On lazy commutation

Nachum Dershowitz

doi:10.1007/978-3-642-01748-3_5

On lazy commutation

Nachum Dershowitz^*

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Languages
Subtitle of host publication	From Formal to Natural - Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday
Pages	59-82
Number of pages	24
DOIs	https://doi.org/10.1007/978-3-642-01748-3_5
State	Published - 2009
Event	Symposium on Languages: From Formal to Natural. Dedicated to Nissim Francez on the Occasion of His 65th Birthday - Haifa, Israel Duration: 24 May 2009 → 25 May 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5533 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Symposium on Languages: From Formal to Natural. Dedicated to Nissim Francez on the Occasion of His 65th Birthday
Country/Territory	Israel
City	Haifa
Period	24/05/09 → 25/05/09

Access to Document

10.1007/978-3-642-01748-3_5

Cite this

@inproceedings{83a093ed8a014a899624fbc8988f0ec2,

title = "On lazy commutation",

abstract = "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.",

author = "Nachum Dershowitz",

year = "2009",

doi = "10.1007/978-3-642-01748-3_5",

language = "אנגלית",

isbn = "3642017479",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "59--82",

booktitle = "Languages",

note = "Symposium on Languages: From Formal to Natural. Dedicated to Nissim Francez on the Occasion of His 65th Birthday ; Conference date: 24-05-2009 Through 25-05-2009",

}

Dershowitz, N 2009, On lazy commutation. in Languages: From Formal to Natural - Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5533 LNCS, pp. 59-82, Symposium on Languages: From Formal to Natural. Dedicated to Nissim Francez on the Occasion of His 65th Birthday, Haifa, Israel, 24/05/09. https://doi.org/10.1007/978-3-642-01748-3_5

On lazy commutation. / Dershowitz, Nachum.
Languages: From Formal to Natural - Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday. 2009. p. 59-82 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5533 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 -

On lazy commutation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this