Bialgebraic Semantics and Recursion

DOI10.1016/S1571-0661(04)80914-9zbMath1260.68219OpenAlexW2070650392MaRDI QIDQ4917044

Gordon D. Plotkin

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80914-9

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (2)

Relating Coalgebraic Notions of Bisimulation ⋮ Structural congruence for bialgebraic semantics

Cites Work

• Structural induction and coinduction in a fibrational setting
• A coinduction principle for recursive data types based on bisimulation
• CPO models for compact GSOS languages
• A domain equation for bisimulation
• Mongruences and cofree coalgebras

This page was built for publication: Bialgebraic Semantics and Recursion