Location of Repository

Infinitary combinatory reduction systems (Extended Abstract)

By Jeroen Ketema and Jakob Grue Simonsen

Abstract

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

Publisher: Springer-Verlag
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.163.277
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.diku.dk/~simonsen/p... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.