TY - GEN
T1 - On lazy commutation
AU - Dershowitz, Nachum
PY - 2009
Y1 - 2009
N2 - We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating well-foundedness of unions of relations. To that end, we develop the notion of a constricting sequence. These results can be applied, for example, to generic path orderings used in termination proofs.
AB - We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating well-foundedness of unions of relations. To that end, we develop the notion of a constricting sequence. These results can be applied, for example, to generic path orderings used in termination proofs.
UR - http://www.scopus.com/inward/record.url?scp=70350681278&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-01748-3_5
DO - 10.1007/978-3-642-01748-3_5
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:70350681278
SN - 3642017479
SN - 9783642017476
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 59
EP - 82
BT - Languages
T2 - Symposium on Languages: From Formal to Natural. Dedicated to Nissim Francez on the Occasion of His 65th Birthday
Y2 - 24 May 2009 through 25 May 2009
ER -