A Coalgebraic Semantics of Subtyping

DOI10.1051/ita:2001109zbMath0990.18004OpenAlexW1981572083MaRDI QIDQ2747942

Erik Poll

Publication date: 14 August 2002

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_1_61_0

zbMATH Keywords

coalgebrasrefinementobject-oriented programmingsubtyping

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50)

Related Items (1)

Components as coalgebras: the refinement dimension

Uses Software

• Eiffel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Essential concepts of algebraic specification and program development
• Universal coalgebra: A theory of systems
• Specification and verification of object-oriented programs using supertype abstraction
• On simulation, subtyping and substitutability in sequential object systems
• A complete algebraic characterization of behavioral subtyping
• Proof of correctness of data representations
• Simple type-theoretic foundations for object-oriented programming
• An approach to object semantics based on terminal co-algebras

This page was built for publication: A Coalgebraic Semantics of Subtyping