The following pages link to A useful \(\lambda\)-notation (Q1365680):
Displaying 14 items.
- A unified approach to type theory through a refined \(\lambda\)-calculus (Q1349674) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Revisiting the notion of function (Q1394989) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case (Q1763159) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case (Q1764799) (← links)
- Comparing and implementing calculi of explicit substitutions with eta-reduction (Q1779307) (← links)
- SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★ (Q3647258) (← links)
- Canonical typing and ∏-conversion in the Barendregt Cube (Q4895552) (← links)
- Comparing Calculi of Explicit Substitutions with Eta-reduction (Q4916203) (← links)
- Automath and Pure Type Systems (Q4924545) (← links)
- Explicit Substitutions à la de Bruijn (Q4924548) (← links)
- Characteristics of de Bruijn’s early proof checker Automath (Q5089679) (← 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)
