Rewrite systems N Dershowitz, JP Jouannaud Formal models and semantics, 243-320, 1990 | 2843* | 1990 |
Introducing obj JA Goguen, T Winkler, J Meseguer, K Futatsugi, JP Jouannaud Software Engineering with OBJ: algebraic specification in action, 3-167, 2000 | 1128 | 2000 |
Principles of OBJ2 K Futatsugi, J Goguen, JP Jouannaud, J Meseguer Proc. 12th ACM Symposium on Principles of Programming Languages, 52-66, 1985 | 826 | 1985 |
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 | 599 | 1984 |
Solving equations in abstract algebras: A rule-based survey of unification JP Jouannaud, C Kirchner Computational Logic, 257-321, 1991 | 470 | 1991 |
Specification and proof in membership equational logic A Bouhoula, JP Jouannaud, J Meseguer Theoretical Computer Science 236 (1-2), 35-132, 2000 | 379 | 2000 |
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 | 199 | 1991 |
Automatic proofs by induction in theories without constructors JP Jouannaud, E Kounalis Proc. Symposium on Logic in Computer Science, 1986 | 182* | 1986 |
Operational semantics for order-sorted algebra JA Goguen, JP Jouannaud, J Meseguer Automata, Languages and Programming: 12th Colloquium Nafplion, Greece, July …, 1985 | 174 | 1985 |
The higher-order recursive path ordering JP Jouannaud, A Rubio Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999 | 160 | 1999 |
Automatic proofs by induction in theories without constructors JP Jouannaud, E Kounalis Information and Computation 82 (1), 1-33, 1989 | 160 | 1989 |
Incremental construction of unification algorithms in equational theories JP Jouannaud, C Kirchner, H Kirchner International Colloquium on Automata, Languages, and Programming, 361-373, 1983 | 146 | 1983 |
Inductive-data-type systems F Blanqui, JP Jouannaud, M Okada Theoretical Computer Science 272 (1-2), 41-68, 2002 | 112 | 2002 |
Recursive decomposition ordering JP Jouannaud, P Lescanne, F Reinig Formal Description of Programming Concepts 2, 331-348, 1982 | 104 | 1982 |
Abstract data type systems JP Jouannaud, M Okada Theoretical computer science 173 (2), 349-391, 1997 | 103 | 1997 |
The Computability Path Ordering F Blanqui, JP Jouannaud, A Rubio Logical Methods in Computer Science 11 (4), 1-45, 2015 | 94* | 2015 |
Syntacticness, cycle-syntacticness, and shallow theories H Comon, M Haberstrau, JP Jouannaud Information and Computation 111 (1), 154-191, 1994 | 94 | 1994 |
Reductive conditional term rewriting systems JP Jouannaud, B Waldmann Centre de Recherche en Informatique de Nancy, 1986 | 89 | 1986 |
The calculus of algebraic constructions F Blanqui, JP Jouannaud, M Okada International Conference on Rewriting Techniques and Applications, 301-316, 1999 | 85 | 1999 |
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 | 82 | 1991 |