This paper is about a categorical approach to model a very simple Semantically Linear λ-calculus, namedS`λ-calculus. This is a core calculus underlying the programming language S ̀ PCF. In particular, in this work, we introduce the notion of S`λ-Category, which is able to describe a very large class of sound models of S`λ-calculus. S`λ-Category extends in the natural way Benton, Bierman, Hyland and de Paiva’s Linear Category, in order to soundly interpret all the constructs of S`λ-calculus. This category is general enough to catch interesting models in Scott Domains and Coherence Spaces.
The aim of this work is to define the categories GC, describe their categorical structure and show t...
We give an illustration of a construction useful in producing and describing models of Girard and Re...
After introducing the syntax for a version of second order typed lambda calculus (Girard's system ...
This paper is about a categorical approach to model a very simple Semantically Linear λ-calculus, na...
This article is about a categorical approach modelling a simple term calculus, named ?l?-calculus. T...
This article is about a categorical approach modelling a simple term calculus, named ?l?-calculus. T...
International audienceThis paper is about a categorical approach to model a very simple Semantically...
International audienceThis paper is about a categorical approach to model a very simple Semantically...
AbstractWe consider several different sound and complete classes of models for the computational ·-c...
We present a construction which, under suitable assumptions, takes a model of Moggi’s computational ...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...
Type assignment systems for λ-calculus based on intersection types are a general framework for build...
In this paper, we study the bicategory of profunctors with the free finite coproduct pseudo-comonad ...
AbstractCurien's CAM is an environment machine for the untyped λ-calculus based on cartesian closed ...
This paper concerns itself with the categorical semantics of -calculi extended with explicit substi...
The aim of this work is to define the categories GC, describe their categorical structure and show t...
We give an illustration of a construction useful in producing and describing models of Girard and Re...
After introducing the syntax for a version of second order typed lambda calculus (Girard's system ...
This paper is about a categorical approach to model a very simple Semantically Linear λ-calculus, na...
This article is about a categorical approach modelling a simple term calculus, named ?l?-calculus. T...
This article is about a categorical approach modelling a simple term calculus, named ?l?-calculus. T...
International audienceThis paper is about a categorical approach to model a very simple Semantically...
International audienceThis paper is about a categorical approach to model a very simple Semantically...
AbstractWe consider several different sound and complete classes of models for the computational ·-c...
We present a construction which, under suitable assumptions, takes a model of Moggi’s computational ...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...
Type assignment systems for λ-calculus based on intersection types are a general framework for build...
In this paper, we study the bicategory of profunctors with the free finite coproduct pseudo-comonad ...
AbstractCurien's CAM is an environment machine for the untyped λ-calculus based on cartesian closed ...
This paper concerns itself with the categorical semantics of -calculi extended with explicit substi...
The aim of this work is to define the categories GC, describe their categorical structure and show t...
We give an illustration of a construction useful in producing and describing models of Girard and Re...
After introducing the syntax for a version of second order typed lambda calculus (Girard's system ...