Orthogonal higher-order rewrite systems are confluent
- Tobias NipkowAffiliated withInstitut für Informatik, Technische Universität München
The results about higher-order critical pairs and the confluence of OHRSs provide a firm foundation for the further study of higher-order rewrite systems. It should now be interesting to lift more results and techniques both from term-rewriting and λ-calculus to the level of HRSs. For example termination proof techniques are much studied for TRSs and are urgently needed for HRSs; similarly the extension of our result to weakly orthogonal HRSs or even to Huet's “parallel closed” systems is highly desirable. Conversely, a large body of λ-calculus reduction theory has been lifted to CRSs  already and should be easy to carry over to HRSs.
Finally there is the need to extend the notion of an HRS to more general left-hand sides. For example the eta-rule for the case-construct on disjoint unions  case(U,λx.F(inl(x)),λy.G(inr(y))) → F(U) is outside our framework, whichever way it is oriented.
- Orthogonal higher-order rewrite systems are confluent
- Book Title
- Typed Lambda Calculi and Applications
- Book Subtitle
- International Conference on Typed Lambda Calculi and Applications TLCA '93 March, 16–18, 1993, Utrech, The Netherlands Proceedings
- pp 306-317
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.