Остановите войну!
for scientists:
default search action
Pierre Lescanne
- > Home > Persons > Pierre Lescanne
Publications
- 2021
- [i32]Silvia Ghilezan, Jelena Ivetic, Simona Kasterovic, Pierre Lescanne:
L-types for resource awareness: an implicit name approach. CoRR abs/2112.11062 (2021) - 2017
- [c48]Dragisa Zunic, Pierre Lescanne:
A Congruence Relation for Restructuring Classical Terms. ICTCS/CILC 2017: 186-197 - 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
- [i18]Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec:
Resource control and intersection types: an intrinsic connection. CoRR abs/1412.2219 (2014) - 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) - 2012
- [i13]Silvia Ghilezan, Pierre Lescanne, Dragisa Zunic:
Computational interpretation of classical logic with explicit structural rules. CoRR abs/1203.4754 (2012) - 2011
- [c44]Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec:
Intersection Types for the Resource Control Lambda Calculi. ICTAC 2011: 116-134 - [i8]Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec:
Resource control and strong normalisation. CoRR abs/1112.3455 (2011) - 2009
- [c43]Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Dragisa Zunic:
Intuitionistic Sequent-Style Calculus with Explicit Structural Rules. TbiLLC 2009: 101-124 - 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) - 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) - 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 - 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 - [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
- [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) - 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) - [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
- [c27]Pierre Lescanne, Jocelyne Rouyer-Degli:
Explicit Substitutions with de Bruijn's Levels. RTA 1995: 294-308 - 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) - 1991
- [j14]Hélène Kirchner, Pierre Lescanne:
Rewriting techniques and applications, RTA'91. SIGACT News 22(3): 24-30 (1991) - [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
- [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) - 1989
- [j8]Hubert Comon, Pierre Lescanne:
Equational Problems and Disunification. J. Symb. Comput. 7(3/4): 371-425 (1989) - 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
- [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 - 1986
- [c11]Isabelle Gnaedig, Pierre Lescanne:
Proving Termination of Associative Commutative Rewriting Systems by Rewriting. CADE 1986: 52-61 - 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 - 1982
- [j4]Jean-Pierre Jouannaud, Pierre Lescanne:
On Multiset Orderings. Inf. Process. Lett. 15(2): 57-63 (1982) - [c4]Jean-Pierre Jouannaud, Pierre Lescanne, F. Reinig:
Recursive Decomposition Ordering. Formal Description of Programming Concepts 1982: 331-348
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-05-02 23:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint