Cited in
(24)- Kripke semantics for higher-order type theory applied to constraint logic programming languages
- Category theoretic semantics for theorem proving in logic programming: embracing the laxness
- Logic programming: laxness and saturation
- Flexible coinductive logic programming
- A productivity checker for logic programming
- Operational semantics of resolution and productivity in Horn clause logic
- Hiord
- CoCaml
- coFJ
- Coalgebraic semantics for parallel derivation strategies in logic programming
- Coalgebraic semantics for derivations in logic programming
- Enhancing expressivity of checked corecursive streams
- Productive corecursion in logic programming
- Integrating induction and coinduction via closure operators and proof cycles
- Bialgebraic semantics for logic programming
- A game semantics for disjunctive logic programming
- scientific article; zbMATH DE number 7649893 (Why is no real title available?)
- Coalgebraic derivations in logic programming
- scientific article; zbMATH DE number 7350768 (Why is no real title available?)
- A type-theoretic approach to resolution
- Constraint logic programming with a relational machine
- A coinductive approach to proof search through typed lambda-calculi
- Universal constructions for (co)relations: categories, monoidal categories, and props
- scientific article; zbMATH DE number 7037626 (Why is no real title available?)
This page was built for software: CoALP
