Solvability in resource lambda-calculus
From MaRDI portal
Publication:3557862
DOI10.1007/978-3-642-12032-9_25zbMATH Open1246.68086OpenAlexW1528473059MaRDI QIDQ3557862FDOQ3557862
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
Recommendations
Cited In (14)
- Inhabitation for non-idempotent intersection types
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization
- Essential and relational models
- Linearity, non-determinism and solvability
- Title not available (Why is that?)
- Intersection types for the resource control lambda calculi
- Reasoning about call-by-need by means of types
- Initial algebras of terms with binding and algebraic structure
- The bang calculus revisited
- The bang calculus revisited
- Standardization in resource \(\lambda\)-calculus
- Title not available (Why is that?)
- What is a categorical model of the differential and the resource \(\lambda \)-calculi?
- A resource aware semantics for a focused intuitionistic calculus
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)