Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. S. Abramsky: The Lazy Lambda Calculus. Chapter 4 in D. Turner (ed.), Research Topics in Functional Programming, pp. 65–116, Addison Wesley. (1988)
2. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, & M.R. Sleep: Term Graph Rewriting. Proc. PARLE 87, Springer LNCS 259, p141–158. (1987)
3. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, & M.R. Sleep: Lean: An Intermediate Language Based on Graph Rewriting. Parallel Computing, Vol 9, p163–177. (1989)
4. G. Berry & G. Boudol: The Chemical Abstract Machine. POPL 90, p 81–94. (1990)
5. D. Berry, R. Milner, & D.N. Turner: A semantics for ML concurrency primitives. Laboratory for Foundations of Computer Science, Edinburgh University. (1991)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献