Lambda-calculus, types and models
Lambda-calculus, types and models
Nondeterministic extensions of untyped &lgr;-calculus
Information and Computation
The differential Lambda-calculus
Theoretical Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
A calculus with polymorphic and polyvariant flow types
Journal of Functional Programming
Parametric parameter passing λ-calculus
Information and Computation
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
Mathematical Structures in Computer Science
Parallel Reduction in Resource Lambda-Calculus
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
A semantic measure of the execution time in linear logic
Theoretical Computer Science
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
Böhm trees, krivine's machine and the taylor expansion of lambda-terms
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Solvability in resource lambda-calculus
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Böhm's theorem for resource lambda calculus through Taylor expansion
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Call-by-Value solvability, revisited
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Constructing differential categories and deconstructing categories of games
Information and Computation
| Hi-index | 0.00 |
We study the notion of solvability in the resource calculus, an extension of the λ-calculus modelling resource consumption. Since this calculus is non-deterministic, two different notions of solvability arise, one optimistic (angelical, may) and one pessimistic (demoniac, must). We give a syntactical, operational and logical characterization for the may-solvability and only a partial characterization of the must-solvability. Finally, we discuss the open problem of a complete characterization of the must-solvability.