Bialgebraic semantics and recursion (extended abstract)

DOI10.1016/S1571-0661(04)80914-9MaRDI QIDQ4917044zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Adding recursive constructs to bialgebraic semantics
• Bialgebraic methods in structural operational semantics (invited talk)
• Combining bialgebraic semantics and equations
• Bialgebraic semantics for logic programming
• Structural congruence for bialgebraic semantics

Cites work

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

Cited in

(7)

• Bi-inductive structural semantics
• On the notion of bimodel for functorial semantics
• Adding recursive constructs to bialgebraic semantics
• Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
• Structural congruence for bialgebraic semantics
• Bialgebraic semantics for logic programming
• scientific article; zbMATH DE number 6302921 (Why is no real title available?)

This page was built for publication: Bialgebraic semantics and recursion (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917044)