Jean-Pierre Jouannaud | Academic Influence

Jean-Pierre Jouannaud's AcademicInfluence.com Rankings

Jean-Pierre Jouannaud

Computer Science

#1820

World Rank

#1887

Historical Rank

Database

#7578

World Rank

#7865

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Jean-Pierre Jouannaud's Degrees

PhD Computer Science Université Paris Cité

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Jean-Pierre Jouannaud Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jean-Pierre Jouannaud is a French computer scientist, known for his work in the area of term rewriting. He was born on 21 May 1947 in Aix-les-Bains . From 1967 to 1969 he visited the Ecole Polytechnique . In 1970, 1972, and 1977, he wrote his Master thesis , PhD thesis , and Habilitation thesis , respectively, at the Université de Paris VI. In 1979, he became an associate professor at the Nancy University; 1985 he changed to the Université de Paris-Sud, where he became a full professor in 1986.

(See a Problem?)

Jean-Pierre Jouannaud's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Rewrite Systems (1991) (1777)
Principles of OBJ2 (1985) (570)
Completion of a set of rules modulo a set of equations (1984) (504)
Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification (1991) (377)
Specification and proof in membership equational logic (1997) (251)
Proofs by induction in equational theories without constructors (1985) (150)
A computation model for executable higher-order algebraic specification languages (1991) (142)
Automatic Proofs by Induction in Theories without Constructors (1989) (127)
Operational Semantics for Order-Sorted Algebra (1985) (125)
The higher-order recursive path ordering (1999) (108)
Incremental Construction of Unification Algorithms in Equational Theories (1983) (98)
Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable (1991) (80)
Abstract Data Type Systems (1997) (78)
Reductive conditional term rewriting systems (1987) (76)
Recursive Decomposition Ordering (1982) (74)
Inductive-data-type systems (2002) (73)
Polymorphic higher-order recursive path orderings (2007) (68)
The Calculus of algebraic Constructions (1999) (66)
TAPSOFT'93: Theory and Practice of Software Development (1993) (58)
Termination of a Set of Rules Modulo a Set of Equations (1984) (58)
Syntacticness, Cycle-Syntacticness, and Shallow Theories (1994) (56)
Open Problems in Rewriting (1991) (53)
On Multiset Orderings (1982) (52)
Modular Termination of Term Rewriting Systems Revisited (1994) (51)
Twenty Years Later (2005) (49)
Unification in Boolean Rings and Abelian Groups (1989) (49)
Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types (1983) (46)
Automata-driven automated induction (1997) (40)
The Computability Path Ordering: The End of a Quest (2008) (38)
Termination and Completion Modulo Associativity, Commutativity and Identity (1992) (37)
Functional Programming Languages and Computer Architecture (1985) (33)
More Problems in Rewriting (1993) (32)
Algebra, Meaning, and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday (2006) (26)
Higher-Order Orderings for Normal Rewriting (2006) (26)
The computability path ordering (2015) (25)
Rewrite Proofs and Computations (1995) (24)
Programming with Equalitiers, Subsorts, Overloading and Parametrization in OBJ (1992) (22)
Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development (1993) (22)
Characterization of a Class of Functions Synthesized from Examples by a SUMMERS Like Method Using a "B.M.W." Matching Technique (1979) (21)
Constraints in Computational Logics (1994) (20)
Strong Sequentiality of Left-Linear Overlapping Rewrite Systems (1994) (20)
Problems in Rewriting III (1995) (19)
Building Decision Procedures in the Calculus of Inductive Constructions (2007) (18)
Notations for Rewting (1991) (18)
Rewrite Orderings for Higher-Order Terms in eta-Long beta-Normal Form and Recursive Path Ordering (1998) (17)
From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures (2008) (16)
Church-Rosser Properties of Weakly Terminating Term Rewriting Systems (1983) (16)
Decidable problems in shallow equational theories (1992) (16)
Higher-Order Termination: From Kruskal to Computability (2006) (16)
CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory (2011) (16)
Drags: A compositional algebraic framework for graph rewriting (2019) (13)
Graph Path Orderings (2018) (13)
Diagrammatic Confluence and Completion (2009) (13)
Church-Rosser Properties of Normal Rewriting (2012) (12)
OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization (1988) (12)
HORPO with Computability Closure: A Reconstruction (2007) (11)
Higher-order recursive path orderings (1998) (11)
Modular Church-Rosser Modulo (2006) (11)
Higher-Order Recursive Path Orderings à la carte (2001) (11)
Modular Church-Rosser Modulo: The Complete Picture (2008) (10)
From diagrammatic confluence to modularity (2012) (10)
Automatic Complexity Analysis for Programs Extracted from Coq Proof (2006) (10)
Higher-order rewriting with types and arities (2004) (10)
Certified Programs and Proofs - First International Conference, CPP 2011, Kenting, Taiwan, December 7-9, 2011. Proceedings (2011) (10)
A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form (1996) (10)
SISP/1: An Interactive System Able to Synthesize Functions from Examples (1977) (10)
Higher-Order Rewriting: Framework, Confluence and Termination (2005) (10)
Conditional Term Rewriting Systems: 1st International Workshop Orsay, France, July 8-10, 1987. Proceedings (1988) (10)
Program Synthesis from Examples of Behavior (1983) (9)
Syntactic Theories (1990) (9)
Proceedings of the First International Conference on Constraints in Computational Logics (1994) (9)
Completion modulo Associativity, Commutativity and Identity (AC1) (1990) (8)
Untyped Confluence in Dependent Type Theories (2016) (8)
Decidable Problems in Shallow Equational Theories (Extended Abstract) (1992) (8)
Construction D'un Plus Petit Odre de Simplification (1984) (8)
A Methodological View of Constraint Solving (1999) (7)
Termination of Dependently Typed Rewrite Rules (2015) (7)
Proc. of a conference on Functional programming languages and computer architecture (1985) (6)
Unification in free extensions of Boolean rings and Abelian groups (1988) (6)
Drags: A Simple Algebraic Framework For Graph Rewriting (2018) (6)
Executable Higher-Order Algebraic Specifications (1991) (6)
Algebraic Manipulations as a Unification and Matching Strategy for Linear Equations in Signed Binary Trees (1981) (5)
Confluence of Layered Rewrite Systems (2015) (5)
Confluence by Critical Pair Analysis (2014) (5)
Normal Higher-Order Termination (2015) (5)
Coq without Type Casts: A Complete Proof of Coq Modulo Theory (2017) (5)
Introduction to Rewriting (1993) (4)
Theorem Proving Languages for Verification (2004) (4)
Certification of SAT Solvers in Coq (2010) (4)
Confluence: The Unifying, Expressive Power of Locality (2014) (4)
Membership equational logic, calculus of inductive instructions, and rewrite logic (1998) (4)
Term Rewriting: French Spring School of Theoretical Computer Science Font Romeux, France, May 17-21, 1993 : Advanced Course (1995) (4)
The Blossom of Finite Semantic Trees (2013) (3)
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course (1993) (2)
Rewriting Techniques and Applications: Dijon, France, May 20-22, 1985 (1985) (2)
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs (2022) (2)
GPO : A Path Ordering for Graphs (2018) (2)
Confluence in (Un)Typed Higher-Order Theories by means of Critical Pairs (2019) (2)
Inductive Data Type Systems : Strong Normalization (1997) (2)
1st international workshop on Conditional Term Rewriting Systems (1988) (2)
Encoding Proofs in Dedukti: the case of Coq proofs (2016) (2)
Infinite Families of Finite String Rewriting Systems and Their Confluence (2010) (1)
Programming and Checking Data Types with REVE (1983) (1)
Constraints in Computational Logics: First International Conference, Ccl '94, Munich, Germany, September 7-9, 1994 : Proceedings (1994) (1)
Associative-commutative rewriting via flattening (2005) (1)
The Higher-Order Computability Path Ordering: the End of a Quest (2008) (1)
A Computability Path Ordering for Polymorphic Terms (2010) (1)
From OBJ to ML to Coq (2006) (1)
Rewriting Techniques for Software Engineering (1992) (1)
Modular Church-Rosser Modulo : The Full Picture (2006) (1)
Functional Programming Languages and Computer Architecture, Nancy, France, September 16-19, 1985, Proceedings (1985) (1)
Open source software for certifying programs: Why, which and how? (2009) (0)
Certification of S AT Solvers in Coq (2011) (0)
Review: Term Rewriting Systems Terese Term Rewriting Systems (2004) (0)
Tutorial on Rewrite-Based Theorem Proving (1990) (0)
Adaptive receivers for high data transmission rates (1975) (0)
Well-founded Path Orderings for Drags (2016) (0)
Well-founded Path Orderings for Operads (2016) (0)
Rewrite-based theorem proving (tutorial) (1990) (0)
Mechanical construction of a new efficient FLATTEN (1979) (0)
Lambda extensions of rewrite orderings (1995) (0)
Proceedings of the First international conference on Certified Programs and Proofs (2011) (0)
The Algebra of Infinite Sequences: Notations and Formalization (2020) (0)
Confluence in (Un)Typed Higher-Order Theories I (2019) (0)
Proc. of the first international conference on Rewriting techniques and applications (1985) (0)
Joseph Goguen (1941-2006) (2006) (0)
5 Concluding Remarks 4 a Semantics for Oodb 4.1 Schemas and Databases 4.2 Inheritance State $ Term $ Proposition Transition $ Rewriting $ Deduction 3.4 Initial Model Semantics (1993) (0)
Confluence in Non-Left-Linear Untyped Higher-Order Rewrite Theories (2021) (0)
Constraints and Constraint Solving: An Introduction (2001) (0)
Logic and Computation (2005) (0)
Unification of drags and confluence of drag rewriting (2022) (0)
Rewriting Techniques and Applications (1985) (0)
New Results - Termination (2009) (0)
Unification of drags (2020) (0)
Final Ccl Report (2007) (0)
New Results - Development of systems (2006) (0)
Book Review: A Proof Theory for General Unification. By Wayne Snyder. (Birkhauser, 1991. vi+175 pages. ISBN 0-8176-3593-9. $28.00) (1994) (0)
Open Source Software for Certifying Programs: Why, Which and How? (Invited Speech) (2009) (0)
Confluence of drag rewriting (2020) (0)
A Framework for Graph Rewriting (2019) (0)

This paper list is powered by the following services:

Other Resources About Jean-Pierre Jouannaud

en.wikipedia.org

What Schools Are Affiliated With Jean-Pierre Jouannaud?

Jean-Pierre Jouannaud is affiliated with the following schools:

Université Paris Cité

Image Attributions

Image Source for Jean-Pierre Jouannaud