An open and shut typecase

Proceedings of the TLDI'05: 2005 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation

Volumn , Issue , 2005, Pages 13-24

  Vytiniotis, Dimitrios ^a   Washburn, Geoffrey ^a   Weirich, Stephanie ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Ad hoc polymorphism; Generativity; Intensional type analysis; Reflexivity

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING; DATA STRUCTURES;

AD-HOC POLYMORPHISM; GENERATIVITY; INTENSIONAL TYPE ANALYSIS; REFLEXIVITY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 29144443022     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1040294.1040296     Document Type: Conference Paper

References (37)

1. M. Abadi, L. Cardelli, B. Pierce, and G. Plotkin. Dynamic typing in a statically-typed language. ACM Transactions on Programming Languages and Systems, 13(2):237-268, April 1991.
2. D. Clarke, R. Hinze, J. Jeuring, A. Löh, and J. de Wit. The Generic Haskell user's guide. Technical Report UU-CS-2001-26, Utrecht University, 2001.
3. R. Cockett and T. Fukushima. About Charity. Yellow Series Report No. 92/480/18, Department of Computer Science, The University of Calgary, June 1992.
4. K. Crary and S. Weirich. Flexible type analysis. In Proceedings of the Fourth International Conference on Functional Programming (ICFP), pages 233-248, Paris, Sept. 1999.
5. K. Crary, S. Weirich, and G. Morrisett. Intensional polymorphism in type erasure semantics. Journal of Functional Programming, 12(6):567-600, Nov. 2002.
6. D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In Proceedings of the Thirtieth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 236-249. ACM Press, 2003.
7. V. Gapeyev and B. Pierce. Regular object types. In Proc. 10th International Workshops on Foundations of Object-Oriented Languages, FOOL '03, New Orleans, LA, USA, Jan. 2003.
8. J. Garrigue. Programming with polymorphic variants. In ML Workshop, Sept. 1998.
9. J.-Y. Girard. Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur, PhD thesis, Université Paris VII, 1972.
10. N. Glew. Type dispatch for named hierarchical types. In 1999 ACM SIGPLAN International Conference on Functional Programming, pages 172-182, Paris, France, Sept. 1999.
11. D. Grossman, G. Morrisett, and S. Zdancewic. Syntactic type abstraction. ACM Transactions on Programming Languages and Systems, 22(6):1037-1080, Nov. 2000.
12. R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Twenty-First ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 123-137, Portland, Oregon, Jan. 1994.
13. R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In Twenty-Second ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 130-141, San Francisco, Jan. 1995.
14. R. Hinze. Polytypic values possess polykinded types. Science of Computer Programming, 43(2-3):129-159, 2002. MPC Special Issue.
15. R. Hinze and S. Peyton Jones. Derivable type classes. In G. Hutton, editor, Proceedings of the Fourth Haskell Workshop, Montreal, Canada, September 17, 2000, volume 41.1 of Electronic Notes in Theoretical Computer Science. Elsevier Science, Aug. 2000.
16. H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. Journal of Functional Programming, 13(4), 2002.
17. P. Jansson and J. Jeuring. PolyP - A polytypic programming language extension. In Twenty-Fourth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 470-482, Paris, France, 1997.
18. C. Jay. Programming in FISh. International Journal on Software Tools for Technology Transfer, 2:307-315, 1999.
19. C. B. Jay, G. Bellè, and E. Moggi. Functorial ML. Journal of Functional Programming, 8(6):573-619, Nov. 1998.
20. R. Lämmel and S. Peyton Jones. Scrap your boilerplate: a practical design pattern for generic programming. In Proc. of the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2003), 2003.
21. J. J. Leifer, G. Peskine, P. Sewell, and K. Wansbrough. Global abstraction-safe marshalling with hash types. In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pages 87-98, Uppsala, Sweden, 2003.
22. A. Löh, D. Clarke, and J. Jeuring. Dependency-style generic haskell. In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pages 141-152, 2003.
23. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, Massachusetts, 1997.
24. G. Morrisett, M. Felleisen, and R. Harper. Abstract models of memory management. In FPCA95: Conference on Functional Programming Languages and Computer Architecture, pages 66-77, La Jolla, CA, June 1995.
25. S. Peyton Jones, editor. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
26. D. Rémy. Records and variants as a natural extension of ML. In Sixteenth Annual Symposium on Principles Of Programming Languages, 1989. Available from http://doi.acm.org/10.1145/75277.75284.
27. D. Rémy. Type inference for records in a natural extension of ML. In C. A. Gunter and J. C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. MIT Press, 1993.
28. J. C. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing '83, pages 513-523. North-Holland, 1983. Proceedings of the IFIP 9th World Computer Congress.
29. A. Rossberg. Generativity and dynamic opacity for abstract types. In D. Miller, editor, Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, Uppsala, Sweden, Aug. 2003. ACM Press.
30. C. Stone and R. Harper. Deciding type equivalence in a language with singleton kinds. In Twenty-Seventh ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 214-225, Boston, MA, USA, Jan. 2000.
31. V. Trifonov, B. Saha, and Z. Shao. Fully reflexive intensional type analysis. In Fifth ACM SIGPLAN International Conference on Functional Programming, pages 82-93, Montreal, Sept. 2000.
32. J. C. Vanderwaart, D. Dreyer, L. Petersen, K. Crary, R. Harper, and P. Cheng. Typed compilation of recursive datatypes. In ACM SIGPLAN Workshop on Types in Language Design and Implementation, New Orleans, USA, Jan. 2003.
33. D. Vytiniotis, G. Washburn, and S. Weirich. An open and shut typecase. Technical Report MS-CIS-04-26, University of Pennsylvania, 2004. Available from http://www.cis.upenn.edu/~dimitriv/itaname.
34. P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Sixteenth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 60-76. ACM Press, 1989.
35. S. Weirich. Higher-order intensional type analysis. In D. L. Métayer, editor, 11th European Symposium on Programming, pages 98-114, Grenoble, France, 2002.
36. A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Information and Computation, 115:38-94, 1994.
37. M. Zenger and M. Odersky. Independently extensible solutions to the expression problem. Technical Report IC/2004/33, EPFL Lausanne, Switzerland, 2004.