Normalisation for higher-order calculi with explicit substitutions
Explicit substitutions (ES) were introduced as a bridge between the theory of rewrite systems with binders and substitution, such as the λ-calculus, and their implementation. In a seminal paper Melliès observed that the dynamical properties of a rewrite system and its ES-based implementation may not...
Guardado en:
| Autor principal: | Bonelli, Eduardo |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2005
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/84837 |
| Aporte de: |
Ejemplares similares
-
Relating higher-order and first-order rewriting
por: Bonelli, E., et al. -
Relating higher-order and first-order rewriting
Publicado: (2005) -
On abstract normalisation beyond neededness
por: Bonelli, Eduardo, et al.
Publicado: (2017) -
On abstract normalisation beyond neededness
por: Bonelli, E., et al. -
The expansion problem in lambda calculi with explicit substitution
por: Arbiser, A.