Giving Haskell a promotion
- 28 January 2012
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation - TLDI '12
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 theoryPublished by Association for Computing Machinery (ACM) ,2012
- UrACM SIGPLAN Notices, 2010
- The architecture of the Utrecht Haskell compilerPublished by Association for Computing Machinery (ACM) ,2009
- Programming in ΩmegaLecture Notes in Computer Science, 2008
- Observational equality, now!Published by Association for Computing Machinery (ACM) ,2007
- Type-level Computation Using Narrowing in ΩmegaElectronic Notes in Theoretical Computer Science, 2007
- Scrap your boilerplate with classPublished by Association for Computing Machinery (ACM) ,2005
- Strongly typed heterogeneous collectionsPublished by Association for Computing Machinery (ACM) ,2004
- Scrap your boilerplatePublished by Association for Computing Machinery (ACM) ,2003
- Flexible type analysisPublished by Association for Computing Machinery (ACM) ,1999