Certifying term rewriting proofs in ELAN

Electronic Notes in Theoretical Computer Science

Volumn 59, Issue 4, 2001, Pages 320-340

  Nguyen, Quang Huy ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; COST EFFECTIVENESS; FORMAL LOGIC; PROGRAM DEBUGGING; SEMANTICS; SYNTACTICS; THEOREM PROVING;

DEBUGGING; PROOF CHECKING; RULE BASED PROGRAMS; TERM REWRITING;

COMPUTER PROGRAMMING;

EID: 0009904762     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00295-6     Document Type: Conference Paper

References (35)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. In ACM, editor, Conf. Rec. 17th Symp. POPL, pages 31-46, 1990.
2. 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.
3. B. Barras. Auto-validation d'un système de preuves avec familles inductives. PhD thesis, Université Paris VII, November 1999.
4. E. Beffara, O. Bournez, H. Kacem, and C. Kirchner. Verification of timed automata using rewrite rules and strategies. In N. Dershowitz and A. Frank, editors, Proc. BISFAI 2001, June 2001.
5. Benanav D., Kapur D., Narendran P. Complexity of matching problems. Journal of Symbolic Computation. 3:(1-2):1987;203-216
6. S. Berghofer and T. Nipkow. Proof terms for simply typed higher order logic. In J. Harrison and M. Aagaard, editors, Proc. 13th Int. Conf. TPHOL, volume 1869 of Lecture Notes in Computer Science, pages 38-52. Springer-Verlag, 2000.
7. M. Bezem, D. Hendriks, and H. de Nivelle. Automated proof construction in type theory using resolution. In D. McAllester, editor, Proc. 17th Int. Conf. CADE, volume 1831 of Lecture Notes in Artificial Intelligence, pages 148-163. Springer-Verlag, 2000.
8. S. Boutin. Using reflection to build efficient and certified decision procedures. In M. Abadi and T. Ito, editors, Proc. of the 3rd Int. Symp. TACS, number 1281 in Lecture Notes in Computer Science, pages 515-529. Springer-Verlag, 1997.
9. H. Cirstea. Calcul de réécriture: fondements et applications. PhD thesis, Université Henri Poincaré - Nancy I, October 2000.
10. Cirstea H., Kirchner C. The rewriting calculus - Part I and II. Journal of the Interest Group in Pure and Applied Logics. 9:(3):May 2001;427-498
11. H. Cirstea, C. Kirchner, and L. Liquori. The Rho Cube. In F. Honsell, editor, Proc. of FOSSACS, volume 2030 of Lecture Notes in Computer Science, pages 166-180, April 2001.
12. Coquand T., Huet G. The Calculus of Constructions. Information and Computation. 76:1988
13. Curien P-L, Hardin T, Lévy J-J. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM. 43:(2):March 1996;362-397
14. E. Denney. A prototype proof translator from HOL to Coq. In M. Aagaard and J. Harrison, editors, Proc. 13th Int. Conf. TPHOL, volume 1869 of Lecture Notes in Computer Science, pages 108-125. Springer-Verlag, 2000.
15. 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)
16. G. Dowek, T. Hardin, and C. Kirchner. Theorem proving modulo. Rapport de Recherche 3400, Institut National de Recherche en Informatique et en Automatique, April 1998. ftp://ftp.inria.fr/INRIA/publication/RR/RR-3400.ps.gz.
17. F. Gadducci. On the Algebraic Approach to Concurrent Term Rewriting. PhD thesis, Università di Pisa, January 1996.
18. Kirchner Claude, Kirchner Hélène, Vittek M. Designing CLP using Computational Systems. Van Hentenryck P., Saraswat S. Principles and Practice of Constraint Programming. 1995;The MIT press
19. Klop J.W. Term rewriting systems. Abramsky S., Gabbay D.M., Maibaum T.S.E. Handbook of Logic in Computer Science, volume 2, chapter 1. 1992;1-117 Oxford University Press, Oxford
20. LogiCal/INRIA. The Coq homepage. http://coq.inria.fr.
21. U. Martin and T. Nipkow. Ordered rewriting and confluence. In M.E. Stickel, editor, Proc. 10th Int. Conf. Automated Deduction, volume 449 of Lecture Notes in Computer Science, pages 366-380. Springer-Verlag, 1990.
22. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science. 96:(1):1992;73-155
23. J-Y. Moyen. System presentation: an analyser of rewriting systems complexity. In Mark van den Brand and Rakesh Verma, editors, Prceedings of the second RULE workshop, volume 59. Elsevier Science Publishers B. V. (North-Holland), 2001. In this volume.
24. P. Naumov, M-O. Stehr, and J. Meseguer. The HOL/NuPRL proof translator: A practical approach to formal interoperability. In R.J. Boulton and P.B. Jackson, editors, Proc. 14th Int. Conf. TPHOL, volume 2152 of Lecture Notes in Computer Science, pages 329-345. Springer-Verlag, 2001.
25. University of Utrecht. The STRATEGO homepage. http://www.stratego- language.org.
26. C. Paulin-Mohring. Extracting w's programs from proofs in the calculus of constructions. In ACM, editor, Proc. 16th Symp. POPL, January 11-13, 1989, Austin, TX, pages 89-104. ACM Press, 1989.
27. C. Paulin-Mohring. Inductive definitions in the system Coq: Rules and properties. In M. Bezem and J. F. Groote, editors, Proc. of the 1st Int. Conf. TLCA, volume 664 of Lecture Notes in Computer Science, pages 328-345, Berlin, 1993. Springer-Verlag.
28. PROTHEO/LORIA. The ELAN homepage. http://elan.loria.fr.
29. Carnegie Mellon School of Computer Science. The twelf project. http://www-2.cs.cmu.edu/~twelf/.
30. J. Stuber. Experiments with an implementation of Extended Narrowing And Resolution in the rewriting language ELAN (system description). Available at http://www.loria.fr/~stuber/software, December 2000.
31. A. Stump and D. L. Dill. Generating proofs from a decision procedure. In Proc. of Workshop on Run-Time Result Verification, July 1999. Available at http://sprout.Stanford.EDU/~stump.
32. Tammet T., Smith J.M. Optimized encodings of fragments of type theory in first-order logic. JLC: Journal of Logic and Computation. 8:1998
33. 2: A laboratory for rapid term graph rewriting. In P. Narendran and M. Rusinowitch, editors, Proc. 10th Int. Conf. RTA, volume 1631 of Lecture Notes in Computer Science, pages 252-255. Springer-Verlag, 1999.
34. Centrum voor Wiskunde en Informatica (CWI). The ATerm homepage. http://www.cwi.nl/projects/MetaEnv/aterm/.
35. Wong W. Validation of HOL proofs by proof checking. Formal Methods in System Design: An International Journal. 14:(2):1999;193-212