Twenty years later

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 368-375

  Jouannaud, Jean Pierre ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; COMPUTER SOFTWARE; CONSTRAINT THEORY; PROBLEM SOLVING; TECHNICAL WRITING;

CONSTRAINT SOLVING; SECURITY THEORY; SOFTWARE VERIFICATION; TERM REWRITING;

TECHNICAL PRESENTATIONS;

EID: 24944588081     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_27     Document Type: Conference Paper

References (55)

1. A. Aiken and E. Wimmers. Type inclusion constraints and type inference. In Proc. 7th ACM Conference on Functional programming and Computer Archtecture, pages 31-41, Copenhaguen, Denmark, 1993.
2. Leo Bachmair and Harald Ganzinger. Completion of first-order clause with equality by strict superposition. In Proc. 2nd Int. Workshop on Conditional and Typed Rewriting Systems, Montreal, LNCS 516, 1990.
3. Leo Bachmair and Harald Ganzinger. On restrictions of ordered paramodulation with simplification. In Proc. 10th Int. Conf. on Automated Deduction, Kaiserslautern, LNCS 449, 1990.
4. Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Technical Report MPI-I-91-208, Max-Planck-Institut für Informatik, Saarbrücken, September 1991. to appear in Journal of Logic and Computation.
5. Leo Bachmair and Harald Ganzinger. Non-clausal resolution and superposition with selection and redundancy criteria. In Proc. of the LPAR'92, 1992. Lecture Notes in Computer Science.
6. Leo Bachmair, Harald Ganzinger, Christopher Lynch, and Wayne Snyder. Basic paramodulation and superposition. In Deepak Kapur, editor, Proc. 11th Int. Conf. on Automated Deduction, Saratoga Springs, NY, LNAI 607. Springer-Verlag, June 1992.
7. Leo Bachmair, Harald Ganzinger, and Uwe Waldmann. Set constraints are the monadic class. In Proceedings of the Eigth Annual IEEE Symposium on Logic in Computer Science. IEEE Comp. Soc. Press, 1993.
8. Gilles Barthe, Horatiu Cirstea, Claude Kirchner, and Luigi Liquori. Pure patern type systems. In Conference Record of the 30th Symposium on Principles of Programming Languages, New-Orleans, USA, January 2003. ACM.
9. Frédéric Blanqui. Definitions by rewriting in the Calculus of Constructions. Mathematical Structures in Computer Science, 15(1):37-92, 2005.
10. Frédéric Blanqui. Inductive types in the Calculus of Algebraic Constructions. Fundamenta Informaticae, to appear.
11. Frédéric Blanqui, Jean-Pierre Jouannaud, and Pierre-Yves Strub. A calculus of congruent constructions. Technical report, École Polytechnique, 2005. submitted.
12. Alexandre Boudet and Hubert Comon. Diophantine equations, Presburger arithmetic and finite automata. In H. Kirchner, editor, Proc. Coll. on Trees in Algebra and Programming (CAAP'96), Lecture Notes in Computer Science, pages 30-43, 1996.
13. Alexandre Boudet, Jean-Pierre Jouannaud, and Manfred Schmidt- Schauß. Unification in Boolean rings and Abelian groups. Journal of Symbolic Computation, 8:449-477, 1989.
14. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. In Michel Bidoit and Max Dauchet, editors, Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, pages 67-92, Lille, France, April 1997. Springer-Verlag.
15. Adel Bouhoula and Jean-Pierre Jouannaud. Automata-driven automated induction. In Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 14-25, Warsaw,Poland, June 1997. IEEE Comp. Soc. Press.
16. R. M. Burstall and J. A. Goguen. The semantics of CLEAR, a specification language. In Proc. Winter School on Abstract Software Specifications, Copenhagen, LNCS 86, 1979.
17. Anne-Cécile Caron, Jean-Luc Coquidé, and Max Dauchet. Encompassment properties and automata with constraints. In Claude Kirchner, editor, 5th International Conference on Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 328-342, Montreal, Canada, June 1993. Springer-Verlag.
18. Jacek Chrzaszcz. Modules in cow are and will be correct. In M. Coppo S. Berardi and F. Damiani, editors, Proceedings TYPES'03, volume 3085 of Lecture Notes in Computer Science, pages 135-150, Torino, Italy, 2003. Springer-Verlag.
19. Hubert Comon. Sequentiality, second-order monadic logic and tree automata. In Dexter Kozen, editor, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 508-517, San Diego, CA, June 1995. IEEE Comp. Soc. Press.
20. Hubert Comon and Catherine Delor. Equational formulae with membership constraints. Information and Computation, 112(2):167-216, August 1994.
21. Thierry Coquand and Gérard Huet. The calculus of constructions. Information and Computation, 76:95-120, February 1988.
22. Nachum Dershowitz. Equations as programming language. In Proceedings of the Fourth Jerusalem Conference on Information Technology, pages 114-124, Jerusalem, Israel, May 1984. IEEE Computer Society.
23. Razvan Diaconescu and Kokichi Futatsugi. Cafeobj-report: The language, proof techniques and methodologies for object-oriented algebraic specification. In AMAST series in Computing, volume 6. World Scientific, 1998.
24. Michaël Rusinowitch et alii. The aviss security protocols analysis tool - system description. In Proceedings of Computer-Aided Verification 02, 2003.
25. Laurent Fribourg and Morcos Veloso Peixoto. Automates concurrents à contraintes. Technique et Science Informatiques, 13(6), 1994.
26. Rémy Gilleron, Sophie Tison, and Marc Tommasi. Solving systems of set constraints using tree automata. In stacs93, 1993.
27. G. Gonthier, J.-J. Lévy, and P.-A. Mellies. An abstract standardisation theorem. In Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, CA, 1992.
28. Jean Goubault-Larrecq. Résolution ordonnée avec sélection et classes décidables de la logique du premier ordre, 2004. available from the web.
29. Benjamin Gregoire. Compilation de termes de preuves. Un mariage entre Coq et OCaml. PhD thesis, École Polytechnique, Palaiseau, France, 2003.
30. Olivier Hermant. A rewriting abstract machine for coq, 2004.
31. Jieh Hsiang and Michaël Rusinowitch. On word problems in equational theories. In Thomas Ottmann, editor, 14th International Colloquium on Automata, Languages and Programming, volume 267 of Lecture Notes in Computer Science, pages 54-71, Karlsruhe, Germany, July 1987. Springer-Verlag.
32. Denis Lugiez Hubert Comon, Max Dauchet and Sophie Tison, editors. Tree Automata techniques and Applications, http://www.grappa.univ-lille3.fr/tata/, Lille, France, 2002.
33. Hubert Comon and Yann Jürsski. Higher-order matching and tree automata. In M. Nielsen and W. Thomas, editors, Proc. 11th Computer Science Logic, volume 1414 of Lecture Notes in Computer Science, Aarhus, Denmark, August 1997. Springer-Verlag.
34. Gérard Huet. Confluent reductions: abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797-821, October 1980.
35. J.-M. Hullot. Canonical forms and unification. In W. Bibel and R. Kowalski, editors, 5th International Conference on Automated Deduction, volume 87 of Lecture Notes in Computer Science, Les Arcs, France, July 1980. Springer-Verlag.
36. Jean-Pierre Jouannaud. Modular associative commutative confluence. Technical report, École Polytechnique, 2005.
37. Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, 1991.
38. Jean-Pierre Jouannaud and Emmanuel Kounalis. Automatic proofs by induction in equational theories without constructors. In Logic in Computer Science, June 1986.
39. Jean-Pierre Jouannaud, Albert Rubio, and Femke Van Raamsdonk. Higher-order rewriting with types and arities. Technical report, École Polytechnique, 2005. submitted.
40. Claude Kirchner, Helene Kirchner, and Michaël Rusinowitch. Deduction with symbolic constraints. Revue Française d'Intelligence Artificielle, 4(3):9-52, 1990. Special issue on automatic deduction.
41. Claude Kirchner and Piere Moreau. Non deterministic computations in elan. In J.L. Fiadeiro, editor, Proceedings 13th workshop on abstract data types, volume 1589 of Lecture Notes in Computer Science, Lisbon, Portugal, October 1999. Springer-Verlag.
42. Dallas S. Lankford. Canonical inference. Memo ATP-32, University of Texas at Austin, March 1975.
43. D. Lugiez and J.-L. Moysset. Complement problems and tree automata in AC-like theories. In Proc. Symp. on Theoretical Aspects of Computer Science, Würzburg, 1993. also available as techincal report CRIN 92-R-175.
44. Richard Mayr and Tobias Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science, 192(1):3-29, February 1998.
45. José Meseguer. A logical theory of concurrent objects and its realization in the maude language. To appear in G. Agha, P.Wegner, and A.Yoneezawa (editors), Research Directions in Object-Based Concurrency, 1992.
46. A.T. Nakagawa and K. Futatsugi. An overview of cafe specification environment. In Proc. of the 1st IEEE International Conference on Formal Engineering Methods, pages 170-181. IEEE Computer Society Press, 1997.
47. Robert Nieuwenhuis. Basic paramodulation and decidable theories. In Amy Felty, editor, Eleventh Annual IEEE Symposium on Logic in Computer Science, New-Brunswick, CA, June 1996. IEEE Comp. Soc. Press.
48. Robert Nieuwenhuis and Albert Rubio. Completion of first-order clauses by basic superposition with ordering constraints. Tech. report, Dept. L.S.I., Univ. Polit. Catalunya, 1991. To appear in Proc. 11th Conf. on Automated Deduction, Saratoga Springs, 1992.
49. Christine Paulin-Mohring. Inductive definitions in the system COQ. In Typed Lambda Calculi and Applications, pages 328-345. Springer-Verlag, 1993. LNCS 664.
50. Gerald E. Peterson. A technique for establishing completeness results in theorem proving with equality. SIAM Journal on Computing, 12(1):82-100, February 1983.
51. David A. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65(2-3):182-215, May/June 1985.
52. R. E. Shostak. An efficient decision procedure for arithmetic with function symbols. J. of the Association for Computing Machinery, 26(2):351-360, April 1979.
53. R.E. Shostak. Deciding combinations of theories. Technical Report CSL 132, SRI International, February 1982.
54. L. Wos, G. Robinson, D. Carson, and L. Shalla. The concept of demodulation in theorem proving. Journal of the ACM, 14:698-709, 1967.
55. Hongwei Xi and Franck Pfenning. Dependent types in practical programming. In Conference Record of the 21st Symposium on Principles of Programming Languages, San Antonio, Texas, 1998. ACM.