Pages that link to "Item:Q1744405"
From MaRDI portal
The following pages link to Completeness in PVS of a nominal unification algorithm (Q1744405):
Displaying 11 items.
- Nominal essential intersection types (Q1643145) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols (Q1744440) (← links)
- Understanding PPA-completeness (Q2208253) (← links)
- A formalisation of nominal C-matching through unification with protected variables (Q2333665) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols (Q2424886) (← links)
- (Q3789061) (← links)
- Verification of the Completeness of Unification Algorithms à la Robinson (Q4931594) (← links)
- Formalising nominal C-unification generalised with protected variables (Q5022930) (← links)
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let (Q5075515) (← links)
- A Certified Functional Nominal C-Unification Algorithm (Q5097631) (← links)
- Understanding PPA-completeness (Q5368757) (← links)