Superdevelopments for Weak Reduction

Details Superdevelopments for Weak Reduction Superdevelopments for Weak Reduction

2010-01-25

arxiv.org/abs/1001.4429v1

EPTCS 15, 2010, pp. 20-31

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.15.2

We study superdevelopments in the weak lambda calculus of Cagman and Hindley, a confluent variant of the standard weak lambda calculus in which reduction below lambdas is forbidden. In contrast to developments, a superdevelopment from a term M allows not only residuals of redexes in M to be reduced but also some newly created ones. In the lambda calculus there are three ways new redexes may be created; in the weak lambda calculus a new form of redex creation is possible. We present labeled and simultaneous reduction formulations of superdevelopments for the weak lambda calculus and prove them equivalent.

Affiliated with

Also associated with

No associations

Rating

Superdevelopments for Weak Reduction 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 Superdevelopments for Weak Reduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Superdevelopments for Weak Reduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131028