An Elementary Affine λ-Calculus with Multithreading and Side Effects

DOI10.1007/978-3-642-21691-6_13zbMath1331.68043OpenAlexW1658990193MaRDI QIDQ3007663

Antoine Madet, Roberto M. Amadio

Publication date: 17 June 2011

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

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

zbMATH Keywords

regionslambda calculuselementary linear logicside effectsresource bounds

Mathematics Subject Classification ID

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 (6)

Paths-based criteria and application to linear logic subsystems characterizing polynomial time ⋮ Characterizing polynomial and exponential complexity classes in elementary lambda-calculus ⋮ Types for complexity of parallel computation in pi-calculus ⋮ An Elementary Affine λ-Calculus with Multithreading and Side Effects ⋮ Combining linear logic and size types for implicit complexity ⋮ Unnamed Item

Cites Work

• Light affine lambda calculus and polynomial time strong normalization
• Typing termination in a higher-order concurrent imperative language
• Light linear logic
• Linear logic and elementary time
• Light logics and higher-order processes
• An Elementary Affine λ-Calculus with Multithreading and Side Effects
• A PolyTime Functional Language from Light Linear Logic
• Light Logics and the Call-by-Value Lambda Calculus
• Optimizing optimal reduction
• Typed Lambda Calculi and Applications
• Intuitionistic Light Affine Logic

This page was built for publication: An Elementary Affine λ-Calculus with Multithreading and Side Effects