Saturated Semantics for Coalgebraic Logic Programming

DOI10.1007/978-3-642-40206-7_8zbMath1394.68053OpenAlexW19531118MaRDI QIDQ2848941

Fabio Zanasi, Filippo Bonchi

Publication date: 13 September 2013

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40206-7_8

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Logic programming (68N17) Categorical semantics of formal languages (18C50) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (5)

Exploiting parallelism in coalgebraic logic programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Logic programming: laxness and saturation ⋮ Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness

This page was built for publication: Saturated Semantics for Coalgebraic Logic Programming