Solvability in resource lambda-calculus

DOI10.1007/978-3-642-12032-9_25MaRDI QIDQ3557862zbMATH OpenOpenAlexFDO

Authors Michele Pagani, Simona Ronchi Della Rocca

Publication date 27 April 2010

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12032-9_25

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Linearity, non-determinism and solvability
• Standardization in resource -calculus
• A Semantical and Operational Account of Call-by-Value Solvability
• A semantics for lambda calculi with resources
• Geometry of resource interaction -- \textit{a minimalist approach}

Cited in

(15)

• The bang calculus revisited
• A type assignment for -calculus complete both for FPTIME and strong normalization
• Reasoning about call-by-need by means of types
• What is a categorical model of the differential and the resource \(\lambda \)-calculi?
• Linearity, non-determinism and solvability
• Intersection types for the resource control lambda calculi
• scientific article; zbMATH DE number 4123701 (Why is no real title available?)
• A resource aware semantics for a focused intuitionistic calculus
• Inhabitation for non-idempotent intersection types
• Standardization in resource -calculus
• Non-idempotent types for classical calculi in natural deduction style
• Essential and relational models
• Initial algebras of terms with binding and algebraic structure
• The bang calculus revisited
• Typed non-determinism in concurrent calculi: the eager way

This page was built for publication: Solvability in resource lambda-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557862)