Rewrite Systems
- N. Dershowitz, J. Jouannaud
- Computer ScienceHandbook of Theoretical Computer Science, Volume…
- 2 January 1991
Principles of OBJ2
- K. Futatsugi, J. Goguen, J. Jouannaud, J. Meseguer
- Computer ScienceACM-SIGACT Symposium on Principles of Programming…
- 1 January 1985
Four clsssrs of design principles for 01352 ate discussed briefly in this inttoduct, and then in mote detail brlnw: motlulntizntion and patnmcteriantion; (2) subsorts; (3) implcmcntnt; and (4) inlrtaction and flexibility.
Completion of a set of rules modulo a set of equations
- J. Jouannaud, H. Kirchner
- MathematicsACM-SIGACT Symposium on Principles of Programming…
- 15 January 1984
The Church–Rosser property is proved decidable for a very general reduction relation which may take into account the left-linearity of rules for efficiency reasons, under the only assumption of existence of a complete and finite unification algorithm for the underlying equational theory, whose congruence classes are assumed to be finite.
Specification and proof in membership equational logic
- A. Bouhoula, J. Jouannaud, J. Meseguer
- Computer ScienceTheoretical Computer Science
- 14 April 1997
Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification
- J. Jouannaud, C. Kirchner
- MathematicsComputational Logic - Essays in Honor of Alan…
- 1991
The higher-order recursive path ordering
- J. Jouannaud, A. Rubio
- MathematicsProceedings. 14th Symposium on Logic in Computer…
- 2 July 1999
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed lambda-calculus…
Proofs by induction in equational theories without constructors
- J. Jouannaud, Emmanuel Kounalis
- MathematicsBull. EATCS
- 1985
Automatic Proofs by Induction in Theories without Constructors
- J. Jouannaud, Emmanuel Kounalis
- Computer ScienceInformation and Computation
- 1 July 1989
A computation model for executable higher-order algebraic specification languages
- J. Jouannaud, M. Okada
- Computer Science, Mathematics[] Proceedings Sixth Annual IEEE Symposium on…
- 15 July 1991
A general modularity result, which allows as particular cases primitive recursive functionals of higher types, transfinite recursion of highertypes, and inheritance for all types, is proved.
Syntacticness, Cycle-Syntacticness, and Shallow Theories
- Hubert Comon-Lundh, Marianne Haberstrau, J. Jouannaud
- MathematicsInformation and Computation
- 15 May 1994
It turns out that these rules do terminate for shallow theories; hence the first-order theory of the quotient algebra T ( F )/ = E is decidable when F is finite and E is shallow.
...
...