Final semantics for a higher order concurrent language

DOI10.1007/3-540-61064-2_32OpenAlexW1578809538MaRDI QIDQ5878904

Marina Lenisa

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_32

zbMATH Keywords

operational semanticscomplete metric spacecoinductionhypersetF-coalgebrafinal semanticsF-bisimulationmixed induction-coinductionsecond-order assignment

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Universal coalgebra: A theory of systems

Cites Work

• Hypersets
• Structured operational semantics and bisimulation as a congruence
• Terminal coalgebras in well-founded set theory
• Processes as terms: non-well-founded models for bisimulation
• Processes and hyperuniverses
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Final semantics for a higher order concurrent language