Skip to Main content
Number of documents

54

Short résumé


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)


Journal articles12 documents

  • Pierre Lescanne. Dependent Types for Extensive Games. J. Formalized Reasoning, 2018. ⟨ensl-01892386⟩
  • Pierre Lescanne. Quantitative Aspects of Linear and Affine Closed Lambda Terms. ACM Transactions on Computational Logic, Association for Computing Machinery, 2018, 19 (2), pp.1 - 18. ⟨10.1145/3173547⟩. ⟨ensl-01892358⟩
  • Pierre Lescanne, Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc. Combinatorics of lambda-terms: a natural approach. J. Log. Comput., Oxford Academic, 2017. ⟨ensl-01892425⟩
  • Katarzyna Grygiel, Pierre Lescanne. Counting and generating terms in the binary lambda calculus. Journal of Functional Programming, Cambridge University Press (CUP), 2015, 25, ⟨10.1017/S0956796815000271⟩. ⟨ensl-01892455⟩
  • Pierre Lescanne. On counting untyped lambda terms. Theoretical Computer Science, Elsevier, 2013, 474, pp.80-97. ⟨10.1016/j.tcs.2012.11.019⟩. ⟨ensl-00578527v9⟩
  • Pierre Lescanne, Katarzyna Grygiel. Counting and generating lambda terms. Journal of Functional Programming, Cambridge University Press (CUP), 2013, 23 (05), pp.594-628. ⟨10.1017/S0956796813000178⟩. ⟨ensl-00879067⟩
  • Pierre Lescanne. Les krachs sont rationnels. Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, Lavoisier, 2013, 32 (9-10), pp.909-909. ⟨ensl-00937354⟩
  • Pierre Lescanne, Perrinel Matthieu. On the Rationality of Escalation. none, 2012, pp.23. ⟨ensl-00439911v2⟩
  • Pierre Lescanne, Matthieu Perrinel. ''Backward'' Coinduction, Nash equilibrium and the Rationality of Escalation. Acta Informatica, Springer Verlag, 2012, 49 (3), pp.117-137. ⟨10.1007/s00236-012-0153-3⟩. ⟨ensl-00692767⟩
  • Pierre Lescanne. Est-ce que ça s'arrête ?. Images des Mathématiques, CNRS, 2009, http://images.math.cnrs.fr/Est-ce-que-ca-s-arrete.html. ⟨hal-00583742⟩
  • Pierre Lescanne. Et si on commençait par les fonctions !. Images des Mathématiques, CNRS, 2009, http://images.math.cnrs.fr/Et-si-on-commencait-par-les.html. ⟨hal-00583647⟩
  • 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. Information and Computation, Elsevier, 1990, 88 (2), pp.187-201. ⟨10.1016/0890-5401(90)90015-A⟩. ⟨hal-02193891⟩

Conference papers13 documents

  • Maciej Bendkowski, Pierre Lescanne. Combinatorics of Explicit Substitutions. PPDP 2016, ACM et Université de Francfort de, Sep 2018, Frankfurt am Main, France. ⟨10.1145/3236950.3236951⟩. ⟨ensl-01892388⟩
  • Pierre Lescanne, Dragisa Zunic. A Congruence Relation for Restructuring Classical Terms. 18th Italian Conference on Theoretical Computer Science, Oct 2018, Naples, Italy. pp.186-197. ⟨ensl-01892440⟩
  • Pierre Lescanne, Maciej Bendkowski. Counting Environments and Closures. FSCD 2018, Jul 2018, Oxford, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2018.11⟩. ⟨ensl-01892406⟩
  • Pierre Lescanne, Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc. A Natural Counting of Lambda Terms. SOFSEM 2016, Jan 2016, Harrachov, Czech Republic. ⟨ensl-01892447⟩
  • Pierre Lescanne, Silvia Ghilezan, Jelena Ivetic, Silvia Likavec. Intersection types fit well with resource control. 21st International Conference on Types for Proofs and Programs, May 2015, Tallinn, Estonia. ⟨ensl-01892569⟩
  • Katarzyna Grygiel, Pierre Lescanne. Counting Terms in the Binary Lambda Calculus. 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France. pp.13. ⟨ensl-00923203⟩
  • Pierre Lescanne. A simple case of rationality of escalation. 5th Conference on Algebra and Coalgebra in Computer Science, CALCO 2013, Sep 2013, Warsaw, Poland. pp.191-204. ⟨ensl-00832490⟩
  • Pierre Lescanne, Silvia Ghilezan, Jelena Ivetic, Silvia Likavec. Intersection Types for the Resource Control Lambda Calculi. Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Aug 2011, Johannesburg, South Africa. pp.116-134. ⟨ensl-00654755⟩
  • Pierre Lescanne, Silvia Ghilezan, Jelena Ivetic, Dragisa Zunic. Intuitionistic Sequent-Style Calculus with Explicit Structural Rules. Logic, Language, and Computation - 8th International Tbilisi Symposium on Logic, Language, and Computation, Sep 2009, Bakuriani, Georgia. pp.101-124. ⟨ensl-00654762⟩
  • Chafika Chettaoui, Franck Delaplace, Pierre Lescanne, Mun'delanji Vestergaard, René Vestergaard. Rewriting Game Theory as a Foundation for State-Based Models of Gene Regulation. Computational Methods in Systems Biology (CMSB), 2006, Italy. pp.257--270, ⟨10.1007/11885191_18⟩. ⟨hal-00339691⟩
  • Dan Dougherty, Pierre Lescanne, Luigi Liquori, Frédéric Lang. 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⟩. ⟨hal-01149607⟩
  • Daniel J. Dougherty, Frederic Lang, Pierre Lescanne, Luigi Liquori, Kristoffer Rose. A Generic Object-Calculus Based on Addressed Term Rewriting Systems. Proceedings of the Fourth Workshop on Explicit Substitutions Theory and Applications (WESTAPP '01), May 2001, Utrecht, Netherlands. pp.6-25. ⟨hal-01152576⟩
  • Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne. 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. ⟨hal-02193998⟩

Book sections2 documents

  • Pierre Lescanne. Common Knowledge Logic in a Higher Order Proof Assistant. Andrei Voronkov, Christoph Weidenbach. Programming Logics - Essays in Memory of Harald Ganzinger., Springer, pp.271-284, 2013, Lecture Notes in Computer Science. ⟨ensl-00869081⟩
  • Pierre Lescanne. Common knowledge logic in a higher order proof assistant. Andreï 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⟩. ⟨ensl-00199368v3⟩

Other publications1 document

  • Chafika Chettaoui, Franck Delaplace, Pierre Lescanne, Mun'delanji Vestergaard, René Vestergaard. Rewriting game theory as a foundation for sate-based models of gene regulation.. 2006. ⟨hal-00339800⟩

Preprints, Working Papers, ...24 documents

  • Pierre Lescanne. Zaionc paradox revisited. 2022. ⟨hal-03197423v6⟩
  • Pierre Lescanne. Linear random generation of Motzkin trees. 2022. ⟨hal-03674690⟩
  • Marion Créhange, Pierre Lescanne, Alain Quéré. L'informatique de Claude Pair. 2021. ⟨hal-03193950v2⟩
  • Silvia Ghilezan, Jelena Ivetić, Simona Kašterović, Pierre Lescanne. L-types for resource awareness: an implicit name approach. 2021. ⟨hal-03498420⟩
  • Pierre Lescanne, Maciej Bendkowski. Counting Environments and Closures. 2018. ⟨ensl-01700703⟩
  • Pierre Lescanne. Quantitative aspects of linear and affine closed lambda terms. 2017. ⟨ensl-01464047v5⟩
  • Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc. A NATURAL COUNTING OF LAMBDA TERMS. 2016. ⟨ensl-01159746v3⟩
  • Pierre Lescanne. Dependent Types for Extensive Games. 2016. ⟨ensl-01391418v3⟩
  • Katarzyna Grygiel, Pierre Lescanne. Counting and Generating Terms in the Binary Lambda Calculus (Extended version). 2015. ⟨ensl-01229794⟩
  • Pierre Lescanne. Boltzmann samplers for random generation of lambda terms. 2014. ⟨ensl-00979074v2⟩
  • Pierre Lescanne. Bubbles are rational. 2013. ⟨ensl-00819188⟩
  • Pierre Lescanne. An exercise on streams: convergence acceleration. 2013. ⟨ensl-00920026v2⟩
  • Silvia Ghilezan, Pierre Lescanne, Dragisa Zunic. Computational interpretation of classical logic with explicit structural rules. 2012. ⟨ensl-00681296⟩
  • Katarzyna Grygiel, Pierre Lescanne. Counting and generating lambda terms. 2012. ⟨ensl-00740034v7⟩
  • Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec. Resource control and strong normalisation (old version). 2011. ⟨ensl-00690095⟩
  • Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec. Resource control and strong normalisation. 2011. ⟨ensl-00651985v3⟩
  • Pierre Lescanne. Les crashs sont rationnels. 2011. ⟨ensl-00646546v5⟩
  • Pierre Lescanne. Rationality and Escalation in Infinite Extensive Games. 2011. ⟨ensl-00594744v4⟩
  • Pierre Lescanne. Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games. 2009. ⟨ensl-00408519⟩
  • Franck Delaplace, Pierre Lescanne. HedN Game, a Relational Framework for Network Based Cooperation. 2009. ⟨hal-00382514v2⟩
  • Pierre Lescanne. Deconstruction of Infinite Extensive Games using coinduction. 2009. ⟨ensl-00376141v2⟩
  • Pierre Lescanne. Mechanical Reasoning on Infinite Extensive Games. 2008. ⟨ensl-00278405v4⟩
  • Pierre Lescanne, Jérôme Puisségur. Dynamic Logic of Common Knowledge in a Proof Assistant. 2007. ⟨ensl-00198782⟩
  • Pierre Lescanne. CP games : a tutorial. 2007. ⟨ensl-00121361v3⟩

Reports2 documents

  • Pierre Lescanne. Intelligent escalation and the principle of relativity. [Research Report] LIP - ENS Lyon. 2014. ⟨ensl-01096264v4⟩
  • Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec. A journey through resource control lambda calculi and explicit substitution using intersection types (an account). 2011, pp.40. ⟨ensl-00823621v2⟩