Author:
Ker Andrew D.,Nickau Hanno,Ong C.-H.Luke
Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. Full abstraction for PCF;Abramsky;Information and Computation,2000
2. S. Abramsky, G.A. McCusker, Games and full abstraction for the lazy λ-calculus, In: Proceedings, Tenth Ann. IEEE Sym. on Logic in Computer Science, IEEE Computer Society Press, 1995, 234–243.
3. Full abstraction in the lazy lambda calculus;Abramsky;Information and Computation,1993
4. H.P. Barendregt, The Lambda Calculus, Its Syntax and Semantics, 103, Studies in Logic and the Foundations of Mathematics, of North-Holland, Amsterdam, 1984.
5. Infinite λ-calculus and types;Berarducci;Theore. Comput. Sci.,1999
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Extensional and Non-extensional Functions as Processes;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Eager functions as processes;Theoretical Computer Science;2022-04
3. Eager Functions as Processes;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09
4. Typed Normal Form Bisimulation;Computer Science Logic