Pure type systems with explicit substitutions
We introduce a new formulation of pure type systems (PTSs) with explicit substitution and de Bruijn indices and formally prove some of its meta-theory. Using techniques based on Normalisation by Evaluation, we prove that untyped conversion can be typed for predicative PTSs. Although this equivale...
Guardado en:
| Autores principales: | Fridlender, Daniel, Pagano, Miguel |
|---|---|
| Formato: | article |
| Lenguaje: | Inglés |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/11086/27605 https://doi.org/10.1017/S0956796815000210 https://doi.org/10.1017/S0956796815000210 |
| Aporte de: |
Ejemplares similares
-
Normalisation for higher-order calculi with explicit substitutions
por: Bonelli, Eduardo
Publicado: (2005) -
On abstract normalisation beyond neededness
por: Bonelli, E., et al. -
On abstract normalisation beyond neededness
por: Bonelli, Eduardo, et al.
Publicado: (2017) -
Sistema de fosfotransferasa dependiente del fosfoenolpiruvato (PTS) y represión catabólica en Bacillus Sphaericus
por: Alice, Alejandro Fabián
Publicado: (2001) -
Sistema de fosfotransferasa dependiente del fosfoenolpiruvato (PTS) y represión catabólica en Bacillus Sphaericus
por: Alice, Alejandro Fabián
Publicado: (2001)