Quantitative Types for the Linear Substitution Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Quantitative Types for the Linear Substitution Calculus

Abstract

We define two non-idempotent intersection type systems for the linear substitution calculus, a calculus with partial substitutions acting at a distance that is a computational interpretation of linear logic proof-nets. The calculus naturally express linear-head reduction, a notion of evaluation of proof nets that is strongly related to abstract machines. We show that our first (resp. second) quantitave type system characterizes linear-head, head and weak (resp. strong) normalizing sets of terms. All such characterizations are given by means of combinatorial arguments, i.e. there is a measure based on type derivations which decreases with respect to each reduction relation considered in the paper.
Fichier principal
Vignette du fichier
978-3-662-44602-7_23_Chapter.pdf (312.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01402078 , version 1 (24-11-2016)

Licence

Attribution

Identifiers

Cite

Delia Kesner, Daniel Ventura. Quantitative Types for the Linear Substitution Calculus. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.296-310, ⟨10.1007/978-3-662-44602-7_23⟩. ⟨hal-01402078⟩
98 View
220 Download

Altmetric

Share

Gmail Facebook X LinkedIn More