Type theories, normal forms, and D∞-lambda-models
Information and Computation
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
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
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
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Linearity, Non-determinism and Solvability
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Intersection types for the resource control lambda calculi
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
| Hi-index | 0.00 |
The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a finite multiset of resources, which in turn can be either linear or reusable, giving rise to non-deterministic choices, expressed by a formal sum. Using the λ-calculus terminology, we call solvable a term that can interact with the environment: solvable terms represent meaningful programs. Because of the non-determinism, different definitions of solvability are possible in the resource calculus. Here we study the optimistic (angelical, or may) notion, and so we define a term solvable whenever there is a simple head context reducing the term into a sum where at least one addend is the identity. We give a syntactical, operational and logical characterization of this kind of solvability.