The following pages link to Jean-Pierre Jouannaud (Q235599):
Displaying 50 items.
- Unification in Boolean rings and Abelian groups (Q582073) (← links)
- On multiset orderings (Q1165004) (← links)
- Termination and completion modulo associativity, commutativity and identity (Q1199927) (← links)
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (Q1275015) (← links)
- Syntacticness, cycle-syntacticness and shallow theories (Q1327397) (← links)
- Abstract data type systems (Q1391729) (← links)
- Automatic proofs by induction in theories without constructors (Q1824382) (← links)
- Automata-driven automated induction (Q1854445) (← links)
- From diagrammatic confluence to modularity (Q1929228) (← links)
- A methodological view of constraint solving (Q1969731) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Corrigendum to: ``Inductive-data-type systems'' (Q2309415) (← links)
- Drags: a compositional algebraic framework for graph rewriting (Q2422028) (← links)
- Unification of drags and confluence of drag rewriting (Q2683036) (← links)
- (Q2762628) (← links)
- Normal Higher-Order Termination (Q2946769) (← links)
- The computability path ordering (Q3196359) (← links)
- (Q3396602) (← links)
- (Q3490927) (← links)
- HORPO with Computability Closure: A Reconstruction (Q3498461) (← links)
- Modular Church-Rosser Modulo (Q3527286) (← links)
- Higher-Order Orderings for Normal Rewriting (Q3527310) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- Polymorphic higher-order recursive path orderings (Q3546327) (← links)
- Building Decision Procedures in the Calculus of Inductive Constructions (Q3608422) (← links)
- Diagrammatic Confluence and Completion (Q3638097) (← links)
- (Q3659124) (← links)
- (Q3664457) (← links)
- (Q3673071) (← links)
- (Q3673082) (← links)
- (Q3719824) (← links)
- Completion of a Set of Rules Modulo a Set of Equations (Q3816048) (← links)
- (Q3970984) (← links)
- (Q3976027) (← links)
- Programming with equalities, subsorts, overloading, and parametrization in OBJ (Q3992232) (← links)
- (Q4035654) (← links)
- (Q4036585) (← links)
- Récepteurs adaptatifs pour transmission de données a grande vitesse (Q4093311) (← links)
- (Q4222984) (← links)
- (Q4385532) (← links)
- Coq without Type Casts: A Complete Proof of Coq Modulo Theory (Q4645754) (← links)
- (Q4649558) (← links)
- (Q4842538) (← links)
- The Blossom of Finite Semantic Trees (Q4916075) (← links)
- Infinite Families of Finite String Rewriting Systems and Their Confluence (Q4933319) (← links)
- (Q4938611) (← links)
- Open problems in rewriting (Q5055780) (← links)
- More problems in rewriting (Q5055812) (← links)
- Problems in rewriting III (Q5055847) (← links)
- A recursive path ordering for higher-order terms in η-long β-normal form (Q5055855) (← links)
