Pages that link to "Item:Q2752527"
From MaRDI portal
The following pages link to Reviewing the classical and the de Bruijn notation for \(\lambda\)-calculus and pure type systems (Q2752527):
Displaying 5 items.
- Derivation and inference of higher-order strictness types (Q1749138) (← 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)
- A proof of the substitution lemma in de Bruijn's notation (Q1802059) (← links)
- Extending a high-performance prover to higher-order logic (Q6536126) (← links)
