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...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Logical Methods in Computer Science e.V.
2009-02-01
|
| Colección: | Logical Methods in Computer Science |
| Materias: | |
| Acceso en línea: | https://lmcs.episciences.org/1145/pdf |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|