Jean-Pierre Jouannaud
Jean-Pierre Jouannaud
LSV, École Normale Supérieure de Paris-Saclay
Verified email at lix.polytechnique.fr
Title
Cited by
Cited by
Year
Rewrite systems
N Dershowitz, JP Jouannaud
Formal models and semantics, 243-320, 1990
2761*1990
Introducing obj
JA Goguen, T Winkler, J Meseguer, K Futatsugi, JP Jouannaud
Software Engineering with OBJ, 3-167, 2000
10582000
Principles of OBJ2
K Futatsugi, J Goguen, JP Jouannaud, J Meseguer
Proc. 12th ACM Symposium on Principles of Programming Languages, 52-66, 1985
7801985
Completion of a set of rules modulo a set of equations
JP Jouannaud, H Kirchner
11th ACM-SIGACT Symposium on Principles of programming languages, 83-92, 1984
5521984
Solving equations in abstract algebras: A rule-based survey of unification
JP Jouannaud, C Kirchner
Computational Logic, 257-321, 1991
4481991
Automatic proofs by induction in theories without constructors
JP Jouannaud, E Kounalis
Information and Computation 82 (1), 1-33, 1989
311*1989
Specification and proof in membership equational logic
A Bouhoula, JP Jouannaud, J Meseguer
Theoretical Computer Science 236 (1-2), 35-132, 2000
2882000
A computation model for executable higher-order algebraic specification languages
JP Jouannaud, M Okada
Proceedings 1991 Sixth Annual IEEE Symposium on Logic in Computer Science …, 1991
1941991
Operational semantics for order-sorted algebra
JA Goguen, JP Jouannaud, J Meseguer
International Colloquium on Automata, Languages, and Programming, 221-231, 1985
1601985
The higher-order recursive path ordering
JP Jouannaud, A Rubio
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
1511999
Incremental construction of unification algorithms in equational theories
JP Jouannaud, C Kirchner, H Kirchner
International Colloquium on Automata, Languages, and Programming, 361-373, 1983
1291983
Inductive-data-type systems
F Blanqui, JP Jouannaud, M Okada
Theoretical Computer Science 272 (1-2), 41-68, 2002
1112002
Syntacticness, cycle-syntacticness, and shallow theories
H Comon, M Haberstrau, JP Jouannaud
Information and Computation 111 (1), 154-191, 1994
108*1994
Abstract data type systems
JP Jouannaud, M Okada
Theoretical computer science 173 (2), 349-391, 1997
991997
Recursive decomposition ordering
JP Jouannaud, P Lescanne, F Reinig
941982
The Computability Path Ordering
F Blanqui, JP Jouannaud, A Rubio
Logical Methods in Computer Science 11 (4), 1-45, 2015
89*2015
Reductive conditional term rewriting systems
JP Jouannaud, B Waldmann
Centre de Recherche en Informatique de Nancy, 1986
861986
The calculus of algebraic constructions
F Blanqui, JP Jouannaud, M Okada
International Conference on Rewriting Techniques and Applications, 301-316, 1999
831999
Satisfiability of systems of ordinal notations with the subterm property is decidable
JP Jouannaud, M Okada
International Colloquium on Automata, Languages, and Programming, 455-468, 1991
791991
Polymorphic higher-order recursive path orderings
JP Jouannaud, A Rubio
Journal of the ACM (JACM) 54 (1), 1-48, 2007
75*2007
The system can't perform the operation now. Try again later.
Articles 1–20