Pages that link to "Item:Q5428832"
From MaRDI portal
The following pages link to Co-Logic Programming: Extending Logic Programming with Coinduction (Q5428832):
Displaying 22 items.
- Program equivalence by circular reasoning (Q493521) (← links)
- Logic programming: laxness and saturation (Q1994355) (← links)
- Preemptive type checking (Q1994367) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- Enhancing expressivity of checked corecursive streams (Q2163153) (← links)
- Operational semantics of resolution and productivity in Horn clause logic (Q2628299) (← links)
- Proof Relevant Corecursive Resolution (Q2798268) (← links)
- Chosen-Ciphertext Security from Subset Sum (Q2798769) (← links)
- Generalizing Inference Systems by Coaxioms (Q2988632) (← links)
- Idealized coinductive type systems for imperative object-oriented programs (Q3006157) (← links)
- Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming (Q3067470) (← links)
- Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification? (Q3067532) (← links)
- (Q3121528) (← links)
- A Logical Encoding of Timed $$\pi $$-Calculus (Q3453652) (← links)
- Type Inference by Coinductive Logic Programming (Q3638242) (← links)
- Productive corecursion in logic programming (Q4592714) (← links)
- (Q5028421) (← links)
- Flexible coinductive logic programming (Q5140017) (← links)
- Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness (Q5739451) (← links)
- Coinduction in Flow: The Later Modality in Fibrations (Q5875348) (← links)
- Deconfined Global Types for Asynchronous Sessions (Q5883749) (← links)
- Checked corecursive streams: expressivity and completeness (Q6049926) (← links)
