Quantitative Types for the Linear Substitution Calculus

DOI10.1007/978-3-662-44602-7_23zbMath1418.03180OpenAlexW220669002MaRDI QIDQ3190169

Delia Kesner, Daniel Lima Ventura

Publication date: 15 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01402078/file/978-3-662-44602-7_23_Chapter.pdf

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (15)

Unnamed Item ⋮ Nominal essential intersection types ⋮ A resource aware semantics for a focused intuitionistic calculus ⋮ A strong call-by-need calculus ⋮ Node Replication: Theory And Practice ⋮ Tight typings and split bounds, fully developed ⋮ Unnamed Item ⋮ The spirit of node replication ⋮ Strong normalization through intersection types and memory ⋮ The vectorial \(\lambda\)-calculus ⋮ The bang calculus revisited ⋮ The bang calculus revisited ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reasoning About Call-by-need by Means of Types

This page was built for publication: Quantitative Types for the Linear Substitution Calculus