26 pagesInternational audienceWe show that the extensional collapse of the relational model of linear logic is the model of prime-algebraic lattices, a natural extension to linear logic of the well known Scott semantics of the lambda-calculus
International audienceIn the refinement calculus, monotonic predicate transformers are used to model...
Various typing system have been recently introduced giving a parametric version of the exponential m...
International audienceThis two-parts paper offers a survey of linear logic and ludics, which were in...
AbstractWe show that the extensional collapse of the relational model of linear logic is the model o...
We proved recently that the extensional collapse of the relational model of linear logic coincides w...
Scott’s information systems provide a categorically equivalent, intensional description of Scott dom...
In this paper, we study the bicategory of profunctors with the free finite coproduct pseudo-comonad ...
Scott’s information systems provide a categorically equivalent, intensional description of Scott do-...
We prove a completeness result for Multiplicative Exponential Linear Logic (MELL): we show that the ...
Following renewed interest in duploids arising from the exponential comonad of linear logic (the con...
AbstractWe show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactica...
In this article, we develop a new and somewhat unexpected connection between higher-order model-chec...
PhD thesisMore than 30 years after the discovery of linear logic, a simple fully-complete model has ...
AbstractThe proof-theoretic origins and specialized models of linear logic make it primarily operati...
We show that for a suitable fragment of linear logic the syntactical equivalence relation on proofs ...
International audienceIn the refinement calculus, monotonic predicate transformers are used to model...
Various typing system have been recently introduced giving a parametric version of the exponential m...
International audienceThis two-parts paper offers a survey of linear logic and ludics, which were in...
AbstractWe show that the extensional collapse of the relational model of linear logic is the model o...
We proved recently that the extensional collapse of the relational model of linear logic coincides w...
Scott’s information systems provide a categorically equivalent, intensional description of Scott dom...
In this paper, we study the bicategory of profunctors with the free finite coproduct pseudo-comonad ...
Scott’s information systems provide a categorically equivalent, intensional description of Scott do-...
We prove a completeness result for Multiplicative Exponential Linear Logic (MELL): we show that the ...
Following renewed interest in duploids arising from the exponential comonad of linear logic (the con...
AbstractWe show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactica...
In this article, we develop a new and somewhat unexpected connection between higher-order model-chec...
PhD thesisMore than 30 years after the discovery of linear logic, a simple fully-complete model has ...
AbstractThe proof-theoretic origins and specialized models of linear logic make it primarily operati...
We show that for a suitable fragment of linear logic the syntactical equivalence relation on proofs ...
International audienceIn the refinement calculus, monotonic predicate transformers are used to model...
Various typing system have been recently introduced giving a parametric version of the exponential m...
International audienceThis two-parts paper offers a survey of linear logic and ludics, which were in...
DOI
Add to ORKG