default search action
Jean-Pierre Jouannaud
Person information
- affiliation: École Polytechnique, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [p2]Jean-Pierre Jouannaud:
Confluence of Terminating Rewriting Computations. The French School of Programming 2024: 265-306 - [i9]Nachum Dershowitz, Jean-Pierre Jouannaud, Fernando Orejas:
Drag Rewriting. CoRR abs/2406.16046 (2024) - 2023
- [j27]Jean-Pierre Jouannaud, Fernando Orejas:
Unification of drags and confluence of drag rewriting. J. Log. Algebraic Methods Program. 131: 100845 (2023) - 2022
- [j26]Gilles Dowek, Gaspard Férey, Jean-Pierre Jouannaud, Jiaxiang Liu:
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs. Math. Struct. Comput. Sci. 32(7): 898-933 (2022) - 2021
- [c64]Gaspard Férey, Jean-Pierre Jouannaud:
Confluence in Non-Left-Linear Untyped Higher-Order Rewrite Theories. PPDP 2021: 8:1-8:14 - 2020
- [j25]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68]. Theor. Comput. Sci. 817: 81-82 (2020) - [c63]Jean-Pierre Jouannaud, Fernando Orejas:
Unification of Drags. UNIF 2020: 8:1-8:7
2010 – 2019
- 2019
- [j24]Nachum Dershowitz, Jean-Pierre Jouannaud:
Drags: A compositional algebraic framework for graph rewriting. Theor. Comput. Sci. 777: 204-231 (2019) - 2018
- [c62]Nachum Dershowitz, Jean-Pierre Jouannaud:
Graph Path Orderings. LPAR 2018: 307-325 - 2017
- [c61]Jean-Pierre Jouannaud, Pierre-Yves Strub:
Coq without Type Casts: A Complete Proof of Coq Modulo Theory. LPAR 2017: 474-489 - 2015
- [j23]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
The computability path ordering. Log. Methods Comput. Sci. 11(4) (2015) - [j22]Jean-Pierre Jouannaud, Albert Rubio:
Normal Higher-Order Termination. ACM Trans. Comput. Log. 16(2): 13:1-13:38 (2015) - [c60]Jiaxiang Liu, Jean-Pierre Jouannaud, Mizuhito Ogawa:
Confluence of Layered Rewrite Systems. CSL 2015: 423-440 - [c59]Jean-Pierre Jouannaud, Jianqi Li:
Termination of Dependently Typed Rewrite Rules. TLCA 2015: 257-272 - [i8]Jean-Pierre Jouannaud, Jiaxiang Liu, Mizuhito Ogawa:
Confluence of Layered Rewrite Systems. CoRR abs/1509.04699 (2015) - 2014
- [c58]Jiaxiang Liu, Jean-Pierre Jouannaud:
Confluence: The Unifying, Expressive Power of Locality. Specification, Algebra, and Software 2014: 337-358 - [c57]Jiaxiang Liu, Nachum Dershowitz, Jean-Pierre Jouannaud:
Confluence by Critical Pair Analysis. RTA-TLCA 2014: 287-302 - 2013
- [c56]Jean Goubault-Larrecq, Jean-Pierre Jouannaud:
The Blossom of Finite Semantic Trees. Programming Logics 2013: 90-122 - 2012
- [j21]Jean-Pierre Jouannaud, Jiaxiang Liu:
From diagrammatic confluence to modularity. Theor. Comput. Sci. 464: 20-34 (2012) - [c55]Jean-Pierre Jouannaud, Jianqi Li:
Church-Rosser Properties of Normal Rewriting. CSL 2012: 350-365 - 2011
- [c54]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 - [e9]Jean-Pierre Jouannaud, Zhong Shao:
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 [contents] - 2010
- [c53]Jean-Pierre Jouannaud, Benjamin Monate:
Infinite Families of Finite String Rewriting Systems and Their Confluence. LPAR (Yogyakarta) 2010: 387-401
2000 – 2009
- 2009
- [c52]Jean-Pierre Jouannaud, Vincent van Oostrom:
Diagrammatic Confluence and Completion. ICALP (2) 2009: 212-222 - 2008
- [j20]Jean-Pierre Jouannaud, Yoshihito Toyama:
Modular Church-Rosser Modulo: The Complete Picture. Int. J. Softw. Informatics 2(1): 61-75 (2008) - [c51]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
The Computability Path Ordering: The End of a Quest. CSL 2008: 1-14 - [c50]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 - [i7]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) - [i6]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
The computability path ordering: the end of a quest. CoRR abs/0806.2517 (2008) - 2007
- [j19]Jean-Pierre Jouannaud, Albert Rubio:
Polymorphic higher-order recursive path orderings. J. ACM 54(1): 2:1-2:48 (2007) - [c49]Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub:
Building Decision Procedures in the Calculus of Inductive Constructions. CSL 2007: 328-342 - [c48]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
HORPO with Computability Closure: A Reconstruction. LPAR 2007: 138-150 - [e8]Jean-Pierre Jouannaud, Ian Mackie:
Proceedings of the Second International Workshop on Developments in Computational Models, DCM@ICALP 2006, Venice, Italy, July 16, 2006. Electronic Notes in Theoretical Computer Science 171(3), Elsevier 2007 [contents] - [i5]Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub:
Building Decision Procedures in the Calculus of Inductive Constructions. CoRR abs/0707.1266 (2007) - [i4]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
HORPO with Computability Closure : A Reconstruction. CoRR abs/0708.3582 (2007) - 2006
- [j18]Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer:
Joseph Goguen (1941-2006). Bull. EATCS 90: 199-201 (2006) - [c47]Jacek Chrzaszcz, Jean-Pierre Jouannaud:
From OBJ to ML to Coq. Essays Dedicated to Joseph A. Goguen 2006: 216-234 - [c46]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
Higher-Order Termination: From Kruskal to Computability. LPAR 2006: 1-14 - [c45]Jean-Pierre Jouannaud:
Modular Church-Rosser Modulo. RTA 2006: 96-107 - [c44]Jean-Pierre Jouannaud, Albert Rubio:
Higher-Order Orderings for Normal Rewriting. RTA 2006: 387-399 - [c43]Jean-Pierre Jouannaud, Ian Mackie:
Preface. DCM@ICALP 2006: 1-2 - [e7]Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer:
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 [contents] - [i3]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
Higher-Order Termination: from Kruskal to Computability. CoRR abs/cs/0609039 (2006) - [i2]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
The Calculus of Algebraic Constructions. CoRR abs/cs/0610063 (2006) - [i1]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Inductive-data-type Systems. CoRR abs/cs/0610066 (2006) - 2005
- [c42]Jean-Pierre Jouannaud:
Higher-Order Rewriting: Framework, Confluence and Termination. Processes, Terms and Cycles 2005: 224-250 - [c41]Jean-Pierre Jouannaud:
Twenty Years Later. RTA 2005: 368-375 - [c40]Jean-Pierre Jouannaud, Weiwen Xu:
Automatic Complexity Analysis for Programs Extracted from Coq Proof. CLASE 2005: 35-53 - 2004
- [c39]Jean-Pierre Jouannaud:
Theorem Proving Languages for Verification. ATVA 2004: 11-14 - 2002
- [j17]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Inductive-data-type systems. Theor. Comput. Sci. 272(1-2): 41-68 (2002) - 2001
- [j16]Adel Bouhoula, Jean-Pierre Jouannaud:
Automata-Driven Automated Induction. Inf. Comput. 169(1): 1-22 (2001) - 2000
- [j15]Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer:
Specification and proof in membership equational logic. Theor. Comput. Sci. 236(1-2): 35-132 (2000)
1990 – 1999
- 1999
- [j14]Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner:
A Methodological View of Constraint Solving. Constraints An Int. J. 4(4): 337-361 (1999) - [c38]Jean-Pierre Jouannaud, Ralf Treinen:
Constraints and Constraint Solving: An Introduction. CCL 1999: 1-46 - [c37]Jean-Pierre Jouannaud, Albert Rubio:
The Higher-Order Recursive Path Ordering. LICS 1999: 402-411 - [c36]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
The Calculus of algebraic Constructions. RTA 1999: 301-316 - 1998
- [j13]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) - [c35]Jean-Pierre Jouannaud:
Membership equational logic, calculus of inductive instructions, and rewrite logic. WRLA 1998: 388-393 - 1997
- [j12]Jean-Pierre Jouannaud, Mitsuhiro Okada:
Abstract Data Type Systems. Theor. Comput. Sci. 173(2): 349-391 (1997) - [c34]Adel Bouhoula, Jean-Pierre Jouannaud:
Automata-Driven Automated Induction. LICS 1997: 14-25 - [c33]Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer:
Specification and Proof in Membership Equational Logic. TAPSOFT 1997: 67-92 - 1996
- [c32]Jean-Pierre Jouannaud, Albert Rubio:
A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form. RTA 1996: 108-122 - 1995
- [c31]Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop:
Problems in Rewriting III. RTA 1995: 457-471 - [e6]Hubert Comon, Jean-Pierre Jouannaud:
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 [contents] - 1994
- [j11]Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud:
Syntacticness, Cycle-Syntacticness, and Shallow Theories. Inf. Comput. 111(1): 154-191 (1994) - [j10]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) - [c30]Maribel Fernández, Jean-Pierre Jouannaud:
Modular Termination of Term Rewriting Systems Revisited. COMPASS/ADT 1994: 255-272 - [c29]Jean-Pierre Jouannaud, Walid Sadfi:
Strong Sequentiality of Left-Linear Overlapping Rewrite Systems. CTRS 1994: 235-246 - [e5]Jean-Pierre Jouannaud:
Constraints in Computational Logics, First International Conference, CCL'94, Munich, Germany, September 7-9, 1994. Lecture Notes in Computer Science 845, Springer 1994, ISBN 3-540-58403-X [contents] - 1993
- [c28]Jean-Pierre Jouannaud:
Introduction to Rewriting. Term Rewriting 1993: 1-15 - [c27]Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop:
More Problems in Rewriting. RTA 1993: 468-487 - [e4]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. Lecture Notes in Computer Science 668, Springer 1993, ISBN 3-540-56610-4 [contents] - 1992
- [j9]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) - [j8]Jean-Pierre Jouannaud, Claude Marché:
Termination and Completion Modulo Associativity, Commutativity and Identity. Theor. Comput. Sci. 104(1): 29-51 (1992) - [c26]Jean-Pierre Jouannaud:
Rewriting Techniques for Software Engineering. COMPASS/ADT 1992: 30-52 - [c25]Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud:
Decidable Problems in Shallow Equational Theories (Extended Abstract). LICS 1992: 255-265 - 1991
- [j7]Nachum Dershowitz, Jean-Pierre Jouannaud:
Notations for Rewting. Bull. EATCS 43: 162-174 (1991) - [c24]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 - [c23]Jean-Pierre Jouannaud, Mitsuhiro Okada:
Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable. ICALP 1991: 455-468 - [c22]Jean-Pierre Jouannaud, Mitsuhiro Okada:
A Computation Model for Executable Higher-Order Algebraic Specification Languages. LICS 1991: 350-361 - [c21]Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop:
Open Problems in Rewriting. RTA 1991: 445-456 - [c20]Jean-Pierre Jouannaud:
Executable Higher-Order Algebraic Specifications. STACS 1991: 16-25 - 1990
- [c19]Jieh Hsiang, Jean-Pierre Jouannaud:
Tutorial on Rewrite-Based Theorem Proving. CADE 1990: 684 - [c18]Jean-Pierre Jouannaud, Claude Marché:
Completion modulo Associativity, Commutativity and Identity (AC1). DISCO 1990: 111-120 - [c17]Jean-Pierre Jouannaud:
Syntactic Theories. MFCS 1990: 15-25 - [p1]Nachum Dershowitz, Jean-Pierre Jouannaud:
Rewrite Systems. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 243-320
1980 – 1989
- 1989
- [j6]Jean-Pierre Jouannaud, Emmanuel Kounalis:
Automatic Proofs by Induction in Theories without Constructors. Inf. Comput. 82(1): 1-33 (1989) - [j5]Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß:
Unification in Boolean Rings and Abelian Groups. J. Symb. Comput. 8(5): 449-477 (1989) - 1988
- [c16]Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis:
OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization. ALP 1988: 41-52 - [c15]Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß:
Unification in Free Extensions of Boolean Rings and Abelian Groups. LICS 1988: 121-130 - [e3]Stéphane Kaplan, Jean-Pierre Jouannaud:
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 [contents] - 1987
- [c14]Jean-Pierre Jouannaud, B. Waldmann:
Reductive conditional term rewriting systems. Formal Description of Programming Concepts 1987: 223-244 - 1986
- [j4]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) - [c13]Jean-Pierre Jouannaud, Emmanuel Kounalis:
Automatic Proofs by Induction in Equational Theories Without Constructors. LICS 1986: 358-366 - 1985
- [j3]Jean-Pierre Jouannaud, Emmanuel Kounalis:
Proofs by induction in equational theories without constructors. Bull. EATCS 27: 49-55 (1985) - [c12]Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer:
Operational Semantics for Order-Sorted Algebra. ICALP 1985: 221-231 - [c11]Kokichi Futatsugi, Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer:
Principles of OBJ2. POPL 1985: 52-66 - [e2]Jean-Pierre Jouannaud:
Functional Programming Languages and Computer Architecture, FPCA 1985, Nancy, France, September 16-19, 1985, Proceedings. Lecture Notes in Computer Science 201, Springer 1985, ISBN 3-540-15975-4 [contents] - [e1]Jean-Pierre Jouannaud:
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 [contents] - 1984
- [j2]Jean-Pierre Jouannaud, Hélène Kirchner:
Construction D'un Plus Petit Odre de Simplification. RAIRO Theor. Informatics Appl. 18(3): 191-208 (1984) - [c10]Jean-Pierre Jouannaud, Miguel Munoz:
Termination of a Set of Rules Modulo a Set of Equations. CADE 1984: 175-193 - [c9]Jean-Pierre Jouannaud, Hélène Kirchner:
Completion of a Set of Rules Modulo a Set of Equations. POPL 1984: 83-92 - 1983
- [c8]Jean-Pierre Jouannaud:
Programming and Checking Data Types with REVE. ADT 1983 - [c7]Jean-Pierre Jouannaud:
Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types. CAAP 1983: 269-283 - [c6]Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner:
Incremental Construction of Unification Algorithms in Equational Theories. ICALP 1983: 361-373 - [c5]Jean-Pierre Jouannaud, Hélène Kirchner, Jean-Luc Rémy:
Church-Rosser Properties of Weakly Terminating Term Rewriting Systems. IJCAI 1983: 909-915 - 1982
- [j1]Jean-Pierre Jouannaud, Pierre Lescanne:
On Multiset Orderings. Inf. Process. Lett. 15(2): 57-63 (1982) - [c4]Jean-Pierre Jouannaud, Pierre Lescanne, F. Reinig:
Recursive Decomposition Ordering. Formal Description of Programming Concepts 1982: 331-348 - 1981
- [c3]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
1970 – 1979
- 1979
- [c2]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 - 1977
- [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint