Search

• < Previous
• 1
• Next >

---

Symbolic and Asynchronous Semantics via Normalized Coalgebras

Filippo Bonchi ; Ugo Montanari.

The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized by the final morphism in some category of coalgebras. Since the behaviour of interactive systems is for many reasons&nbsp;[&hellip;]

---

Bialgebraic Semantics for Logic Programming

Filippo Bonchi ; Fabio Zanasi.

Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic programs as reactive systems and exploit abstract techniques&nbsp;[&hellip;]

---