Polarized Linear Logic with Fixpoints - Archive ouverte HAL Accéder directement au contenu
Rapport Année : 2022

Polarized Linear Logic with Fixpoints

Résumé

We introduce and study µLLP, which can be viewed both as an extension of Laurent's Polarized Linear Logic, LLP, with least and greatest fixpoints, and as a polarized version of Baelde's Linear Logic with fixpoints (µMALL and µLL). We take advantage of the implicit structural rules of µLLP to introduce a term syntax for this language, in the spirit of the classical lambda-calculus and of system L in the style of Curien, Herbelin and Munch-Maccagnoni. We equip this language with a deterministic reduction semantics as well as a denotational semantics based on the notion of non-uniform totality spaces and the notion of categorical model for linear logic with fixpoint introduced by Ehrhard and Jafarrahmani. We prove an adequacy result for µLLP between these operational and denotational semantics, from which we derive a normalization property for µLLP thanks to the properties of the totality interpretation.
Fichier principal
Vignette du fichier
Polarized Linear Logic with Fixpoints.pdf (733.41 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03655737 , version 1 (29-04-2022)

Identifiants

  • HAL Id : hal-03655737 , version 1

Citer

Thomas Ehrhard, Farzad Jafarrahmani, Alexis Saurin. Polarized Linear Logic with Fixpoints. [Technical Report] IRIF (UMR_8243) - Institut de Recherche en Informatique Fondamentale. 2022. ⟨hal-03655737⟩
37 Consultations
101 Téléchargements

Partager

Gmail Facebook X LinkedIn More