Pierre Lescanne
55
Documents
Presentation
Pierre Lescanne is emeritus professor at Ecole normale superieure de
Lyon (France) since 2012.
He graduated at the University of Nancy (France) where he obtained a
first doctorate (PhD) in 1971 and a second doctorate (habilitation) in
1979\. He was at MIT (USA) for two years in 1980-1982 where he
developed the software REVE (one of the first proof assistant based on
first order rewriting) and became a director of research at the CNRS
research center in computer science in Nancy. He was a professor at
Ecole normale superieure de Lyon from 1997 to 2012. He is now
emeritus professor at Ecole normale superieure de Lyon
His current domain of research are
\- coinduction, games, escalation, and the refoundation of economics,
\- quantitative aspects of lambda calculus,
\- resource calculi and its connection with models of deduction.
====================================================================
Five publications
Katarzyna Grygiel, Pierre Lescanne: Counting and generating terms in the binary lambda calculus. J. Funct. Program. 25 (2015)
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc: A Natural Counting of Lambda Terms. SOFSEM 2016: 183-194
Pierre Lescanne: On counting untyped lambda terms. Theor. Comput. Sci. 474: 80-97 (2013)
Pierre Lescanne: A Simple Case of Rationality of Escalation. CALCO 2013: 191-204
Pierre Lescanne, Matthieu Perrinel: "Backward" coinduction, Nash equilibrium and the rationality of escalation. Acta Inf. 49(3): 117-137 (2012)
Publications
Dependent Types for Extensive Games J. Formalized Reasoning, 2018
Journal articles
ensl-01892386v1
|
|
Quantitative Aspects of Linear and Affine Closed Lambda TermsACM Transactions on Computational Logic, 2018, 19 (2), pp.1 - 18. ⟨10.1145/3173547⟩
Journal articles
ensl-01892358v1
|
|
Combinatorics of lambda-terms: a natural approachJ. Log. Comput., 2017
Journal articles
ensl-01892425v1
|
|
Counting and generating terms in the binary lambda calculusJournal of Functional Programming, 2015, 25, ⟨10.1017/S0956796815000271⟩
Journal articles
ensl-01892455v1
|
|
Counting and generating lambda termsJournal of Functional Programming, 2013, 23 (05), pp.594-628. ⟨10.1017/S0956796813000178⟩
Journal articles
ensl-00879067v1
|
|
|
On counting untyped lambda termsTheoretical Computer Science, 2013, 474, pp.80-97. ⟨10.1016/j.tcs.2012.11.019⟩
Journal articles
ensl-00578527v9
|
Les krachs sont rationnelsRevue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, 2013, 32 (9-10), pp.909-909
Journal articles
ensl-00937354v1
|
|
|
On the Rationality of Escalationnone, 2012, pp.23
Journal articles
ensl-00439911v2
|
''Backward'' Coinduction, Nash equilibrium and the Rationality of EscalationActa Informatica, 2012, 49 (3), pp.117-137. ⟨10.1007/s00236-012-0153-3⟩
Journal articles
ensl-00692767v1
|
|
|
Est-ce que ça s'arrête ?Images des Mathématiques, 2009, http://images.math.cnrs.fr/Est-ce-que-ca-s-arrete.html
Journal articles
hal-00583742v1
|
|
Et si on commençait par les fonctions !Images des Mathématiques, 2009, http://images.math.cnrs.fr/Et-si-on-commencait-par-les.html
Journal articles
hal-00583647v1
|
Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systemsInformation and Computation, 1990, 88 (2), pp.187-201. ⟨10.1016/0890-5401(90)90015-A⟩
Journal articles
hal-02193891v1
|
A Congruence Relation for Restructuring Classical Terms18th Italian Conference on Theoretical Computer Science, Oct 2018, Naples, Italy. pp.186-197
Conference papers
ensl-01892440v1
|
|
Counting Environments and ClosuresFSCD 2018, Jul 2018, Oxford, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2018.11⟩
Conference papers
ensl-01892406v1
|
|
Combinatorics of Explicit SubstitutionsPPDP 2016, ACM et Université de Francfort de, Sep 2018, Frankfurt am Main, France. ⟨10.1145/3236950.3236951⟩
Conference papers
ensl-01892388v1
|
|
A Natural Counting of Lambda TermsSOFSEM 2016, Jan 2016, Harrachov, Czech Republic
Conference papers
ensl-01892447v1
|
|
Intersection types fit well with resource control21st International Conference on Types for Proofs and Programs, May 2015, Tallinn, Estonia
Conference papers
ensl-01892569v1
|
|
|
Counting Terms in the Binary Lambda Calculus25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France. pp.13
Conference papers
ensl-00923203v1
|
|
A simple case of rationality of escalation5th Conference on Algebra and Coalgebra in Computer Science, CALCO 2013, Sep 2013, Warsaw, Poland. pp.191-204
Conference papers
ensl-00832490v1
|
Intersection Types for the Resource Control Lambda CalculiTheoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Aug 2011, Johannesburg, South Africa. pp.116-134
Conference papers
ensl-00654755v1
|
|
Intuitionistic Sequent-Style Calculus with Explicit Structural RulesLogic, Language, and Computation - 8th International Tbilisi Symposium on Logic, Language, and Computation, Sep 2009, Bakuriani, Georgia. pp.101-124
Conference papers
ensl-00654762v1
|
|
|
Rewriting game theory as a foundation for sate-based models of gene regulationInternational Conference on Computational Methods in Systems Biology (CMSB 2006), Oct 2006, Trento, Italy. pp.257-270, ⟨10.1007/11885191_18⟩
Conference papers
hal-00339800v1
|
Rewriting Game Theory as a Foundation for State-Based Models of Gene RegulationComputational Methods in Systems Biology (CMSB), 2006, Italy. pp.257--270, ⟨10.1007/11885191_18⟩
Conference papers
hal-00339691v1
|
|
|
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics [Extended Abstract]Proceedings of the 2nd International Workshop on Term Graph Rewriting (TERMGRAPH 2004), Oct 2004, Rome, Italy. pp.57-82, ⟨10.1016/j.entcs.2004.12.042⟩
Conference papers
hal-01149607v1
|
|
A Generic Object-Calculus Based on Addressed Term Rewriting SystemsProceedings of the Fourth Workshop on Explicit Substitutions Theory and Applications (WESTAPP '01), May 2001, Utrecht, Netherlands. pp.6-25
Conference papers
hal-01152576v1
|
Decidability of the Confluence of Ground Term Rewriting Systems.LICS 1987 - Second Annual IEEE Symposium on Logic in Computer Science, Jun 1987, Ithaca, New York, United States
Conference papers
hal-02193998v1
|
Common Knowledge Logic in a Higher Order Proof AssistantAndrei Voronkov, Christoph Weidenbach. Programming Logics - Essays in Memory of Harald Ganzinger., Springer, pp.271-284, 2013, Lecture Notes in Computer Science
Book sections
ensl-00869081v1
|
|
|
Common knowledge logic in a higher order proof assistantAndreï Voronkov & Christoph Weidenbach. Memory of Harald Ganzinger 2013, 7797, Springer, pp.271-284, 2013, Lecture Notes in Computer Science, ⟨10.1007/978-3-642-40206-7_15⟩
Book sections
ensl-00199368v3
|
|
Intelligent escalation and the principle of relativity[Research Report] LIP - ENS Lyon. 2014
Reports
ensl-01096264v4
|
|
A journey through resource control lambda calculi and explicit substitution using intersection types (an account)2011, pp.40
Reports
ensl-00823621v2
|