Phantom types and subtyping

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 448-460

  Fluet, Matthew ^a   Pucella, Riccardo ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; PHANTOMS; POLYMORPHISM;

MULTIPLE INTERFACES; PARAMETRIC POLYMORPHISM; POLYMORPHIC TYPES; SUBTYPING RELATION; SUBTYPINGS; TYPE CONSTRAINTS; TYPE SYSTEMS; TYPE-PRESERVING TRANSLATIONS;

FORMAL LANGUAGES;

EID: 31744438118     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_37     Document Type: Article

References (14)

1. M. Blume. No-Longer-Foreign: Teaching an ML compiler to speak C natively. In Electronic Notes in Theoretical Computer Science, volume 59. Elsevier Science Publishers, 2001.
2. F. Burton. Type extension through polymorphism. ACM Transactions on Programming Languages and Systems, 12(1): 135-138, January 1990.
3. L. Cardelli, S. Martini, J. C. Mitchell, and A. Scedrov. An extension of System F with subtyping. Information and Computation, 109(l-2):4-56, 1994.
4. L. Damas and R. Milner. Principal type-schemes for functional programs. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 207-212. ACM Press, 1982.
5. C. Elliott, S. Finne, and O. de Moor. Compiling embedded languages. In Workshop on Semantics, Applications, and Implementation of Program Generation, 2000.
6. S. Finne, D. Leijen, E. Meijer, and S. Peyton Jones. Calling hell from heaven and heaven from hell. In Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming, pages 114-125. ACM Press, 1999.
7. S. Kahrs. Red-black trees with types. Journal of Functional Programming, 11(3):425-432, 2001.
8. D. Leijen and E. Meijer. Domain specific embedded compilers. In Proceedings of the Second Conference on Domain-Specific Languages (DSU99), pages 109-122, 1999.
9. R. Milner. A theory of type polymorphism in programming. Journal of Computer and Systems Sciences, 17(3):348-375, 1978.
10. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, Mass., 1997.
11. F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. In Conference Record of the Twenty-Sixth Annual ACM Symposium on Principles of Programming Languages, pages 276-290. ACM Press, 1999.
12. D. Rémy. Records and variants as a natural extension of ML. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 77-88. ACM Press, 1989.
13. J. H. Reppy. A safe interface to sockets. Technical memorandum, AT&T Bell Laboratories, 1996.
14. M. Wand. Complete type inference for simple objects. In Proceedings of the 2nd Annual IEEE Symposium on Logic in Computer Science, 1987.