The Safe Lambda Calculus
Safety is a syntactic condition of higher-order grammars that constrains occurrences of variables in the production rules according to their type-theoretic order. In this paper, we introduce the safe lambda calculus, which is obtained by transposing (and generalizing) the safety condition to the set...
Main Authors: | Blum, W, Ong, C |
---|---|
Formato: | Journal article |
Publicado em: |
2009
|
Registos relacionados
-
The Safe Lambda Calculus
Por: William Blum, et al.
Publicado em: (2009-02-01) -
The safe lambda calculus
Por: Blum, W
Publicado em: (2009) -
Supermartingales, ranking functions and probabilistic lambda calculus
Por: Ong, C-H, et al.
Publicado em: (2021) -
The dagger lambda calculus
Por: Philip Atzemoglou
Publicado em: (2014-12-01) -
Quantitative semantics of the lambda calculus: Some generalisations of the relational model
Por: Ong, C
Publicado em: (2017)