Sergio Antoy & Michael Hanus (2006):
Overlapping Rules and Logic Variables in Functional Logic Programs.
In: Sandro Etalle & Miroslaw Truszczynski: Logic Programming, 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings,
Lecture Notes in Computer Science 4079.
Springer,
pp. 87–101,
doi:10.1007/11799573_9.
Franz Baader & Tobias Nipkow (1998):
Term rewriting and all that.
Cambridge University Press,
doi:10.1017/CBO9781139172752.
Franz Baader & Wayne Snyder (2001):
Unification Theory.
In: John Alan Robinson & Andrei Voronkov: Handbook of Automated Reasoning (in 2 volumes).
Elsevier and MIT Press,
pp. 445–532,
doi:10.1016/B978-044450813-3/50010-2.
Adel Bouhoula, Jean-Pierre Jouannaud & José Meseguer (2000):
Specification and proof in membership equational logic.
Theoretical Computer Science 236(1-2),
pp. 35–132,
doi:10.1016/S0304-3975(99)00206-6.
Bernd Braßel, Michael Hanus, Björn Peemöller & Fabian Reck (2011):
KiCS2: A New Compiler from Curry to Haskell.
In: Herbert Kuchen: Functional and Constraint Logic Programming - 20th International Workshop, WFLP 2011, Odense, Denmark, July 19th, Proceedings,
Lecture Notes in Computer Science 6816.
Springer,
pp. 1–18,
doi:10.1007/978-3-642-22531-4_1.
Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer & Carolyn L. Talcott (2007):
All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic.
Lecture Notes in Computer Science 4350.
Springer,
doi:10.1007/978-3-540-71999-1.
Manuel Clavel, José Meseguer & Miguel Palomino (2007):
Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic.
Theor. Comput. Sci. 373(1-2),
pp. 70–91,
doi:10.1016/j.tcs.2006.12.009.
Javier de Dios Castro & Francisco Javier López-Fraguas (2007):
Extra Variables Can Be Eliminated from Functional Logic Programs.
Electr. Notes Theor. Comput. Sci. 188,
pp. 3–19,
doi:10.1016/j.entcs.2006.05.049.
Francisco Durán, Steven Eker, Santiago Escobar, José Meseguer & Carolyn L. Talcott (2011):
Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6.
In: Manfred Schmidt-Schauß: Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, May 30 - June 1, 2011, Novi Sad, Serbia,
LIPIcs 10.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 31–40,
doi:10.4230/LIPIcs.RTA.2011.31.
Santiago Escobar (2004):
Implementing Natural Rewriting and Narrowing Efficiently.
In: Yukiyoshi Kameyama & Peter J. Stuckey: Functional and Logic Programming, 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004, Proceedings,
Lecture Notes in Computer Science 2998.
Springer,
pp. 147–162,
doi:10.1007/978-3-540-24754-8_12.
Michael Hanus (2005):
Functional Logic Programming: From Theory to Curry.
Technical Report.
Christian-Albrechts-Universität Kiel.
Jean-Marie Hullot (1980):
Canonical Forms and Unification.
In: Wolfgang Bibel & Robert A. Kowalski: 5th Conference on Automated Deduction, Les Arcs, France, July 8-11, 1980, Proceedings,
Lecture Notes in Computer Science 87.
Springer,
pp. 318–334,
doi:10.1007/3-540-10009-1_25.
H. Hussmann (1993):
Non-Determinism in Algebraic Specifications and Algebraic Programs.
Birkhäuser Verlag.
F. López-Fraguas, J. Rodríguez-Hortalá & J. Sánchez-Hernández (2009):
A Fully Abstract Semantics for Constructor Systems (Extended version).
Technical Report SIC-2-09.
Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid.
Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá & Jaime Sánchez-Hernández (2009):
A Fully Abstract Semantics for Constructor Systems.
In: Ralf Treinen: Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, Proceedings,
Lecture Notes in Computer Science 5595.
Springer,
pp. 320–334,
doi:10.1007/978-3-642-02348-4_23.
José Meseguer (1992):
Conditioned Rewriting Logic as a Unified Model of Concurrency.
Theor. Comput. Sci. 96(1),
pp. 73–155,
doi:10.1016/0304-3975(92)90182-F.
José Meseguer & Grigore Rosu (2007):
The rewriting logic semantics project.
Theor. Comput. Sci. 373(3),
pp. 213–237,
doi:10.1016/j.tcs.2006.12.018.
José Meseguer & Prasanna Thati (2007):
Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols.
Higher-Order and Symbolic Computation 20(1-2),
pp. 123–160,
doi:10.1007/s10990-007-9000-6.
Aart Middeldorp & Erik Hamoen (1994):
Completeness Results for Basic Narrowing.
Appl. Algebra Eng. Commun. Comput. 5,
pp. 213–253,
doi:10.1007/BF01190830.
Juan Carlos González Moreno, Maria Teresa Hortalá-González, Francisco Javier López-Fraguas & Mario Rodríguez-Artalejo (1999):
An Approach to Declarative Programming Based on a Rewriting Logic.
J. Log. Program. 40(1),
pp. 47–87,
doi:10.1016/S0743-1066(98)10029-8.
A. Riesco & J. Rodríguez-Hortalá (2012):
Generators: Detailed proofs.
Technical Report 07/12.
Departamento de Sistemas Informáticos y Computación, Universidad Complutense de Madrid.
Available at http://gpd.sip.ucm.es/snarrowing.
Adrián Riesco & Juan Rodríguez-Hortalá (2012):
S-Narrowing for Constructor Systems.
In: Abhik Roychoudhury & Meenakshi D'Souza: Theoretical Aspects of Computing - ICTAC 2012 - 9th International Colloquium, Bangalore, India, September 24-27, 2012. Proceedings,
Lecture Notes in Computer Science 7521.
Springer,
pp. 136–150,
doi:10.1007/978-3-642-32943-2_10.
Juan Rodríguez-Hortalá (2008):
A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems.
In: Ramesh Hariharan, Madhavan Mukund & V. Vinay: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, December 9-11, 2008, Bangalore, India,
LIPIcs 2.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 328–339,
doi:10.4230/LIPIcs.FSTTCS.2008.1764.
eptcs@eptcs.org