The following pages link to (Q3751042):
Displaying 20 items.
- Simple second-order languages for which unification is undecidable (Q807609) (← links)
- Expressing combinatory reduction systems derivations in the rewriting calculus (Q857913) (← links)
- A unification algorithm for second-order monadic terms (Q1109019) (← links)
- Horn clause programs with polymorphic types: Semantics and resolution (Q1177936) (← links)
- Making PVS accessible to generic services by interpretation in a universal format (Q1687752) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Uniform proofs as a foundation for logic programming (Q2640596) (← links)
- (Q2736348) (← links)
- Encoding generic judgments: preliminary results (Q2841234) (← links)
- Programming with higher-order logic. (Q2891520) (← links)
- Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming (Q3067470) (← links)
- Refinement of Higher-Order Logic Programs (Q3079921) (← links)
- (Q4229811) (← links)
- (Q4342090) (← links)
- Logic programs with equational type specifications (Q5096188) (← links)
- The Expressive Power of Higher-Order Datalog (Q5108510) (← links)
- Implementing type theory in higher order constraint logic programming (Q5236551) (← links)
- Reasoning with higher-order abstract syntax in a logical framework (Q5738952) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- Higher order E-unification (Q6488561) (← links)
