The following pages link to (Q3024846):
Displayed 23 items.
- A prismoid framework for languages with resources (Q654907) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- Explicit substitution. On the edge of strong normalization (Q1274458) (← links)
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions (Q1575247) (← links)
- Lambda-calculus with director strings (Q1778107) (← links)
- Pattern matching as cut elimination (Q1882898) (← links)
- Intersection types for explicit substitutions (Q1887145) (← links)
- On explicit substitution with names (Q2392486) (← links)
- Unification for $$\lambda $$ -calculi Without Propagation Rules (Q3179400) (← links)
- Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting (Q3522032) (← links)
- On explicit substitutions and names (extended abstract) (Q4571957) (← links)
- The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations (Q4916200) (← links)
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus (Q4972064) (← links)
- Strongly-Normalizing Higher-Order Relational Queries (Q5043580) (← links)
- Explicit substitutions with de bruijn's levels (Q5055838) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Combinatory reduction systems with explicit substitution that preserve strong normalisation (Q5055859) (← links)
- Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract) (Q5055860) (← links)
- A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi (Q5179010) (← links)
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus (Q5747746) (← links)
- Subtractive logic (Q5940919) (← links)
- (Q6079230) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)