Giving Haskell a promotion
Open Access
- 28 January 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 53-66
Abstract
Static type systems strive to be richly expressive while still being simple enough for programmers to use. We describe an experiment that enriches Haskell's kind system with two features promoted from its type system: data types and polymorphism. The new system has a very good power-to-weight ratio: it offers a significant improvement in expressiveness, but, by re-using concepts that programmers are already familiar with, the system is easy to understand and implement.Keywords
This publication has 21 references indexed in Scilit:
- Canonicity for 2-dimensional type theory2012
- UrACM SIGPLAN Notices, 2010
- The architecture of the Utrecht Haskell compiler2009
- Programming in ΩmegaLecture Notes in Computer Science, 2008
- Observational equality, now!2007
- Type-level Computation Using Narrowing in ΩmegaElectronic Notes in Theoretical Computer Science, 2007
- Scrap your boilerplate with class2005
- Strongly typed heterogeneous collections2004
- Scrap your boilerplate2003
- Flexible type analysis1999