Pierre-Louis Curien

Publication Activity (10 Years)

Years Active: 1982-2024
Publications (10 Years): 11

Top Topics

Theorem Proving

Category Specific

Top Venues

Theor. Comput. Sci.

Appl. Categorical Struct.

Publications

Pierre-Louis Curien, Guillaume Laplante-Anfossi
Term rewriting on nestohedra. CoRR (2024)
Yijia Chen, Pierre-Louis Curien, Yuxin Deng, Min Zhang
birthday of Yuxi Fu. Theor. Comput. Sci. 945 (2023)
Pierre-Louis Curien, Jovana Obradovic
Categorified Cyclic Operads. Appl. Categorical Struct. 28 (1) (2020)
Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien
Preface. Theor. Comput. Sci. 807 (2020)
Djordje Baralic, Pierre-Louis Curien, Marina Milicevic, Jovana Obradovic, Zoran Petric, Mladen Zekic, Rade T. Zivaljevic
Proofs and surfaces. Ann. Pure Appl. Log. 171 (9) (2020)
Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien
Preface. Theor. Comput. Sci. 777 (2019)
Cédric Ho Thanh, Pierre-Louis Curien, Samuel Mimram
A Sequent Calculus for Opetopes. LICS (2019)
Pierre-Louis Curien, Samuel Mimram
Coherent Presentations of Monoidal Categories. CoRR (2017)
Pierre-Louis Curien, Samuel Mimram
Coherent Presentations of Monoidal Categories. Log. Methods Comput. Sci. 13 (3) (2017)
Pierre-Louis Curien, Gérard P. Huet, Antoine Petit
Obituary Maurice Nivat (1937-2017). Bull. EATCS 123 (2017)
Pierre-Louis Curien, Marcelo P. Fiore, Guillaume Munch-Maccagnoni
A theory of effects and resources: adjunction models and polarised calculi. POPL (2016)
Pierre-Louis Curien, Richard Garner, Martin Hofmann
Revisiting the categorical interpretation of dependent type theory. Theor. Comput. Sci. 546 (2014)
Pierre-Louis Curien
Operads, clones, and distributive laws CoRR (2012)
Pierre-Louis Curien, Claudia Faggian
An approach to innocent strategies as graphs. Inf. Comput. 214 (2012)
Pierre-Louis Curien
Preface. Theor. Comput. Sci. 412 (20) (2011)
Pierre-Louis Curien, Guillaume Munch-Maccagnoni
The Duality of Computation under Focus. IFIP TCS (2010)
Pierre-Louis Curien, Guillaume Munch-Maccagnoni
The duality of computation under focus CoRR (2010)
Jim Allen, Zena M. Ariola, Pierre-Louis Curien, Matthew Fluet, Jeffrey S. Foster, Dan Grossman, Robert Harper, Hugo Herbelin, Yannis Smaragdakis, David Walker, Steve Zdancewic
An overview of the Oregon programming languages summer school. ACM SIGPLAN Notices 44 (11) (2009)
Pierre-Louis Curien
The Joy of String Diagrams. CSL (2008)
Pierre-Louis Curien, Vincent Danos, Jean Krivine, Min Zhang
Computational self-assembly. Theor. Comput. Sci. 404 (1-2) (2008)
Pierre-Louis Curien
Definability and Full Abstraction. Electron. Notes Theor. Comput. Sci. 172 (2007)
Pierre-Louis Curien, Hugo Herbelin
Abstract machines for dialogue games CoRR (2007)
Pierre-Louis Curien, Claudia Faggian
L-Nets, Strategies and Proof-Nets. CSL (2005)
Pierre-Louis Curien
Introduction to linear logic and ludics, part II CoRR (2005)
Pierre-Louis Curien
Symmetry and interactivity in Programming CoRR (2005)
Pierre-Louis Curien
Playful, streamlike computation CoRR (2005)
Pierre-Louis Curien
Introduction to linear logic and ludics, part I CoRR (2005)
Pierre-Louis Curien
Symmetry and interactivity in programming. Bull. Symb. Log. 9 (2) (2003)
Pierre-Louis Curien
Une breve biographie scientifique de Maurice Nivat. Theor. Comput. Sci. 281 (1-2) (2002)
Pierre-Louis Curien
Preface to Locus Solum. Math. Struct. Comput. Sci. 11 (3) (2001)
Pierre-Louis Curien
Abstract Machines, Control, and Sequents. APPSEM (2000)
Pierre-Louis Curien, Gordon D. Plotkin, Glynn Winskel
Bistructures, bidomains, and linear logic. Proof, Language, and Interaction (2000)
Pierre-Louis Curien, Hugo Herbelin
The duality of computation. ICFP (2000)
Gérard Boudol, Pierre-Louis Curien, Carolina Lavatelli
A semantics for lambda calculi with resources. Math. Struct. Comput. Sci. 9 (4) (1999)
Pierre-Louis Curien, Hugo Herbelin
Computing with Abstract Böhm Trees. Fuji International Symposium on Functional and Logic Programming (1998)
Pierre-Louis Curien
Explicit substitutions: A short survey. J. Comput. Sci. Technol. 13 (6) (1998)
Pierre-Louis Curien
Abstract Böhm trees. Math. Struct. Comput. Sci. 8 (6) (1998)
Pierre-Louis Curien, Matthew Hennessy, Huimin Lin
Preface. J. Comput. Sci. Technol. 13 (6) (1998)
Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos
Strong Normalizations of Substitutions. J. Log. Comput. 6 (6) (1996)
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) (1996)
Pierre-Louis Curien, Roberto Di Cosmo
A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object. J. Funct. Program. 6 (2) (1996)
Roberto Bellucci, Martín Abadi, Pierre-Louis Curien
A Model for Formal Parametric Polymorphism: A PER Interpretation for System R. TLCA (1995)
Robert Cartwright, Pierre-Louis Curien, Matthias Felleisen
Fully Abstract Semantics for Observably Sequential Languages Inf. Comput. 111 (2) (1994)
Pierre-Louis Curien, Giorgio Ghelli
Decidability and Confluence of \beta\eta\hboxtop_\le Reduction in F_\le Inf. Comput. 109 (1/2) (1994)
Pierre-Louis Curien, Thérèse Hardin
Yet Yet a Counterexample for lambda + SP. J. Funct. Program. 4 (1) (1994)
Pierre-Louis Curien
On the Symmetry of Sequentiality. MFPS (1993)
Pierre-Louis Curien
Substitution up to Isomorphism. Fundam. Informaticae 19 (1/2) (1993)
Martín Abadi, Luca Cardelli, Pierre-Louis Curien
Formal Parametric Polymorphism. Theor. Comput. Sci. 121 (1&2) (1993)
Martín Abadi, Luca Cardelli, Pierre-Louis Curien
Formal Parametric Polymorphism. POPL (1993)
Pierre-Louis Curien
Observable Algorithms on Concrete Data Structures LICS (1992)
Pierre-Louis Curien, Giorgio Ghelli
. Math. Struct. Comput. Sci. 2 (1) (1992)
Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos
Strong Normalization of Substitutions. MFCS (1992)
Pierre-Louis Curien, Roberto Di Cosmo
A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object. ICALP (1991)
Pierre-Louis Curien
An Abstract Framework for Environment Machines. Theor. Comput. Sci. 82 (2) (1991)
Pierre-Louis Curien, Giorgio Ghelli
On Confluence for Weakly Normalizing Systems. RTA (1991)
Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy
Explicit Substitutions. J. Funct. Program. 1 (4) (1991)
Pierre-Louis Curien, Giorgio Ghelli
. TACS (1991)
Pierre-Louis Curien, Giorgio Ghelli
Coherence of Subsumption. CAAP (1990)
Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy
Explicit Substitutions. POPL (1990)
Pierre-Louis Curien, Adam Obtulowicz
Partiality, Cartesian closedness and Toposes Inf. Comput. 80 (1) (1989)
Pierre-Louis Curien
Alpha-conversion, conditions on variables and categorical logic. Stud Logica 48 (3) (1989)
Guy Cousineau, Pierre-Louis Curien, Michel Mauny
The Categorical Abstract Machine. Sci. Comput. Program. 8 (2) (1987)
Pierre-Louis Curien
Categorical Combinators Inf. Control. 69 (1-3) (1986)
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)
Pierre-Louis Curien
Categorial Combinatory Logic. ICALP (1985)
Guy Cousineau, Pierre-Louis Curien, Michel Mauny
The Categorical Abstract Machine. FPCA (1985)
Pierre-Louis Curien
Syntactic Equivalences Inducing Semantic Equivalences. European Conference on Computer Algebra (2) (1985)
Pierre-Louis Curien
Typed Categorial Combinatory Logic. TAPSOFT, Vol.1 (1985)
Gérard Berry, Pierre-Louis Curien
Sequential Algorithms on Concrete Data Structures. Theor. Comput. Sci. 20 (1982)