Author:
Okasaki Chris,Lee Peter,Tarditi David
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Software,General Computer Science
Reference30 articles.
1. Appel, Andrew W. and Jim, Trevor. Continuation-passing, closure-passing style. InSixteenth ACM Symposium on Principles of Programming Languages (1989) 293?302.
2. Asperti, Andrea. Integrating strict and lazy evaluation: the ? sl -calculus. In Deransart, P. and Maluszy?ski, J., editors,Programming Language Implementation and Logic Programming, Sweden, Springer-Verlag (1990) 238?254.
3. Augusteijn, A. and van der Hoeven, G. Combinatorgraphs as self-reducing programs. (1984). Unpublished workshop presentation.
4. Augustsson, Lennart.Compiling Lazy Functional Languages, Part II. PhD thesis, Department of Computer Sciences, Chalmers University of Technology (1987).
5. Bloss, Adrienne, Hudak, Paul, and Young, Jonathan. Code optimizations for lazy evaluation.Lisp and Symbolic Computation, 1 (1988) 147?164.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strictly capturing non-strict closures;Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation;2021-01-17
2. A calculus of expandable stores;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
3. Compiling with continuations, or without? whatever.;Proceedings of the ACM on Programming Languages;2019-07-26
4. Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order;Programming Languages and Systems;2019
5. Realizability Interpretation and Normalization of Typed Call-by-Need $$\lambda $$-calculus with Control;Lecture Notes in Computer Science;2018