Author:
Löw Tobias,Streicher Thomas
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. Comput. 163(2), 409–470 (2000)
2. Amadio, R.M., Curien, P.-L.: Domains and lambda-calculi. Cambridge University Press, New York (1998)
3. Asperti, A.: Stability and computability in coherent domains. Inf. Comput. 86(2), 115–139 (1990)
4. Barendregt, H.P.: The Lambda Calculus - its syntax and semantics. North-Holland, Amsterdam (1981) (1984)
5. Cartwright, R., Curien, P.-L., Felleisen, M.: Fully abstract models of observably sequential languages. Information and Computation 111(2), 297–401 (1994)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The stack calculus;Electronic Proceedings in Theoretical Computer Science;2013-03-28