
Factorize Factorization
We present a new technique for proving factorization theorems for compou...
read it

The Bang Calculus and the Two Girard's Translations
We study the two Girard's translations of intuitionistic implication int...
read it

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

Factorization and Normalization, Essentially
Lambdacalculi come with no fixed evaluation strategy. Different strateg...
read it

A constructive proof of dependent choice in classical arithmetic via memoization
In a recent paper, Herbelin developed dPA^ω, a calculus in which constru...
read it

Iterative division in the Distributive Full Nonassociative Lambek Calculus
We study an extension of the Distributive Full Nonassociative Lambek Ca...
read it

Normalization by Evaluation for CallbyPushValue and Polarized LambdaCalculus
We observe that normalization by evaluation for simplytyped lambdacalc...
read it
Factorization in CallbyName and CallbyValue Calculi via Linear Logic (long version)
In each variant of the lambdacalculus, factorization and normalization are two keyproperties that show how results are computed. Instead of proving factorization/normalization for the callbyname (CbN) and callbyvalue (CbV) variants separately, we prove them only once, for the bang calculus (an extension of the lambdacalculus inspired by linear logic and subsuming CbN and CbV), and then we transfer the result via translations, obtaining factorization/normalization for CbN and CbV. The approach is robust: it still holds when extending the calculi with operators and extra rules to model some additional computational features.
READ FULL TEXT
Comments
There are no comments yet.