Light Logics and the Call-by-Value Lambda Calculus
From MaRDI portal
Publication:3623002
DOI10.2168/LMCS-4(4:5)2008zbMath1161.68011OpenAlexW1995956074MaRDI QIDQ3623002
Ugo Dal Lago, Paolo Coppola, Simonetta Ronchi della Rocca
Publication date: 29 April 2009
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-4(4:5)2008
Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)
Related Items (5)
Linear Logic Properly Displayed ⋮ Characterizing polynomial and exponential complexity classes in elementary lambda-calculus ⋮ An Elementary Affine λ-Calculus with Multithreading and Side Effects ⋮ On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy ⋮ Implicit computation complexity in higher-order programming languages
This page was built for publication: Light Logics and the Call-by-Value Lambda Calculus
