Harvey Abramson
Abstract
An ordered type is a data structure together with predecessor and successor procedures and a relation defined over pairs of elements of the ordered type. A generalized for statement which uses the procedures connected with an ordered type is introduced. This allows ordered types to be used to control statement iteration in programs.
- Dahl, O.-J. & Dijkstra, E. W. & Hoare, C. A. R., <& Hoare, C. A. R., <
Structured Programming, Academic Press, 1972. Google Scholar
Digital Library
- Dahl, O.-J. & Myrhaug, B. & Nygaard, K.,<& Nygaard, K.,<
The Simula 67 Common Base Language, Norwegian Computing Centre, Forskningsveien 1B, Oslo 3. Google ScholarDigital Library - Hoare, C. A. R.,
A Note on the For Statement, B.I.T. Vol. 12, 1972.Google Scholar - Hoare, C. A. R. & Wirth, N., <
An Axiomatic Definition of the Programming Language PASCAL, Acta Informatica Vol. 2.Google Scholar - Jensen, Kathleen & Wirth, Niklaus, <
PASCAL: User Manual and Report, Springer, 1974. Google ScholarDigital Library - Knuth, D. E.,
The Art of Computer Programming: Fundamental Algorithms, Vol. 1, Addison-Wesley, 1968. Google ScholarDigital Library
Recommendations
Pointwise generalized algebraic data types
TLDI '10: Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementationIn the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even though the type system can handle complex interactions between the two types,...
Generalized conjunctive types
POPL '89: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesThe definitions of Conjunctive types and their subtype relation, as introduced by Coppo-Dezani, are extended to consider the conjunction as a partial mapping from pairs of types to types, and the subtype relation as a relation between finite sets of ...
Generalized algebraic data types and object-oriented programming
OOPSLA '05: Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsGeneralized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatypes (PADTs) of ML and Haskell by permitting value constructors to return ...
Comments