Sequential Algorithms on Concrete Data Structures. - Gérard Berry; Pierre-Louis Curien (Theor. Comput. Sci., 1982)

Syntactic Equivalences Inducing Semantic Equivalences. - Pierre-Louis Curien (European Conference on Computer Algebra (2), 1985)

Categorial Combinatory Logic. - Pierre-Louis Curien (ICALP, 1985)

Combinateures, Catégoriques et Implémentation des Languages Fonctionnels. - Guy Cousineau; Pierre-Louis Curien; Michel Mauny; Ascánder Suárez (Combinators and Functional Programming Languages, 1985)

Typed Categorial Combinatory Logic. - Pierre-Louis Curien (TAPSOFT, Vol.1, 1985)

Categorical Combinators - Pierre-Louis Curien (Inf. Control., 1986)

The Categorical Abstract Machine. - Guy Cousineau; Pierre-Louis Curien; Michel Mauny (Sci. Comput. Program., 1987)

Alpha-conversion, conditions on variables and categorical logic. - Pierre-Louis Curien (Stud Logica, 1989)

Partiality, Cartesian closedness and Toposes - Pierre-Louis Curien; Adam Obtulowicz (Inf. Comput., 1989)

Coherence of Subsumption. - Pierre-Louis Curien; Giorgio Ghelli (CAAP, 1990)

A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object. - Pierre-Louis Curien; Roberto Di Cosmo (ICALP, 1991)

On Confluence for Weakly Normalizing Systems. - Pierre-Louis Curien; Giorgio Ghelli (RTA, 1991)

Subtyping + Extensionality: Confluence of beta-eta-top reduction in F<=. - Pierre-Louis Curien; Giorgio Ghelli (TACS, 1991)

Explicit Substitutions. - Martín Abadi; Luca Cardelli; Pierre-Louis Curien; Jean-Jacques Lévy (J. Funct. Program., 1991)

An Abstract Framework for Environment Machines. - Pierre-Louis Curien (Theor. Comput. Sci., 1991)

Observable Algorithms on Concrete Data Structures - Pierre-Louis Curien (LICS, 1992)

Strong Normalization of Substitutions. - Pierre-Louis Curien; Thérèse Hardin; Alejandro Ríos 001 (MFCS, 1992)

Coherence of Subsumption, Minimum Typing and Type-Checking in F<=. - Pierre-Louis Curien; Giorgio Ghelli (Math. Struct. Comput. Sci., 1992)

On the Symmetry of Sequentiality. - Pierre-Louis Curien (MFPS, 1993)

Substitution up to Isomorphism. - Pierre-Louis Curien (Fundam. Informaticae, 1993)

Formal Parametric Polymorphism. - Martín Abadi; Luca Cardelli; Pierre-Louis Curien (Theor. Comput. Sci., 1993)

Decidability and Confluence of beta eta hboxtop_ le Reduction in F_ le - Pierre-Louis Curien; Giorgio Ghelli (Inf. Comput., 1994)

Yet Yet a Counterexample for lambda + SP. - Pierre-Louis Curien; Thérèse Hardin (J. Funct. Program., 1994)

Fully Abstract Semantics for Observably Sequential Languages - Robert Cartwright; Pierre-Louis Curien; Matthias Felleisen (Inf. Comput., 1994)

A Model for Formal Parametric Polymorphism: A PER Interpretation for System R. - Roberto Bellucci; Martín Abadi; Pierre-Louis Curien (TLCA, 1995)

Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. - Pierre-Louis Curien; Thérèse Hardin; Jean-Jacques Lévy (J. ACM, 1996)

A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object. - Pierre-Louis Curien; Roberto Di Cosmo (J. Funct. Program., 1996)

Strong Normalizations of Substitutions. - Pierre-Louis Curien; Thérèse Hardin; Alejandro Ríos 001 (J. Log. Comput., 1996)

Domains and lambda-calculi. - Roberto M. Amadio; Pierre-Louis Curien (Cambridge University Press, 1998)

Computing with Abstract Böhm Trees. - Pierre-Louis Curien; Hugo Herbelin (Fuji International Symposium on Functional and Logic Programming, 1998)

Explicit substitutions: A short survey. - Pierre-Louis Curien (J. Comput. Sci. Technol., 1998)

Preface. - Pierre-Louis Curien; Matthew Hennessy; Huimin Lin (J. Comput. Sci. Technol., 1998)

Abstract Böhm trees. - Pierre-Louis Curien (Math. Struct. Comput. Sci., 1998)

A semantics for lambda calculi with resources. - Gérard Boudol; Pierre-Louis Curien; Carolina Lavatelli (Math. Struct. Comput. Sci., 1999)

Abstract Machines, Control, and Sequents. - Pierre-Louis Curien (APPSEM, 2000)

Bistructures, bidomains, and linear logic. - Pierre-Louis Curien; Gordon D. Plotkin; Glynn Winskel (Proof, Language, and Interaction, 2000)

The duality of computation. - Pierre-Louis Curien; Hugo Herbelin (ICFP, 2000)

Preface to Locus Solum. - Pierre-Louis Curien (Math. Struct. Comput. Sci., 2001)

Une breve biographie scientifique de Maurice Nivat. - Pierre-Louis Curien (Theor. Comput. Sci., 2002)

Symmetry and interactivity in programming. - Pierre-Louis Curien (Bull. Symb. Log., 2003)

L-Nets, Strategies and Proof-Nets. - Pierre-Louis Curien; Claudia Faggian (CSL, 2005)

Playful, streamlike computation - Pierre-Louis Curien (CoRR, 2005)

Introduction to linear logic and ludics, part I - Pierre-Louis Curien (CoRR, 2005)

Introduction to linear logic and ludics, part II - Pierre-Louis Curien (CoRR, 2005)

Abstract machines for dialogue games - Pierre-Louis Curien; Hugo Herbelin (CoRR, 2007)

Definability and Full Abstraction. - Pierre-Louis Curien (Computation, Meaning, and Logic, 2007)

The Joy of String Diagrams. - Pierre-Louis Curien (CSL, 2008)

Computational self-assembly. - Pierre-Louis Curien; Vincent Danos; Jean Krivine; Min Zhang 019 (Theor. Comput. Sci., 2008)

An overview of the Oregon programming languages summer school. - Jim Allen; Zena M. Ariola; Pierre-Louis Curien; Matthew Fluet; Jeffrey S. Foster; Dan Grossman; Robert Harper 001; Hugo Herbelin; Yannis Smaragdakis; David Walker 001; Steve Zdancewic (ACM SIGPLAN Notices, 2009)

The Duality of Computation under Focus. - Pierre-Louis Curien; Guillaume Munch-Maccagnoni (IFIP TCS, 2010)

Preface. - Pierre-Louis Curien (Theor. Comput. Sci., 2011)

Operads, clones, and distributive laws - Pierre-Louis Curien (CoRR, 2012)

An approach to innocent strategies as graphs. - Pierre-Louis Curien; Claudia Faggian (Inf. Comput., 2012)

Revisiting the categorical interpretation of dependent type theory. - Pierre-Louis Curien; Richard Garner; Martin Hofmann 001 (Theor. Comput. Sci., 2014)

A theory of effects and resources: adjunction models and polarised calculi. - Pierre-Louis Curien; Marcelo P. Fiore; Guillaume Munch-Maccagnoni (POPL, 2016)

Obituary Maurice Nivat (1937-2017). - Pierre-Louis Curien; Gérard P. Huet; Antoine Petit 001 (Bull. EATCS, 2017)

Coherent Presentations of Monoidal Categories. - Pierre-Louis Curien; Samuel Mimram (Log. Methods Comput. Sci., 2017)

A Sequent Calculus for Opetopes. - Cédric Ho Thanh; Pierre-Louis Curien; Samuel Mimram (LICS, 2019)

Categorified Cyclic Operads. - Pierre-Louis Curien; Jovana Obradovic (Appl. Categorical Struct., 2020)

Proofs and surfaces. - Djordje Baralic; Pierre-Louis Curien; Marina Milicevic; Jovana Obradovic; Zoran Petric; Mladen Zekic; Rade T. Zivaljevic (Ann. Pure Appl. Log., 2020)

Preface. - Giorgio Ausiello; Lila Kari; Grzegorz Rozenberg; Donald Sannella; Paul G. Spirakis; Pierre-Louis Curien (Theor. Comput. Sci., 2020)

Preface for the special issue of Theoretical Computer Science in honor of the 60th birthday of Yuxi Fu. - Yijia Chen; Pierre-Louis Curien; Yuxin Deng; Min Zhang 019 (Theor. Comput. Sci., 2023)

Semantics and Syntax, Between Computer Science and Mathematics. - Pierre-Louis Curien (The French School of Programming, 2024)

Term rewriting on nestohedra. - Pierre-Louis Curien; Guillaume Laplante-Anfossi (CoRR, 2024)

Foreword. - Pierre-Louis Curien (Math. Struct. Comput. Sci., 2024)