default search action
Pierre-Louis Curien
Person information
- affiliation: CNRS - Université Paris 7, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [p1]Pierre-Louis Curien:
Semantics and Syntax, Between Computer Science and Mathematics. The French School of Programming 2024: 147-174 - [i9]Pierre-Louis Curien, Guillaume Laplante-Anfossi:
Term rewriting on nestohedra. CoRR abs/2403.15987 (2024) - 2023
- [j35]Yijia Chen, Pierre-Louis Curien, Yuxin Deng, Min Zhang:
Preface for the special issue of Theoretical Computer Science in honor of the 60th birthday of Yuxi Fu. Theor. Comput. Sci. 945: 113720 (2023) - 2020
- [j34]Pierre-Louis Curien, Jovana Obradovic
:
Categorified Cyclic Operads. Appl. Categorical Struct. 28(1): 59-112 (2020) - [j33]Djordje Baralic, Pierre-Louis Curien, Marina Milicevic
Proofs and surfaces. Ann. Pure Appl. Log. 171(9): 102845 (2020) - [j32]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella
Preface. Theor. Comput. Sci. 807: 1-2 (2020)
2010 – 2019
- 2019
- [j31]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella
Preface. Theor. Comput. Sci. 777: 1-2 (2019) - [c25]Cédric Ho Thanh, Pierre-Louis Curien, Samuel Mimram:
A Sequent Calculus for Opetopes. LICS 2019: 1-12 - 2017
- [j30]Pierre-Louis Curien, Gérard P. Huet, Antoine Petit:
Obituary Maurice Nivat (1937-2017). Bull. EATCS 123 (2017) - [j29]Pierre-Louis Curien, Samuel Mimram:
Coherent Presentations of Monoidal Categories. Log. Methods Comput. Sci. 13(3) (2017) - [i8]Pierre-Louis Curien, Samuel Mimram:
Coherent Presentations of Monoidal Categories. CoRR abs/1705.03553 (2017) - 2016
- [c24]Pierre-Louis Curien, Marcelo P. Fiore, Guillaume Munch-Maccagnoni:
A theory of effects and resources: adjunction models and polarised calculi. POPL 2016: 44-56 - 2014
- [j28]Pierre-Louis Curien, Richard Garner
Revisiting the categorical interpretation of dependent type theory. Theor. Comput. Sci. 546: 99-119 (2014) - 2012
- [j27]Pierre-Louis Curien, Claudia Faggian:
An approach to innocent strategies as graphs. Inf. Comput. 214: 119-155 (2012) - [i7]Pierre-Louis Curien:
Operads, clones, and distributive laws. CoRR abs/1205.3050 (2012) - 2011
- [j26]Pierre-Louis Curien:
Preface. Theor. Comput. Sci. 412(20): 1853-1859 (2011) - 2010
- [c23]Pierre-Louis Curien, Guillaume Munch-Maccagnoni:
The Duality of Computation under Focus. IFIP TCS 2010: 165-181 - [i6]Pierre-Louis Curien, Guillaume Munch-Maccagnoni:
The duality of computation under focus. CoRR abs/1006.2283 (2010)
2000 – 2009
- 2009
- [j25]Jim Allen, Zena M. Ariola, Pierre-Louis Curien, Matthew Fluet, Jeffrey S. Foster, Dan Grossman, Robert Harper, Hugo Herbelin, Yannis Smaragdakis, David Walker
An overview of the Oregon programming languages summer school. ACM SIGPLAN Notices 44(11): 1-3 (2009) - [e3]Pierre-Louis Curien:
Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings. Lecture Notes in Computer Science 5608, Springer 2009, ISBN 978-3-642-02272-2 [contents] - 2008
- [j24]Pierre-Louis Curien, Vincent Danos, Jean Krivine, Min Zhang:
Computational self-assembly. Theor. Comput. Sci. 404(1-2): 61-75 (2008) - [c22]Pierre-Louis Curien:
The Joy of String Diagrams. CSL 2008: 15-22 - 2007
- [c21]Pierre-Louis Curien:
Definability and Full Abstraction. Computation, Meaning, and Logic 2007: 301-310 - [i5]Pierre-Louis Curien, Hugo Herbelin:
Abstract machines for dialogue games. CoRR abs/0706.2544 (2007) - 2005
- [c20]Pierre-Louis Curien, Claudia Faggian:
L-Nets, Strategies and Proof-Nets. CSL 2005: 167-183 - [i4]Pierre-Louis Curien:
Playful, streamlike computation. CoRR abs/cs/0501033 (2005) - [i3]Pierre-Louis Curien:
Symmetry and interactivity in Programming. CoRR abs/cs/0501034 (2005) - [i2]Pierre-Louis Curien:
Introduction to linear logic and ludics, part I. CoRR abs/cs/0501035 (2005) - [i1]Pierre-Louis Curien:
Introduction to linear logic and ludics, part II. CoRR abs/cs/0501039 (2005) - 2003
- [j23]Pierre-Louis Curien:
Symmetry and interactivity in programming. Bull. Symb. Log. 9(2): 169-180 (2003) - 2002
- [j22]Pierre-Louis Curien:
Une breve biographie scientifique de Maurice Nivat. Theor. Comput. Sci. 281(1-2): 3-23 (2002) - 2001
- [j21]Pierre-Louis Curien:
Preface to Locus Solum. Math. Struct. Comput. Sci. 11(3): 299-300 (2001) - 2000
- [c19]Pierre-Louis Curien:
Abstract Machines, Control, and Sequents. APPSEM 2000: 123-136 - [c18]Pierre-Louis Curien, Gordon D. Plotkin, Glynn Winskel:
Bistructures, bidomains, and linear logic. Proof, Language, and Interaction 2000: 21-54 - [c17]Pierre-Louis Curien, Hugo Herbelin:
The duality of computation. ICFP 2000: 233-243
1990 – 1999
- 1999
- [j20]Gérard Boudol, Pierre-Louis Curien, Carolina Lavatelli:
A semantics for lambda calculi with resources. Math. Struct. Comput. Sci. 9(4): 437-482 (1999) - 1998
- [b1]Roberto M. Amadio, Pierre-Louis Curien:
Domains and lambda-calculi. Cambridge tracts in theoretical computer science 46, Cambridge University Press 1998, ISBN 978-0-521-62277-6, pp. I-XIII, 1-484 - [j19]Pierre-Louis Curien, Matthew Hennessy, Huimin Lin:
Preface. J. Comput. Sci. Technol. 13(6): 481 (1998) - [j18]Pierre-Louis Curien:
Explicit substitutions: A short survey. J. Comput. Sci. Technol. 13(6): 562-563 (1998) - [j17]Pierre-Louis Curien:
Abstract Böhm trees. Math. Struct. Comput. Sci. 8(6): 559-591 (1998) - [c16]Pierre-Louis Curien, Hugo Herbelin:
Computing with Abstract Böhm Trees. Fuji International Symposium on Functional and Logic Programming 1998: 20-39 - 1996
- [j16]Pierre-Louis Curien, Thérèse Hardin, Jean-Jacques Lévy:
Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. J. ACM 43(2): 362-397 (1996) - [j15]Pierre-Louis Curien, Roberto Di Cosmo:
A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object. J. Funct. Program. 6(2): 299-327 (1996) - [j14]Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos:
Strong Normalizations of Substitutions. J. Log. Comput. 6(6): 799-817 (1996) - 1995
- [c15]Roberto Bellucci, Martín Abadi, Pierre-Louis Curien:
A Model for Formal Parametric Polymorphism: A PER Interpretation for System R. TLCA 1995: 32-46 - 1994
- [j13]Pierre-Louis Curien, Giorgio Ghelli
Decidability and Confluence of \beta\eta\hboxtop_\le Reduction in F_\le. Inf. Comput. 109(1/2): 57-114 (1994) - [j12]Robert Cartwright, Pierre-Louis Curien, Matthias Felleisen:
Fully Abstract Semantics for Observably Sequential Languages. Inf. Comput. 111(2): 297-401 (1994) - [j11]Pierre-Louis Curien, Thérèse Hardin:
Yet Yet a Counterexample for lambda + SP. J. Funct. Program. 4(1): 113-115 (1994) - 1993
- [j10]Pierre-Louis Curien:
Substitution up to Isomorphism. Fundam. Informaticae 19(1/2): 51-85 (1993) - [j9]Martín Abadi, Luca Cardelli
Formal Parametric Polymorphism. Theor. Comput. Sci. 121(1&2): 9-58 (1993) - [c14]Pierre-Louis Curien:
On the Symmetry of Sequentiality. MFPS 1993: 29-71 - [c13]Martín Abadi, Luca Cardelli, Pierre-Louis Curien:
Formal Parametric Polymorphism. POPL 1993: 157-170 - 1992
- [j8]Pierre-Louis Curien, Giorgio Ghelli:
Coherence of Subsumption, Minimum Typing and Type-Checking in F<=. Math. Struct. Comput. Sci. 2(1): 55-91 (1992) - [c12]Pierre-Louis Curien:
Observable Algorithms on Concrete Data Structures. LICS 1992: 432-443 - [c11]Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos:
Strong Normalization of Substitutions. MFCS 1992: 209-217 - 1991
- [j7]Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy:
Explicit Substitutions. J. Funct. Program. 1(4): 375-416 (1991) - [j6]Pierre-Louis Curien:
An Abstract Framework for Environment Machines. Theor. Comput. Sci. 82(2): 389-402 (1991) - [c10]Pierre-Louis Curien, Roberto Di Cosmo:
A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object. ICALP 1991: 291-302 - [c9]Pierre-Louis Curien, Giorgio Ghelli:
On Confluence for Weakly Normalizing Systems. RTA 1991: 215-225 - [c8]Pierre-Louis Curien, Giorgio Ghelli:
Subtyping + Extensionality: Confluence of beta-eta-top reduction in F<=. TACS 1991: 731-749 - [e2]David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew M. Pitts, Axel Poigné, David E. Rydeheard:
Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings. Lecture Notes in Computer Science 530, Springer 1991, ISBN 3-540-54495-X [contents] - 1990
- [c7]Pierre-Louis Curien, Giorgio Ghelli:
Coherence of Subsumption. CAAP 1990: 132-146 - [c6]Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy:
Explicit Substitutions. POPL 1990: 31-46
1980 – 1989
- 1989
- [j5]Pierre-Louis Curien, Adam Obtulowicz:
Partiality, Cartesian closedness and Toposes. Inf. Comput. 80(1): 50-95 (1989) - [j4]Pierre-Louis Curien:
Alpha-conversion, conditions on variables and categorical logic. Stud Logica 48(3): 319-360 (1989) - 1987
- [j3]Guy Cousineau, Pierre-Louis Curien, Michel Mauny:
The Categorical Abstract Machine. Sci. Comput. Program. 8(2): 173-202 (1987) - 1986
- [j2]Pierre-Louis Curien:
Categorical Combinators. Inf. Control. 69(1-3): 188-254 (1986) - [e1]Guy Cousineau, Pierre-Louis Curien, Bernard J. Robinet:
Combinators and Functional Programming Languages, Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985, Proceedings. Lecture Notes in Computer Science 242, Springer 1986, ISBN 3-540-17184-3 [contents] - 1985
- [c5]Pierre-Louis Curien:
Syntactic Equivalences Inducing Semantic Equivalences. European Conference on Computer Algebra (2) 1985: 168-178 - [c4]Guy Cousineau, Pierre-Louis Curien, Michel Mauny:
The Categorical Abstract Machine. FPCA 1985: 50-64 - [c3]Pierre-Louis Curien:
Categorial Combinatory Logic. ICALP 1985: 130-139 - [c2]Guy Cousineau, Pierre-Louis Curien, Michel Mauny, Ascánder Suárez:
Combinateures, Catégoriques et Implémentation des Languages Fonctionnels. Combinators and Functional Programming Languages 1985: 85-103 - [c1]Pierre-Louis Curien:
Typed Categorial Combinatory Logic. TAPSOFT, Vol.1 1985: 157-172 - 1982
- [j1]Gérard Berry, Pierre-Louis Curien:
Sequential Algorithms on Concrete Data Structures. Theor. Comput. Sci. 20: 265-321 (1982)
Coauthor Index
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-08-08 19:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: