A PolyTime Functional Language from Light Linear Logic

DOI10.1007/978-3-642-11957-6_7zbMath1260.68070OpenAlexW1545415328MaRDI QIDQ3558218

Patrick Baillot, Virgile Mogbil, Marco Gaboardi

Publication date: 4 May 2010

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11957-6_7

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Higher-order interpretations and program complexity, A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization, Paths-based criteria and application to linear logic subsystems characterizing polynomial time, Linear dependent types in a call-by-value scenario, An Elementary Affine λ-Calculus with Multithreading and Side Effects, Combining linear logic and size types for implicit complexity, Unnamed Item, On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy