Traceable data types for self-adjusting computation

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2010, Pages 483-496

  Acar, Umut A ^a   Blelloch, Guy ^b   Ley Wild, Ruy ^b   Tangwongsan, Kanat ^b   Türkoǧlu, Duru ^c  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF CHICAGO   (United States)

Author keywords

self adjusting computation; traceable data types

Indexed keywords

CONSTANT FACTORS; CURRENT INPUT; DATA TYPE; EVALUATION MODELS; EXPERIMENTAL EVALUATION; MEMORY CELL; MEMORY OPERATIONS; OPTIMAL SOLUTIONS; ORDERS OF MAGNITUDE; PRIORITY QUEUES; RUNTIMES; SELF-ADJUSTING; SPACE AND TIME;

C (PROGRAMMING LANGUAGE);

LINGUISTICS;

EID: 77954743468     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806596.1806650     Document Type: Conference Paper

References (27)

1. M. Abadi, B. W. Lampson, and J.-J. Lévy. Analysis and Caching of Dependencies. In Proceedings of the International Conference on Functional Programming, pages 83-91, 1996.
2. U. A. Acar, G. E. Blelloch, and R. Harper. Adaptive functional programming. ACM Transactions on Programming Languages and Systems, 28(6):990-1034, 2006.
3. U. A. Acar, G. E. Blelloch, and K. Tangwongsan. Non-oblivious retroactive data structures. Technical report, Carnegie Mellon University, 2007.
4. U. A. Acar, G. E. Blelloch, K. Tangwongsan, and D. Türkoǧlu. Robust Kinetic Convex Hulls in 3D. In Proceedings of the 16th Annual European Symposium on Algorithms, September 2008.
5. U. A. Acar, G. E. Blelloch, M. Blume, R. Harper, and K. Tangwongsan. An experimental analysis of self-adjusting computation. ACM Transactions on Programming Languages and Systems (TOPLAS), 32(1): 3:1-3:53, 2009.
6. U. A. Acar, A. Cotter, B. Hudson, and D. Türkoǧlu. Dynamic well-spaced point sets. In SCG '10: Proceedings of the 26th Annual Symposium on Computational Geometry, 2010.
7. P. K. Agarwal, L. J. Guibas, H. Edelsbrunner, J. Erickson, M. Isard, S. Har-Peled, J. Hershberger, C. Jensen, L. Kavraki, P. Koehl, M. Lin, D. Manocha, D. Metaxas, B. Mirtich, D. Mount, S. Muthukrishnan, D. Pai, E. Sacks, J. Snoeyink, S. Suri, and O. Wolefson. Algorithmic issues in modeling motion. ACM Comput. Surv., 34(4):550-572, 2002. ISSN 0360-0300.
8. C. B. Barber, D. P. Dobkin, and H. Huhdanpaa. The Quickhull Algorithm for Convex Hulls. ACM Trans. Math. Softw., 22(4):469-483, 1996.
9. R. Bellman. Dynamic Programming. Princeton University Press, 1957.
10. M. Carlsson. Monads for Incremental Computing. In Proceedings of the 7th ACM SIGPLAN International Conference on Functional programming, pages 26-35. ACM Press, 2002.
11. Y.-J. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Proceedings of the IEEE, 80(9):1412-1434, 1992.
12. A. Demers, T. Reps, and T. Teitelbaum. Incremental Evaluation of Attribute Grammars with Application to Syntax-directed Editors. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages, pages 105-116, 1981.
13. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proceedings of the 19th ACM Symposium on Theory of Computing, pages 365-372, 1987.
14. D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook, chapter 8. CRC Press, 1999.
15. J. Field and T. Teitelbaum. Incremental reduction in the lambda calculus. In Proceedings of the ACM '90 Conference on LISP and Functional Programming, pages 307-322, June 1990.
16. M. A. Hammer, U. A. Acar, and Y. Chen. CEAL: A C-based language for self-adjusting computation. In Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, June 2009.
17. A. Heydon, R. Levin, and Y. Yu. Caching Function Calls Using Precise Dependencies. In Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 311-320, 2000.
18. R. Hoover. Incremental Graph Evaluation. PhD thesis, Department of Computer Science, Cornell University, May 1987.
19. R. Ley-Wild, M. Fluet, and U. A. Acar. Compiling self-adjusting programs with continuations. In Proceedings of the International Conference on Functional Programming, 2008.
20. R. Ley-Wild, U. A. Acar, and M. Fluet. A cost semantics for self-adjusting computation. In Proceedings of the 26th Annual ACM Symposium on Principles of Programming Languages, 2009.
21. J. McCarthy. A Basis for a Mathematical Theory of Computation. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, pages 33-70. North-Holland, Amsterdam, 1963.
22. D. Michie. "Memo" Functions and Machine Learning. Nature, 218: 19-22, 1968.
23. W. Pugh and T. Teitelbaum. Incremental computation via function caching. In Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, pages 315-328, 1989.
24. G. Ramalingam and T. Reps. A Categorized Bibliography on Incremental Computation. In Proceedings of the 20th Annual ACM Symposium on Principles of Programming Languages, pages 502-510, 1993.
25. A. Shankar and R. Bodik. DITTO: Automatic Incrementalization of Data Structure Invariant Checks (in Java). In Proceedings of the ACM SIGPLAN 2007 Conference on Programming language Design and Implementation, 2007.
26. R. S. Sundaresh and P. Hudak. Incremental compilation via partial evaluation. In Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages, pages 1-13, 1991.
27. D. M. Yellin and R. E. Strom. INC: A Language for Incremental Computations. ACM Transactions on Programming Languages and Systems, 13(2):211-236, Apr. 1991.