✦ LIBER ✦

A Coalgebraic Semantics of Subtyping

✍ Scribed by Erik Poll

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 893 KB
Volume: 33
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80352-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Coalgebraic Semantics for Epistemic Pr

A Coalgebraic Semantics for Epistemic Programs

✍ Alexandru Baltag 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 256 KB

A Coalgebraic Foundation for Linear Time

A Coalgebraic Foundation for Linear Time Semantics

✍ John Power; Daniele Turi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Subtyping can have a simple semantics

✍ Herman Balsters; Maarten M. Fokkinga 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 724 KB

Coalgebras and monads in the semantics o

Coalgebras and monads in the semantics of Java

✍ Bart Jacobs; Erik Poll 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 225 KB

This paper describes the basic structures in the denotational and axiomatic semantics of sequential Java, both from a monadic and a coalgebraic perspective. This semantics is an abstraction of the one used for the veriÿcation of (sequential) Java programs using proof tools in the LOOP project at the

A Coalgebraic View of Infinite Trees and

A Coalgebraic View of Infinite Trees and Iteration

✍ Peter Aczel; Jiří Adámek; Jiří Velebil 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 255 KB

The algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ideal recursive equations are uniquely solvable. This is proved here to be a general coalgebraic phenomenon: let H be an endofunctor such that for every object X a final coalgebra, T X, of H( )+X exists. Then T

Coalgebras in a category of classes

✍ Michael A. Warren 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 310 KB