An imperative object calculus
From MaRDI portal
Publication:5096750
DOI10.1007/3-540-59293-8_214zbMath1496.68098OpenAlexW1563488194WikidataQ56982211 ScholiaQ56982211MaRDI QIDQ5096750
Publication date: 18 August 2022
Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59293-8_214
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (6)
A delegation-based object calculus with subtyping ⋮ On flexible dynamic trait replacement for Java-like languages ⋮ An operational semantics for object-oriented concepts based on the class hierarchy ⋮ An interpretation of typed objects into typed \(\pi\)-calculus ⋮ Matching for the lambda calculus of objects ⋮ Modular statically typed multimethods
Cites Work
- Type inference for polymorphic references
- A modest model of records, inheritance, and bounded quantification
- An extension of system \(F\) with subtyping
- A simplified account of polymorphic references
- A syntactic approach to type soundness
- Operations on records
- A paradigmatic object-oriented programming language: Design, static typing and semantics
- Simple type-theoretic foundations for object-oriented programming
- Baby Modula-3 and a theory of objects
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An imperative object calculus