Остановите войну!
for scientists:
default search action
Pierre Lescanne
- > Home > Persons > Pierre Lescanne
Publications
- 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) - 2020
- [i31]Pierre Lescanne:
Extensive Infinite Games and Escalation, an exercise in Agda. CoRR abs/2006.15137 (2020) - 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) - 2017
- [i28]Pierre Lescanne:
Quantitative aspects of linear and affine closed lambda terms. CoRR abs/1702.03085 (2017) - 2016
- [i26]Pierre Lescanne:
Dependent Types for Extensive Games. CoRR abs/1611.06101 (2016) - 2015
- [i25]Pierre Lescanne:
Intelligent escalation and the principle of relativity. CoRR abs/1505.07212 (2015) - [i22]Pierre Lescanne:
The risk of divergence. CoRR abs/1512.07010 (2015) - 2014
- [i19]Pierre Lescanne:
Boltzmann samplers for random generation of lambda terms. CoRR abs/1404.3875 (2014) - 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) - [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) - 2011
- [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) - 2009
- [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
- [i4]Pierre Lescanne:
(Mechanical) Reasoning on Infinite Extensive Games. CoRR abs/0805.1798 (2008) - 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) - [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) - 1996
- [c31]Pierre Lescanne:
Calculi of Explicit Substitutions: New Results. APPIA-GULP-PRODE 1996: 309-328 - 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 - 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
- [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 - 1991
- [c22]Pierre Lescanne:
Rewrite Orderings and Termination of Rewrite Systems. MFCS 1991: 17-27 - 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 - 1989
- [j9]Pierre Lescanne:
Well quasi-ordering in a paper by Maurice Janet. Bull. EATCS 39: 185-188 (1989) - [c18]Pierre Lescanne:
Completion Procedures as Transition Rules + Control. TAPSOFT, Vol.1 1989: 28-41 - 1987
- [c17]Pierre Lescanne:
Current Trends in Rewriting Techniques and Related Problems. Trends in Computer Algebra 1987: 38-51 - [c14]Pierre Lescanne:
REVE: A Rewrite Rule Laboratory. STACS 1987: 482-483 - [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) - [c10]Pierre Lescanne:
REVE a Rewrite Rule Laboratory. CADE 1986: 695-696 - 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) - [c5]Pierre Lescanne:
Computer Experiments with the Reve Term Rewriting System Generator. POPL 1983: 99-108 - 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) - 1981
- [c3]Pierre Lescanne:
Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems. IJCAI 1981: 548-550 - 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)
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-04-21 17:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint