Theoretical Computer Science
The discriminating power of multiplicities in the &lgr;-calculus
Information and Computation
The differential Lambda-calculus
Theoretical Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
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
Exponentials with infinite multiplicities
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Linearity, Non-determinism and Solvability
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
What is a categorical model of the differential and the resource λ-calculi?
Mathematical Structures in Computer Science
Constructing differential categories and deconstructing categories of games
Information and Computation
Hi-index | 0.00 |
We study the resource calculus, an extension of the λ-calculus allowing to model resource consumption. We achieve an internal separation result, in analogy with Böhm's theorem of λ-calculus. We define an equivalence relation on the terms, which we prove to be the maximal non-trivial congruence on normalizable terms respecting β-reduction. It is significant that this equivalence extends the usual η-equivalence and is related to Ehrhard's Taylor expansion - a translation mapping terms into series of finite resources.