Baby Modula-3 and a theory of objects
- 1 April 1994
- journal article
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 4 (2) , 249-283
- https://doi.org/10.1017/s0956796800001052
Abstract
Baby Modula-3 is a small, functional, object-oriented programming language. It is intended as a vehicle for explaining the core of Modula-3 from a biased perspective: Baby Modula-3 includes the main features of Modula-3 related to objects, but not much else. To the theoretician, Baby Modula-3 provides a tractable, concrete example of an object-oriented language, and we use it to study the formal semantics of objects. Baby Modula-3 is defined with a structured operational semantics and with a set of static type rules. A denotational semantics guarantees the soundness of this definition.Keywords
This publication has 15 references indexed in Scilit:
- Larch: Languages and Tools for Formal SpecificationPublished by Springer Nature ,1993
- Object-oriented programming without recursive typesPublished by Association for Computing Machinery (ACM) ,1993
- Safe type checking in a statically-typed object-oriented programming languagePublished by Association for Computing Machinery (ACM) ,1993
- A calculus for overloaded functions with subtypingPublished by Association for Computing Machinery (ACM) ,1992
- Recursion over realizability structuresInformation and Computation, 1991
- Inheritance is not subtypingPublished by Association for Computing Machinery (ACM) ,1990
- Functorial polymorphismTheoretical Computer Science, 1990
- A denotational semantics of inheritance and its correctnessPublished by Association for Computing Machinery (ACM) ,1989
- Relational semantics for recursive types and bounded quantificationPublished by Springer Nature ,1989
- An ideal model for recursive polymorphic typesInformation and Control, 1986