Pages that link to "Item:Q1104311"
From MaRDI portal
The following pages link to Reducibility of types in typed lambda calculus. Comment on a paper by Richard Statman (Q1104311):
Displaying 6 items.
- A correspondence between type checking via reduction and type checking via evaluation (Q763480) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case (Q1763159) (← links)
- An upper bound for reduction sequences in the typed \(\lambda\)-calculus (Q2639840) (← links)
- (Q4362909) (← links)
- (Q4794072) (← links)
- Typed Lambda Calculi and Applications (Q5704015) (← links)