Jean-Pierre Jouannaud

Jean-Pierre Jouannaud, Jiaxiang Liu: From diagrammatic confluence to modularity. Theor. Comput. Sci. 464: 20-34 (2012)

Jean-Pierre Jouannaud, Jianqi Li: Church-Rosser Properties of Normal Rewriting. CSL 2012: 350-365

Bruno Barras, Jean-Pierre Jouannaud, Pierre-Yves Strub, Qian Wang: CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory. LICS 2011: 143-151

Jean-Pierre Jouannaud, Zhong Shao (Eds.): Certified Programs and Proofs - First International Conference, CPP 2011, Kenting, Taiwan, December 7-9, 2011. Proceedings. Lecture Notes in Computer Science 7086, Springer 2011, isbn 978-3-642-25378-2

Jean-Pierre Jouannaud, Benjamin Monate: Infinite Families of Finite String Rewriting Systems and Their Confluence. LPAR (Yogyakarta) 2010: 387-401

Jean-Pierre Jouannaud, Vincent van Oostrom: Diagrammatic Confluence and Completion. ICALP (2) 2009: 212-222

Jean-Pierre Jouannaud, Yoshihito Toyama: Modular Church-Rosser Modulo: The Complete Picture. Int. J. Software and Informatics 2(1): 61-75 (2008)

Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio: The Computability Path Ordering: The End of a Quest. CSL 2008: 1-14

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

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)

Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio: The computability path ordering: the end of a quest. CoRR abs/0806.2517 (2008)

Jean-Pierre Jouannaud, Ian Mackie: Preface. Electr. Notes Theor. Comput. Sci. 171(3): 1-2 (2007)

Jean-Pierre Jouannaud, Albert Rubio: Polymorphic higher-order recursive path orderings. J. ACM 54(1) (2007)

Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub: Building Decision Procedures in the Calculus of Inductive Constructions. CSL 2007: 328-342

Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio: HORPO with Computability Closure: A Reconstruction. LPAR 2007: 138-150

Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub: Building Decision Procedures in the Calculus of Inductive Constructions. CoRR abs/0707.1266 (2007)

Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio: HORPO with Computability Closure : A Reconstruction. CoRR abs/0708.3582 (2007)

Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer: Joseph Goguen (1941-2006). Bulletin of the EATCS 90: 199-201 (2006)

Jean-Pierre Jouannaud, Weiwen Xu: Automatic Complexity Analysis for Programs Extracted from Coq Proof. Electr. Notes Theor. Comput. Sci. 153(1): 35-53 (2006)

Jacek Chrzaszcz, Jean-Pierre Jouannaud: From OBJ to ML to Coq. Essays Dedicated to Joseph A. Goguen 2006: 216-234

Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio: Higher-Order Termination: From Kruskal to Computability. LPAR 2006: 1-14

Jean-Pierre Jouannaud: Modular Church-Rosser Modulo. RTA 2006: 96-107

Jean-Pierre Jouannaud, Albert Rubio: Higher-Order Orderings for Normal Rewriting. RTA 2006: 387-399

Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer (Eds.): Algebra, Meaning, and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 4060, Springer 2006, isbn 3-540-35462-X

Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio: Higher-Order Termination: from Kruskal to Computability. CoRR abs/cs/0609039 (2006)

Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada: The Calculus of Algebraic Constructions. CoRR abs/cs/0610063 (2006)

Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada: Inductive-data-type Systems. CoRR abs/cs/0610066 (2006)

Jean-Pierre Jouannaud: Higher-Order Rewriting: Framework, Confluence and Termination. Processes, Terms and Cycles 2005: 224-250

Jean-Pierre Jouannaud: Twenty Years Later. RTA 2005: 368-375

Jean-Pierre Jouannaud: Theorem Proving Languages for Verification. ATVA 2004: 11-14

Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada: Inductive-data-type systems. Theor. Comput. Sci. 272(1-2): 41-68 (2002)

Adel Bouhoula, Jean-Pierre Jouannaud: Automata-Driven Automated Induction. Inf. Comput. 169(1): 1-22 (2001)

Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer: Specification and proof in membership equational logic. Theor. Comput. Sci. 236(1-2): 35-132 (2000)

Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner: A Methodological View of Constraint Solving. Constraints 4(4): 337-361 (1999)

Jean-Pierre Jouannaud, Ralf Treinen: Constraints and Constraint Solving: An Introduction. CCL 1999: 1-46

Jean-Pierre Jouannaud, Albert Rubio: The Higher-Order Recursive Path Ordering. LICS 1999: 402-411

Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada: The Calculus of algebraic Constructions. RTA 1999: 301-316

Jean-Pierre Jouannaud: Membership equational logic, calculus of inductive instructions, and rewrite logic. Electr. Notes Theor. Comput. Sci. 15: 388-393 (1998)

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)

Jean-Pierre Jouannaud, Mitsuhiro Okada: Abstract Data Type Systems. Theor. Comput. Sci. 173(2): 349-391 (1997)

Adel Bouhoula, Jean-Pierre Jouannaud: Automata-Driven Automated Induction. LICS 1997: 14-25

Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer: Specification and Proof in Membership Equational Logic. TAPSOFT 1997: 67-92

Jean-Pierre Jouannaud, Albert Rubio: A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form. RTA 1996: 108-122

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: Problems in Rewriting III. RTA 1995: 457-471

Hubert Comon, Jean-Pierre Jouannaud (Eds.): Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course. Lecture Notes in Computer Science 909, Springer 1995, isbn 3-540-59340-3

Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud: Syntacticness, Cycle-Syntacticness, and Shallow Theories. Inf. Comput. 111(1): 154-191 (1994)

Jean-Pierre Jouannaud: Book Review: A Proof Theory for General Unification. By Wayne Snyder. (Birkhauser, 1991. vi+175 pages. ISBN 0-8176-3593-9. $28.00). SIGACT News 25(2): 25 (1994)

Maribel Fernández, Jean-Pierre Jouannaud: Modular Termination of Term Rewriting Systems Revisited. COMPASS/ADT 1994: 255-272

Jean-Pierre Jouannaud, Walid Sadfi: Strong Sequentiality of Left-Linear Overlapping Rewrite Systems. CTRS 1994: 235-246

Jean-Pierre Jouannaud (Ed.): Constraints in Computational Logics, First International Conference, CCL'94, Munich, Germant, September 7-9, 1994. Lecture Notes in Computer Science 845, Springer 1994, isbn 3-540-58403-X

Jean-Pierre Jouannaud: Introduction to Rewriting. Term Rewriting 1993: 1-15

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: More Problems in Rewriting. RTA 1993: 468-487

Marie-Claude Gaudel, Jean-Pierre Jouannaud (Eds.): TAPSOFT'93: Theory and Practice of Software Development, International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993, Proceedings. Lecture Notes in Computer Science 668, Springer 1993, isbn 3-540-56610-4

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)

Jean-Pierre Jouannaud, Claude Marché: Termination and Completion Modulo Associativity, Commutativity and Identity. Theor. Comput. Sci. 104(1): 29-51 (1992)

Jean-Pierre Jouannaud: Rewriting Techniques for Software Engineering. COMPASS/ADT 1992: 30-52

Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud: Decidable Problems in Shallow Equational Theories (Extended Abstract). LICS 1992: 255-265

Nachum Dershowitz, Jean-Pierre Jouannaud: Notations for Rewting. Bulletin of the EATCS 43: 162-174 (1991)

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

Jean-Pierre Jouannaud, Mitsuhiro Okada: Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable. ICALP 1991: 455-468

Jean-Pierre Jouannaud, Mitsuhiro Okada: A Computation Model for Executable Higher-Order Algebraic Specification Languages. LICS 1991: 350-361

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: Open Problems in Rewriting. RTA 1991: 445-456

Jean-Pierre Jouannaud: Executable Higher-Order Algebraic Specifications. STACS 1991: 16-25

Nachum Dershowitz, Jean-Pierre Jouannaud: Rewrite Systems. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 243-320

Jieh Hsiang, Jean-Pierre Jouannaud: Tutorial on Rewrite-Based Theorem Proving. CADE 1990: 684

Jean-Pierre Jouannaud, Claude Marché: Completion modulo Associativity, Commutativity and Identity (AC1). DISCO 1990: 111-120

Jean-Pierre Jouannaud: Syntactic Theories. MFCS 1990: 15-25

Jean-Pierre Jouannaud, Emmanuel Kounalis: Automatic Proofs by Induction in Theories without Constructors. Inf. Comput. 82(1): 1-33 (1989)

Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß: Unification in Boolean Rings and Abelian Groups. J. Symb. Comput. 8(5): 449-477 (1989)

Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis: OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization. ALP 1988: 41-52

Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß: Unification in Free Extensions of Boolean Rings and Abelian Groups. LICS 1988: 121-130

Stéphane Kaplan, Jean-Pierre Jouannaud (Eds.): Conditional Term Rewriting Systems, 1st International Workshop, Orsay, France, July 8-10, 1987, Proceedings. Lecture Notes in Computer Science 308, Springer 1988, isbn 3-540-19242-5

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)

Jean-Pierre Jouannaud, Emmanuel Kounalis: Automatic Proofs by Induction in Equational Theories Without Constructors. LICS 1986: 358-366

Jean-Pierre Jouannaud, Emmanuel Kounalis: Proofs by induction in equational theories without constructors. Bulletin of the EATCS 27: 49-55 (1985)

Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer: Operational Semantics for Order-Sorted Algebra. ICALP 1985: 221-231

Kokichi Futatsugi, Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer: Principles of OBJ2. POPL 1985: 52-66

Jean-Pierre Jouannaud (Ed.): Functional Programming Languages and Computer Architecture, Nancy, France, September 16-19, 1985, Proceedings. Lecture Notes in Computer Science 201, Springer 1985, isbn 3-540-15975-4

Jean-Pierre Jouannaud (Ed.): Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings. Lecture Notes in Computer Science 202, Springer 1985, isbn 3-540-15976-2

Jean-Pierre Jouannaud, Hélène Kirchner: Construction D'un Plus Petit Odre de Simplification. ITA 18(3): 191-208 (1984)

Jean-Pierre Jouannaud, Miguel Munoz: Termination of a Set of Rules Modulo a Set of Equations. CADE 1984: 175-193

Jean-Pierre Jouannaud, Hélène Kirchner: Completion of a Set of Rules Modulo a Set of Equations. POPL 1984: 83-92

Jean-Pierre Jouannaud: Programming and Checking Data Types with REVE. ADT 1983

Jean-Pierre Jouannaud: Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types. CAAP 1983: 269-283

Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner: Incremental Construction of Unification Algorithms in Equational Theories. ICALP 1983: 361-373

Jean-Pierre Jouannaud, Hélène Kirchner, Jean-Luc Remy: Church-Rosser Properties of Weakly Terminating Term Rewriting Systems. IJCAI 1983: 909-915

Jean-Pierre Jouannaud, Pierre Lescanne: On Multiset Orderings. Inf. Process. Lett. 15(2): 57-63 (1982)

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

Jean-Pierre Jouannaud, Yves Kodratoff: Characterization of a Class of Functions Synthesized from Examples by a SUMMERS Like Method Using a "B.M.W." Matching Technique. IJCAI 1979: 440-447

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