Typed representation of objects by functions
- 1 January 1989
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 11 (1) , 67-89
- https://doi.org/10.1145/59287.77345
Abstract
A systematic representation of objects grouped into types by constructions similar to the composition of sets in mathematics is proposed. The representation is by lambda expressions, which supports the representation of objects from function spaces. The representation is related to a rather conventional language of type descriptions in a way that is believed to be new. Ordinary control-expressions (i.e.,case- and let-expressions) are derived from the proposed representation.Keywords
This publication has 10 references indexed in Scilit:
- Constructive Mathematics and Computer ProgrammingPublished by Elsevier ,2014
- Classification in object-oriented systemsACM SIGPLAN Notices, 1986
- Automatic synthesis of typed Λ-programs on term algebrasTheoretical Computer Science, 1985
- Final Data Types and Their SpecificationACM Transactions on Programming Languages and Systems, 1983
- A Statement-Oriented Approach to Data AbstractionACM Transactions on Programming Languages and Systems, 1981
- Correctness proofs of syntax-directed processing descriptions by attributesJournal of Computer and System Sciences, 1979
- Pascal-clarifications and recommended extensionsActa Informatica, 1979
- Data Types as LatticesSIAM Journal on Computing, 1976
- Recursive data structuresInternational Journal of Parallel Programming, 1975
- The programming language pascalActa Informatica, 1971