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...
I tiakina i:
| Ngā kaituhi matua: | , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Logical Methods in Computer Science e.V.
2010-02-01
|
| Rangatū: | Logical Methods in Computer Science |
| Ngā marau: | |
| Urunga tuihono: | https://lmcs.episciences.org/841/pdf |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|