S. Antoy
1992
Definitional Trees
H. Kirchner
G. Levi
Proceedings of the Third International Conference on Algebraic and Logic Programming
Springer LNCS 632
Volterra, Italy
143–157
http://dx.doi.org/10.1007/bfb0013825
S Antoy
1993
Normalization by Leftmost Innermost Rewriting
Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Springer-Verlag
London, UK
448–457
http://dx.doi.org/10.1007/3-540-56393-8_36
S. Antoy
2005
Evaluation Strategies for Functional Logic Programming
Journal of Symbolic Computation
40
1
875–903
http://dx.doi.org/10.1016/j.jsc.2004.12.007
S. Antoy
2010
Programming with Narrowing
Journal of Symbolic Computation
45
5
501–522
http://dx.doi.org/10.1016/j.jsc.2010.01.006
S. Antoy
2011
On the Correctness of Pull-Tabbing
TPLP
11
4-5
713–730
http://dx.doi.org/10.1017/S1471068411000263
S. Antoy
D. Brown
S. Chiang
2006
Lazy Context Cloning for Non-deterministic Graph Rewriting
Proceedings of the 3rd International Workshop on Term Graph Rewriting, Termgraph'06
Vienna, Austria
61–70
http://dx.doi.org/10.1016/j.entcs.2006.10.026
S. Antoy
M. Hanus
2006
Overlapping Rules and Logic Variables in Functional Logic Programs
Proceedings of the Twenty Second International Conference on Logic Programming
Springer LNCS 4079
Seattle, WA
87–101
http://dx.doi.org/10.1007/11799573_9
S. Antoy
A. Jost
2013
Are needed redexes really needed?
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
PPDP '13
ACM
New York, NY, USA
61–71
http://doi.acm.org/10.1145/2505879.2505881
M. Bezem
J. W. Klop
R. de Vrijer (eds.)
2003
Term Rewriting Systems
Cambridge University Press
http://dx.doi.org/10.1145/979743.979772
G. L. Burn
S. L. Peyton Jones
J. D. Robson
1988
The Spineless G-machine
Proceedings of the 1988 ACM Conference on LISP and Functional Programming
ACM
244–258
http://doi.acm.org/10.1145/62678.62717
R. Echahed
J. C. Janodet
1997
On constructor-based graph rewriting systems
Technical Report
985-I
IMAG
Available at ftp://ftp.imag.fr/pub/labo-LEIBNIZ/OLD-archives/PMP/c-graph-rewriting.ps.gz
W. Fokkink
J. van de Pol
1997
Simulation as a correct transformation of rewrite systems
In Proceedings of 22nd Symposium on Mathematical Foundations of Computer Science, LNCS 1295
Springer
249–258
http://dx.doi.org/10.1.1.41.8118
J. C. González Moreno
F. J. López Fraguas
M. T. Hortalá González
M. Rodríguez Artalejo
1999
An Approach to Declarative Programming Based on a Rewriting Logic
The Journal of Logic Programming
40
47–87
http://dx.doi.org/10.1016/S0743-1066(98)10029-8
M. Hanus
1994
The Integration of Functions into Logic Programming: From Theory to Practice
Journal of Logic Programming
19&20
583–628
http://dx.doi.org/10.1.1.226.8638
M. Hanus
2013
Functional Logic Programming: From Theory to Curry
Programming Logics - Essays in Memory of Harald Ganzinger
Springer LNCS 7797
123–168
http://dx.doi.org/10.1007/978-3-642-37651-1_6
M. Hanus
S. Lucas
A. Middeldorp
1998
Strongly sequential and inductively sequential term rewriting systems
Information Processing Letters
67
1
1–8
http://dx.doi.org/10.1016/S0020-0190(98)00016-7
M. Hanus (ed.)
2012
Curry: An Integrated Functional Logic Language (Vers. 0.8.3)
Available at http://www.curry-language.org
G. Huet
J.-J. Lévy
1991
Computations in orthogonal term rewriting systems
J.-L. Lassez
G. Plotkin
Computational logic: essays in honour of Alan Robinson
MIT Press
Cambridge, MA
Part I, pp. 395–414 and Part II, pp. 415–443
J. F. T. Kamperman
H. R. Walters
1996
Simulating TRSs by Minimal TRSs a Simple, Efficient, and Correct Compilation Technique
Technical Report
CS-R9605
CWI
R. Kieburtz
1985
The G-machine: A fast, graph-reduction evaluator
Functional Programming Languages and Computer Architecture
LNCS 201
Springer
400–413
http://dx.doi.org/10.1007/3-540-15975-4_50
F. J. López-Fraguas
E. Martin-Martin
J. Rodríguez-Hortalá
J. Sánchez-Hernández
2014
Rewriting and narrowing for constructor systems with call-time choice semantics
TPLP
14
2
165–213
http://dx.doi.org/10.1017/S1471068412000373
A. Middeldorp
1997
Call by Need Computations to Root-stable Form
Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
POPL '97
ACM
New York, NY, USA
94–105
http://dx.doi.org/10.1145/263699.263711
M. J. O'Donnell
1977
Computing in Systems Described by Equations
Springer LNCS 58
http://dx.doi.org/10.1007/3-540-08531-9
Philip Wadler
1988
Deforestation: Transforming Programs to Eliminate Trees
Theor. Comput. Sci.
73
2
231–248
http://dx.doi.org/10.1016/0304-3975(90)90147-A