Computer Science – Programming Languages
Scientific paper
2011-07-06
EPTCS 57, 2011, pp. 89-103
Computer Science
Programming Languages
In Proceedings QAPL 2011, arXiv:1107.0746
Scientific paper
10.4204/EPTCS.57.7
"Theorems for Free!" (Wadler, FPCA 1989) is a slogan for a technique that allows to derive statements about functions just from their types. So far, the statements considered have always had a purely extensional flavor: statements relating the value semantics of program expressions, but not statements relating their runtime (or other) cost. Here we study an extension of the technique that allows precisely statements of the latter flavor, by deriving quantitative theorems for free. After developing the theory, we walk through a number of example derivations. Probably none of the statements derived in those simple examples will be particularly surprising to most readers, but what is maybe surprising, and at the very least novel, is that there is a general technique for obtaining such results on a quantitative level in a principled way. Moreover, there is good potential to bring that technique to bear on more complex examples as well. We turn our attention to short-cut fusion (Gill et al., FPCA 1993) in particular.
Seidel Daniel
Voigtländer Janis
No associations
LandOfFree
Improvements for Free 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 Improvements for Free, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improvements for Free will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-678840