Bialgebraic Semantics for Logic Programming

DOI10.2168/LMCS-11(1:14)2015zbMath1347.68040arXiv1502.06095OpenAlexW1817268752MaRDI QIDQ5246719

Filippo Bonchi, Fabio Zanasi

Publication date: 22 April 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.06095

zbMATH Keywords

compositionalitybialgebraslogic programmingcoalgebrae on presheaves

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Logic programming (68N17) Categorical semantics of formal languages (18C50)

Related Items (7)

Iterated covariant powerset is not a monad ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Logic programming: laxness and saturation ⋮ Lawvere Categories as Composed PROPs ⋮ Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness ⋮ Universal Constructions for (Co)Relations: categories, monoidal categories, and props

Uses Software

• CoALP

This page was built for publication: Bialgebraic Semantics for Logic Programming