Pages that link to "Item:Q2367541"
From MaRDI portal
The following pages link to Higher-order unification via combinators (Q2367541):
Displaying 19 items.
- The correctness of Newman's typability algorithm and some of its extensions (Q549191) (← links)
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- Unification under a mixed prefix (Q1201348) (← links)
- A higher-order unification algorithm for inductive types and dependent types (Q1362142) (← links)
- Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- Restricted combinatory unification (Q2305407) (← links)
- Unification for $$\lambda $$ -calculi Without Propagation Rules (Q3179400) (← links)
- (Q3300788) (← links)
- (Q4723321) (← links)
- (Q4989394) (← links)
- (Q5028439) (← links)
- Higher-order unification with dependent function types (Q5055716) (← links)
- Modular higher-order E-unification (Q5055760) (← links)
- Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type (Q5055872) (← links)
- Logic Programming (Q5475791) (← links)
- Superposition with lambdas (Q5919500) (← links)
- Higher-order matching for program transformation (Q5958614) (← links)
- Higher order E-unification (Q6488561) (← links)