Infinitary combinatory reduction systems: normalising reduction strategies
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Dokumenter
- Ketema_2010_Infinitary_combinatory
Forlagets udgivne version, 380 KB, PDF-dokument
We study normalising reduction strategies for infinitary Combinatory Reduc-
tion 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 first-order infinitary rewriting and provide the first examples of normalising strategies for infinitary -calculus.
tion 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 first-order infinitary rewriting and provide the first examples of normalising strategies for infinitary -calculus.
Originalsprog | Engelsk |
---|---|
Artikelnummer | 7 |
Tidsskrift | Logical Methods in Computer Science |
Vol/bind | 6 |
Udgave nummer | 1 |
Antal sider | 35 |
ISSN | 1860-5974 |
DOI | |
Status | Udgivet - 2010 |
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
Ingen data tilgængelig
ID: 32193273