Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in fi...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Logical Methods in Computer Science e.V.
2010-02-01
|
| Colección: | Logical Methods in Computer Science |
| Materias: | |
| Acceso en línea: | https://lmcs.episciences.org/841/pdf |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|