Polytypic Values Possess Polykinded Types (2000)
Cached
Download Links
- [www.informatik.uni-bonn.de]
- [www.informatik.uni-bonn.de]
- [www.informatik.uni-bonn.de]
- [www.cs.bonn.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 102 - 20 self |
BibTeX
@MISC{Hinze00polytypicvalues,
author = {Ralf Hinze},
title = {Polytypic Values Possess Polykinded Types},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A polytypic value is one that is defined by induction on the structure of types. In Haskell the type structure is described by the so-called kind system, which distinguishes between manifest types like the type of integers and functions on types like the list type constructor. Previous approaches to polytypic programming were restricted in that they only allowed to parameterize values by types of one fixed kind. In this paper we show how to define values that are indexed by types of arbitrary kinds. It appears that these polytypic values possess types that are indexed by kinds. We present several examples that demonstrate that the additional exibility is useful in practice. One paradigmatic example is the mapping function, which describes the functorial action on arrows. A single polytypic definition yields mapping functions for datatypes of arbitrary kinds including first- and higher-order functors. Polytypic values enjoy polytypic properties. Using kind-indexed logical relations we prove...
