Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Lect Notes Comput Sci;S. Abramsky,1994
2. S. Abramsky and G. McCusker. Games and full abstraction for the lazy λ-calculus. In Proceedings LICS’ 95, 1995.
3. S. Abramsky and G. McCusker. Games for recursive types. In I. C. Mackie C. L. Hankin and R. Nagarajan, editors, Theory and Formal Methods of Computing 1994: Proceedings of the Second Imperial College Department of Computing Workshop on Theory and Formal Methods. Imperial College Press, October 1995.
4. S. Abramsky and C.H.L. Ong. Full abstraction in the lazy λ-calculus. Information and Computation, 105:159–267, 1993.
5. O. Bastonero, A. Pravato, and S Ronchi. Structures for lazy semantics. In Programming Concepts and Methods, PROCOMET’98. Chapman & Hall, 1998.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献