default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Lescanne
Person information
- affiliation: ENS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j40]Pierre Lescanne
:
Almost all Classical Theorems are Intuitionistic. RAIRO Theor. Informatics Appl. 56: 9 (2022)- [i34]Pierre Lescanne:
Linear random generation of Motzkin trees. CoRR abs/2205.11982 (2022) - 2021
- [i33]Pierre Lescanne:
Zaionc paradox revisited. CoRR abs/2104.06723 (2021) - [i32]Silvia Ghilezan, Jelena Ivetic, Simona Kasterovic, Pierre Lescanne:
L-types for resource awareness: an implicit name approach. CoRR abs/2112.11062 (2021) - 2020
- [i31]Pierre Lescanne:
Extensive Infinite Games and Escalation, an exercise in Agda. CoRR abs/2006.15137 (2020)
2010 – 2019
- 2019
- [j39]Maciej Bendkowski, Pierre Lescanne:
On the enumeration of closures and environments with an application to random generation. Log. Methods Comput. Sci. 15(4) (2019) - 2018
- [j38]Pierre Lescanne:
Dependent Types for Extensive Games. J. Formaliz. Reason. 11(1): 1-17 (2018) - [j37]Pierre Lescanne:
Quantitative Aspects of Linear and Affine Closed Lambda Terms. ACM Trans. Comput. Log. 19(2): 9:1-9:18 (2018) - [c50]Maciej Bendkowski, Pierre Lescanne:
Combinatorics of Explicit Substitutions. PPDP 2018: 7:1-7:12 - [c49]Maciej Bendkowski, Pierre Lescanne:
Counting Environments and Closures. FSCD 2018: 11:1-11:16 - [i30]Maciej Bendkowski, Pierre Lescanne:
Counting Environments and Closures. CoRR abs/1802.00640 (2018) - [i29]Maciej Bendkowski, Pierre Lescanne:
Combinatorics of explicit substitutions. CoRR abs/1804.03862 (2018) - 2017
- [j36]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
Combinatorics of $$\lambda$$-terms: a natural approach. J. Log. Comput. 27(8): 2611-2630 (2017) - [c48]Dragisa Zunic, Pierre Lescanne:
A Congruence Relation for Restructuring Classical Terms. ICTCS/CILC 2017: 186-197 - [i28]Pierre Lescanne:
Quantitative aspects of linear and affine closed lambda terms. CoRR abs/1702.03085 (2017) - 2016
- [c47]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
A Natural Counting of Lambda Terms. SOFSEM 2016: 183-194 - [i27]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
Combinatorics of λ-terms: a natural approach. CoRR abs/1609.07593 (2016) - [i26]Pierre Lescanne:
Dependent Types for Extensive Games. CoRR abs/1611.06101 (2016) - 2015
- [j35]Katarzyna Grygiel, Pierre Lescanne:
Counting and generating terms in the binary lambda calculus. J. Funct. Program. 25 (2015) - [i25]Pierre Lescanne:
Intelligent escalation and the principle of relativity. CoRR abs/1505.07212 (2015) - [i24]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
A natural counting of Lambda terms. CoRR abs/1506.02367 (2015) - [i23]Katarzyna Grygiel, Pierre Lescanne:
Counting and Generating Terms in the Binary Lambda Calculus (Extended version). CoRR abs/1511.05334 (2015) - [i22]Pierre Lescanne:
The risk of divergence. CoRR abs/1512.07010 (2015) - [i21]Samson Abramsky, Alexander Kurz, Pierre Lescanne, Viktor Winschel:
Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042). Dagstuhl Reports 5(1): 197-206 (2015) - 2014
- [i20]Katarzyna Grygiel, Pierre Lescanne:
Counting Terms in the Binary Lambda Calculus. CoRR abs/1401.0379 (2014) - [i19]Pierre Lescanne:
Boltzmann samplers for random generation of lambda terms. CoRR abs/1404.3875 (2014) - [i18]Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec:
Resource control and intersection types: an intrinsic connection. CoRR abs/1412.2219 (2014) - 2013
- [j34]Katarzyna Grygiel, Pierre Lescanne:
Counting and generating lambda terms. J. Funct. Program. 23(5): 594-628 (2013) - [j33]Pierre Lescanne:
On counting untyped lambda terms. Theor. Comput. Sci. 474: 80-97 (2013) - [j32]Pierre Lescanne:
Les krachs sont rationnels. Tech. Sci. Informatiques 32(9-10): 909-929 (2013) - [c46]Pierre Lescanne:
Common Knowledge Logic in a Higher Order Proof Assistant. Programming Logics 2013: 271-284 - [c45]Pierre Lescanne:
A Simple Case of Rationality of Escalation. CALCO 2013: 191-204 - [i17]Pierre Lescanne:
Bubbles are rational. CoRR abs/1305.0101 (2013) - [i16]Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec:
A journey through resource control lambda calculi and explicit substitution using intersection types (an account). CoRR abs/1306.2283 (2013) - [i15]Pierre Lescanne:
A simple case of rationality of escalation. CoRR abs/1306.2284 (2013) - [i14]Pierre Lescanne:
An exercise on streams: convergence acceleration. CoRR abs/1312.4917 (2013) - 2012
- [j31]Pierre Lescanne, Matthieu Perrinel:
"Backward" coinduction, Nash equilibrium and the rationality of escalation. Acta Informatica 49(3): 117-137 (2012) - [i13]Silvia Ghilezan, Pierre Lescanne, Dragisa Zunic:
Computational interpretation of classical logic with explicit structural rules. CoRR abs/1203.4754 (2012) - [i12]Katarzyna Grygiel, Pierre Lescanne:
Counting and generating lambda terms. CoRR abs/1210.2610 (2012) - 2011
- [c44]Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec:
Intersection Types for the Resource Control Lambda Calculi. ICTAC 2011: 116-134 - [i11]Pierre Lescanne:
On counting untyped lambda terms. CoRR abs/1107.1327 (2011) - [i10]Pierre Lescanne:
Les crashs sont rationnels. CoRR abs/1111.7299 (2011) - [i9]Pierre Lescanne:
Rationality and Escalation in Infinite Extensive Games. CoRR abs/1112.1185 (2011) - [i8]Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec:
Resource control and strong normalisation. CoRR abs/1112.3455 (2011) - 2010
- [i7]Pierre Lescanne, Matthieu Perrinel:
On the Rationality of Escalation. CoRR abs/1004.5257 (2010)
2000 – 2009
- 2009
- [c43]Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Dragisa Zunic:
Intuitionistic Sequent-Style Calculus with Explicit Structural Rules. TbiLLC 2009: 101-124 - [i6]Pierre Lescanne:
Deconstruction of Infinite Extensive Games using coinduction. CoRR abs/0904.3528 (2009) - [i5]Pierre Lescanne:
Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games. CoRR abs/0907.5469 (2009) - 2008
- [j30]Steffen van Bakel, Pierre Lescanne:
Computation with classical sequents. Math. Struct. Comput. Sci. 18(3): 555-609 (2008) - [j29]Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne:
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage. Theor. Comput. Sci. 398(1-3): 114-128 (2008) - [i4]Pierre Lescanne:
(Mechanical) Reasoning on Infinite Extensive Games. CoRR abs/0805.1798 (2008) - [i3]Stéphane Le Roux, Pierre Lescanne, René Vestergaard:
Conversion/Preference Games. CoRR abs/0811.0071 (2008) - 2007
- [i2]Pierre Lescanne, Jérôme Puisségur:
Dynamic Logic of Common Knowledge in a Proof Assistant. CoRR abs/0712.3146 (2007) - [i1]Pierre Lescanne:
Common knowledge logic in a higher order proof assistant? CoRR abs/0712.3147 (2007) - 2006
- [j28]Pierre Lescanne:
Mechanizing common knowledge logic using COQ. Ann. Math. Artif. Intell. 48(1-2): 15-43 (2006) - [j27]Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori:
Addressed term rewriting systems: application to a typed object calculus. Math. Struct. Comput. Sci. 16(4): 667-709 (2006) - [j26]Pierre Lescanne:
Review of "Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman", Cambridge University Press 2004. SIGACT News 37(1): 27-28 (2006) - [c42]Chafika Chettaoui, Franck Delaplace, Pierre Lescanne, Mun'delanji Vestergaard, René Vestergaard:
Rewriting Game Theory as a Foundation for State-Based Models of Gene Regulation. CMSB 2006: 257-270 - 2005
- [c41]Steffen van Bakel, Stéphane Lengrand, Pierre Lescanne:
The Language chi: Circuits, Computations and Classical Logic. ICTCS 2005: 81-96 - [c40]Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec:
Strong Normalization of the Dual Classical Sequent Calculus. LPAR 2005: 169-183 - [e4]Pierre Lescanne, René David, Marek Zaionc:
Proceedings of the Second Workshop on Computational Logic and Applications, CLA 2004, Lyon, France, June 17-18, 2004. Electronic Notes in Theoretical Computer Science 140, Elsevier 2005 [contents] - 2004
- [j25]Stéphane Lengrand, Pierre Lescanne, Daniel J. Dougherty, Mariangiola Dezani-Ciancaglini, Steffen van Bakel:
Intersection types for explicit substitutions. Inf. Comput. 189(1): 17-42 (2004) - [c39]Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne:
Characterizing strong normalization in a language with control operators. PPDP 2004: 155-166 - [c38]Pierre Lescanne, René David, Marek Zaionc:
Preface. CLA 2004: 1 - [c37]Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori, Frédéric Lang:
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract. TERMGRAPH 2004: 57-82 - [c36]Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne:
Intersection and Union Types in the lambda-my-my/tilde-calculus. ITRS 2004: 153-172 - 2003
- [j24]Daniel J. Dougherty, Pierre Lescanne:
Reductions, Intersection Types, and Explicit Substitutions. Math. Struct. Comput. Sci. 13(1): 55-85 (2003) - [c35]Silvia Ghilezan, Pierre Lescanne:
Classical Proofs, Typed Processes, and Intersection Types: Extended Abstract. TYPES 2003: 226-241 - 2002
- [c34]Daniel J. Dougherty, Stéphane Lengrand, Pierre Lescanne:
An Improved System of Intersection Types for Explicit Substitutions. IFIP TCS 2002: 511-523 - 2001
- [j23]Jürgen Giesl, Pierre Lescanne:
Special Issue "Termination". Appl. Algebra Eng. Commun. Comput. 12(1/2): 1-2 (2001) - [c33]Daniel J. Dougherty, Pierre Lescanne:
Reductions, Intersection Types, and Explicit Substitutions. TLCA 2001: 121-135 - 2000
- [j22]Frédéric Lang, Pierre Lescanne:
On Strong Normalization of Explicit Substitution Calculi (Short Note). J. Funct. Log. Program. 2000(7) (2000)
1990 – 1999
- 1999
- [c32]Frédéric Lang, Pierre Lescanne, Luigi Liquori:
A Framework for Defining Object-Calculi. World Congress on Formal Methods 1999: 963-982 - 1996
- [j21]Zine-El-Abidine Benaissa, Daniel Briaud, Pierre Lescanne, Jocelyne Rouyer-Degli:
lambda-nu, A Calculus of Explicit Substitutions which Preserves Strong Normalisation. J. Funct. Program. 6(5): 699-722 (1996) - [j20]Gregory Kucherov, Pierre Lescanne, Peter D. Mosses:
Valentin M. Antimirov (1961-1995). Theor. Comput. Sci. 155(2): 289-290 (1996) - [c31]Pierre Lescanne:
Calculi of Explicit Substitutions: New Results. APPIA-GULP-PRODE 1996: 309-328 - [c30]Zine-El-Abidine Benaissa, Pierre Lescanne, Kristoffer Høgsbro Rose:
Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution. PLILP 1996: 393-407 - 1995
- [j19]Pierre Lescanne:
Termination of Rewrite Systems by Elementary Interpretations. Formal Aspects Comput. 7(1): 77-90 (1995) - [c29]Pierre Lescanne:
The Lambda Calculus as an Abstract Data Type. COMPASS/ADT 1995: 74-80 - [c28]Boutheina Chetali, Pierre Lescanne:
Formal Verfication of a Protocol for Communications over Faulty Channels. FORTE 1995: 91-108 - [c27]Pierre Lescanne, Jocelyne Rouyer-Degli:
Explicit Substitutions with de Bruijn's Levels. RTA 1995: 294-308 - 1994
- [j18]Pierre Lescanne:
On Termination of One Rule Rewrite Systems. Theor. Comput. Sci. 132(2): 395-401 (1994) - [c26]Pierre Lescanne:
From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. POPL 1994: 60-69 - 1992
- [j17]Pierre Lescanne, Wolfgang Wechler:
Introduction - ALP 1988. J. Log. Program. 12(3&4): 189 (1992) - [j16]Jieh Hsiang, Hélène Kirchner, Pierre Lescanne, Michaël Rusinowitch:
The Term Rewriting Approach to Automated Theorem Proving. J. Log. Program. 14(1&2): 71-99 (1992) - [j15]Pierre Lescanne:
Well Rewrite Orderings and Well Quasi-Orderings. J. Symb. Comput. 14(5): 419-436 (1992) - [c25]Pierre Lescanne:
Termination of Rewrite Systems by Elementary Interpretations. ALP 1992: 21-36 - [c24]Adam Cichon, Pierre Lescanne:
Polynomial Interpretations and the Complexity of Algorithms. CADE 1992: 139-147 - [c23]Boutheina Chetali, Pierre Lescanne:
An Exercise in LP: The Proof of a Non Restoring Division Circuit. Larch 1992: 55-68 - 1991
- [j14]Hélène Kirchner, Pierre Lescanne:
Rewriting techniques and applications, RTA'91. SIGACT News 22(3): 24-30 (1991) - [c22]Pierre Lescanne:
Rewrite Orderings and Termination of Rewrite Systems. MFCS 1991: 17-27 - [e3]Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella:
Algebraic System Specification and Development - A Survey and Annotated Bibliography. Lecture Notes in Computer Science 501, Springer 1991, ISBN 3-540-54060-1 - 1990
- [j13]Françoise Bellegarde, Pierre Lescanne:
Termination by Completion. Appl. Algebra Eng. Commun. Comput. 1: 79-96 (1990) - [j12]Azeddine Lazrek, Pierre Lescanne, Jean-Jacques Thiel:
Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness. Inf. Comput. 84(1): 47-70 (1990) - [j11]Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison:
Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems. Inf. Comput. 88(2): 187-201 (1990) - [j10]Pierre Lescanne:
On the Recursive Decomposition Ordering with Lexicographical Status and Other Related Orderings. J. Autom. Reason. 6(1): 39-49 (1990) - [c21]Pierre Lescanne:
Implementations of Completion by Transition Rules + Control: ORME. ALP 1990: 262-269 - [c20]Pierre Lescanne:
ORME: An Implementation of Completion Procedures as Sets of Transition Rules. CADE 1990: 661-662 - [c19]Pierre Lescanne:
Well Rewrite Orderings. LICS 1990: 249-256
1980 – 1989
- 1989
- [j9]Pierre Lescanne:
Well quasi-ordering in a paper by Maurice Janet. Bull. EATCS 39: 185-188 (1989) - [j8]Hubert Comon, Pierre Lescanne:
Equational Problems and Disunification. J. Symb. Comput. 7(3/4): 371-425 (1989) - [c18]Pierre Lescanne:
Completion Procedures as Transition Rules + Control. TAPSOFT, Vol.1 1989: 28-41 - 1988
- [e2]Jan Grabowski, Pierre Lescanne, Wolfgang Wechler:
Algebraic and Logic Programming, International Workshop, Gaussig, GDR, November 14-18, 1988, Proceedings. Lecture Notes in Computer Science 343, Springer 1988, ISBN 3-540-50667-5 [contents] - 1987
- [j7]Ahlem Ben Cherifa, Pierre Lescanne:
Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation. Sci. Comput. Program. 9(2): 137-159 (1987) - [c17]Pierre Lescanne:
Current Trends in Rewriting Techniques and Related Problems. Trends in Computer Algebra 1987: 38-51 - [c16]Claude Kirchner, Pierre Lescanne:
Solving Disequations. LICS 1987: 347-352 - [c15]Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne:
Decidability of the Confluence of Ground Term Rewriting Systems. LICS 1987: 353-359 - [c14]Pierre Lescanne:
REVE: A Rewrite Rule Laboratory. STACS 1987: 482-483 - [c13]Françoise Bellegarde, Pierre Lescanne:
Transformation Ordering. TAPSOFT, Vol.1 1987: 69-80 - [e1]Pierre Lescanne:
Rewriting Techniques and Applications, 2nd International Conference, RTA-87, Bordeaux, France, May 25-27, 1987, Proceedings. Lecture Notes in Computer Science 256, Springer 1987, ISBN 3-540-17220-3 [contents] - 1986
- [j6]Pierre Lescanne:
Divergence of the Knuth-Bendix Completion Procedure and Termination Orderings. Bull. EATCS 30: 80-83 (1986) - [c12]Ahlem Ben Cherifa, Pierre Lescanne:
An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations. CADE 1986: 42-51 - [c11]Isabelle Gnaedig, Pierre Lescanne:
Proving Termination of Associative Commutative Rewriting Systems by Rewriting. CADE 1986: 52-61 - [c10]Pierre Lescanne:
REVE a Rewrite Rule Laboratory. CADE 1986: 695-696 - 1985
- [c9]Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne:
NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. RTA 1985: 141-157 - 1984
- [c8]Pierre Lescanne:
Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status. CAAP 1984: 181-194 - [c7]Pierre Lescanne:
Term Rewriting Systems and Algebra. CADE 1984: 166-174 - 1983
- [j5]Pierre Lescanne:
Behavioural Categoricity of Abstract Data Type Specifications. Comput. J. 26(4): 289-292 (1983) - [c6]Pierre Lescanne, Jean-Marc Steyaert:
On the Study Data Structures: Binary Tournaments with Repeated Keys. ICALP 1983: 466-477 - [c5]Pierre Lescanne:
Computer Experiments with the Reve Term Rewriting System Generator. POPL 1983: 99-108 - 1982
- [j4]Jean-Pierre Jouannaud, Pierre Lescanne:
On Multiset Orderings. Inf. Process. Lett. 15(2): 57-63 (1982) - [j3]Pierre Lescanne:
Modèles non Déterministes de Types Abstraits. RAIRO Theor. Informatics Appl. 16(3): 225-244 (1982) - [j2]Pierre Lescanne:
Some Properties of Decomposition Ordering, a Simplification Ordering to Prove Termination of Rewriting Systems. RAIRO Theor. Informatics Appl. 16(4): 331-347 (1982) - [c4]Jean-Pierre Jouannaud, Pierre Lescanne, F. Reinig:
Recursive Decomposition Ordering. Formal Description of Programming Concepts 1982: 331-348 - 1981
- [c3]Pierre Lescanne:
Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems. IJCAI 1981: 548-550 - 1980
- [c2]Jacques Guyard, Pierre Lescanne:
Manipulation d'arbres syntaxiques et contruction de programmes (Résumé). CLAAP 1980: 180-181 - [c1]Jacques Guyard, Pierre Lescanne:
Manipulation d'arbres syntaxiques et contruction de programmes. CLAAP 1980: 208-224
1970 – 1979
- 1976
- [j1]Pierre Lescanne:
Équivalence Entre la Famille des Ensembles Réguliers et la Famille des Ensembles Algébriques. RAIRO Theor. Informatics Appl. 10(2): 57-81 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
