Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Infinitary Combinatory Reduction Systems
(Extended Abstract)
verfasst von : Jeroen Ketema, Jakob Grue Simonsen
Erschienen in: Term Rewriting and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We define infinitary combinatory reduction systems (iCRSs). This provides the first extension of infinitary rewriting to higher-order rewriting. We lift two well-known results from infinitary term rewriting systems and infinitary
λ
-calculus to iCRSs:
1
every reduction sequence in a fully-extended left-linear iCRS is compressible to a reduction sequence of length at most
ω
, and
2
every complete development of the same set of redexes in an orthogonal iCRS ends in the same term.