Roel Bloo & Kristoffer H. Rose (1996):
Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Normalisation.
In: Harald Ganzinger: RTA '96—Rewriting Techniques and Applications,
Lecture Notes in Computer Science 1103.
Rutgers University.
Springer-Verlag,
New Brunswick, New Jersey,
pp. 169–183,
doi:10.1007/3-540-61464-8_51.
Scott Boag, Don Chamberlain, Mary F. Fernández, Daniela Florescu, Jonathan Robie & Jér^ome Siméon (2007):
XQuery 1.0: An XML Query Language.
W3C Recommendation.
World Wide Web Consortium.
Available at http://www.w3.org/TR/2007/REC-xquery-20070123/.
M.G.J. van den Brand, J. Heering, P. Klint & P. A. Olivier (2002):
Compiling Language Definitions: The ASF+SDF Compiler.
ACM Transactions on Programming Languages and Systems 24(4),
pp. 334–368,
doi:10.1145/567097.567099.
Martin Bravenboer, Arthur van Dam, Karina Olmos & Eelco Visser (2006):
Program Transformation with Scoped Dynamic Rewrite Rules.
Fundamenta Informaticae 69(1–2),
pp. 123–178.
Sophie Cluet & Guido Moerkotte (1993):
Nested Queries in Object Bases.
In: In Proc. Int. Workshop on Database Programming Languages,
pp. 226–242.
Maulik A. Dave (2003):
Compiler verification: a bibliography.
SIGSOFT Softw. Eng. Notes 28(6),
pp. 2–2,
doi:10.1145/966221.966235.
Maribel Fernández & Murdoch J. Gabbay (2007):
Nominal rewriting.
Inf. Comput. 205(6),
pp. 917–965,
doi:10.1016/j.ic.2006.12.002.
Giorgio Ghelli, Nicola Onose, Kristoffer H. Rose & Jér^ome Siméon (2007):
A better semantics for XQuery with side-effects.
In: DBPL'07: Proceedings of the 11th international conference on Database programming languages.
Springer-Verlag,
Berlin, Heidelberg,
pp. 81–96,
doi:10.1007/978-3-540-75987-4_6.
Jason Hickey & Aleksey Nogin (2006):
Formal Compiler Construction in a Logical Framework.
Higher-Order and Symb. Comp. 19(2-3),
pp. 197–230,
doi:10.1007/s10990-006-8746-6.
Delia Kesner & Fabien Renaud (2009):
The Prismoid of Resources.
In: 34th International Symposium on Mathematical Foundations of Computer Science (MFCS),
LNCS 5734.
Springer-Verlag,
Novy Smokovec, High Tatras, Slovakia,
pp. 464–476,
doi:10.1007/978-3-642-03816-7_40.
Jan Willem Klop, Vincent van Oostrom & Femke van Raamsdonk (1993):
Combinatory Reduction Systems: Introduction and Survey.
Theoretical Computer Science 121,
pp. 279–308,
doi:10.1016/0304-3975(93)90091-7.
Donald E. Knuth (1968):
Semantics of Context-Free Languages.
Mathematical Systems Theory 2(2),
pp. 127–145.
Donald E. Knuth & P. Bendix (1970):
Simple Word Problems in Universal Algebras.
In: J. Leech: Computational Problems in Abstract Algebra.
Pergamon Press,
Elmsford, N.Y.,
pp. 263–297.
Koji Okuma & Yasuhiko Minamide (2003):
Executing Verified Compiler Specification.
In: Atsushi Ohori: APLAS 2003—First Asian Symposium on Programming Languages and Systems,
Lecture Notes in Computer Science 2895.
Springer,
Beijing, China,
pp. 178–194,
doi:10.1007/978-3-540-40018-9_13.
Frank Pfenning & Conal Elliot (1988):
Higher-Order Abstract Syntax.
SIGPLAN Notices 23(7),
pp. 199–208,
doi:10.1145/960116.54010.
Kristoffer H. Rose (1996):
Operational Reduction Models for Functional Programming Languages.
DIKU, University of Copenhagen,
Universitetsparken 1, DK-2100 København Ø.
http://krisrose.net/thesis.pdf.
Kristoffer H. Rose (2007):
CRSX – An Open Source Platform for Experimenting with Higher Order Rewriting.
Presented in absentia at HOR 2007—http://kristoffer.rose.name/papers.
Kristoffer H. Rose (2010):
Combinatory Reduction Systems with Extensions.
http://crsx.sourceforge.net.
Kristoffer H. Rose, Roel Bloo & Frédéric Lang (2009):
On Explicit Substitution with Names.
IBM Research Report RC24909.
IBM Thomas J. Watson Research Center,
P.O. Box 704, Yorktown Heights, NY 10598, USA.
Available at http://domino.research.ibm.com/library/cyberdig.nsf/reportnumber/rc24909.
To appear in Journal of Automated Reasoning.
Mark A. Roth, Herry F. Korth & Abraham Silberschatz (1988):
Extended algebra and calculus for nested relational databases.
ACM Trans. Database Syst. 13(4),
pp. 389–417,
doi:10.1145/49346.49347.
eptcs@eptcs.org