Positive Supercompilation for a Higher-Order Call-By-Value Language

Details Positive Supercompilation for a Higher-Order Call-By-Value Language Positive Supercompilation for a Higher-Order Call-By-Value Language

2010-05-28

arxiv.org/abs/1005.5278v2

MCS 6 (3:5) 2010

Computer Science

Programming Languages

Scientific paper

10.2168/LMCS-6(3:5)2010

Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, and changes the behavior of a program depending on whether it is optimized or not. We present a supercompilation algorithm for a higher-order call-by-value language and prove that the algorithm both terminates and preserves termination properties. This algorithm utilizes strictness information to decide whether to substitute or not and compares favorably with previous call-by-name transformations.

Affiliated with

Also associated with

No associations

Rating

Positive Supercompilation for a Higher-Order Call-By-Value Language 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 Positive Supercompilation for a Higher-Order Call-By-Value Language, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Positive Supercompilation for a Higher-Order Call-By-Value Language will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-15992