Marc Bezem, Jan W. Klop & Roel de Vrijer (2003):
Terese: Term Rewriting Systems.
Cambridge University Press,
United Kingdom.
Robert Glück & Masahiko Kawabe (2005):
Revisiting an automatic program inverter for Lisp.
SIGPLAN Notices 40(5),
pp. 8–17,
doi:10.1145/1071221.1071222.
Robert Glück & Andrei V. Klimov (1994):
Metacomputation as a tool for formal linguistic modeling.
In: Robert Trappl: Cybernetics and Systems '94 2.
World Scientific,
pp. 1563–1570.
Robert Glück & Valentin F. Turchin (1990):
Application of metasystem transition to function inversion and transformation.
In: International Symposium on Symbolic and Algebraic Computation. Proceedings.
ACM,
pp. 286–287,
doi:10.1145/96877.96953.
Masahiko Kawabe & Robert Glück (2005):
The program inverter LRinv and its structure.
In: Manuel Hermenegildo & Daniel Cabeza: Practical Aspects of Declarative Languages. Proceedings,
LNCS 3350.
Springer,
pp. 219–234,
doi:10.1007/978-3-540-30557-6_17.
Maja H. Kirkeby & Robert Glück (2020):
Inversion framework: reasoning about inversion by conditional term rewriting systems.
In: Principles and Practice of Declarative Programming. Proceedings.
ACM,
pp. Article 9,
doi:10.1145/3414080.3414089.
Maja H. Kirkeby & Robert Glück (2020):
Semi-inversion of conditional constructor term rewriting systems.
In: Maurizio Gabbrielli: Logic-based Program Synthesis and Transformation. Proceedings,
LNCS 12042.
Springer,
pp. 243–259,
doi:10.1007/978-3-030-45260-5_15.
Cynthia Kop, Aart Middeldorp & Thomas Sternagel (2017):
Complexity of conditional term rewriting.
Logical Methods in Computer Science 13(1:6),
doi:10.23638/LMCS-13(1:6)2017.
Daniel Le Métayer (1988):
ACE: an automatic complexity evaluator.
ACM Transactions on Programming Languages and Systems 10(2),
pp. 248–266,
doi:10.1145/42190.42347.
Masanori Nagashima, Masahiko Sakai & Toshiki Sakabe (2012):
Determinization of conditional term rewriting systems.
TCS 464,
doi:10.1016/j.tcs.2012.09.005.
Jorge Navas, Edison Mera, Pedro López-García & Manuel V. Hermenegildo (2007):
User-definable resource bounds analysis for logic programs.
In: Véronica Dahl & Ilkka Niemelä: Logic Programming. Proceedings,
LNCS 4670.
Springer,
pp. 348–363,
doi:10.1007/978-3-540-74610-2_24.
Naoki Nishida (2004):
Transformational Approach to Inverse Computation in Term Rewriting.
Graduate School of Engineering, Nagoya University,
Japan.
Naoki Nishida, Masahiko Sakai & Toshiki Sakabe (2005):
Partial inversion of constructor term rewriting systems.
In: Jürgen Giesl: Rewriting Techniques and Applications. Proceedings,
LNCS 3467.
Springer,
pp. 264–278,
doi:10.1007/978-3-540-32033-3_20.
Enno Ohlebusch (2002):
Advanced Topics in Term Rewriting.
Springer,
New York,
doi:10.1007/978-1-4757-3661-8.
Alexander Y. Romanenko (1988):
The generation of inverse functions in Refal.
In: Dines Bjørner, Andrei P. Ershov & Neil D. Jones: Partial Evaluation and Mixed Computation.
North-Holland,
pp. 427–444.
Alexander Y. Romanenko (1991):
Inversion and metacomputation.
In: Partial Evaluation and Semantics-Based Program Manipulation. Proceedings.
ACM,
pp. 12–22,
doi:10.1145/115865.115868.
Valentin F. Turchin (1986):
The concept of a supercompiler.
ACM TOPLAS 8(3),
pp. 292–325,
doi:10.1145/5956.5957.
eptcs@eptcs.org