The following pages link to Explicit substitutions (Q4939690):
Displayed 21 items.
- Programming Inductive Proofs (Q3058448) (← links)
- λν, a calculus of explicit substitutions which preserves strong normalisation (Q3125228) (← links)
- The Prismoid of Resources (Q3182947) (← links)
- Term-Generic Logic (Q3184738) (← links)
- Mechanized Verification of CPS Transformations (Q3498467) (← links)
- Why Would You Trust B? (Q3498474) (← links)
- Inter-deriving Semantic Artifacts for Object-Oriented Programming (Q3511441) (← links)
- Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting (Q3522032) (← links)
- Strong cut-elimination in sequent calculus using Klop's <i>ι</i>-translation and perpetual reductions (Q3617369) (← links)
- SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★ (Q3647258) (← links)
- (Q4222859) (← links)
- <i>Theoretical Pearl</i> Yet yet a counterexample for λ+SP (Q4764268) (← links)
- Lilac: a functional programming language based on linear logic (Q4764609) (← 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)
- Intersection Types and Computational Rules (Q4924527) (← links)
- Explicit Substitutions à la de Bruijn (Q4924548) (← links)
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus (Q5747746) (← links)
- Explicit substitutions for \(\pi\)-congruences (Q5958613) (← links)
- A typed context calculus (Q5958759) (← links)
- Proof-term synthesis on dependent-type systems via explicit substitutions (Q5958764) (← links)