Relational type-checking of connected proof-structures - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Relational type-checking of connected proof-structures

Lorenzo Tortora de Falco
  • Fonction : Auteur
  • PersonId : 830526

Résumé

It is possible to define a typing system for Multiplicative Exponential Linear Logic (MELL): in such a system, typing judgments are of the form ⊢ R : x : Γ, where R is a MELL proof-structure, Γ is the list of types of the conclusions of R, and x an element of the relational interpretation of Γ, meaning that x is an element of the relational interpretation of R (of type Γ). As relational semantics can be used to infer execution properties of the proof-structure, these judgment can be considered as forms of quantitative typing. We provide an abstract machine that decides, if R satisfies a geometric condition, whether the judgment ⊢ R : x : Γ is valid. Also, the machine halts in bilinear time in the sizes of R and x.
Fichier non déposé

Dates et versions

hal-01287936 , version 1 (14-03-2016)

Identifiants

  • HAL Id : hal-01287936 , version 1

Citer

Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco. Relational type-checking of connected proof-structures. Developments in Implicit Computational Complexity, Apr 2016, Eindhoven, Netherlands. ⟨hal-01287936⟩
87 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More