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...
Главные авторы: | Blum, W, Ong, C |
---|---|
Формат: | Journal article |
Опубликовано: |
2009
|
Схожие документы
-
The Safe Lambda Calculus
по: William Blum, и др.
Опубликовано: (2009-02-01) -
The safe lambda calculus
по: Blum, W
Опубликовано: (2009) -
Supermartingales, ranking functions and probabilistic lambda calculus
по: Ong, C-H, и др.
Опубликовано: (2021) -
The dagger lambda calculus
по: Philip Atzemoglou
Опубликовано: (2014-12-01) -
Quantitative semantics of the lambda calculus: Some generalisations of the relational model
по: Ong, C
Опубликовано: (2017)