Tim: A simple, lazy abstract machine to execute supercombinators-Reference-Cited by-同舟云学术

Tim: A simple, lazy abstract machine to execute supercombinators

Published:1987 Issue: Volume: Page:34-45
ISSN:0302-9743
Container-title:Functional Programming Languages and Computer Architecture
language:
Short-container-title:

Author:

Fairbairn Jon,Wray Stuart

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-18317-5_3

Reference14 articles.

1. Luca Cardelli, The Functional Abstract Machine, Bell Laboratories Computing Science Technical Report No. 107.

2. G. Cousineau, P-L. Curien, M. Mauny, The Categorical Abstract Machine, Science of Computer Programming Vol 8, pp 173–202, 1987.

3. Jon Fairbairn, Ponder and its Type System, University of Cambridge Computer Laboratory Technical Report No. 31, 1983.

4. Jon Fairbairn, Design and Implementation of a Simple Typed Language Based on the Lambda-Calculus, University of Cambridge Computer Laboratory Technical Report No. 75, May 1985.

5. Jon Fairbairn & Stuart Wray, Code generation techniques for functional languages, 1986 ACM Conference on Lisp and Functional Programming (proceedings) pp 95–104

Cited by 49 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cactus Environment Machine;Lecture Notes in Computer Science;2019

2. Formal Verification of the Correspondence Between Call-by-Need and Call-by-Name;Functional and Logic Programming;2018

3. Liveness-based garbage collection for lazy languages;Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management;2016-06-14

4. The Very Lazy λ-Calculus and the STEC Machine;Implementation and Application of Functional Languages;2010

5. Strongly reducing variants of the Krivine abstract machine;Higher-Order and Symbolic Computation;2007-10-24