
Normalization, Taylor expansion and rigid approximation of λterms
The aim of this work is to characterize three fundamental normalization ...
read it

Reducing Lambda Terms with Traversals
We introduce a method to evaluate untyped lambda terms by combining the ...
read it

Glueability of resource proofstructures: inverting the Taylor expansion (long version)
A MultiplicativeExponential Linear Logic (MELL) proofstructure can be ...
read it

Proving Soundness of Extensional NormalForm Bisimilarities
Normalform bisimilarity is a simple, easytouse behavioral equivalence...
read it

Gluing resource proofstructures: inhabitation and inverting the Taylor expansion
A MultiplicativeExponential Linear Logic (MELL) proofstructure can be ...
read it

Nonidempotent types for classical calculi in natural deduction style
In the first part of this paper, we define two resource aware typing sys...
read it

Lambda Calculus with Explicit Readback
This paper introduces a new term rewriting system that is similar to the...
read it
On the Taylor expansion of λterms and the groupoid structure of their rigid approximants
We show that the normal form of the Taylor expansion of a λterm is isomorphic to its Böhm tree, improving Ehrhard and Regnier's original proof along three independent directions. First, we simplify the final step of the proof by following the left reduction strategy directly in the resource calculus, avoiding to introduce an abstract machine ad hoc. We also introduce a groupoid of permutations of copies of arguments in a rigid variant of the resource calculus, and relate the coefficients of Taylor expansion with this structure, while Ehrhard and Regnier worked with groups of permutations of occurrences of variables. Finally, we extend all the results to a nondeterministic setting: by contrast with previous attempts, we show that the uniformity property that was crucial in Ehrhard and Regnier's approach can be preserved in this setting.
READ FULL TEXT
Comments
There are no comments yet.