Analysis and caching of dependencies

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 6, 1996, Pages 83-91

  Abadi, Martín ^a   Lampson, Butler ^b   Lévy, Jean Jacques ^c  

^a Digital Systems Research Center

^b MICROSOFT   (United States)

^c INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144430134     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/232629.232638     Document Type: Article

References (18)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
2. Henk P. Barendregt. The Lambda Calculus. North Holland, Revised edition, 1984.
3. G. Berry. Stable models of typed lambda-calculi. In Proc. 5th Coll. on Automata, Languages and Programming, Lectures Notes in Computer Science, pages 72-89. Springer-Verlag, 1978.
4. G. L. Burn, C. Hankin, and S. Abramsky. Strictness analysis for higher-order functions. Science of Computer Programming, 7:249-278, 1986.
5. John Field. On laziness and optimality in lambda interpreters: Tools for specification and analysis. In Proceedings of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 1-15, 1990.
6. John Field and Tim Teitelbaum. Incremental reduction in the lambda calculus. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, pages 307-322. ACM, 1990.
7. Georges Gonthier, Jean-Jacques Lévy, and Paul-André Melliès. An abstract standardisation theorem. In Seventh Annual IEEE Symposium on Logic in Computer Science, 1992.
8. Milind Gandhe, G. Venkatesh, and Amitabha Sanyal. Labeled λ-calculus and a generalised notion of strictness. In Asian Computing Science Conference, Lecture Notes in Computer Science. Springer-Verlag, December 1995.
9. Gérard Huet and Jean-Jacques Lévy. Computations in Orthogonal Term Rewriting Systems. MIT Press, 1991.
10. Chris Hanna and Roy Levin. The Vesta language for configuration management. Research Report 107, Digital Equipment Corporation, Systems Research Center, June 1993. Available from http://www.research.digital.com/SRC.
11. John Hughes. Lazy memo-functions. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architecture, pages 129-146, September 1985.
12. Jan Willem Klop. Combinatory Reduction Systems. PhD thesis, CWI, 1980.
13. Jean-Jacques Lévy. Réductions Correctes et Optimales dans le Lambda Calcul. PhD thesis, University of Paris 7, 1978.
14. Roy Levin and Paul R. McJones. The Vesta approach to precise configuration of large software systems. Research Report 105, Digital Equipment Corporation, Systems Research Center, June 1993. Available from http://www.research.digital.com/SRC.
15. Luc Maranget. Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems. In Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991.
16. D. Michie. 'Memo' functions and machine learning. Nature, 218:19-22, 1968.
17. Michael O'Donnell. Computing in Systems described by Equations. PhD thesis, Cornell University, 1977.
18. William Pugh. Incremental Computation and the Incremental Evaluation of Functional Programs. PhD thesis, Cornell University, 1988.