@inproceedings{5abac62ad9f94f53812a4c85888de828,

title = "When are two rewrite systems more than none?",

abstract = "It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as term- rewriting systems (which compute normal forms of input terms) and consider the case where individual systems share constructors, but not defined symbols. We present some old and new sufficient conditions under which termination (existence of normal forms, regardless of computation strategy) and confluence (uniqueness) are preserved by such combinations.",

author = "Nachum Dershowitz",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997 ; Conference date: 25-08-1997 Through 29-08-1997",

year = "1997",

doi = "10.1007/bfb0029947",

language = "אנגלית",

isbn = "3540634371",

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

publisher = "Springer Verlag",

pages = "37--43",

editor = "Igor Privara and Peter Ruzicka",

booktitle = "Mathematical Foundations of Computer Science 1997 - 22nd International Symposium, MFCS 1997, Proceedings",

}