1. Recherche
10 résultats  enregistrer la recherche
...
inria-00073599v1  Rapport
Zine-El-Abidine Benaissa, Pierre Lescanne, Kristoffer H. Rose. Modeling Sharing and Recursion for Weak Reduction Strategies using Explicit Substitution
[Research Report] RR-3092, INRIA. 1997
...
inria-00074197v1  Rapport
Zine-El-Abidine Benaissa, Daniel Briaud, Pierre Lescanne, Jocelyne Rouyer-Degli. $\lambda\upsilon$, a calculus of explicit substitutions which preserves strong normalisation
[Research Report] RR-2477, INRIA. 1995
...
inria-00075384v1  Rapport
François Bellegarde, Pierre Lescanne. Termination by completion
[Research Report] RR-1174, INRIA. 1990
...
inria-00074448v1  Rapport
Pierre Lescanne, Jocelyne Rouyer-Degli. The Calculus of explicit substitutions lambda-upsilon
[Research Report] RR-2222, INRIA. 1994
...
inria-00075176v1  Rapport
Pierre Lescanne. Well rewrite orderings and well quasi-orderings
[Research Report] RR-1385, INRIA. 1991
...
inria-00075652v1  Rapport
Hubert Comon, Pierre Lescanne. Equational problems and disunification
[Research Report] RR-0904, INRIA. 1988
...
inria-00075878v1  Rapport
Pierre Lescanne, Thierry Heuillard, Max Dauchet, Sophie Tison. Decidability of the confluence of ground term rewriting systems
[Research Report] RR-0675, INRIA. 1987
...
inria-00075867v1  Rapport
Claude Kirchner, Pierre Lescanne. Solving disequations
[Research Report] RR-0686, INRIA. 1987
...
inria-00075871v1  Rapport
Azzedine Lazrek, Pierre Lescanne, Jean-Jacques Thiel. Proving inductive equalities algorithms and implementation
[Research Report] RR-0682, INRIA. 1987
...
inria-00075876v1  Rapport
Ahlem Ben Cherifa, Pierre Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation
[Research Report] RR-0677, INRIA. 1987

Contact


archive-ouverte@inria.fr