Pierre Lescanne
Présentation
Pierre Lescanne is emeritus professor at Ecole normale superieure de He graduated at the University of Nancy (France) where he obtained a 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. ==================================================================== 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)
Lyon (France) since 2012.
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
Five publications
Publications
Publications
|
|
Combinatorics of Explicit SubstitutionsPPDP 2016, ACM et Université de Francfort de, Sep 2018, Frankfurt am Main, France. ⟨10.1145/3236950.3236951⟩ |
A Congruence Relation for Restructuring Classical Terms18th Italian Conference on Theoretical Computer Science, Oct 2018, Naples, Italy. pp.186-197 |
|
Counting Environments and ClosuresFSCD 2018, Jul 2018, Oxford, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2018.11⟩ |
|
A Natural Counting of Lambda TermsSOFSEM 2016, Jan 2016, Harrachov, Czech Republic |
|
Intersection types fit well with resource control21st International Conference on Types for Proofs and Programs, May 2015, Tallinn, Estonia |
|
|
|
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 |
|
|
A simple case of rationality of escalation5th Conference on Algebra and Coalgebra in Computer Science, CALCO 2013, Sep 2013, Warsaw, Poland. pp.191-204 |
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 |
|
Intersection Types for the Resource Control Lambda CalculiTheoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Aug 2011, Johannesburg, South Africa. pp.116-134 |
|
|
|
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⟩ |
|
|
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⟩ |
|
|
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 |
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 |
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 |
|
|
|
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⟩ |
|
|
Intelligent escalation and the principle of relativity[Research Report] LIP - ENS Lyon. 2014 |
|
|
A journey through resource control lambda calculi and explicit substitution using intersection types (an account)2011, pp.40 |