Departmental Papers (CIS)

Date of this Version

1-28-2012

Document Type

Conference Paper

Comments

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. TLDI’12, January 28, 2012, Philadelphia, PA, USA. Copyright © 2012 ACM 978-1-4503-1120-5/12/01

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.

Share

COinS
 

Date Posted: 20 July 2012