
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 isom...
read it

Revisiting Callbyvalue Bohm trees in light of their Taylor expansion
The callbyvalue lambda calculus can be endowed with permutation rules,...
read it

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

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

On the Taylor Expansion of Probabilistic λTerms (Long Version)
We generalise Ehrhard and Regnier's Taylor expansion from pure to probab...
read it

On reduction and normalization in the computational core
We study the reduction in a lambdacalculus derived from Moggi's computa...
read it

Regression Model for Predicting Expansion of Concrete Exposed to Sulfate Attack Based on Performancebased Classification
This paper mainly described development of a new kind of regression mode...
read it
Normalization, Taylor expansion and rigid approximation of λterms
The aim of this work is to characterize three fundamental normalization proprieties in lambdacalculus trough the Taylor expansion of λterms. The general proof strategy consists in stating the dependence of ordinary reduction strategies on their resource counterparts and in finding a convenient resource term in the Taylor expansion that behaves well under the considered kind of reduction.
READ FULL TEXT
Comments
There are no comments yet.