Universal Types and What They are Good For-Reference-Cited by-同舟云学术

Universal Types and What They are Good For

Published:2003 Issue: Volume: Page:25-63
ISSN:
Container-title:Domain Theory, Logic and Computation
language:
Short-container-title:

Author:

Longley John R.

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-017-1291-0_2

Reference26 articles.

1. Abramsky, S. and McCusker, G., Game semantics, In: H. Schwichtenberg and U. Berger (editors), Computational Logic: Proceedings of the 1997 Marktoberdorf summer school, Springer-Verlag, 1999, 1–56.

2. Barendregt, H. P., The Lambda Calculus: Its Syntax and Semantics, North-Holland 1984.

3. Bucciarelli, A. and Ehrhard, T., Sequentiality and strong stability, In: Proc. 6th Annual Symposium on Logic in Computer Science, IEEE Computer Soc. Press, 1991, 138–145.

4. Cartwright, R., Curien, P.-L. and Felleisen, M., Fully abstract semantics for observably sequential languages, Information and Computation 111 (2) (1994), 297–401.

5. Cartwright, R. and Felleisen, M., Observable sequentiality and full abstraction, In: Proc. 19th Symp. Principles of Programming Languages, ACM Press, 1992, 328–342.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two Parametricities Versus Three Universal Types;ACM Transactions on Programming Languages and Systems;2022-09-21

2. Parametricity versus the universal type;Proceedings of the ACM on Programming Languages;2018-01

3. A Graph Model for Imperative Computation;Logical Methods in Computer Science;2010-01-12

4. On the ubiquity of certain total type structures;Mathematical Structures in Computer Science;2007-10

5. The Elimination of Nesting in SPCF;Lecture Notes in Computer Science;2005