Compact normalisation trace via lazy rewriting

Electronic Notes in Theoretical Computer Science

Volumn 57, Issue , 2001, Pages 87-108

  Nguyen, Quang Huy ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; PATTERN MATCHING; PROBLEM SOLVING; SPECIFICATIONS; SYNTACTICS;

LAZY REWRITING; NORMAL FORMS (NF); PROOF ASSISTANTS; TERM REWRITING SYSTEMS (TRS);

LOGIC PROGRAMMING;

EID: 18944388864     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00269-5     Document Type: Conference Paper

References (21)

1. C. Alvarado and Q-H. Nguyen. ELAN for equational reasoning in Coq. In J. Despeyroux, editor, Proc. of 2nd Workshop on Logical Frameworks and Metalanguages. Institut National de Recherche en Informatique et en Automatique, ISBN 2-7261-1166-1, June 2000.
2. S. Antoy. Definitional trees. In H. Kirchner and G. Levi, editors, Proc. of the 3rd International Conference on Algebraic and Logic Programming, volume 632 of Lecture Notes in Computer Science, pages 143-157. Springer-Verlag, September 1992.
3. Borovanský P., Kirchner C., Kirchner H., Ringeissen C. Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science. 2001.
4. CSL/SRI. The PVS homepage. http://pvs.csl.sri.com.
5. Dershowitz N., Jouannaud J-P. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems. 1990;244-320 Elsevier Science Publishers B. V, (North-Holland)
6. R. Diaconescu and K. Futatsugi. An overview of CafeOBJ. In C. Kirchner and H. Kirchner, editors, Proc. of 2nd International Workshop on Rewriting Logic and its Applications, volume 15 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers B. V. (North-Holland), 2000. Available at http://www.elsevier.nl/locate/volume15.html.
7. Fokkink W., Kamperman J., Walters P. Within ARM's reach: Compilation of left-linear rewrite systems via minimal rewrite systems. ACM Transactions on Programming Languages and Systems. 20:(3):May 1998;679-706
8. Fokkink W., Kamperman J., Walters P. Lazy rewriting on eager machinery. ACM Transactions on Programming Languages and Systems. 2:(1):January 2000;45-86
9. Goguen J.A., Winkler J.M., Meseguer J., Futatsugi K., Jouannaud J-P. An introduction to OBJ. Goguen A.J., Malcolm G. Software engineering with OBJ, Advances in Formal Methods. 2000;Kluwer Academic Publishers
10. A. Graf. Left-to-right tree pattern matching. In Ronald V. Book, editor, Proc. 4th Int. Conf. RTA, volume 488 of Lecture Notes in Computer Science, pages 323-334. Springer-Verlag, 1991.
11. Huet G., Lévy J-J. Computations in orthogonal rewriting systems, Part I + II. Lassez J-L., Plotkin G.D. Computational Logic - Essays in Honor of Alan Robinson. 1991;395-443
12. J. Kamperman and P. Walters. Minimal term rewriting systems. In M. Haveraaen, O. Owe, and O. J. Dahl, editors, Recent Trends in Data Type Specification, volume 1130 of Lecture Notes in Computer Science, pages 274-290. Springer-Verlag, 1995.
13. LogiCal/INRIA. The Coq homepage. http://coq.inria.fr.
14. Lucas S. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming. 1998:(1):January 1998
15. M. Nakamura and K. Ogata. The evaluation strategy for head normal form with and without on-demand flag. In K. Futatsugi, editor, Proc. of 3rd International Workshop on Rewriting Logic and its Applications, volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers B. V. (North-Holland), 2000. Available at http://www.elsevier.nl/locate/volume36. html.
16. M.J. O'Donnell. Equational logic programming. In D. Gabbay, editor, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, Logic Programming, chapter 2. Oxford University Press, 1995. Preprint.
17. University of Karlsruhe. The KIV homepage. http://illwww.ira.uka.de/~kiv/ KIV-KA.html.
18. K. Ogata and K. Futatsugi. Operational semantics of rewriting with the on-demand evaluation strategy. In Proc. of ACM Symposium on Applied Computing, pages 756-763, 2000.
19. PROTHEO/LORIA. The ELAN homepage. http://elan.loria.fr.
20. R I. Strandh. Classes of equational programs that compile into efficient machine code. In N. Dershowitz, editor, Proc. of the 3rd Int. Conf. RTA, volume 355 of Lecture Notes in Computer Science, pages 449-461. Springer-Verlag, April 1989.
21. Thatte S. A refinement of strong sequentiality for term rewriting with constructors. Information and Computation. 72:(1):January 1987;46-65