Pages that link to "Item:Q1823936"
From MaRDI portal
The following pages link to Higher-order unification revisited: Complete sets of transformations (Q1823936):
Displaying 35 items.
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- Synthesis of rewrite programs by higher-order and semantic unification (Q749216) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- Polymorphic rewriting conserves algebraic strong normalization (Q1176244) (← links)
- Unification under a mixed prefix (Q1201348) (← links)
- A decision algorithm for distributive unification (Q1275018) (← links)
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- Third order matching is decidable (Q1337691) (← links)
- Reduction and unification in lambda calculi with a general notion of subtype (Q1340967) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- Decidability of bounded second order unification (Q1887168) (← links)
- Normal forms in combinatory logic (Q1903133) (← links)
- Functions-as-constructors higher-order unification: extended pattern unification (Q2134936) (← links)
- Restricted combinatory unification (Q2305407) (← links)
- Higher-order unification via combinators (Q2367541) (← links)
- Tractable and intractable second-order matching problems (Q2643530) (← links)
- Extensional higher-order paramodulation in Leo-III (Q2666959) (← links)
- Unification for $$\lambda $$ -calculi Without Propagation Rules (Q3179400) (← links)
- Regular Patterns in Second-Order Unification (Q3454122) (← links)
- On intuitionistic proof nets with additional rewrite rules and their approximations (Q4916174) (← links)
- (Q5028439) (← links)
- Higher-order unification with dependent function types (Q5055716) (← links)
- Modular higher-order E-unification (Q5055760) (← links)
- Efficient second-order matching (Q5055870) (← links)
- Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type (Q5055872) (← links)
- From programming-by-example to proving-by-example (Q5096230) (← links)
- Higher order disunification: Some decidable cases (Q5096304) (← links)
- Higher-order narrowing with convergent systems (Q5096386) (← links)
- Decidable higher-order unification problems (Q5210802) (← links)
- Theory and practice of minimal modular higher-order E-unification (Q5210803) (← links)
- Context rewriting (Q5881173) (← links)
- Higher-order unification, polymorphism, and subsorts (Q5881304) (← links)
- Second-order unification in the presence of linear shallow algebraic equations (Q5881305) (← links)
- Superposition with lambdas (Q5918381) (← links)
- Superposition with lambdas (Q5919500) (← links)
