DeepAI AI Chat
Log In Sign Up

On the Taylor expansion of λ-terms and the groupoid structure of their rigid approximants

by   Federico Olimpieri, et al.

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 non-deterministic 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.


page 1

page 2

page 3

page 4


Normalization, Taylor expansion and rigid approximation of λ-terms

The aim of this work is to characterize three fundamental normalization ...

Reducing Lambda Terms with Traversals

We introduce a method to evaluate untyped lambda terms by combining the ...

Taylor Expansion Finitely Simulates Infinitary β-Reduction

Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expan...

Proving Soundness of Extensional Normal-Form Bisimilarities

Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence...

Gluing resource proof-structures: inhabitation and inverting the Taylor expansion

A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be ...

Strategies as Resource Terms, and their Categorical Semantics

As shown by Tsukada and Ong, normal (extensional) simply-typed resource ...