M.: Computational self-assembly (2008)
Pierre-louis Curien, Vincent Danos, Jean Krivine, Min Zhang
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language κ. That language is primarily meant as a visual...
M.: Computational self-assembly (2008)
Pierre-louis Curien, Vincent Danos, Jean Krivine, Min Zhang
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language κ. That language is primarily meant as a visual...
Operads, clones, and distributive laws (2008)
Abstract We show how non-symmetric operads (or multicategories), sym-metric operads, and clones, arise from three suitable monads on Cat, each extending to a monad on profunctors thanks to a...
Bistructures, Bidomains and Linear Logic (2007)
Pierre-Louis Curien, Gordon Plotkin, Glynn Winskel, Glynn Winskel Brics
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of causal dependency is...
Une breve biographie scientique de (2007)
Maurice Nivat, Pierre-louis Curien
Warning. The main body of this short biography is written in French. An extended summary in English is given next. An even shorter biography Maurice Nivat was born on December 21, 1937. His parents...
Lambda-calcul et domaines (2007)
-calcul. Lorsqu'on ecrit une fonction, par exemple
Abstract machines for dialogue games (2007)
Curien, Pierre-Louis, Herbelin, Hugo
The notion of abstract Boehm tree has arisen as an operationally-oriented distillation of works on game semantics, and has been investigated in two papers. This paper revisits the notion, providing...
Computational self-assembly (2007)
Curien, Pierre-Louis, Danos, Vincent, Krivine, Jean, Zhang, Min
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language kappa. That language is primarily meant as a...
Computational self-assembly (2007)
Curien, Pierre-Louis, Danos, Vincent, Krivine, Jean, Zhang, Min
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language kappa. That language is primarily meant as a...
Introduction to linear logic and ludics, part II (2006)
This paper is the second part of an introduction to linear logic and ludics, both due to Girard. It is devoted to proof nets, in the limited, yet central, framework of multiplicative linear logic and...
An approach to innocent strategies as graphs (2006)
Curien, Pierre-Louis, Faggian, Claudia
This paper proposes an approach for extending to graphs the close relation between proofs and innocent strategies. We work in the setting of L-nets, introduced by Faggian and Maurel as a game model...
Abstract machines for dialogue games (2006)
Curien, Pierre-Louis, Herbelin, Hugo
The notion of abstract Boehm tree has arisen as an operationally-oriented distillation of works on game semantics, and has been investigated in two papers. This paper revisits the notion, providing...
An approach to innocent strategies as graphs (2006)
Curien, Pierre-Louis, Faggian, Claudia
This paper proposes an approach for extending to graphs the close relation between proofs and innocent strategies. We work in the setting of L-nets, introduced by Faggian and Maurel as a game model...
Abstract machines for dialogue games (2006)
Curien, Pierre-Louis, Herbelin, Hugo
The notion of abstract Boehm tree has arisen as an operationally-oriented distillation of works on game semantics, and has been investigated in two papers. This paper revisits the notion, providing...
Introduction to linear logic and ludics, part II (2006)
This paper is the second part of an introduction to linear logic and ludics, both due to Girard. It is devoted to proof nets, in the limited, yet central, framework of multiplicative linear logic and...
Operads, clones, and distributive laws (2006)
We show how non-symmetric operads (or multicategories), symmetric operads, and clones, arise from three suitable monads on Cat, each extending to a monad on profunctors thanks to a distributive law....
Introduction to linear logic and ludics, part II (2005)
This paper is the second part of an introduction to linear logic and ludics, both due to Girard. It is devoted to proof nets, in the limited, yet central, framework of multiplicative linear logic and...
Introduction to linear logic and ludics, part II (2005)
This paper is the second part of an introduction to linear logic and ludics, both due to Girard. It is devoted to proof nets, in the limited, yet central, framework of multiplicative linear logic and...
Introduction to linear logic and ludics, part II (2005)
This paper is the second part of an introduction to linear logic and ludics, both due to Girard. It is devoted to proof nets, in the limited, yet central, framework of multiplicative linear logic and...
Playful, streamlike computation (2005)
We offer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation -- that is, computation of successive bits of information upon request. The core...
Symmetry and interactivity in Programming (2005)
We recall some of the early occurrences of the notions of interactivity and symmetry in the operational and denotational semantics of programming languages. We suggest some connections with ludics.
Introduction to linear logic and ludics, part I (2005)
This two-parts paper offers a survey of linear logic and ludics, which were introduced by Girard in 1986 and 2001, respectively. Both theories revisit mathematical logic from first principles, with...
Introduction to linear logic and ludics, part I (2005)
This two-parts paper offers a survey of linear logic and ludics, which were introduced by Girard in 1986 and 2001, respectively. Both theories revisit mathematical logic from first principles, with...
Introduction to linear logic and ludics, part I (2005)
This two-parts paper offers a survey of linear logic and ludics, which were introduced by Girard in 1986 and 2001, respectively. Both theories revisit mathematical logic from first principles, with...
Introduction to linear logic and ludics, part I (2005)
This two-parts paper offers a survey of linear logic and ludics, which were introduced by Girard in 1986 and 2001, respectively. Both theories revisit mathematical logic from first principles, with...
Introduction to linear logic and ludics, part I (2005)
This two-parts paper offers a survey of linear logic and ludics, which were introduced by Girard in 1986 and 2001, respectively. Both theories revisit mathematical logic from first principles, with...
L-nets, strategies and proof-nets (2005)
Pierre-louis Curien, Claudia Faggian
Abstract. We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying an...
Sequential algorithms as bistable maps (2004)
We exhibit Cartwright-Curien-Felleisen's model of observably sequential algorithms as a full subcategory of Laird's bistable biorders, thereby reconciling two views of functions:...
Sequential algorithms as bistable maps (2004)
We exhibit Cartwright-Curien-Felleisen's model of observably sequential algorithms as a full subcategory of Laird's bistable biorders, thereby reconciling two views of functions:...
Sequential Algorithms as Bistable Maps (2004)
In this short note, triggered by [5, 6], I exhibit the model of sequential algorithms as a full subcategory of Laird's bistable bi-orders (without reference to the simple type hierarchy over a...
Symmetry and interactivity in Programming (2003)
We recall some of the early occurrences of the notions of interactivity and symmetry in the operational and denotational semantics of programming languages. We suggest some connections with ludics.
Playful, streamlike computation (2003)
We offer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation - that is, computation of successive bits of information upon request. The core...
Symmetry and interactivity in Programming (2003)
We recall some of the early occurrences of the notions of interactivity and symmetry in the operational and denotational semantics of programming languages. We suggest some connections with ludics.
Playful, streamlike computation (2003)
We offer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation - that is, computation of successive bits of information upon request. The core...
Symmetry and interactivity in Programming (2003)
We recall some of the early occurrences of the notions of interactivity and symmetry in the operational and denotational semantics of programming languages. We suggest some connections with ludics.
Playful, streamlike computation (2003)
We offer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation - that is, computation of successive bits of information upon request. The core...
Symmetry and interactivity in Programming (2003)
We recall some of the early occurrences of the notions of interactivity and symmetry in the operational and denotational semantics of programming languages. We suggest some connections with ludics.
Playful, streamlike computation (2003)
We offer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation - that is, computation of successive bits of information upon request. The core...
Playful, Streamlike Computation (2003)
We oer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation { that is, computation of successive bits of information upon request. The core of...
Playful, streamlike computation (2003)
We offer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation – that is, computation of successive bits of information upon request. The core...
Bistructures, Bidomains and Linear Logic (2000)
Curien, Pierre-Louis, Plotkin, Gordon, Winskel, Glynn
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an order-extensional setting. The partial order of causal dependency is...
Bistructures, Bidomains and Linear Logic (2000)
Curien, Pierre-Louis, Plotkin, Gordon, Winskel, Glynn
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an order- extensional setting. The partial order of causal dependency is...
The duality of computation (2000)
Herbelin, Hugo, Curien, Pierre-Louis
We present the lambda-bar-mu-mu-tilde-calculus, a syntax for lambda-calculus + control operators exhibiting symmetries such as program/context and call-by-name/call-by-value. This calculus is derived...
The duality of computation (2000)
Herbelin, Hugo, Curien, Pierre-Louis
We present the lambda-bar-mu-mu-tilde-calculus, a syntax for lambda-calculus + control operators exhibiting symmetries such as program/context and call-by-name/call-by-value. This calculus is derived...
The Duality of Computation (2000)
Pierre-Louis Curien, Hugo Herbelin
We present the ~-calculus, a syntax for -calculus + control operators exhibiting symmetries such as program/context and call-by-name/call-by-value. This calculus is derived from implicational...
Confluence properties of weak and strong calculi of explicit substitutions (1996)
Categorical combinators [12, 21, 43] and more recently oe-calculus [1, 23], have been introduced to provide an explicit treatment of substitutions in the-calculus. We reintroduce here the ingredients...
Confluence properties of Weak and Strong Calculi of Explicit Substitutions (1996)
Pierre-Louis Curien, Thérèse Hardin, Jean-Jacques Lévy
Categorical combinators [12, 21, 43] and more recently oe-calculus [1, 23], have been introduced to provide an explicit treatment of substitutions in the -calculus. We reintroduce here the...
A Model for Formal Parametric Polymorphism: a Per Interpretation for System R (1995)
Uperieure S Ormale, N Ecole, Pierre-Louis Curien, Martin Abadi, Martin Abadi, Roberto Bellucci, ...
System R is an extension of system F that formalizes Reynolds' notion of relational parametricity. In this paper we describe a semantics for system R. As a first step, we give a careful and...
A Model for Formal Parametric Polymorphism: A PER Interpretation for System R (1995)
Roberto Bellucci, Martin Abadi, Pierre-Louis Curien
System R is an extension of system F that formalizes Reynolds' notion of relational parametricity. In system R, considerably more lambda-terms can be proved equal than in system F: for example,...
Selected domains and lambda calculi (1994)
Amadio, Roberto M., Curien, Pierre-Louis
This monograph derives from the integration of lecture notes developed by the authors in the last three years. The topics considered include: simply typed lambda-calculus, PCF, categorical...
Selected domains and lambda calculi (1994)
Amadio, Roberto M., Curien, Pierre-Louis
This monograph derives from the integration of lecture notes developed by the authors in the last three years. The topics considered include: simply typed lambda-calculus, PCF, categorical...
Bistructures, bidomains and linear logic (1994)
Pierre-louis Curien, Gordon Plotkin, Glynn Winskel
et al.: Bistructures,
Bistructures, bidomains and linear logic (1994)
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of causal dependency is...
Bistructures, bidomains and linear logic (1994)
Pierre-louis Curien, Gordon Plotkin, Glynn Winskel
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...
Fully abstract semantics for observably sequential languages (1994)
Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen
One of the major challenges in denotational semantics is the construction of a fully abstract semantics for a higher-order sequential programming language. For the past fifteen years, research on...
Fully abstract semantics for observably sequential languages (1994)
Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen
One of the major challenges in denotational semantics is the construction of a fully abstract semantics for a higher-order sequential programming language. For the past fifteen years, research on...
A logic for parametric polymorphism (1993)
Martín Abadi, Luca Cardelli, Pierre-louis Curien
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In...
A logic for parametric polymorphism (1993)
Martín Abadi, Luca Cardelli, Pierre-louis Curien
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In...
A logic for parametric polymorphism (1993)
Martín Abadi, Luca Cardelli, Pierre-louis Curien
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In...
Formal Parametric Polymorphism (1993)
Martn Abadi Luca, Luca Cardelli, Pierre-louis Curien
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In...
Formal Parametric Polymorphism (1993)
Mart Abadi, Luca Cardelli, Pierre-louis Curien
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In...
Formal Parametric Polymorphism (1993)
Martin Abadi, Martn Abadi, Luca Cardelli, Pierre-Louis Curien
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In...
Formal Parametric Polymorphism (1993)
Martin Abadi, Martn Abadi, Luca Cardelli, Pierre-Louis Curien
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In...
A logic for parametric polymorphism (1993)
Martín Abadi, Luca Cardelli, Pierre-louis Curien
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In...