The safe lambda calculus
We consider a syntactic restriction for higher-order grammars called safety that constrains occurrences of variables in the production rules according to their type-theoretic order. We transpose and generalize this restriction to the setting of the simply-typed lambda calculus, giving rise to what w...
Main Author: | Blum, W |
---|---|
Other Authors: | Ong, C |
Format: | Thesis |
Language: | English |
Published: |
2009
|
Subjects: |
Similar Items
-
The Safe Lambda Calculus
by: Blum, W, et al.
Published: (2009) -
Termination and semantics of probabilistic lambda calculus
by: Kenyon-Roberts, A
Published: (2024) -
Full abstraction for PCF
by: Abramsky, S, et al.
Published: (2000) -
On full abstraction for PCF: I, II, and III
by: Hyland, J, et al.
Published: (2000) -
Angelic semantics of fine-grained concurrency
by: Ghica, D, et al.
Published: (2008)