Pages that link to "Item:Q1854337"
From MaRDI portal
The following pages link to Higher order unification via explicit substitutions (Q1854337):
Displayed 25 items.
- Simplifying the signature in second-order unification (Q843951) (← links)
- Choices in representation and reduction strategies for lambda terms in intensional contexts (Q861365) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- A \(\rho\)-calculus of explicit constraint application (Q880989) (← links)
- Nominal techniques in Isabelle/HOL (Q928672) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions (Q1575247) (← links)
- Equational rules for rewriting logic (Q1608925) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- Nominal essential intersection types (Q1643145) (← links)
- Completeness in PVS of a nominal unification algorithm (Q1744405) (← links)
- Comparing and implementing calculi of explicit substitutions with eta-reduction (Q1779307) (← links)
- Nominal unification (Q1882909) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Restricted combinatory unification (Q2305407) (← links)
- Higher-order unification: a structural relation between Huet's method and the one based on explicit substitutions (Q2480966) (← links)
- (Q2703692) (← links)
- Unification for $$\lambda $$ -calculi Without Propagation Rules (Q3179400) (← links)
- SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★ (Q3647258) (← links)
- The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations (Q4916200) (← links)
- Comparing Calculi of Explicit Substitutions with Eta-reduction (Q4916203) (← links)
- (Q4989394) (← links)
- Formal categorical reasoning (Q5102205) (← links)
- A typed context calculus (Q5958759) (← links)
- Proof-term synthesis on dependent-type systems via explicit substitutions (Q5958764) (← links)