On the denotational semantics of Linear Logic with least and greatest fixed points of formulas

06/13/2019
by   Thomas Ehrhard, et al.
0

We develop a denotational semantics of Linear Logic with least and greatest fixed points in coherence spaces (where both fixed points are interpreted in the same way) and in coherence spaces with totality (where they have different interpretations). These constructions can be carried out in many different denotational models of LL (hypercoherences, Scott semantics, finiteness spaces etc). We also present a natural embedding of Gödel System T in LL with fixed points thus enforcing the expressive power of this system as a programming language featuring both normalization and a huge expressive power in terms of data types.

READ FULL TEXT
research
11/19/2020

Categorical models of Linear Logic with fixed points of formulas

We develop a denotational semantics of muLL, a version of propositional ...
research
02/01/2019

Around finite second-order coherence spaces

Many applications of denotational semantics, such as higher-order model ...
research
02/01/2019

Finite semantics of polymorphism, complexity and the power of type fixpoints

Many applications of denotational semantics, such as higher-order model ...
research
10/25/2017

Logical relations for coherence of effect subtyping

A coercion semantics of a programming language with subtyping is typical...
research
02/23/2023

A Curry-Howard Correspondence for Linear, Reversible Computation

In this paper, we present a linear and reversible programming language w...
research
04/22/2022

Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings

A number of models of linear logic are based on or closely related to li...
research
05/23/2019

Lewisian Fixed Points I: Two Incomparable Constructions

Our paper is the first study of what one might call "reverse mathematics...

Please sign up or login with your details

Forgot password? Click here to reset