Author:
Brock Simon,Ostheimer Gerald
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. S. Abramsky. The lazy λ-calculus. In D. Turner, editor, Research Topics in Functional Programming, pages 65–117. Addison-Wesley, 1990.
2. Z. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. A call-by-need λ-calculus. In The Conference Record of Principles of Programming Languages, ACM, 1995.
3. H. Barendregt. The λ-calculus: its syntax and semantics, Studies in logic and the foundations of mathematics, volume 103. Elsevier Science Publishers, 1984.
4. G. Boudol. Some chemical abstract machines. In A Decade of Concurrency — Reflections and Perspectives, Proceedings of the REX School Symposium, LNCS 803, pages 92–123. Springer-Verlag, June 1993.
5. S. Brock and G. Ostheimer. Process semantics of graph reduction. Technical report, Computer Science Division, University of St. Andrews, 1995.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Asynchronous $$\pi $$ -calculus at Work: The Call-by-Need Strategy;The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy;2019
2. Continuations, Processes, and Sharing;Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming - PPDP '14;2014
3. A Process Semantics for Functional Programming;Electronic Notes in Theoretical Computer Science;1995
4. Constraints for free in concurrent computation;Algorithms, Concurrency and Knowledge;1995
5. Process semantics of graph reduction;CONCUR '95: Concurrency Theory;1995