The following pages link to ON STEPWISE EXPLICIT SUBSTITUTION (Q4286110):
Displaying 14 items.
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Explicit substitution. On the edge of strong normalization (Q1274458) (← links)
- A unified approach to type theory through a refined \(\lambda\)-calculus (Q1349674) (← links)
- A useful \(\lambda\)-notation (Q1365680) (← links)
- Comparing and implementing calculi of explicit substitutions with eta-reduction (Q1779307) (← links)
- On explicit substitution with names (Q2392486) (← links)
- λν, a calculus of explicit substitutions which preserves strong normalisation (Q3125228) (← links)
- On explicit substitutions and names (extended abstract) (Q4571957) (← links)
- Refining reduction in the lambda calculus (Q4880488) (← links)
- Canonical typing and ∏-conversion in the Barendregt Cube (Q4895552) (← links)
- Comparing Calculi of Explicit Substitutions with Eta-reduction (Q4916203) (← links)
- Explicit Substitutions à la de Bruijn (Q4924548) (← links)
- A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi (Q5179010) (← links)
- THE SOUNDNESS OF EXPLICIT SUBSTITUTION WITH NAMELESS VARIABLES (Q5248982) (← links)
