P
Pierre-Louis Curien
Researcher at University of Paris
Publications - 76
Citations - 3679
Pierre-Louis Curien is an academic researcher from University of Paris. The author has contributed to research in topics: Denotational semantics & Operational semantics. The author has an hindex of 28, co-authored 70 publications receiving 3591 citations. Previous affiliations of Pierre-Louis Curien include École Normale Supérieure & Mines ParisTech.
Papers
More filters
Proceedings ArticleDOI
Explicit substitutions
TL;DR: The λ&sgr;-calculus is a refinement of the λ-Calculus where substitutions are manipulated explicitly, and provides a setting for studying the theory of substitutions, with pleasant mathematical properties.
Proceedings ArticleDOI
The duality of computation
TL;DR: The μ -calculus is presented, a syntax for λ-calculus + control operators exhibiting symmetries such as program/context and call-by-name/call- by-value, derived from implicational Gentzen's sequent calculus LK.
Book
Categorical Combinators, Sequential Algorithms and Functional Programming
TL;DR: The new edition covers new results, and introduces new connections, as suggested by the following non-exhaustive fist of keywords: confluence properties of categorical combinators, explicit substitutions, control operations, linear logic, geometry of interaction, strong stability.
Book
Domains and Lambda-Calculi
TL;DR: In this article, the mathematical aspects of the semantics of programming languages are described and the main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve.
Journal ArticleDOI
Sequential algorithms on concrete data structures
Gérard Berry,Pierre-Louis Curien +1 more
TL;DR: A sequential denotational semantics for sequential programming languages is provided, based on a new notion of sequential algorithm on the Kahn-Plotkin concrete data structures, which form a cartesian closed category with straightforward solutions to recursive domain equations.