On the Invariance of the Unitary Cost Model for Head Reduction (Long Version)

Details On the Invariance of the Unitary Cost Model for Head Reduction (Long Version) On the Invariance of the Unitary Cost Model for Head Reduction (Long Version)

2012-02-08

arxiv.org/abs/1202.1641v1

Computer Science

Logic in Computer Science

22 pages

Scientific paper

The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda terms to their normal form is typically studied by reasoning on concrete implementation algorithms. In this paper, we show that when head reduction is the underlying dynamics, the unitary cost model is indeed invariant. This improves on known results, which only deal with weak (call-by-value or call-by-name) reduction. Invariance is proved by way of a linear calculus of explicit substitutions, which allows to nicely decompose any head reduction step in the lambda calculus into more elementary substitution steps, thus making the combinatorics of head-reduction easier to reason about. The technique is also a promising tool to attack what we see as the main open problem, namely understanding for which normalizing strategies derivation complexity is an invariant cost model, if any.

Affiliated with

Also associated with

No associations

Rating

On the Invariance of the Unitary Cost Model for Head Reduction (Long Version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Invariance of the Unitary Cost Model for Head Reduction (Long Version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Invariance of the Unitary Cost Model for Head Reduction (Long Version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-64294