Sexy types in action

ACM SIGPLAN Notices

Volumn 39, Issue 5, 2004, Pages 15-22

  Shan, Chung Chieh ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER SCIENCE; INFORMATION TECHNOLOGY; SEMANTICS; SOFTWARE ENGINEERING; TECHNICAL PRESENTATIONS;

FUNCTIONAL PROGRAMMING; PARAMETRIC POLYMORPHISM; PARAMETRICITY; VERBOSITY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 4444256167     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/997140.997142     Document Type: Article

References (53)

1. Baars, Arthur I., and S. Doaitse Swierstra. 2002. Typing dynamic typing. In ICFP (2002), 157-166.
2. Bird, Richard, and Ross Pater son. 1999. de Bruijn notation as a nested datatype. Journal of Functional Programming 9(1): 77-91.
3. Böhm, Corrado, and Alessandro Berarducci. 1985. Automatic synthesis of typed A-programs on term algebras. Theoretical Computer Science 39:135-154.
4. Church, Alonzo. 1932. A set of postulates for the foundation of logic. Annals of Mathematics II.33(2):346-366.
5. _. 1940. A formulation of the simple theory of types. Journal of Symbolic Logic 5(2):56-68.
6. Claessen, Koen. 2002. Parallel parsing processes. Submitted to the Journal of Functional Programming. http://www. math.chalmers.se/~koen/Papers/ parsing-pearl.ps.
7. Clément, Dominique, Thierry Despeyroux, Gilles Kahn, and Joëlle Despeyroux. 1986. A simple applicative language: Mini-ML. In Proceedings of the 1986 ACM conference on Lisp and functional programming, 13-27. New York: ACM Press.
8. Damas, Luis, and Robin Milner. 1982. Principal type-schemes for functional programs. In POPL '82: Conference record of the annual ACM symposium on principles of programming languages, 207-212. New York: ACM Press.
9. Gaster, Benedict R., and Mark P. Jones. 1996. A polymorphic type system for extensible records and variants. Tech. Rep. NOTTCS-TR-96-3, School of Computer Science and Information Technology, University of Nottingham.
10. Gill, Andrew, John Launchbury, and Simon L. Peyton Jones. 1993. A short cut to deforestation. In Functional programming languages and computer architecture: 6th conference, 223-232, New York: ACM Press.
11. Girard, Jean-Yves. 1972. Interprétation fonctionnelle et élimination des coupures dans l'arithmétique d'ordre supérieur. Thèse de doctorat d'état, Université Paris VII.
12. Girard, Jean-Yves, Paul Taylor, and Yves Lafont. 1989. Proofs and types. Cambridge: Cambridge University Press.
13. Hall, Cordelia V., Kevin Hammond, Simon L. Peyton Jones, and Philip L. Wadler. 1996. Type classes in Haskell. ACM Transactions on Programming Languages and Systems 18(2):109-138.
14. Hindley, J. Roger. 1969. The principal type-scheme of an object in combinatory logic. Transactions of the American Mathematical Society 146:29-60.
15. Hinze, Ralf. 2000a. Deriving backtracking monad transformers. In ICFP '00: Proceedings of the ACM international conference on functional programming, vol. 35(9) of ACM SIGPLAN Notices, 186-197. New York: ACM Press.
16. _. 2000b. A new approach to generic functional programming. In POPL '00: Conference record of the annual ACM symposium on principles of programming languages, 119-132. New York: ACM Press.
17. _. 2001. Manufacturing datatypes. Journal of Functional Programming 11(5):493-524.
18. Hughes, John. 1995. The design of a pretty-printing library. In Advanced functional programming: 1st international spring school on advanced functional programming techniques, ed. Johan Jeuring and Erik Meijer, 53-96. Lecture Notes in Computer Science 925, Berlin: Springer-Verlag.
19. ICFP. 2002. ICFP '02: Proceedings of the ACM international conference on functional programming. New York: ACM Press.
20. Jones, Mark P. 1997. First-class polymorphism with type inference. In POPL '97: Conference record of the annual ACM symposium on principles of programming languages, 483-496. New York: ACM Press.
21. Jones, Mark P., and Simon L. Peyton Jones. 1999. Lightweight extensible records for Haskell. In Proceedings of the 1999 Haskell workshop, ed. Erik Meijer. Tech. Rep. UU-CS-1999-28, Department of Computer Science, Utrecht University.
22. Kahrs, Stefan, 2001. Red-black trees with types. Journal of Functional Programming 11(4):425-432.
23. Kfoury, Assaf J., and Jerzy Tiuryn. 1992. Type reconstruction in finite rank fragments of the second-order λ-calculus. Information and Computation 98(2):228-257.
24. Kfoury, Assaf J., and Joe B. Wells. 1994. A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus. In Proceedings of the 1994 ACM conference on Lisp and functional programming, 196-207. New York: ACM Press.
25. Kiselyov, Oleg. 2003. Polymorphic stanamically balanced AVL trees. http://okmij.org/ftp/Haskell/types.html.
26. Kiselyov, Oleg, and Chung-chieh Shan. 2004. Implicit configuration - or, type classes reflect the value of types.http://www.eecs.harvard.edu/~ccshan/ prepose/.
27. Lämmel, Ralf, and Simon L. Peyton Jones. 2003. Scrap your boilerplate: A practical design pattern for generic programming. In Proceedings of the 2003 ACM SIGPLAN international workshop on types in languages design and implementation, 26-37. New York: ACM Press.
28. Läufer, Konstantin. 1996. Type classes with existential types. Journal of Functional Programming 6(3):485-517.
29. Launchbury, John, and Simon L. Peyton Jones. 1994. Lazy functional state threads. In PLDI '94: Proceedings of the ACM conference on programming language design and implementation, vol. 29(6) of ACM SIGPLAN Notices, 24-35. New York: ACM Press.
30. _. 1995. State in Haskell. Lisp and Symbolic Computation 8(4):293-341.
31. F: Raising ML to the power of System F. In ICFP '03: Proceedings of the ACM international conference on functional programming, 27-38. New York: ACM Press.
32. Lüth, Christoph, and Neil Ghani. 2002. Composing monads using coproducts. In ICFP (2002), 133-144.
33. Milner, Robin. 1978. A theory of type polymorphism in programming. Journal of Computer and System Sciences 17: 348-375.
34. Mitchell, John C., and Gordon D. Plotkin. 1988. Abstract types have existential type. ACM Transactions on Programming Languages and Systems 10(3):470-502.
35. Moggi, Eugenio, and Amr Sabry. 2001. Monadic encapsulation of effects: A revised approach (extended version). Journal of Functional Programming 11(6):591-627.
36. Odersky, Martin, and Konstantin Läufer. 1996. Putting type annotations to work. In POPL '96: Conference record of the annual ACM symposium on principles of programming languages, 54-67. New York: ACM Press.
37. Okasaki, Chris. 1999. From fast exponentiation to square matrices: An adventure in types. In ICFP '99: Proceedings of the ACM international conference on functional programming, vol. 34(9) of ACM SIGPLAN Notices, 28-35. New York: ACM Press.
38. Peyton Jones, Simon L. 2003. Wearing the hair shirt: A retrospective on Haskell. Invited talk at POPL 2003.
39. Peyton Jones, Simon L., and Mark B. Shields. 2004. Practical type inference for arbitrary-rank types. Submitted to the Journal of Functional Programming. http://research. microsoft.com/~simonpj/papers/putting/.
40. Pierce, Benjamin C., and David N. Turner. 1994. Simple type-theoretic foundations for object-oriented programming. Journal of Functional Programming 4(2):207-247.
41. Reynolds, John C. 1974. Towards a theory of type structure. In Programming symposium: Proceedings, colloque sur la programmation, ed. Bernard Robinet, 408-425. Lecture Notes in Computer Science 19, Berlin: Springer-Verlag.
42. _. 1983. Types, abstraction and parametric polymorphism. In Information processing 83: Proceedings of the IFIP 9th world computer congress, ed. R. E. A. Mason, 513-523. Amsterdam: Elsevier Science.
43. _. 1990. Introduction to part II, polymorphic lambda calculus. In Logical foundations of functional programming: Proceedings of the Year of Programming Institute, ed. Gérard Huet, 77-86. Boston: Addison-Wesley.
44. Reynolds, John C., and Gordon D. Plotkin. 1993. On functors expressible in the polymorphic typed lambda calculus. Information and Computation 105(1):l-29.
45. Strachey, Christopher. 1967. Fundamental concepts in programming languages. Lecture notes for the International Summer School in Computer Programming. Also as Higher-Order and Symbolic Computation 13(1-2):11-49, 2000.
46. Strachey, Christopher. 1967. Fundamental concepts in programming languages. Lecture notes for the International Summer School in Computer Programming. Also as Higher-Order and Symbolic Computation 13(1-2):11-49, 2000.
47. Thurston, Dylan. 2001. Modular arithmetic. Messages to the Haskell mailing list; http://www.haskell.org/ pipermail/haskell-cafe/2001-August/002132. html; http://www.haskell.org/pipermail/haskell-cafe/ 2001-August/002133.html.
48. Voigtländer, Janis. 2002. Concatenate, reverse and map vanish for free. In ICFP (2002), 14-25.
49. Wadler, Philip L. 1989. Theorems for free! In FPCA '89: 4th international conference on functional programming languages and computer architecture, 347-359. New York: ACM Press.
50. _. 2004. The Girard-Reynolds isomorphism (second edition), http://homepages.inf.ed.ac.uk/wadler/ papers/gr2/gr2.pdf.
51. Wadler, Philip L., and Stephen Blott. 1989. How to make ad-hoc polymorphism less ad hoc. In POPL '89: Conference record of the annual ACM symposium on principles of programming languages, 60-76. New York: ACM Press.
52. Wells, Joe B. 1999. Typability and type checking in System F are equivalent and undecidable. Annals of Pure and Applied Logic 98(1-3):111-156.
53. Yakeley, Ashley. 2003. Where are higher-rank and existential types used? Message to the Haskell mailing list; http://haskell.org/pipermail/haskell/ 2003-September/012670.html.