On Confluence of Infinitary Combinatory Reduction Systems

J. Ketema; J.G. Simonsen

doi:10.1007/11591191_15

On Confluence of Infinitary Combinatory Reduction Systems

J. Ketema, J.G. Simonsen

Research output: Contribution to Journal › Article › Academic › peer-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 language	English
Pages (from-to)	199-214
Journal	Lecture Notes in Computer Science
Volume	3835
DOIs	https://doi.org/10.1007/11591191_15
Publication status	Published - 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

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/11591191_15

Persistent URL (handle)

Persistent link

Cite this

@article{f611cbe4a5734d48b96c59899eca4cf9,

title = "On Confluence of Infinitary Combinatory Reduction Systems",

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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2005.",

author = "J. Ketema and J.G. Simonsen",

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",

year = "2005",

doi = "10.1007/11591191\_15",

language = "English",

volume = "3835",

pages = "199--214",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

}

TY - JOUR

T1 - On Confluence of Infinitary Combinatory Reduction Systems

AU - Ketema, J.

AU - Simonsen, J.G.

N1 - 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

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33745439194

UR - https://www.scopus.com/inward/citedby.url?scp=33745439194&partnerID=8YFLogxK

U2 - 10.1007/11591191_15

DO - 10.1007/11591191_15

M3 - Article

SN - 0302-9743

VL - 3835

SP - 199

EP - 214

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

On Confluence of Infinitary Combinatory Reduction Systems

Abstract

Bibliographical note

UN SDGs

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this