The following pages link to (Q4391451):
Displaying 21 items.
- A game semantics for disjunctive logic programming (Q388214) (← links)
- Semantics of structured normal logic programs (Q444364) (← links)
- Equivalence of two fixed-point semantics for definitional higher-order logic programs (Q512650) (← links)
- Kripke semantics for higher-order type theory applied to constraint logic programming languages (Q683712) (← links)
- Subset-equational programming in intelligent decision systems (Q805225) (← links)
- Universal algebra in higher types (Q1199827) (← links)
- Unification under a mixed prefix (Q1201348) (← links)
- The Qu-Prolog unification algorithm: formalisation and correctness (Q1349886) (← links)
- A new framework for declarative programming (Q1399960) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
- Clausal logic and logic programming in algebraic domains (Q1854478) (← links)
- From axioms to synthetic inference rules via focusing (Q2120974) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Higher-order unification via combinators (Q2367541) (← links)
- A semantic framework for open processes (Q2463561) (← links)
- Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis (Q4559809) (← links)
- The intricacies of three-valued extensional semantics for higher-order logic programs (Q4592720) (← links)
- Constraint handling rules with binders, patterns and generic quantification (Q4592722) (← links)
- A concurrent constraint programming interpretation of access permissions (Q4644356) (← links)
- Logic programming (Q6602251) (← links)
