Pages that link to "Item:Q2628299"
From MaRDI portal
The following pages link to Operational semantics of resolution and productivity in Horn clause logic (Q2628299):
Displaying 9 items.
- Logic programming: laxness and saturation (Q1994355) (← links)
- \texttt{slepice}: towards a verified implementation of type theory in type theory (Q2119108) (← links)
- Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
- On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs (Q2163179) (← links)
- A coinductive approach to proof search through typed lambda-calculi (Q2231698) (← links)
- Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis (Q4559809) (← links)
- First-order Answer Set Programming as Constructive Proof Search (Q4559822) (← links)
- Productive corecursion in logic programming (Q4592714) (← links)
- The New Normal: We Cannot Eliminate Cuts in Coinductive Calculi, But We Can Explore Them (Q5140030) (← links)