Giving haskell a promotion

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2012, Pages 53-65

  Yorgey, Brent A ^a   Weirich, Stephanie ^a   Cretin, Julien ^b   Jones, Simon Peyton ^c   Vytiniotis, Dimitrios ^c   Magalhães, José Pedro ^d  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b INRIA   (France)

^c MICROSOFT RESEARCH   (United Kingdom)

^d UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Haskell; Kinds; Polymorphism; Promotion

Indexed keywords

DATA TYPE; HASKELL; KINDS; POWER-TO-WEIGHT RATIOS; PROMOTION; STATIC TYPE SYSTEMS; TYPE SYSTEMS;

POLYMORPHISM;

JAVA PROGRAMMING LANGUAGE;

EID: 84857812135     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2103786.2103795     Document Type: Conference Paper

References (33)

1. T. Altenkirch, C. McBride, and W. Swierstra. Observational equality, now! In Proceedings of the 2007 workshop on Programming languages meets program verification, PLPV '07, pages 57-68, New York, NY, USA, 2007. ACM.
2. H. P. Barendregt. Lambda calculi with types, pages 117-309. Oxford University Press, Inc., New York, NY, USA, 1992.
3. Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer-Verlag, 1 edition, June 2004.
4. M. Bolingbroke. Constraint Kinds for GHC. 2011. URL http://blog.omega- prime.co.uk/?p=127.
5. A. Chlipala. Ur: statically-typed metaprogramming with type-level record computation. SIGPLAN Not., 45:122-133, June 2010. ISSN 0362-1340.
6. K. Crary and S. Weirich. Flexible type analysis. In Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), pages 233-248, 1999.
7. A. Dijkstra, J. Fokker, and S. D. Swierstra. The architecture of the Utrecht Haskell compiler. In Proceedings of the 2nd ACM SIGPLAN symposium on Haskell, Haskell '09, pages 93-104, New York, NY, USA, 2009. ACM.
8. J.-Y. Girard. Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur. PhD thesis, Université Paris VII, 1972.
9. R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In Proceedings of the 22nd ACM SIGPLANSIGACT symposium on Principles of programming languages, POPL '95, pages 130-141, New York, NY, USA, 1995. ACM.
10. R. Hinze. Polytypic Values Possess Polykinded Types. In Proceedings of the 5th International Conference on Mathematics of Program Construction, MPC '00, pages 2-27, London, UK, 2000. Springer-Verlag.
11. A. J. C. Hurkens. A Simplification of Girard's Paradox. In Proceedings of the Second International Conference on Typed Lambda Calculi and Applications, pages 266-278, London, UK, 1995. Springer-Verlag.
12. L. Jia, J. A. Vaughan, K. Mazurak, J. Zhao, L. Zarko, J. Schorr, and S. Zdancewic. Aura: a programming language for authorization and audit. In Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, ICFP 2008, Victoria, BC, Canada, September 20-28, 2008, pages 27-38, 2008.
13. O. Kiselyov, R. Lämmel, and K. Schupke. Strongly typed heterogeneous collections. In Haskell 04: Proceedings of the ACM SIGPLAN workshop on Haskell, pages 96-107. ACM Press, 2004.
14. R. Lämmel and S. Peyton Jones. 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, TLDI '03, pages 26-37, New York, NY, USA, 2003. ACM.
15. R. Lämmel and S. Peyton Jones. Scrap your boilerplate with class: extensible generic functions. In Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, ICFP '05, pages 204-215, New York, NY, USA, 2005. ACM.
16. D. Licata and R. Harper. Canonicity for 2-dimensional type theory. In POPL '12. To appear.
17. D. R. Licata and R. Harper. Positively dependent types. In PLPV '09:Proceedings of the 3rd Workshop on Programming Languages Meets Program Verification, pages 3-14, New York, NY, USA, 2009. ACM. ISBN 978-1-60558-330-3.
18. S. Marlow, editor. Haskell 2010 Language Report. 2010. URL http://www.haskell.org/onlinereport/haskell2010/.
19. C. McBride. The Strathclyde Haskell Enhancement. URL http://personal.cis. strath.ac.uk/~conor/pub/she/.
20. C. McBride. Kleisli arrows of outrageous fortune. 2011. URL http://personal.cis.strath.ac.uk/~conor/Kleisli.pdf.
21. N. P. Mendler. Predicative type universes and primitive recursion. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, 15-18 July, 1991, Amsterdam, The Netherlands, pages 173-184. IEEE Computer Society, 1991.
22. S. Monnier and D. Haguenauer. Singleton types here Singleton types there Singleton Types Everywhere, 2009.
23. U. Norell. Towards a practical programming language based on dependent type theory. Chalmers University of Technology, 2007.
24. S. Peyton Jones, D. Vytiniotis, S. Weirich, and G. Washburn. Simple unification-based type inference for GADTs. In Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, ICFP '06, pages 50-61. ACM Press, 2006.
25. T. Schrijvers, S. Peyton Jones, M. M. T. Chakravarty, and M. Sulzmann. Type checking with open type functions. In Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, ICFP '08, pages 51-62. ACM Press, 2008.
26. T. Schrijvers, S. Peyton Jones, M. Sulzmann, and D. Vytiniotis. Complete and decidable type inference for GADTs. In Proceedings of the 14th ACM SIGPLAN international conference on Functional programming, ICFP '09, pages 341-352, New York, NY, USA, 2009. ACM.
27. T. Sheard. Type-level Computation Using Narrowing in Omega. Electr. Notes Theor. Comput. Sci., 174(7):105-128, 2007.
28. T. Sheard and N. Linger. Programming in Omega. In CEFP, pages 158-227, 2007.
29. M. Sulzmann, M. M. T. Chakravarty, S. Peyton Jones, and K. Donnelly. System F with type equality coercions. In Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation, TLDI '07, pages 53-66. ACM Press, 2007.
30. N. Swamy, J. Chen, C. Fournet, P.-Y. Strub, K. Bhargavan, and J. Yang. Secure distributed programming with value-dependent types. pages 266-278.
31. The Coq Team. Coq. URL http://coq.inria.fr.
32. V. Trifonov, B. Saha, and Z. Shao. Fully Reflexive Intensional Type Analysis. In Fifth ACM SIGPLAN International Conference on Functional Programming, pages 82-93. ACM Press, 2000.
33. S. Weirich, D. Vytiniotis, S. Peyton Jones, and S. Zdancewic. Generative type abstraction and type-level computation. In Proceedings of the 38th annual ACM SIGPLAN-SIGACT Symposium on Principles of programming languages, POPL '11, pages 227-240, New York, NY, USA, 2011. ACM.