Coalgebraic Derivations in Logic Programming

DOI10.4230/LIPICS.CSL.2011.352zbMath1247.68044OpenAlexW1593507982MaRDI QIDQ2915694

Ekaterina Komendantskaya, A. John Power

Publication date: 18 September 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_e88d.html

zbMATH Keywords

logic programmingconcurrencySLD-resolutioncoinductionLawvere theoriesconcurrent logic programmingcoinductive logic programming

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (8)

Exploiting parallelism in coalgebraic logic programming ⋮ Operational semantics of resolution and productivity in Horn clause logic ⋮ Declarative Compilation for Constraint Logic Programming ⋮ A coinductive approach to proof search through typed lambda-calculi ⋮ Constraint logic programming with a relational machine ⋮ Kripke semantics for higher-order type theory applied to constraint logic programming languages ⋮ Logic programming: laxness and saturation ⋮ Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness

Uses Software

• CoALP

This page was built for publication: Coalgebraic Derivations in Logic Programming