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...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Journal article |
| Publicerad: |
2009
|