Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Samson Abramsky and C.-H. Luke Ong. Full Abstraction in the Lazy Lambda Calculus. Information and Computation, 105:159–267, 1993.
2. Martin Abadi, Benjamin Pierce and Gordon Plotkin. Faithful Ideal Models for Recursive Polymorphic Types. Int. J. of Foundations for Computer Science, 2(1):1–21, 1991.
3. Henk Barendregt. The Lambda-Calculus, its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, North-Holland, 1984.
4. Baard Bloom. Can LCF Be Topped? Flat Lattice Models of Typed λ-calculus. Information and Computation 87:264–301, 1990.
5. Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as Implicit Coercion. Information and Computation 93:172–221, 1991. Also in [11], pp 197–245.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Semantic types;ACM SIGPLAN Notices;2004-01
2. Semantic types;Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages;2004-01
3. Typing Non-uniform Concurrent Objects;CONCUR 2000 — Concurrency Theory;2000
4. Semantics of Objects As Processes (SOAP);Object-Oriented Technology ECOOP’99 Workshop Reader;1999
5. Operational Subsumption, an Ideal Model of Subtyping;Electronic Notes in Theoretical Computer Science;1998