CMU-CS-01-161 Computer Science Department School of Computer Science, Carnegie Mellon University
Adaptive Functional Programming Umut A. Acar, Guy E. Blelloch, Robert Harper January 2002
CMU-CS-01-161.ps
We show that the mechanism is practical by giving an efficient implementation as a small ML library. The library consists of three operations for making a program adaptive, plus two operations for making changes to the input and adapting the output to these changes. We give a general bound on the time it takes to adapt the output, and based on this, show that an adaptive Quicksort adapts its output in logarithmic time when its input is extended by one key. To show the safety and correctness of the mechanism we give a formal definition of AFL, a call-by-value functional language extended with adaptivity primitives. The modal type system of AFL enforces correct usage of the adaptivity mechanism, which can only be checked at run time in the ML library. Based on the AFL dynamic semantics, we formalize the change propagation algorithm and prove its correctness. 46 pages
| |
Return to:
SCS Technical Report Collection This page maintained by reports@cs.cmu.edu |