| 2008 |
|---|
| 80 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
The Computability Path Ordering: The End of a Quest.
CSL 2008: 1-14 |
| 79 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Pierre-Yves Strub:
From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures.
IFIP TCS 2008: 349-365 |
| 78 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Pierre-Yves Strub:
From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures
CoRR abs/0804.3762: (2008) |
| 77 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
The computability path ordering: the end of a quest
CoRR abs/0806.2517: (2008) |
| 2007 |
|---|
| 76 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Pierre-Yves Strub:
Building Decision Procedures in the Calculus of Inductive Constructions.
CSL 2007: 328-342 |
| 75 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
HORPO with Computability Closure: A Reconstruction.
LPAR 2007: 138-150 |
| 74 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Pierre-Yves Strub:
Building Decision Procedures in the Calculus of Inductive Constructions
CoRR abs/0707.1266: (2007) |
| 73 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
HORPO with Computability Closure : A Reconstruction
CoRR abs/0708.3582: (2007) |
| 72 | EE | Jean-Pierre Jouannaud,
Ian Mackie:
Preface.
Electr. Notes Theor. Comput. Sci. 171(3): 1-2 (2007) |
| 71 | EE | Jean-Pierre Jouannaud,
Albert Rubio:
Polymorphic higher-order recursive path orderings.
J. ACM 54(1): (2007) |
| 2006 |
|---|
| 70 | | Kokichi Futatsugi,
Jean-Pierre Jouannaud,
José Meseguer:
Algebra, Meaning, and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday
Springer 2006 |
| 69 | EE | Jacek Chrzaszcz,
Jean-Pierre Jouannaud:
From OBJ to ML to Coq.
Essays Dedicated to Joseph A. Goguen 2006: 216-234 |
| 68 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
Higher-Order Termination: From Kruskal to Computability.
LPAR 2006: 1-14 |
| 67 | EE | Jean-Pierre Jouannaud,
Albert Rubio:
Higher-Order Orderings for Normal Rewriting.
RTA 2006: 387-399 |
| 66 | EE | Jean-Pierre Jouannaud:
Modular Church-Rosser Modulo.
RTA 2006: 96-107 |
| 65 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Albert Rubio:
Higher-Order Termination: from Kruskal to Computability
CoRR abs/cs/0609039: (2006) |
| 64 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Mitsuhiro Okada:
The Calculus of Algebraic Constructions
CoRR abs/cs/0610063: (2006) |
| 63 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Mitsuhiro Okada:
Inductive-data-type Systems
CoRR abs/cs/0610066: (2006) |
| 62 | EE | Jean-Pierre Jouannaud,
Weiwen Xu:
Automatic Complexity Analysis for Programs Extracted from Coq Proof.
Electr. Notes Theor. Comput. Sci. 153(1): 35-53 (2006) |
| 2005 |
|---|
| 61 | EE | Jean-Pierre Jouannaud:
Higher-Order Rewriting: Framework, Confluence and Termination.
Processes, Terms and Cycles 2005: 224-250 |
| 60 | EE | Jean-Pierre Jouannaud:
Twenty Years Later.
RTA 2005: 368-375 |
| 2004 |
|---|
| 59 | EE | Jean-Pierre Jouannaud:
Theorem Proving Languages for Verification.
ATVA 2004: 11-14 |
| 2002 |
|---|
| 58 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Mitsuhiro Okada:
Inductive-data-type systems.
Theor. Comput. Sci. 272(1-2): 41-68 (2002) |
| 2001 |
|---|
| 57 | | Adel Bouhoula,
Jean-Pierre Jouannaud:
Automata-Driven Automated Induction.
Inf. Comput. 169(1): 1-22 (2001) |
| 2000 |
|---|
| 56 | EE | Adel Bouhoula,
Jean-Pierre Jouannaud,
José Meseguer:
Specification and proof in membership equational logic.
Theor. Comput. Sci. 236(1-2): 35-132 (2000) |
| 1999 |
|---|
| 55 | EE | Jean-Pierre Jouannaud,
Ralf Treinen:
Constraints and Constraint Solving: An Introduction.
CCL 1999: 1-46 |
| 54 | EE | Jean-Pierre Jouannaud,
Albert Rubio:
The Higher-Order Recursive Path Ordering.
LICS 1999: 402-411 |
| 53 | EE | Frédéric Blanqui,
Jean-Pierre Jouannaud,
Mitsuhiro Okada:
The Calculus of algebraic Constructions.
RTA 1999: 301-316 |
| 52 | | Hubert Comon,
Mehmet Dincbas,
Jean-Pierre Jouannaud,
Claude Kirchner:
A Methodological View of Constraint Solving.
Constraints 4(4): 337-361 (1999) |
| 1998 |
|---|
| 51 | EE | Jean-Pierre Jouannaud:
Membership equational logic, calculus of inductive instructions, and rewrite logic.
Electr. Notes Theor. Comput. Sci. 15: (1998) |
| 50 | EE | Jean-Pierre Jouannaud,
Albert Rubio:
Rewrite Orderings for Higher-Order Terms in eta-Long beta-Normal Form and Recursive Path Ordering.
Theor. Comput. Sci. 208(1-2): 33-58 (1998) |
| 1997 |
|---|
| 49 | EE | Adel Bouhoula,
Jean-Pierre Jouannaud:
Automata-Driven Automated Induction.
LICS 1997: 14-25 |
| 48 | | Adel Bouhoula,
Jean-Pierre Jouannaud,
José Meseguer:
Specification and Proof in Membership Equational Logic.
TAPSOFT 1997: 67-92 |
| 47 | EE | Jean-Pierre Jouannaud,
Mitsuhiro Okada:
Abstract Data Type Systems.
Theor. Comput. Sci. 173(2): 349-391 (1997) |
| 1996 |
|---|
| 46 | | Jean-Pierre Jouannaud,
Albert Rubio:
A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form.
RTA 1996: 108-122 |
| 1995 |
|---|
| 45 | | Hubert Comon,
Jean-Pierre Jouannaud:
Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course
Springer 1995 |
| 44 | | Nachum Dershowitz,
Jean-Pierre Jouannaud,
Jan Willem Klop:
Problems in Rewriting III.
RTA 1995: 457-471 |
| 1994 |
|---|
| 43 | | Jean-Pierre Jouannaud:
Constraints in Computational Logics, First International Conference, CCL'94, Munich, Germant, September 7-9, 1994
Springer 1994 |
| 42 | | Maribel Fernández,
Jean-Pierre Jouannaud:
Modular Termination of Term Rewriting Systems Revisited.
COMPASS/ADT 1994: 255-272 |
| 41 | | Jean-Pierre Jouannaud,
Walid Sadfi:
Strong Sequentiality of Left-Linear Overlapping Rewrite Systems.
CTRS 1994: 235-246 |
| 40 | | Hubert Comon,
Marianne Haberstrau,
Jean-Pierre Jouannaud:
Syntacticness, Cycle-Syntacticness, and Shallow Theories
Inf. Comput. 111(1): 154-191 (1994) |
| 1993 |
|---|
| 39 | | Marie-Claude Gaudel,
Jean-Pierre Jouannaud:
TAPSOFT'93: Theory and Practice of Software Development, International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993, Proceedings
Springer 1993 |
| 38 | | Nachum Dershowitz,
Jean-Pierre Jouannaud,
Jan Willem Klop:
More Problems in Rewriting.
RTA 1993: 468-487 |
| 37 | | Jean-Pierre Jouannaud:
Introduction to Rewriting.
Term Rewriting 1993: 1-15 |
| 1992 |
|---|
| 36 | | Jean-Pierre Jouannaud:
Rewriting Techniques for Software Engineering.
COMPASS/ADT 1992: 30-52 |
| 35 | | Hubert Comon,
Marianne Haberstrau,
Jean-Pierre Jouannaud:
Decidable Problems in Shallow Equational Theories (Extended Abstract)
LICS 1992: 255-265 |
| 34 | | Jean-Pierre Jouannaud,
Claude Kirchner,
Hélène Kirchner,
Aristide Mégrelis:
Programming with Equalitiers, Subsorts, Overloading and Parametrization in OBJ.
J. Log. Program. 12(3&4): 257-279 (1992) |
| 33 | | Jean-Pierre Jouannaud,
Claude Marché:
Termination and Completion Modulo Associativity, Commutativity and Identity.
Theor. Comput. Sci. 104(1): 29-51 (1992) |
| 1991 |
|---|
| 32 | | Jean-Pierre Jouannaud,
Claude Kirchner:
Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification.
Computational Logic - Essays in Honor of Alan Robinson 1991: 257-321 |
| 31 | | Jean-Pierre Jouannaud,
Mitsuhiro Okada:
Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable.
ICALP 1991: 455-468 |
| 30 | | Jean-Pierre Jouannaud,
Mitsuhiro Okada:
A Computation Model for Executable Higher-Order Algebraic Specification Languages
LICS 1991: 350-361 |
| 29 | | Nachum Dershowitz,
Jean-Pierre Jouannaud,
Jan Willem Klop:
Open Problems in Rewriting.
RTA 1991: 445-456 |
| 28 | | Jean-Pierre Jouannaud:
Executable Higher-Order Algebraic Specifications.
STACS 1991: 16-25 |
| 27 | | Nachum Dershowitz,
Jean-Pierre Jouannaud:
Notations for Rewting.
Bulletin of the EATCS 43: 162-174 (1991) |
| 1990 |
|---|
| 26 | | Jieh Hsiang,
Jean-Pierre Jouannaud:
Tutorial on Rewrite-Based Theorem Proving.
CADE 1990: 684 |
| 25 | | Jean-Pierre Jouannaud,
Claude Marché:
Completion modulo Associativity, Commutativity and Identity (AC1).
DISCO 1990: 111-120 |
| 24 | | Jean-Pierre Jouannaud:
Syntactic Theories.
MFCS 1990: 15-25 |
| 23 | | Nachum Dershowitz,
Jean-Pierre Jouannaud:
Rewrite Systems.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 243-320 |
| 1989 |
|---|
| 22 | | Jean-Pierre Jouannaud,
Emmanuel Kounalis:
Automatic Proofs by Induction in Theories without Constructors
Inf. Comput. 82(1): 1-33 (1989) |
| 21 | | Alexandre Boudet,
Jean-Pierre Jouannaud,
Manfred Schmidt-Schauß:
Unification in Boolean Rings and Abelian Groups.
J. Symb. Comput. 8(5): 449-477 (1989) |
| 1988 |
|---|
| 20 | | Stéphane Kaplan,
Jean-Pierre Jouannaud:
Conditional Term Rewriting Systems, 1st International Workshop, Orsay, France, July 8-10, 1987, Proceedings
Springer 1988 |
| 19 | | Jean-Pierre Jouannaud,
Claude Kirchner,
Hélène Kirchner,
Aristide Mégrelis:
OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization.
ALP 1988: 41-52 |
| 18 | | Alexandre Boudet,
Jean-Pierre Jouannaud,
Manfred Schmidt-Schauß:
Unification in Free Extensions of Boolean Rings and Abelian Groups
LICS 1988: 121-130 |
| 1986 |
|---|
| 17 | | Jean-Pierre Jouannaud,
Emmanuel Kounalis:
Automatic Proofs by Induction in Equational Theories Without Constructors
LICS 1986: 358-366 |
| 16 | | Jean-Pierre Jouannaud,
Hélène Kirchner:
Completion of a Set of Rules Modulo a Set of Equations.
SIAM J. Comput. 15(4): 1155-1194 (1986) |
| 1985 |
|---|
| 15 | | Jean-Pierre Jouannaud:
Functional Programming Languages and Computer Architecture, Nancy, France, September 16-19, 1985, Proceedings
Springer 1985 |
| 14 | | Jean-Pierre Jouannaud:
Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings
Springer 1985 |
| 13 | | Joseph A. Goguen,
Jean-Pierre Jouannaud,
José Meseguer:
Operational Semantics for Order-Sorted Algebra.
ICALP 1985: 221-231 |
| 12 | | Kokichi Futatsugi,
Joseph A. Goguen,
Jean-Pierre Jouannaud,
José Meseguer:
Principles of OBJ2.
POPL 1985: 52-66 |
| 11 | | Jean-Pierre Jouannaud,
Emmanuel Kounalis:
Proofs by induction in equational theories without constructors.
Bulletin of the EATCS 27: 49-55 (1985) |
| 1984 |
|---|
| 10 | | Jean-Pierre Jouannaud,
Miguel Munoz:
Termination of a Set of Rules Modulo a Set of Equations.
CADE 1984: 175-193 |
| 9 | | Jean-Pierre Jouannaud,
Hélène Kirchner:
Completion of a Set of Rules Modulo a Set of Equations.
POPL 1984: 83-92 |
| 8 | | Jean-Pierre Jouannaud,
Hélène Kirchner:
Construction D'un Plus Petit Odre de Simplification.
ITA 18(3): 191-208 (1984) |
| 1983 |
|---|
| 7 | | Jean-Pierre Jouannaud:
Programming and Checking Data Types with REVE.
ADT 1983 |
| 6 | | Jean-Pierre Jouannaud:
Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types.
CAAP 1983: 269-283 |
| 5 | | Jean-Pierre Jouannaud,
Claude Kirchner,
Hélène Kirchner:
Incremental Construction of Unification Algorithms in Equational Theories.
ICALP 1983: 361-373 |
| 4 | | Jean-Pierre Jouannaud,
Hélène Kirchner,
Jean-Luc Remy:
Church-Rosser Properties of Weakly Terminating Term Rewriting Systems.
IJCAI 1983: 909-915 |
| 1982 |
|---|
| 3 | | Jean-Pierre Jouannaud,
Pierre Lescanne:
On Multiset Orderings.
Inf. Process. Lett. 15(2): 57-63 (1982) |
| 1981 |
|---|
| 2 | | Claude Kirchner,
Hélène Kirchner,
Jean-Pierre Jouannaud:
Algebraic Manipulations as a Unification and Matching Strategy for Linear Equations in Signed Binary Trees.
IJCAI 1981: 1016-1023 |
| 1977 |
|---|
| 1 | | Jean-Pierre Jouannaud,
Gérard D. Guiho,
Jean-Pierre Treuil:
SISP/1: An Interactive System Able to Synthesize Functions from Examples.
IJCAI 1977: 412-418 |
