Pierre-Louis Curien

Affiliations:
  • CNRS - Université Paris 7, France


According to our database1, Pierre-Louis Curien authored at least 64 papers between 1982 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Term rewriting on nestohedra.
CoRR, 2024

Semantics and Syntax, Between Computer Science and Mathematics.
Proceedings of the French School of Programming, 2024

2023
Preface for the special issue of Theoretical Computer Science in honor of the 60<sup>th</sup> birthday of Yuxi Fu.
Theor. Comput. Sci., February, 2023

2020
Preface.
Theor. Comput. Sci., 2020

Proofs and surfaces.
Ann. Pure Appl. Log., 2020

Categorified Cyclic Operads.
Appl. Categorical Struct., 2020

2019
A Sequent Calculus for Opetopes.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2017
Coherent Presentations of Monoidal Categories.
Log. Methods Comput. Sci., 2017

Obituary Maurice Nivat (1937-2017).
Bull. EATCS, 2017

2016
A theory of effects and resources: adjunction models and polarised calculi.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2014
Revisiting the categorical interpretation of dependent type theory.
Theor. Comput. Sci., 2014

2012
An approach to innocent strategies as graphs.
Inf. Comput., 2012

Operads, clones, and distributive laws
CoRR, 2012

2011
Preface.
Theor. Comput. Sci., 2011

2010
The Duality of Computation under Focus.
Proceedings of the Theoretical Computer Science, 2010

2009
An overview of the Oregon programming languages summer school.
ACM SIGPLAN Notices, 2009

2008
Computational self-assembly.
Theor. Comput. Sci., 2008

The Joy of String Diagrams.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007
Definability and Full Abstraction.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Abstract machines for dialogue games
CoRR, 2007

2005
Introduction to linear logic and ludics, part II
CoRR, 2005

Introduction to linear logic and ludics, part I
CoRR, 2005

Playful, streamlike computation
CoRR, 2005

L-Nets, Strategies and Proof-Nets.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2003
Symmetry and interactivity in programming.
Bull. Symb. Log., 2003

2002
Une breve biographie scientifique de Maurice Nivat.
Theor. Comput. Sci., 2002

2001
Preface to Locus Solum.
Math. Struct. Comput. Sci., 2001

2000
The duality of computation.
Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), 2000

Bistructures, bidomains, and linear logic.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

Abstract Machines, Control, and Sequents.
Proceedings of the Applied Semantics, International Summer School, 2000

1999
A semantics for lambda calculi with resources.
Math. Struct. Comput. Sci., 1999

1998
Abstract Böhm trees.
Math. Struct. Comput. Sci., 1998

Preface.
J. Comput. Sci. Technol., 1998

Explicit substitutions: A short survey.
J. Comput. Sci. Technol., 1998

Computing with Abstract Böhm Trees.
Proceedings of the Third Fuji International Symposium on Functional and Logic Programming, 1998

Domains and lambda-calculi.
Cambridge tracts in theoretical computer science 46, Cambridge University Press, ISBN: 978-0-521-62277-6, 1998

1996
Strong Normalizations of Substitutions.
J. Log. Comput., 1996

A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object.
J. Funct. Program., 1996

Confluence Properties of Weak and Strong Calculi of Explicit Substitutions.
J. ACM, 1996

1995
A Model for Formal Parametric Polymorphism: A PER Interpretation for System R.
Proceedings of the Typed Lambda Calculi and Applications, 1995

1994
Fully Abstract Semantics for Observably Sequential Languages
Inf. Comput., June, 1994

Yet Yet a Counterexample for lambda + SP.
J. Funct. Program., 1994

Decidability and Confluence of \beta\eta\hboxtop_\le Reduction in F_\le
Inf. Comput., 1994

1993
Formal Parametric Polymorphism.
Theor. Comput. Sci., 1993

Substitution up to Isomorphism.
Fundam. Informaticae, 1993

On the Symmetry of Sequentiality.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992
Coherence of Subsumption, Minimum Typing and Type-Checking in F<sub><=</sub>.
Math. Struct. Comput. Sci., 1992

Strong Normalization of Substitutions.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Observable Algorithms on Concrete Data Structures
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991
An Abstract Framework for Environment Machines.
Theor. Comput. Sci., 1991

Explicit Substitutions.
J. Funct. Program., 1991

Subtyping + Extensionality: Confluence of beta-eta-top reduction in F<sub><=</sub>.
Proceedings of the Theoretical Aspects of Computer Software, 1991

On Confluence for Weakly Normalizing Systems.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Coherence of Subsumption.
Proceedings of the CAAP '90, 1990

1989
Partiality, Cartesian closedness and Toposes
Inf. Comput., January, 1989

Alpha-conversion, conditions on variables and categorical logic.
Stud Logica, 1989

1987
The Categorical Abstract Machine.
Sci. Comput. Program., 1987

1986
Categorical Combinators
Inf. Control., 1986

1985
Typed Categorial Combinatory Logic.
Proceedings of the Mathematical Foundations of Software Development, 1985

Combinateures, Catégoriques et Implémentation des Languages Fonctionnels.
Proceedings of the Combinators and Functional Programming Languages, 1985

Categorial Combinatory Logic.
Proceedings of the Automata, 1985

Syntactic Equivalences Inducing Semantic Equivalences.
Proceedings of the EUROCAL '85, 1985

1982
Sequential Algorithms on Concrete Data Structures.
Theor. Comput. Sci., 1982


  Loading...