Sergio Antoy, Bernd Braßel & Michael Hanus (2003):
Conditional Narrowing without Conditions.
In: Proc. 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 27-29 August 2003, Uppsala, Sweden.
ACM Press,
pp. 20–31,
doi:10.1145/888251.888255.
Jürgen Avenhaus & Carlos Loría-Sáenz (1994):
On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs.
In: Frank Pfenning: Proc. 5th Int. Conf. on Logic Programming and Automated Reasoning (LPAR'94), Kiev, Ukraine, July 16-22, 1994,
pp. 215–229,
doi:10.1007/3-540-58216-9_40.
Franz Baader & Tobias Nipkow (1998):
Term rewriting and All That.
Cambridge University Press,
doi:10.1017/CBO9781139172752.
Jan A. Bergstra & Jan Willem Klop (1986):
Conditional Rewrite Rules: Confluence and Termination.
Journal of Computer and System Sciences 32(3),
pp. 323–362,
doi:10.1016/0022-0000(86)90033-4.
Francisco Durán, Salvador Lucas, José Meseguer, Claude Marché & Xavier Urbain (2004):
Proving termination of membership equational programs.
In: Nevin Heintze & Peter Sestoft: PEPM.
ACM,
pp. 147–158,
doi:10.1145/1014007.1014022.
Elio Giovanetti & Corrado Moiso (1988):
Notes on the Elimination of Conditions.
In: Stéphane Kaplan & Jean-Pierre Jouannaud: Proc. 1st Int. Workshop on Conditional Rewriting Systems (CTRS'87), Orsay, France, 1987,
Lecture Notes in Computer Science 308.
Springer,
Orsay, France,
pp. 91–97,
doi:10.1007/3-540-19242-5_8.
ISBN 3-540-19242-5.
Karl Gmeiner (2013):
Transformational Approaches for Conditional Term Rewrite Systems.
Vienna Technical University, Vienna, Austria.
Karl Gmeiner, Bernhard Gramlich & Felix Schernhammer (2010):
On (Un)Soundness of Unravelings.
In: Christopher Lynch: Proc. 21st International Conference on Rewriting Techniques and Applications (RTA 2010), July 11-13, 2010, Edinburgh, Scotland, UK,
LIPIcs (Leibniz International Proceedings in Informatics),
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: Proc. 23rd International Conference on Rewriting Techniques and Applications (RTA 2012), May 30 – June 2, 2012, Nagoya, Japan,
LIPIcs (Leibniz International Proceedings in Informatics),
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 1st International Workshop on Rewriting Techniques for Program Transformations and Evaluation,
pp. 3–14,
doi:10.4230/OASIcs.WPTE.2014.3.
Karl Gmeiner, Naoki Nishida & Bernhard Gramlich (2013):
Proving Confluence of Conditional Term Rewriting Systems via Unravelings.
In: Nao Hirokawa & Vincent van Oostrom: Proceedings of the 2nd International Workshop on Confluence,
pp. 35–39.
Claus Hintermeier (1995):
How to Transform Canonical Decreasing CTRSs into Equivalent Canonical TRSs.
In: Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings,
Lecture Notes in Computer Science 968,
pp. 186–205,
doi:10.1007/3-540-60381-6_11.
Massimo Marchiori (1996):
Unravelings and Ultra-Properties.
In: Michael Hanus & Mario Rodríguez-Artalejo: Proc. 5th Int. Conf. on Algebraic and Logic Programming, Aachen,
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.
Technical Report MIT LCS CSG Memo n.405.
MIT, Cambridge, MA, USA.
Naoki Nishida, Masahiko Sakai & Toshiki Sakabe (2005):
Partial Inversion of Constructor Term Rewriting Systems.
In: Jürgen Giesl: Proc. 16th International Conference on Rewriting Techniques and Applications (RTA'05), Nara, Japan, April 19-21, 2005,
Lecture Notes in Computer Science 3467.
Springer,
pp. 264–278,
doi:10.1007/b138262.
Naoki Nishida, Masahiko Sakai & Toshiki Sakabe (2011):
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity.
In: Manfred Schmidt-Schauss: Proc. 22nd International Conference on Rewriting Techniques and Applications (RTA 2011), May 30 – June 1, 2011, Novi Sad, Serbia,
LIPIcs (Leibniz International Proceedings in Informatics),
doi:10.4230/LIPIcs.RTA.2011.267.
Pages 267–282.
Naoki Nishida, Makishi Yanagisawa & Karl Gmeiner (2014):
On Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation.
In: Takahito Aoto & Delia Kesner: Proceedings of the 3nd International Workshop on Confluence,
pp. 24–28.
Enno Ohlebusch (1999):
On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems.
In: Aart Middeldorp & Taisuke Sato: Proc. 4th Fuji Int. Symp. on Functional and Logic Programming (FLOPS'99),
Lecture Notes in Computer Science 1722.
Springer,
Tsukuba, Japan,
pp. 179–193,
doi:10.1007/10705424_12.
Felix Schernhammer & Bernhard Gramlich (2007):
On Proving and Characterizing Operational Termination of Deterministic Conditional Rewrite Systems.
In: Dieter Hofbauer & Alexander Serebrenik: Proc. 9th International Workshop on Termination (WST'07), June 29, 2007, Paris, France,
pp. 82–85.
Traian-Florin Şerbănuţă & Grigore Roşu (2006):
Computationally Equivalent Elimination of Conditions.
In: Frank Pfenning: Proc. 17th International Conference on Rewriting Techniques and Applications, Seattle, WA, USA, August 12-14, 2006,
Lecture Notes in Computer Science 4098.
Springer,
pp. 19–34,
doi:10.1007/11805618_3.
Patrick Viry (1999):
Elimination of Conditions.
J. Symb. Comput. 28(3),
pp. 381–401,
doi:10.1006/jsco.1999.0288.
eptcs@eptcs.org