A theory of incremental computation and its application
暂无分享,去创建一个
[1] Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, USA, January 1990 , 1990, POPL.
[2] A. Tarski,et al. On Closed Elements in Closure Algebras , 1946 .
[3] Barbara G. Ryder,et al. An efficient hybrid algorithm for incremental data flow analysis , 1989, POPL '90.
[4] Peter Sestoft,et al. MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract) , 1987, MFPS.
[5] Thomas W. Reps,et al. Generating Language-Based Environments , 1982 .
[6] Thomas W. Reps,et al. Algebraic Properties of Program Integration , 1990, Sci. Comput. Program..
[7] Olivier Danvy,et al. From Interpreting to Compiling Binding Times , 1990, ESOP.
[8] Neil D. Jones,et al. Mix: A self-applicable partial evaluator for experiments in compiler generation , 1989, LISP Symb. Comput..
[9] Raman Srinivas Sundaresh. Incremental computation via partial evaluation , 1992 .
[10] Daniel M. Yellin,et al. INC: a language for incremental computations , 1988, PLDI '88.
[11] Jr. William Worthington Pugh. Incremental Computation and the Incremental Evaluation of Functional Programs , 1988 .
[12] Tim Teitelbaum,et al. Incremental reduction in the lambda calculus , 1990, LISP and Functional Programming.
[13] Thomas W. Reps,et al. Incremental Context-Dependent Analysis for Language-Based Editors , 1983, TOPL.