Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. S. Abramsky, Retracing some paths in process algebra. In Proc. 7th Int. Conf. Concurrency Theory (CONCUR'96), Springer LNCS 1119, pages 1–17, 1996.
2. Z. Ariola and Arvind, Properties of a first-order functional language with sharing. Theoretical Computer Science 146, pages 69–108, 1995.
3. Z. Ariola and M. Felleisen, A call-by-need lambda calculus. Technical report CIS-TR-96-97, 1996. To appear in Journal of Functional Programming.
4. Z. Ariola and J. Klop, Cyclic lambda graph rewriting. In Proc. 9th Symposium on Logic in Computer Sciece (LICS'94), pages 416–425, 1994.
5. S. L. Bloom and Z. Ésik, Iteration Theories. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993.
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献