Pierre-Louis Curien

Guillaume Laplante-Anfossi

CoRR, 2024

Semantics and Syntax, Between Computer Science and Mathematics.

[BibT_eX]

[DOI]

Proceedings of the French School of Programming, 2024

2023

Preface for the special issue of Theoretical Computer Science in honor of the 60th birthday of Yuxi Fu.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

2020

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Proofs and surfaces.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2020

Categorified Cyclic Operads.

[BibT_eX]

[DOI]

Jovana Obradovic

Appl. Categorical Struct., 2020

2019

A Sequent Calculus for Opetopes.

[BibT_eX]

[DOI]

Cédric Ho Thanh

Samuel Mimram

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2017

Coherent Presentations of Monoidal Categories.

[BibT_eX]

[DOI]

Samuel Mimram

Log. Methods Comput. Sci., 2017

Obituary Maurice Nivat (1937-2017).

[BibT_eX]

[DOI]

Gérard P. Huet

Antoine Petit

Bull. EATCS, 2017

2016

A theory of effects and resources: adjunction models and polarised calculi.

[BibT_eX]

[DOI]

Guillaume Munch-Maccagnoni

Marcelo P. Fiore

Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2014

Revisiting the categorical interpretation of dependent type theory.

[BibT_eX]

[DOI]

Richard Garner

Martin Hofmann

Theor. Comput. Sci., 2014

2012

An approach to innocent strategies as graphs.

[BibT_eX]

[DOI]

Claudia Faggian

Inf. Comput., 2012

Operads, clones, and distributive laws

[BibT_eX]

[DOI]

CoRR, 2012

2011

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2010

The Duality of Computation under Focus.

[BibT_eX]

[DOI]

Guillaume Munch-Maccagnoni

Proceedings of the Theoretical Computer Science, 2010

2009

An overview of the Oregon programming languages summer school.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 2009

2008

Computational self-assembly.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

The Joy of String Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007

Definability and Full Abstraction.

[BibT_eX]

[DOI]

Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Abstract machines for dialogue games

[BibT_eX]

[DOI]

Hugo Herbelin

CoRR, 2007

2005

Introduction to linear logic and ludics, part II

[BibT_eX]

[DOI]

CoRR, 2005

Introduction to linear logic and ludics, part I

[BibT_eX]

[DOI]

CoRR, 2005

Playful, streamlike computation

[BibT_eX]

[DOI]

CoRR, 2005

L-Nets, Strategies and Proof-Nets.

[BibT_eX]

[DOI]

Claudia Faggian

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2003

Symmetry and interactivity in programming.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2003

2002

Une breve biographie scientifique de Maurice Nivat.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2001

Preface to Locus Solum.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2001

2000

The duality of computation.

[BibT_eX]

[DOI]

Hugo Herbelin

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

Bistructures, bidomains, and linear logic.

[BibT_eX]

Gordon D. Plotkin

Glynn Winskel

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

Abstract Machines, Control, and Sequents.

[BibT_eX]

[DOI]

Proceedings of the Applied Semantics, International Summer School, 2000

1999

A semantics for lambda calculi with resources.

[BibT_eX]

[DOI]

Gérard Boudol

Carolina Lavatelli

Math. Struct. Comput. Sci., 1999

1998

Abstract Böhm trees.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1998

Preface.

[BibT_eX]

[DOI]

Matthew Hennessy

Huimin Lin

J. Comput. Sci. Technol., 1998

Explicit substitutions: A short survey.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 1998

Computing with Abstract Böhm Trees.

[BibT_eX]

Hugo Herbelin

Proceedings of the Third Fuji International Symposium on Functional and Logic Programming, 1998

Domains and lambda-calculi.

[BibT_eX]

Roberto M. Amadio

Cambridge tracts in theoretical computer science 46, Cambridge University Press, ISBN: 978-0-521-62277-6, 1998

1996

Strong Normalizations of Substitutions.

[BibT_eX]

[DOI]

Alejandro Ríos

J. Log. Comput., 1996

A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object.

[BibT_eX]

[DOI]

Roberto Di Cosmo

J. Funct. Program., 1996

Confluence Properties of Weak and Strong Calculi of Explicit Substitutions.

[BibT_eX]

[DOI]

Jean-Jacques Lévy

J. ACM, 1996

1995

A Model for Formal Parametric Polymorphism: A PER Interpretation for System R.

[BibT_eX]

[DOI]

Roberto Bellucci

Martín Abadi

Proceedings of the Typed Lambda Calculi and Applications, 1995

1994

Fully Abstract Semantics for Observably Sequential Languages

[BibT_eX]

[DOI]

Robert Cartwright

Matthias Felleisen

Inf. Comput., June, 1994

Yet Yet a Counterexample for lambda + SP.

[BibT_eX]

[DOI]

J. Funct. Program., 1994

Decidability and Confluence of \beta\eta\hboxtop_\le Reduction in F_\le

[BibT_eX]

[DOI]

Inf. Comput., 1994

1993

Formal Parametric Polymorphism.

[BibT_eX]

[DOI]

Martín Abadi

Luca Cardelli

Theor. Comput. Sci., 1993

Substitution up to Isomorphism.

[BibT_eX]

Fundam. Informaticae, 1993

On the Symmetry of Sequentiality.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992

Coherence of Subsumption, Minimum Typing and Type-Checking in F<=.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1992

Strong Normalization of Substitutions.

[BibT_eX]

[DOI]

Alejandro Ríos

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Observable Algorithms on Concrete Data Structures

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991

An Abstract Framework for Environment Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Explicit Substitutions.

[BibT_eX]

[DOI]

J. Funct. Program., 1991

Subtyping + Extensionality: Confluence of beta-eta-top reduction in F<=.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Software, 1991

On Confluence for Weakly Normalizing Systems.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object.

[BibT_eX]

[DOI]

Roberto Di Cosmo

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

Coherence of Subsumption.

[BibT_eX]

[DOI]

Proceedings of the CAAP '90, 1990

1989

Partiality, Cartesian closedness and Toposes

[BibT_eX]

[DOI]

Adam Obtulowicz

Inf. Comput., January, 1989

Alpha-conversion, conditions on variables and categorical logic.

[BibT_eX]

[DOI]

Stud Logica, 1989

1987

The Categorical Abstract Machine.

[BibT_eX]

[DOI]

Guy Cousineau

Michel Mauny

Sci. Comput. Program., 1987

1986

Categorical Combinators

[BibT_eX]

[DOI]

Inf. Control., 1986

1985

Typed Categorial Combinatory Logic.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Software Development, 1985

Combinateures, Catégoriques et Implémentation des Languages Fonctionnels.

[BibT_eX]

[DOI]

Proceedings of the Combinators and Functional Programming Languages, 1985

Categorial Combinatory Logic.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1985

Syntactic Equivalences Inducing Semantic Equivalences.

[BibT_eX]

[DOI]

Proceedings of the EUROCAL '85, 1985

1982

Sequential Algorithms on Concrete Data Structures.

[BibT_eX]

[DOI]

Gérard Berry