Franz Baader & Tobias Nipkow (1998):
Term Rewriting and All That.
Cambridge University Press,
doi:10.1145/505863.505888.
Francisco Durán, Salvador Lucas, José Meseguer, Claude Marché & Xavier Urbain (2004):
Proving termination of membership equational programs.
In: Nevin Heintze & Peter Sestoft: Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation.
ACM,
pp. 147–158,
doi:10.1145/1014007.1014022.
Guillaume Feuillade & Thomas Genet (2003):
Reachability in Conditional Term Rewriting Systems.
Electronic Notes in Theoretical Computer Science 86(1),
pp. 133–146,
doi:10.1016/S1571-0661(04)80658-3.
Karl Gmeiner & Bernhard Gramlich (2009):
Transformations of Conditional Rewrite Systems Revisited.
In: Andrea Corradini & Ugo Montanari: Proceedings of the 19th International Workshop on Recent Trends in Algebraic Development Techniques,
Lecture Notes in Computer Science 5486.
Springer,
pp. 166–186,
doi:10.1007/978-3-642-03429-9_12.
Karl Gmeiner, Bernhard Gramlich & Felix Schernhammer (2010):
On (Un)Soundness of Unravelings.
In: Christopher Lynch: Proceedings of the 21st International Conference on Rewriting Techniques and Applications,
Leibniz International Proceedings in Informatics 6.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik,
pp. 119–134,
doi:10.4230/LIPIcs.RTA.2010.119.
Karl Gmeiner, Bernhard Gramlich & Felix Schernhammer (2012):
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems.
In: Ashish Tiwari: Proceedings of the 23rd International Conference on Rewriting Techniques and Applications,
Leibniz International Proceedings in Informatics 15.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik,
pp. 193–208,
doi:10.4230/LIPIcs.RTA.2012.193.
Karl Gmeiner & Naoki Nishida (2014):
Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems.
In: Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel & Yuki Chiba: Proceedings of the first International Workshop on Rewriting Techniques for Program Transformations and Evaluation,
OpenAccess Series in Informatics 40.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik,
pp. 3–14,
doi:10.4230/OASIcs.WPTE.2014.3.
Salvador Lucas, Claude Marché & José Meseguer (2005):
Operational termination of conditional term rewriting systems.
Information Processing Letters 95(4),
pp. 446–453,
doi:10.1016/j.ipl.2005.05.002.
Massimo Marchiori (1996):
Unravelings and Ultra-properties.
In: Michael Hanus & Mario Rodríguez-Artalejo: Proceedings of the 5th International Conference on Algebraic and Logic Programming,
Lecture Notes in Computer Science 1139.
Springer,
pp. 107–121,
doi:10.1007/3-540-61735-3_7.
Massimo Marchiori (1997):
On Deterministic Conditional Rewriting.
Computation Structures Group, Memo 405.
MIT Laboratory for Computer Science.
Naoki Nishida, Masahiko Sakai & Toshiki Sakabe (2012):
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity.
Logical Methods in Computer Science 8(3),
pp. 1–49,
doi:10.2168/LMCS-8(3:4)2012.
Naoki Nishida, Makishi Yanagisawa & Karl Gmeiner (2014):
On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings.
In: Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel & Yuki Chiba: Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation,
OpenAccess Series in Informatics 40.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik,
pp. 39–50,
doi:10.4230/OASIcs.WPTE.2014.39.
Enno Ohlebusch (2001):
Termination of Logic Programs: Transformational Methods Revisited.
Applicable Algebra in Engineering, Communication and Computing 12(1/2),
pp. 73–116,
doi:10.1007/s002000100064.
Traian-Florin Şerbănuţă & Grigore Roşu (2006):
Computationally Equivalent Elimination of Conditions.
In: Frank Pfenning: Proceedings of the 17th International Conference on Rewriting Techniques and Applications,
Lecture Notes in Computer Science 4098.
Springer,
pp. 19–34,
doi:10.1007/11805618_3.
Traian-Florin Şerbănuţă & Grigore Roşu (2006):
Computationally Equivalent Elimination of Conditions.
Technical Report UIUCDCS-R-2006-2693.
Department of Computer Science, University of Illinois at Urbana-Champaign.
Taro Suzuki, Aart Middeldorp & Tetsuo Ida (1995):
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides.
In: Jieh Hsiang: Proceedings of the 6th International Conference on Rewriting Techniques and Applications,
Lecture Notes in Computer Science 914.
Springer,
pp. 179–193,
doi:10.1007/3-540-59200-8_56.
Patrick Viry (1999):
Elimination of Conditions.
Journal of Symbolic Computation 28(3),
pp. 381–401,
doi:10.1006/jsco.1999.0288.
eptcs@eptcs.org