Suivre
Jean-Pierre Jouannaud
Jean-Pierre Jouannaud
LSV, École Normale Supérieure de Paris-Saclay
Adresse e-mail validée de lix.polytechnique.fr
Titre
Citée par
Citée par
Année
Rewrite systems
N Dershowitz, JP Jouannaud
Formal models and semantics, 243-320, 1990
2896*1990
Introducing obj
JA Goguen, T Winkler, J Meseguer, K Futatsugi, JP Jouannaud
Software Engineering with OBJ: algebraic specification in action, 3-167, 2000
10902000
Principles of OBJ2
K Futatsugi, J Goguen, JP Jouannaud, J Meseguer
Proc. 12th ACM Symposium on Principles of Programming Languages, 52-66, 1985
7981985
Completion of a set of rules modulo a set of equations
JP Jouannaud, H Kirchner
Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of …, 1984
5861984
Solving equations in abstract algebras: A rule-based survey of unification
JP Jouannaud, C Kirchner
Computational Logic, 257-321, 1991
4591991
Specification and proof in membership equational logic
A Bouhoula, JP Jouannaud, J Meseguer
Theoretical Computer Science 236 (1-2), 35-132, 2000
3572000
A computation model for executable higher-order algebraic specification languages
JP Jouannaud, M Okada
[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science …, 1991
2061991
Automatic proofs by induction in theories without constructors
JP Jouannaud, E Kounalis
Proc. Symposium on Logic in Computer Science, 1986
1761986
Operational semantics for order-sorted algebra
JA Goguen, JP Jouannaud, J Meseguer
Automata, Languages and Programming: 12th Colloquium Nafplion, Greece, July …, 1985
1731985
The higher-order recursive path ordering
JP Jouannaud, A Rubio
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
1611999
Automatic proofs by induction in theories without constructors
JP Jouannaud, E Kounalis
Information and Computation 82 (1), 1-33, 1989
1581989
Incremental construction of unification algorithms in equational theories
JP Jouannaud, C Kirchner, H Kirchner
Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July …, 2005
1412005
Inductive-data-type systems
F Blanqui, JP Jouannaud, M Okada
Theoretical Computer Science 272 (1-2), 41-68, 2002
1132002
Recursive decomposition ordering
JP Jouannaud, P Lescanne, F Reinig
1061982
Abstract data type systems
JP Jouannaud, M Okada
Theoretical computer science 173 (2), 349-391, 1997
1051997
The Computability Path Ordering
F Blanqui, JP Jouannaud, A Rubio
Logical Methods in Computer Science 11 (4), 1-45, 2015
93*2015
Syntacticness, cycle-syntacticness, and shallow theories
H Comon, M Haberstrau, JP Jouannaud
Information and Computation 111 (1), 154-191, 1994
871994
Reductive conditional term rewriting systems
JP Jouannaud, B Waldmann
Centre de Recherche en Informatique de Nancy, 1986
851986
The calculus of algebraic constructions
F Blanqui, JP Jouannaud, M Okada
Rewriting Techniques and Applications: 10th International Conference, RTA-99 …, 1999
841999
Polymorphic higher-order recursive path orderings
JP Jouannaud, A Rubio
Journal of the ACM (JACM) 54 (1), 1-48, 2007
83*2007
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20