Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Jouannaud, Jean-Pierre - Laboratoire d’Informatique, École Polytechnique
Higher-Order Rewriting: Framework, Confluence and Termination
Completion contrainte avec simplification Jean-Pierre Jouannaud1
Ordered Resolution and Paramodulation October 25, 2005
Deduction contrainte Jean-Pierre Jouannaud
Deduction contrainte Jean-Pierre Jouannaud1
Recriture d'Ordre Superieur Jean-Pierre Jouannaud
Recriture d'Ordre Superieur Jean-Pierre Jouannaud
Les termes en logique et en programmation Version prliminaire
Logique du premier ordre 2`eme lecon
Associative-commutative rewriting via flattening Jean-Pierre Jouannaud
Higher-Order Orderings for Normal Rewriting Jean-Pierre Jouannaud1
Modular Church-Rosser Modulo: The Complete Picture
Toyama's Modularity Theorem New Proof of Toyama's Theorem
From Formal Proofs to Mathematical Proofs: A safe, incremental way for building in first-order decision procedures
HORPO with Computability Closure : A Reconstruction Frederic Blanqui1
Building Decision Procedures in the Calculus of Inductive Constructions Frederic Blanqui
Higher-Order Termination: from Kruskal to Computability
Higher-Order Termination From Kruskal to Computability
Higher-Order Orderings for Normal Rewriting Jean-Pierre Jouannaud1
Modular Church-Rosser Modulo Jean-Pierre Jouannaud
Verification = Specification + Deduction + Computation + Abstraction Logical foundations
Higher-Order Recursive Path Orderings `a la carte
Logique du premier ordre 1`ere lecon
Twenty years later Jean-Pierre Jouannaud
Titre du stage : rcriture d'ordre suprieur Lieu du stage : LIX, cole polytechnique
Logique du premier ordre 3`eme lecon
Devoir du cours de rcriture d'ordre suprieur Jean-Pierre Jouannaud
cole Polytechnique Spcialit Informatique
Recriture d'Ordre Superieur Jean-Pierre Jouannaud
Logique : notes de cours Jean-Pierre Jouannaud
The Higher-Order Computability Path Ordering: the End of a Quest
Recriture d'Ordre Superieur Jean-Pierre Jouannaud
From OBJ to ML to Coq Jacek Chrz aszcz1 and Jean-Pierre Jouannaud2
Titre du stage : Rcriture compile Lieu du stage : LIX, cole polytechnique
A new generation of Proof Assistants integrating Small Proof Engines
The Blossom of Finite Semantic Trees Jean Goubault-Larrecq1
Logique du premier ordre 4`eme lecon
Polymorphic Higher-Order Recursive Path Orderings Jean-Pierre Jouannaud
Formal Mathematics and Application to Software Safety and Internet Security
Higher-Order Recursive Path Orderings `a la carte Jean-Pierre Jouannaud
Theorem proving languages for verification Jean-Pierre Jouannaud
Deduction contrainte Jean-Pierre Jouannaud1
Universit Paris-Sud Licence d'Informatique