System F with type equality coercions (2007)
Cached
Download Links
- [www.cse.unsw.edu.au]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
by
Martin Sulzmann
,
Manuel M. T. Chakravarty
,
Simon Peyton Jones
,
Kevin Donnelly
| Citations: | 57 - 21 self |
BibTeX
@MISC{Sulzmann07systemf,
author = {Martin Sulzmann and Manuel M. T. Chakravarty and Simon Peyton Jones and Kevin Donnelly},
title = {System F with type equality coercions},
year = {2007}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce System FC, which extends System F with support for non-syntactic type equality. There are two main extensions: (i) explicit witnesses for type equalities, and (ii) open, non-parametric type functions, given meaning by toplevel equality axioms. Unlike System F, FC is expressive enough to serve as a target for several different source-language features, including Haskell’s newtype, generalised algebraic data types, associated types, functional dependencies, and perhaps more besides.
