Pages that link to "Item:Q5739982"
From MaRDI portal
The following pages link to Coalgebraic logic programming: from Semantics to Implementation (Q5739982):
Displaying 23 items.
- CoALP (Q27977) (← links)
- Exploiting parallelism in coalgebraic logic programming (Q280198) (← links)
- Logic programming: laxness and saturation (Q1994355) (← links)
- Enhancing expressivity of checked corecursive streams (Q2163153) (← links)
- On dual programs in co-logic programming and the Horn \({\mu}\)-calculus (Q2628297) (← links)
- Operational semantics of resolution and productivity in Horn clause logic (Q2628299) (← links)
- The coalgebraic class specification language CCSL (Q2709810) (← links)
- A coalgebraic decision procedure for NetKAT (Q2819821) (← links)
- Coalgebraic derivations in logic programming (Q2915694) (← links)
- (Q3204454) (← links)
- Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme (Q3655207) (← links)
- Universal Constructions for (Co)Relations: categories, monoidal categories, and props (Q4585067) (← links)
- Productive corecursion in logic programming (Q4592714) (← links)
- (Q4989395) (← links)
- Flexible coinductive logic programming (Q5140017) (← links)
- Algebra and Coalgebra in Computer Science (Q5492824) (← links)
- Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness (Q5739451) (← links)
- A Type-Theoretic Approach to Resolution (Q5743587) (← links)
- (Q5875350) (← links)
- Checked corecursive streams: expressivity and completeness (Q6049926) (← links)
- Checking equivalence of corecursive streams: an inductive procedure (Q6589842) (← links)
- Reductive logic, proof-search, and coalgebra: a perspective from resource semantics (Q6612799) (← links)
- Reducing higher-order recursion scheme equivalence to coinductive higher-order constrained Horn clauses (Q6647302) (← links)
