Search

• < Previous
• 1
• Next >

---

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;]

---

Universal Constructions for (Co)Relations: categories, monoidal categories, and props

Brendan Fong ; Fabio Zanasi.

Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic interpretation for diagrams is given in terms of relations or&nbsp;[&hellip;]

---

A Finite Axiomatisation of Finite-State Automata Using String Diagrams

Robin Piedeleu ; Fabio Zanasi.

We develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two&nbsp;[&hellip;]

---