A paradigmatic object-oriented programming language: Design, static typing and semantics
From MaRDI portal
Publication:4764618
DOI10.1017/S0956796800001039zbMath0817.68037MaRDI QIDQ4764618
Publication date: 4 May 1995
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items
A meta-language for typed object-oriented languages, Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping, Termination of system \(F\)-bounded: A complete proof, Semantic types and approximation for Featherweight Java, An imperative object calculus, Matching MyType to subtyping, Formal reasoning about modules, reuse and their correctness, Divergence of \(F_{\leq}\) type checking, Type-based hot swapping of running modules, A declarative framework for object-oriented programming with genetic inheritance, Matching for the lambda calculus of objects, Basic theory of \(F\)-bounded quantification., Comparing object encodings., Privacy via subsumption, Type-safe covariant specialization with generalized matching
Uses Software
Cites Work
- The semantics of second-order lambda calculus
- Denotational semantics of a parallel object-oriented language
- A modest model of records, inheritance, and bounded quantification
- Polymorphic type inference and containment
- Recursion over realizability structures
- Inheritance as implicit coercion
- Operations on records
- The programming language oberon
- Type theories and object-oriented programmimg
- Coherence of subsumption, minimum typing and type-checking in F ≤
- A semantic basis for Quest
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
