Phantom types and subtyping

Journal of Functional Programming

Volumn 16, Issue 6, 2006, Pages 751-791

  Fluet, Matthew ^a   Pucella, Riccardo ^b  

^a Department of Obstetrics Gynecology   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

CALCULATIONS;

FORMAL LANGUAGES;

EID: 33750235501     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796806006046     Document Type: Article

References (14)

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