Adventures in sequent calculus modulo equations

Electronic Notes in Theoretical Computer Science

Volumn 15, Issue , 1998, Pages 21-32

  Viry, Patrick ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

THEOREM PROVING;

REWRITE THEORY; SEQUENT CALCULUS;

DIFFERENTIATION (CALCULUS);

EID: 0001150433     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82550-2     Document Type: Conference Paper

References (12)

1. [AEH94] S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy, 1994.
2. [DHK98] G. Dowek, Th. Hardin, and C. Kirchner. Theorem proving modulo. Technical Report 3400, INRIA, 1998.
3. [FJ95] M. Fernandez and J.-P. Jouannaud. Modular termination of term rewriting systems revisited. In Procs. of 11th Workshop on Specification of Abstract Data Types, number 906 in LNCS. Springer-Verlag, 1995.
4. [GLT89] J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
5. [JK84] J.-P. Jouannaud and Helene Kirchner. Completion of a set of rules modulo a set of equations. In Proceedings 11th ACM Symposium on Principles of Programming Languages, Salt Lake City, 1984.
6. [KKM95] C. Kirchner, H. Kirchner, and M.Vittek. Designing clp using computational systems. In P. Van Hentenryck and S. Saraswat, editors, Principles and Practice of Constraint Programming. The MIT press, 1995.
7. [Les94] P. Lescanne. From Xa to Xv, a journey through calculi of explicit substitutions. In Hans Boehm, editor, Proceedings of the 21st Annual ACM Symposium on Principles Of Programming Languages, Portland (Or., USA), pages 60-69. ACM, 1994.
8. [Mes92] J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.
9. [Mes93] J. Meseguer. A logical theory of concurrent objects and its realization in the maude language. In G. Agha, P. Wegner, and A. Yonezawa, editors, Research Directions in Object-Based Concurrency. MIT Press, 1993.
10. [MOM93] N. Marti-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. Technical Report CSL-93-05, SRI International, 1993.
11. [Rub95] Rubio. Extension orderings. In Procs. of ICA I,I. number 944 in LNCS. Springer-Verlag, 1995.
12. [Vir95] Patrick Viry. Rewriting modulo a rewrite system. Technical Report TR-20/95, Universita di Pisa, 1995. available from http://www.kurims.kyoto-u. ac.jp/-viry.