×

zbMATH — the first resource for mathematics

Lescanne, Pierre

Compute Distance To:
Author ID: lescanne.pierre Recent zbMATH articles by "Lescanne, Pierre"
Published as: Lescanne, Pierre; Lescanne, P.
External Links: IdRef · MGP · Wikidata · dblp · GND
Documents Indexed: 70 Publications since 1977, including 7 Books

Publications by Year

Citations contained in zbMATH Open

50 Publications have been cited 321 times in 240 Documents Cited by Year
Equational problems and disunification. Zbl 0678.68093
Comon, Hubert; Lescanne, Pierre
49
1989
Termination of rewriting systems by polynomial interpretations and its implementation. Zbl 0625.68036
Ben Cherifa, Ahlem; Lescanne, Pierre
36
1987
Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Zbl 0705.68067
Dauchet, Max; Heuillard, Thierry; Lescanne, Pierre; Tison, Sophie
27
1990
\(\lambda\nu\), a calculus of explicit substitutions which preserves strong normalisation. Zbl 0873.68108
Benaissa, Zine-El-Abidine; Briaud, Daniel; Lescanne, Pierre; Rouyer-Degli, Jocelyne
23
1996
On multiset orderings. Zbl 0486.68041
Jouannaud, Jean-Pierre; Lescanne, Pierre
16
1982
Counting and generating lambda terms. Zbl 1311.68045
Grygiel, Katarzyna; Lescanne, Pierre
12
2013
Recursive decomposition ordering. Zbl 0513.68026
Jouannaud, Jean-Pierre; Lescanne, Pierre; Reinig, Fernand
11
1983
Termination by completion. Zbl 0723.68056
Bellegarde, Françoise; Lescanne, Pierre
10
1990
Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness. Zbl 0691.68026
Lazrek, Azeddine; Lescanne, Pierre; Thiel, Jean-Jacques
8
1990
On the recursive decomposition ordering with lexicographical status and other related orderings. Zbl 0698.68031
Lescanne, Pierre
8
1990
Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems. Zbl 0518.68025
Lescanne, Pierre
7
1982
A natural counting of lambda terms. Zbl 1428.68095
Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek
7
2016
Counting and generating terms in the binary lambda calculus. Zbl 1419.68039
Grygiel, Katarzyna; Lescanne, Pierre
7
2015
Polynomial interpretations and the complexity of algorithms. Zbl 0925.68266
Cichon, Adam; Lescanne, Pierre
6
1992
On counting untyped lambda terms. Zbl 1259.68028
Lescanne, Pierre
6
2013
Intersection types for explicit substitutions. Zbl 1082.68014
Lengrand, Stéphane; Lescanne, Pierre; Dougherty, Dan; Dezani-Ciancaglini, Mariangiola; van Bakel, Steffen
5
2004
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage. Zbl 1146.68028
Dougherty, Daniel J.; Ghilezan, Silvia; Lescanne, Pierre
5
2008
Algebraic system specification and development. A survey and annotated bibliography. Zbl 0875.68642
Bidoit, Michel (ed.); Kreowski, Hans-Jörg (ed.); Lescanne, Pierre (ed.); Sannella, Donald (ed.)
4
1991
Transformation ordering. Zbl 0621.68022
Bellegarde, F.; Lescanne, P.
4
1987
Uniform termination of term rewriting systems. Recursive decomposition ordering with status. Zbl 0546.68020
Lescanne, Pierre
4
1984
NARROWER: a new algorithm for unification and its application to logic programming. Zbl 0576.68002
Rety, Pierre; Kirchner, Claude; Kirchner, Hélène; Lescanne, Pierre
4
1985
The language \(\mathcal X\): Circuits, computations and classical logic. Zbl 1171.68411
van Bakel, Steffen; Lengrand, Stéphane; Lescanne, Pierre
4
2005
Strong normalization of the dual classical sequent calculus. Zbl 1143.03360
Dougherty, Daniel; Ghilezan, Silvia; Lescanne, Pierre; Likavec, Silvia
4
2005
Combinatorics of \(\lambda\)-terms: a natural approach. Zbl 1444.03017
Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek
4
2017
Proving termination of associative commutative rewriting systems by rewriting. Zbl 0642.68037
Gnaedig, Isabelle; Lescanne, Pierre
4
1986
Termination of rewrite systems by elementary interpretations. Zbl 0817.68095
Lescanne, Pierre
3
1995
Reductions, intersection types, and explicit substitutions. Zbl 0981.68024
Dougherty, Dan; Lescanne, Pierre
3
2001
Addressed term rewriting systems: syntax, semantics, and pragmatics (extended abstract). Zbl 1272.68177
Dougherty, Dan; Lescanne, Pierre; Liquori, Luigi; Lang, Frédéric
3
2005
Computation with classical sequents. Zbl 1173.03011
van Bakel, Steffen; Lescanne, Pierre
3
2008
An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations. Zbl 0642.68038
Ben Cherifa, Ahlem; Lescanne, Pierre
3
1986
Well rewrite orderings and well quasi-orderings. Zbl 0778.68048
Lescanne, Pierre
2
1992
Reductions, intersection types, and explicit substitutions. Zbl 1029.03006
Dougherty, Dan; Lescanne, Pierre
2
2003
Divergence of the Knuth-Bendix completion procedure and termination orderings. Zbl 1023.68595
Lescanne, Pierre
2
1986
On the study data structures: Binary tournaments with repeated keys. Zbl 0516.68020
Lescanne, P.; Steyaert, J. M.
2
1983
Term rewriting systems and algebra. Zbl 0546.68079
Lescanne, Pierre
2
1984
Medee: A type of language for the deductive programming method. Zbl 0408.68014
Bellegarde, F.; Finance, J. P.; Huc, B.; Jaray, J.; Lescanne, P.; Maroldt, J.; Pair, C.; Quere, A.; Remy, J. L.
2
1979
“Backward” coinduction, Nash equilibrium and the rationality of escalation. Zbl 1262.91039
Lescanne, Pierre; Perrinel, Matthieu
2
2012
Intersection and union types in the \(\bar{\lambda}\mu\tilde{\mu}\)-calculus. Zbl 1272.03078
Dougherty, Daniel J.; Ghilezan, Silvia; Lescanne, Pierre
2
2005
Counting terms in the binary lambda calculus. Zbl 1352.68042
Grygiel, Katarzyna; Lescanne, Pierre
2
2014
Modeles non déterministes de types abstraits. Zbl 0491.68013
Lescanne, Pierre
2
1982
On termination of one rule rewrite systems. Zbl 0938.68687
Lescanne, Pierre
2
1994
The term rewriting approach to automated theorem proving. Zbl 0754.68100
Hsiang, Jieh; Kirchner, Hélène; Lescanne, Pierre; Rusinowitch, Michaël
1
1992
Behavioural categoricity of abstract data type specifications. Zbl 0517.68040
Lescanne, Pierre
1
1983
Well quasi-ordering in a paper by Maurice Janet. Zbl 0712.06001
Lescanne, Pierre
1
1989
Intersection types for the resource control lambda calculi. Zbl 1351.03008
Ghilezan, Silvia; Ivetić, Jelena; Lescanne, Pierre; Likavec, Silvia
1
2011
Algèbres de mots et algèbre universelle. Zbl 0487.08010
Lescanne, Pierre
1
1978
Addressed term rewriting systems: application to a typed object calculus. Zbl 1122.68069
Dougherty, Daniel J.; Lescanne, Pierre; Liquori, Luigi
1
2006
Mechanizing common knowledge logic using COQ. Zbl 1122.03007
Lescanne, Pierre
1
2006
Intuitionistic sequent-style calculus with explicit structural rules. Zbl 1341.03019
Ghilezan, Silvia; Ivetić, Jelena; Lescanne, Pierre; Žunić, Dragisa
1
2011
Common knowledge logic in a higher order proof assistant. Zbl 1383.68078
Lescanne, Pierre
1
2013
Combinatorics of \(\lambda\)-terms: a natural approach. Zbl 1444.03017
Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek
4
2017
A natural counting of lambda terms. Zbl 1428.68095
Bendkowski, Maciej; Grygiel, Katarzyna; Lescanne, Pierre; Zaionc, Marek
7
2016
Counting and generating terms in the binary lambda calculus. Zbl 1419.68039
Grygiel, Katarzyna; Lescanne, Pierre
7
2015
Counting terms in the binary lambda calculus. Zbl 1352.68042
Grygiel, Katarzyna; Lescanne, Pierre
2
2014
Counting and generating lambda terms. Zbl 1311.68045
Grygiel, Katarzyna; Lescanne, Pierre
12
2013
On counting untyped lambda terms. Zbl 1259.68028
Lescanne, Pierre
6
2013
Common knowledge logic in a higher order proof assistant. Zbl 1383.68078
Lescanne, Pierre
1
2013
“Backward” coinduction, Nash equilibrium and the rationality of escalation. Zbl 1262.91039
Lescanne, Pierre; Perrinel, Matthieu
2
2012
Intersection types for the resource control lambda calculi. Zbl 1351.03008
Ghilezan, Silvia; Ivetić, Jelena; Lescanne, Pierre; Likavec, Silvia
1
2011
Intuitionistic sequent-style calculus with explicit structural rules. Zbl 1341.03019
Ghilezan, Silvia; Ivetić, Jelena; Lescanne, Pierre; Žunić, Dragisa
1
2011
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage. Zbl 1146.68028
Dougherty, Daniel J.; Ghilezan, Silvia; Lescanne, Pierre
5
2008
Computation with classical sequents. Zbl 1173.03011
van Bakel, Steffen; Lescanne, Pierre
3
2008
Addressed term rewriting systems: application to a typed object calculus. Zbl 1122.68069
Dougherty, Daniel J.; Lescanne, Pierre; Liquori, Luigi
1
2006
Mechanizing common knowledge logic using COQ. Zbl 1122.03007
Lescanne, Pierre
1
2006
The language \(\mathcal X\): Circuits, computations and classical logic. Zbl 1171.68411
van Bakel, Steffen; Lengrand, Stéphane; Lescanne, Pierre
4
2005
Strong normalization of the dual classical sequent calculus. Zbl 1143.03360
Dougherty, Daniel; Ghilezan, Silvia; Lescanne, Pierre; Likavec, Silvia
4
2005
Addressed term rewriting systems: syntax, semantics, and pragmatics (extended abstract). Zbl 1272.68177
Dougherty, Dan; Lescanne, Pierre; Liquori, Luigi; Lang, Frédéric
3
2005
Intersection and union types in the \(\bar{\lambda}\mu\tilde{\mu}\)-calculus. Zbl 1272.03078
Dougherty, Daniel J.; Ghilezan, Silvia; Lescanne, Pierre
2
2005
Intersection types for explicit substitutions. Zbl 1082.68014
Lengrand, Stéphane; Lescanne, Pierre; Dougherty, Dan; Dezani-Ciancaglini, Mariangiola; van Bakel, Steffen
5
2004
Reductions, intersection types, and explicit substitutions. Zbl 1029.03006
Dougherty, Dan; Lescanne, Pierre
2
2003
Reductions, intersection types, and explicit substitutions. Zbl 0981.68024
Dougherty, Dan; Lescanne, Pierre
3
2001
\(\lambda\nu\), a calculus of explicit substitutions which preserves strong normalisation. Zbl 0873.68108
Benaissa, Zine-El-Abidine; Briaud, Daniel; Lescanne, Pierre; Rouyer-Degli, Jocelyne
23
1996
Termination of rewrite systems by elementary interpretations. Zbl 0817.68095
Lescanne, Pierre
3
1995
On termination of one rule rewrite systems. Zbl 0938.68687
Lescanne, Pierre
2
1994
Polynomial interpretations and the complexity of algorithms. Zbl 0925.68266
Cichon, Adam; Lescanne, Pierre
6
1992
Well rewrite orderings and well quasi-orderings. Zbl 0778.68048
Lescanne, Pierre
2
1992
The term rewriting approach to automated theorem proving. Zbl 0754.68100
Hsiang, Jieh; Kirchner, Hélène; Lescanne, Pierre; Rusinowitch, Michaël
1
1992
Algebraic system specification and development. A survey and annotated bibliography. Zbl 0875.68642
Bidoit, Michel; Kreowski, Hans-Jörg; Lescanne, Pierre; Sannella, Donald
4
1991
Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Zbl 0705.68067
Dauchet, Max; Heuillard, Thierry; Lescanne, Pierre; Tison, Sophie
27
1990
Termination by completion. Zbl 0723.68056
Bellegarde, Françoise; Lescanne, Pierre
10
1990
Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness. Zbl 0691.68026
Lazrek, Azeddine; Lescanne, Pierre; Thiel, Jean-Jacques
8
1990
On the recursive decomposition ordering with lexicographical status and other related orderings. Zbl 0698.68031
Lescanne, Pierre
8
1990
Equational problems and disunification. Zbl 0678.68093
Comon, Hubert; Lescanne, Pierre
49
1989
Well quasi-ordering in a paper by Maurice Janet. Zbl 0712.06001
Lescanne, Pierre
1
1989
Termination of rewriting systems by polynomial interpretations and its implementation. Zbl 0625.68036
Ben Cherifa, Ahlem; Lescanne, Pierre
36
1987
Transformation ordering. Zbl 0621.68022
Bellegarde, F.; Lescanne, P.
4
1987
Proving termination of associative commutative rewriting systems by rewriting. Zbl 0642.68037
Gnaedig, Isabelle; Lescanne, Pierre
4
1986
An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations. Zbl 0642.68038
Ben Cherifa, Ahlem; Lescanne, Pierre
3
1986
Divergence of the Knuth-Bendix completion procedure and termination orderings. Zbl 1023.68595
Lescanne, Pierre
2
1986
NARROWER: a new algorithm for unification and its application to logic programming. Zbl 0576.68002
Rety, Pierre; Kirchner, Claude; Kirchner, Hélène; Lescanne, Pierre
4
1985
Uniform termination of term rewriting systems. Recursive decomposition ordering with status. Zbl 0546.68020
Lescanne, Pierre
4
1984
Term rewriting systems and algebra. Zbl 0546.68079
Lescanne, Pierre
2
1984
Recursive decomposition ordering. Zbl 0513.68026
Jouannaud, Jean-Pierre; Lescanne, Pierre; Reinig, Fernand
11
1983
On the study data structures: Binary tournaments with repeated keys. Zbl 0516.68020
Lescanne, P.; Steyaert, J. M.
2
1983
Behavioural categoricity of abstract data type specifications. Zbl 0517.68040
Lescanne, Pierre
1
1983
On multiset orderings. Zbl 0486.68041
Jouannaud, Jean-Pierre; Lescanne, Pierre
16
1982
Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems. Zbl 0518.68025
Lescanne, Pierre
7
1982
Modeles non déterministes de types abstraits. Zbl 0491.68013
Lescanne, Pierre
2
1982
Medee: A type of language for the deductive programming method. Zbl 0408.68014
Bellegarde, F.; Finance, J. P.; Huc, B.; Jaray, J.; Lescanne, P.; Maroldt, J.; Pair, C.; Quere, A.; Remy, J. L.
2
1979
Algèbres de mots et algèbre universelle. Zbl 0487.08010
Lescanne, Pierre
1
1978
all top 5

Cited by 296 Authors

12 Lescanne, Pierre
12 Peltier, Nicolas
10 Vágvölgyi, Sándor
9 Middeldorp, Aart
9 Zantema, Hans
7 Kesner, Delia
7 Martin, Ursula
7 Meseguer Guaita, José
6 van Bakel, Steffen
5 Dershowitz, Nachum
5 Fernández, Maribel
5 Lucas, Salvador
5 Pichler, Reinhard
4 Ayala-Rincón, Mauricio
4 Bendkowski, Maciej
4 Caferra, Ricardo
4 Gittenberger, Bernhard
4 Horbach, Matthias
4 Kamareddine, Fairouz D.
4 Kirchner, Hélène
3 Bodini, Olivier
3 Courcelle, Bruno
3 Cavalcanti de Moura, Flávio Leonardo
3 Durand, Irène A.
3 Geser, Alfons
3 Ghilezan, Silvia
3 Gnaedig, Isabelle
3 Jacquemard, Florent
3 Lengrand, Stéphane Jean Eric
3 Marché, Claude
3 Rusinowitch, Michaël
3 Tarau, Paul
3 Treinen, Ralf
3 Winkler, Sarah
2 Asada, Kazuyuki
2 Baader, Franz
2 Bachmair, Leo
2 Bloo, Roel
2 Bonfante, Guillaume
2 Bouhoula, Adel
2 Bourely, Christophe
2 Comon-Lundh, Hubert
2 Comon, Hubert
2 Dauchet, Max
2 Défourneaux, Gilles
2 Delaune, Stéphanie
2 de’Liguoro, Ugo
2 Durán, Francisco
2 Fokkink, Willem Jan
2 Geuvers, Jan Herman
2 Giesl, Jürgen
2 Gołȩbiewski, Zbigniew
2 Grygiel, Katarzyna
2 Hermann, Miki
2 Hirokawa, Nao
2 Kirchner, Claude
2 Kobayashi, Naoki
2 Likavec, Silvia
2 Meadows, Catherine A.
2 Nadathur, Gopalan
2 Nieuwenhuis, Robert
2 Ohlebusch, Enno
2 Plaisted, David Alan
2 Remy, Jean-Luc
2 Roşu, Grigore
2 Rubio, Albert
2 Sannella, Donald T.
2 Schneider-Kamp, Peter
2 Scott, Elizabeth A.
2 Şerbănuţă, Traian Florin
2 Simonsen, Jakob Grue
2 Sin’ya, Ryoma
2 Skeirik, Stephen
2 Steinbach, Joachim
2 Struth, Georg
2 Tarlecki, Andrzej
2 Thiemann, René
2 Tsukada, Takeshi
2 Urbain, Xavier
2 Veanes, Margus
2 Lima Ventura, Daniel
2 Verma, Rakesh M.
2 Vial, Pierre
2 Weidenbach, Christoph
2 Yamada, Akihisa
1 Abramsky, Samson
1 Abriola, Sergio
1 Aït-Kaci, Hassan
1 Aoto, Takahito
1 Artamonov, Vyacheslav Aleksandrovich
1 Asinowski, Andrei
1 Bacher, Axel
1 Backofen, Rolf
1 Badban, Bahareh
1 Balland, Emilie
1 Bancerek, Grzegorz
1 Banderier, Cyril
1 Barbanera, Franco
1 Barthe, Gilles
1 Bellegarde, Françoise
...and 196 more Authors

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.