Multiplicative Linear Logic from Logic Programs and Tilings - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

Multiplicative Linear Logic from Logic Programs and Tilings

Résumé

We present a non-deterministic model of computation related to Robinson’s first-order resolution. This model formalises and extends ideas sketched by Girard in his Transcendental Syntax programme. After establishing formal defini- tions and basic properties, we show its Turing-completeness by exhibiting how it naturally models logic programs as well as non-deterministic tiling constructions such as those defining the abstract tile assembly model, recently used in DNA computing. In a second part, we explain how this model of computation yields, using realisability techniques, a dynamic semantics of proofs in the multiplicative fragment of linear logic (MLL), for which we obtain full-completeness results for both MLL and MLL extended with the so-called MIX rule.
Fichier principal
Vignette du fichier
main.pdf (389.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02895111 , version 1 (09-07-2020)
hal-02895111 , version 2 (30-07-2020)
hal-02895111 , version 3 (26-01-2021)

Identifiants

Citer

Boris Eng, Thomas Seiller. Multiplicative Linear Logic from Logic Programs and Tilings. 2021. ⟨hal-02895111v3⟩
719 Consultations
460 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More