Type-safe run-time polytypic programming

Journal of Functional Programming

Volumn 16, Issue 6, 2006, Pages 681-710

  Weirich, Stephanie ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HASKELL; POLYMORPHIC RECURSION; POLYTYPIC PROGRAMMING; PROTOTYPE IMPLEMENTATIONS; RUNTIMES; SEPARATE COMPILATION; TYPE INFORMATION;

MACHINERY;

SEMANTICS;

EID: 33750272381     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796806005879     Document Type: Article

References (34)

1. Abadi, M., Cardelli, L., Pierce, B. and Plotkin, G. (1991) Dynamic typing in a statically-typed language. ACM Trans. Program. Lang. Syst. 13(2): 237-268.
2. Abadi, M., Cardelli, L., Pierce, B. and Rémy, D. (1995) Dynamic typing in polymorphic languages. J. Funct. Program. 5(1): 111-130.
3. Cheney, J. and Hinze, R. (2002) Poor man's dynamics and generics. In: Chakravarty, M. M. (ed.), Proceedings of the ACM SIGPLAN 2002 Haskell Workshop. ACM Press.
4. Coquand, T. (1991) An algorithm for testing conversion in type theory. In: Huet, G. and Plotkin, G. (eds.), Logical Frameworks pp. 255-277. Cambridge University Press.
5. Crary, K. and Weirich, S. (1999) Flexible type analysis. Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP), pp. 233-248.
6. Crary, K., Weirich, S. and Morrisett, G. (2002) Intensional polymorphism in type erasure semantics. J. Funct. Program. 12(6): 567-600.
7. Dubois, C., Rouaix, F. and Weis, P. (1995) Extensional polymorphism. Twenty-Second ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 118-129.
8. Fegaras, L. and Sheard, T. (1996) Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space). Conf. Record 23rd ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, POPL'96, St. Petersburg Beach, FL, USA, 21-24 Jan. 1996, pp. 284-294. ACM Press.
9. Girard, J.-Y. ( 1971 ) Une extension de l'interprétation de Gödel à l'analyse, et son application à l'èlimination de coupures dans l'analyse et la théorie des types. In: Fenstad, J. E. (ed.), Proceedings of the Second Scandinavian Logic Symposium pp. 63-92. North-Holland Publishing Co.
10. Girard, J.-Y. (1972) Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur. PhD thesis, Université Paris VII
11. Harper, R. and Morrisett, G. (1995) Compiling polymorphism using intensional type analysis. Twenty-Second ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 130-141.
12. Hinze, R. (2000) Polytypic values possess polykinded types. In: Backhouse, R. and Oliveira, J. (eds), Proceedings of the Fifth International Conference on Mathematics of Program Construction (MPC 2000), pp. 2-27.
13. Hinze, R., Jeuring, J. and Löh, A. (2002) Type-indexed data types. In: Eerke Boiten, B. M. (ed.), Proceedings of the Sixth International Conference on Mathematics of Program Construction (MPC 2002), pp. 148-174.
14. Jansson, P. and Jeuring, J. (1997) Polyp - A polytypic programming language extension. Twenty-Fourth ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 470-482.
15. Jay, C. B., Bellè, G. and Moggi, E. (1998) Functorial ML. J. Funct. Program. 8(6): 573-619.
16. Löh, A., Clarke, D. and Juering, J. (2003) Dependency-style Generic Haskell. ACM SIGPLAN International Conference on Functional Programming (ICFP). To appear.
17. Morrisett, G. and Harper, R. (1997) Semantics of memory management for polymorphic languages. In: Gordon, A. D. and Pitts, A. M. (eds.). Higher Order Operational Techniques in Semantics. Cambridge University Press.
18. Morrisett, G., Felleisen, M. and Harper, R. (1995) Abstract models of memory management. FPCA95: Conference on Functional Programming Languages and Computer Architecture (FPLCA), pp. 66-77.
19. Odersky, M. and Läufer, K. (1996) Putting type annotations to work. Conference Record of POPL '96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, St. Petersberg Beach, Florida. pp. 54-67.
20. Peyton Jones, S. (ed). (2003) Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press.
21. Pierce, B. C. and Turner, D. N. (1998) Local type inference. Conference Record of POPL 98: The 25TH ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 252-265.
22. Reynolds, J. C. (1983) Types, abstraction and parametric polymorphism. Information Processing '83 pp. 513-523. North-Holland. Proceedings of the IFIP 9th World Computer Congress.
23. Ruehr, F. (1998) Structural polymorphism. In: Backhouse, R. and Sheard, T. (eds.), Informal Proceedings Workshop on Generic Programming, WGP'98, Marstrand, Sweden.
24. Saha, B., Trifonov, V. and Shao, Z. (2000) Fully reflexive intensional type analysis in type erasure semantics. Third ACM SIGPLAN Workshop on Typen in Compilation.
25. Schürmann, C., Despeyroux, J. and Pfenning, F. (2001) Primitive recursion for higher-order abstract syntax. Theor. Comput. Sci. 266(1-2): 1-58.
26. Sheard, T. (1993) Type parametric programming. Tech. rept. CSE 93-018. Oregon Graduate Institute.
27. Stone, C. and Harper, R. (2000) Deciding type equivalence in a language with singleton kinds. Twenty-Seventh ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) pp. 214-225.
28. Trifonov, V., Saha, B. and Shao, Z. (2000) Fully reflexive intensional type analysis. Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP), pp. 82-93.
29. Wadler, P. (1989) Theorems for free! FPCA89: Conference on Functional Programming Languages and Computer Architecture (FPLCA).
30. Wadler, P. and Blott, S. (1989) How to make ad-hoc polymorphism less ad hoc. Sixteenth ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) pp. 60-76. ACM Press.
31. Washburn, G. and Weirich, S. (2003) Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism. ACM SIGPLAN International Conference on Functional Programming (ICFP), pp. 249-262.
32. Weirich, S. (2001) Encoding intensional type analysis. In: Sands, D. (ed.), 10th European Symposium on Programming (ESOP), pp. 92-106.
33. Weirich, S. (2002a) Higher-order intensional type analysis. In: Métayer, D. L. (ed), 11th European Symposium on Programming (ESOP), pp. 98-114.
34. Weirich, S. (2002b) Programming With Types. PhD thesis, Cornell University.