Adaptive functional programming

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 6, 2006, Pages 990-1034

  Acar, Umut A ^a,c   Blelloch, Guy E ^b   Harper, Robert ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE   (Japan)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

Adaptive computation; Dynamic algorithms; Incremental computation

Indexed keywords

ADAPTIVE COMPUTATION; DYNAMIC ALGORITHMS; INCREMENTAL COMPUTATION;

ALGORITHMS; DIGITAL LIBRARIES; GRAPH THEORY; MATHEMATICAL MODELS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33845541245     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1186632.1186634     Document Type: Article

References (32)

1. ABADI, M., LAMPSON, B. W., AND LEVY, J.-J. 1996. Analysis and caching of dependencies. In Proceedings of the International Conference on Functional Programming, pp. 83-91.
2. ACAR, U. A. 2005. Self-Adjusting Computation. Ph.D. dissertation. Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May.
3. ACAR, U. A., BLELLOCH, G. E., AND HARPER, R. 2003. Selective memoization. In Proceedings of the 30th Annual ACM Symposium on Principles of Programming Languages. ACM, New York.
4. ACAR, U. A., BLELLOCH, G. E., HARPER, R., VITTES, J. L., AND WOO, M. 2004. Dynamizing static algorithms with applications to dynamic trees and history independence. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York.
5. ACAR, U. A., BLELLOCH, G. E., BLUME, M., HARPER, R., AND TANGWONGSAN, K. 2005a. A library for self-adjusting computation. In Proceedings of the ACM SIGPLAN Workshop on ML. ACM, New York.
6. ACAR, U. A., BLELLOCH, G. E., AND VITTES, J. L. 2005b. An experimental analysis of change propagation in dynamic trees. In Proceedings of the Workshop on Algorithm Engineering and Experimentation. ACM, New York.
7. BASCH, J., GUIBAS, L. J., AND HERSHBERGER, J. 1999. Data structures for mobile data. J. Algorithms 31, 1, 1-28.
8. BELLMAN, R. 1957. Dynamic Programming. Princeton University Press, Princeton, NJ.
9. CARLSSON, M. 2002. Monads for incremental computing. In Proceedings of the 7th ACM SIGPLAN International Conference on Functional Programming. ACM, New York, pp. 26-35.
10. DEMERS, A., REPS, T., AND TEITELBAUM, T. 1981. Incremental evaluation of attribute grammars with application to syntax directed editors. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 105-116.
11. DIETZ, P. F. AND SLEATOR, D. D. 1987. Two algorithms for maintaining order in a list. In Proceedings of the 19th ACM Symposium on Theory of Computing. ACM, New York, pp. 365-372.
12. DIETZ, P. F. 1989. Fully persistent arrays. In Proceedings of the Workshop on Algorithms and Data Structures. (Aug.) Lecture Notes in Computer Science, Vol 382. Springer-Verlag, ACM, New York, pp. 67-74.
13. DRISCOLL, J. R., SARNAK, N., SLEATOR, D. D., AND TARJAN, R. E. 1989. Making data structures persistent. J. Comput. Syst. Sci. 38, 1, (Feb.) 86-124.
14. DRISCOLL, J. R., SLEATOR, D. D., AND TARJAN, R. E. 1994. Fully persistent lists with catenation. J. ACM 41, 5, 943-959.
15. FIELD, J. AND TEITELBAUM, T. 1990. Incremental reduction in the lambda calculus. In Proceedings of the ACM '90 Conference on LISP and Functional Programming. (June). ACM, New York, pp. 307-322.
16. FIELD, J. 1991. Incremental reduction in the lambda calculus and related reduction systems. Ph.D. dissertation. Department of Computer Science, Cornell University.
17. HEYDON, A., LEVIN, R., MANN, T., AND YU, Y. 1999. The Vesta approach to software configuration management. Rep. 1999-001, Compaq Systems Research Center.
18. HEYDON, A., LEVIN, R., AND Yu, Y. 2000. Caching function calls using precise dependencies. In Proceedings of the 2000 ACM SIGPLAN Conference on PLDI. (May). ACM, New York, pp. 311-320.
19. HOOVER, R. 1987. Incremental graph evaluation. Ph.D. dissertation. Department of Computer Science, Cornell University.
20. LIU, Y. A., STOLLER, S., AND TEITELBAUM, T. 1998. Static caching for incremental computation. ACM Trans. Prog. Lang. Syst. 20, 3, 546-585.
21. LIU, Y. A. 1996. Incremental Computation: A Semantics-Based Systematic Transformational Approach. Ph.D. dissertation. Department of Computer Science, Cornell University.
22. MCCARTHY, J. 1963. A Basis for a mathematical theory of computation. In Computer Programming and Formal Systems. P. Braffort and D. Hirschberg, Eds., North-Holland, Amsterdam. The Netherlands, pp. 33-70.
23. MICHIE, D. 1968. 'memo' functions and machine learning. Nature 21, 8, 19-22.
24. MILLER, G. L. AND REIF, J. H. 1985. Parallel tree contraction and its application. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, pp. 487-489.
25. PFENNING, F. AND DAVIES, R. 2001. A judgmental reconstruction of modal logic. Math. Struct. Comput. Sci. 11, 511-540.
26. PUGH, W. 1988. Incremental computation via function caching. Ph.D. dissertation. Department of Computer Science, Cornell University.
27. PUGH, W. AND TEITELBAUM, T. 1989. Incremental computation via function caching. In Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 315-328.
28. RAMALINGAM, G. AND REPS, T. 1993. A categorized bibliography on incremental computation. In Conference Record of the 20th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 502-510.
29. REPS, T. 1982. Optimal-time incremental semantic analysis for syntax-directed editors. In Proceedings of the 9th Annual Symposium on Principles of Programming Languages. ACM, New York, pp. 169-176.
30. SLEATOR, D. D. AND TARJAN, R. E. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 3, 362-391.
31. SUNDARESH, R. S. AND HUDAK, P. 1991. Incremental compilation via partial evaluation. In Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 1-13.
32. YELLIN, D. M. AND STROM, R. E. 1991. INC: A language for incremental computations. ACM Trans. Prog. Lang. Syst. 13, 2, 211-236.