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...
Egile Nagusiak: | Blum, W, Ong, C |
---|---|
Formatua: | Journal article |
Argitaratua: |
2009
|
Antzeko izenburuak
-
The Safe Lambda Calculus
nork: William Blum, et al.
Argitaratua: (2009-02-01) -
The safe lambda calculus
nork: Blum, W
Argitaratua: (2009) -
Supermartingales, ranking functions and probabilistic lambda calculus
nork: Ong, C-H, et al.
Argitaratua: (2021) -
The dagger lambda calculus
nork: Philip Atzemoglou
Argitaratua: (2014-12-01) -
Quantitative semantics of the lambda calculus: Some generalisations of the relational model
nork: Ong, C
Argitaratua: (2017)