Author:
Sands David,Gustavsson Jörgen,Moran Andrew
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Lect Notes Comput Sci;Z. M. Ariola,1997
2. M. Abadi and L. Cardelli, A theory of objects, Springer-Verlag, New York, 1996.
3. Z. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler, A call-byneed lambda calculus, Proc. POPL’95, the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, January 1995, pp. 233–246.
4. Lars Andersen and Carsten Gomard, Speedup analysis in partial evaluation: Preliminary results, Proceedings of the 1992 ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation (San Francisco, U.S.A.), Association for Computing Machinery, June 1992, pp. 1–7.
5. Gerard Boudol and Laurent Kott, Recursion induction principle revisited, Theoretical Computer Science 22 (1983), 135–173.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Multi types and reasonable space;Proceedings of the ACM on Programming Languages;2022-08-29
2. The (In)Efficiency of interaction;Proceedings of the ACM on Programming Languages;2021-01-04
3. The Machinery of Interaction;22nd International Symposium on Principles and Practice of Declarative Programming;2020-09-08
4. Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits;Journal of Automated Reasoning;2017-09-22
5. Implementing Open Call-by-Value;Fundamentals of Software Engineering;2017