Coalgebraic logic programming: from Semantics to Implementation
From MaRDI portal
Publication:5739982
DOI10.1093/logcom/exu026zbMath1344.68044arXiv1312.6568MaRDI QIDQ5739982
Martin Schmidt, Ekaterina Komendantskaya, A. John Power
Publication date: 7 July 2016
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.6568
68Q65: Abstract data types; algebraic specification
68N17: Logic programming
18C50: Categorical semantics of formal languages
Related Items
Productive corecursion in logic programming, Universal Constructions for (Co)Relations: categories, monoidal categories, and props, Unnamed Item, Flexible coinductive logic programming, Unnamed Item, Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness, A Type-Theoretic Approach to Resolution, Checked corecursive streams: expressivity and completeness, CoALP, Logic programming: laxness and saturation, Enhancing expressivity of checked corecursive streams, Operational semantics of resolution and productivity in Horn clause logic