On Confluence of Infinitary Combinatory Reduction Systems

J. Ketema, J.G. Simonsen

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

We prove that fully-extended, orthogonal infinitary combinatory reduction systems with finite right-hand sides are confluent modulo identification of hypercollapsing subterms. This provides the first general confluence result for infinitary higher-order rewriting. © Springer-Verlag Berlin Heidelberg 2005.
Original languageEnglish
Pages (from-to)199-214
JournalLecture Notes in Computer Science
Volume3835
DOIs
Publication statusPublished - 2005

Bibliographical note

DBLP:conf/lpar/KetemaS05
Proceedings title: Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings
Publisher: Springer
Editors: G. Sutcliffe, A. Voronkov

Fingerprint Dive into the research topics of 'On Confluence of Infinitary Combinatory Reduction Systems'. Together they form a unique fingerprint.

  • Cite this