Deciding Type Equivalence in a Language with Singleton Kinds (2000)
Cached
Download Links
by
Christopher A. Stone
,
Robert Harper
| Venue: | In Twenty-Seventh ACM Symposium on Principles of Programming Languages |
| Citations: | 38 - 7 self |
BibTeX
@INPROCEEDINGS{Stone00decidingtype,
author = {Christopher A. Stone and Robert Harper},
title = {Deciding Type Equivalence in a Language with Singleton Kinds},
booktitle = {In Twenty-Seventh ACM Symposium on Principles of Programming Languages},
year = {2000},
pages = {214--227}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Work on the TILT compiler for Standard ML led us to study a language with singleton kinds: S(A) is the kind of all types provably equivalent to the type A. Singletons are interesting because they provide a very general form of definitions for type variables, allow fine-grained control of type computations, and allow many equational constraints to be expressed within the type system.
