Pages that link to "Item:Q1060023"
From MaRDI portal
The following pages link to Verifying the unification algorithm in LCF (Q1060023):
Displaying 10 items.
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
- Completeness in PVS of a nominal unification algorithm (Q1744405) (← links)
- Unification: A case-study in data refinement (Q1898815) (← links)
- Unification via the \(\lambda s_e\)-style of explicit substitutions (Q2743636) (← links)
- Lessons learned from LCF: A Survey of Natural Deduction Proofs (Q3696549) (← links)
- Verification of the Completeness of Unification Algorithms à la Robinson (Q4931594) (← links)
- A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading (Q5372007) (← links)
- A certified implementation of ML with structural polymorphism and recursive types (Q5740642) (← links)