Simple type-theoretic foundations for object-oriented programming

DOI10.1017/S0956796800001040zbMath0817.68052OpenAlexW2138839382MaRDI QIDQ4764619

David N. Turner, Benjamin C. Pierce

Publication date: 4 May 1995

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796800001040

zbMATH Keywords

\(\lambda\)-calculusobject-oriented programming

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Logic programming (68N17) Combinatory logic and lambda calculus (03B40)

Related Items

A delegation-based object calculus with subtyping ⋮ A Realizability Interpretation for Intersection and Union Types ⋮ Intersection-types à la Church ⋮ Higher-order subtyping and its decidability ⋮ Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping ⋮ Termination of system \(F\)-bounded: A complete proof ⋮ An imperative object calculus ⋮ The Expression Lemma ⋮ Disjoint Polymorphism ⋮ A Coalgebraic Semantics of Subtyping ⋮ Type system in programming languages ⋮ A declarative framework for object-oriented programming with genetic inheritance ⋮ Subtyping dependent types ⋮ Manifest Fields and Module Mechanisms in Intensional Type Theory ⋮ Order-sorted inductive types ⋮ Comparing object encodings. ⋮ Type destructors ⋮ Objects and classes in Algol-like languages ⋮ Foundations for virtual types

Uses Software

• Smalltalk
• CLOS

Cites Work

• Unnamed Item
• Unnamed Item
• A modest model of records, inheritance, and bounded quantification
• A semantics of multiple inheritance
• Operations on records
• Functional Characters of Solvable Terms
• Coherence of subsumption, minimum typing and type-checking in F ≤
• Baby Modula-3 and a theory of objects