BibTeX
@MISC{Sheard_programmingin,
author = {Tim Sheard and Nathan Linger},
title = {Programming in \Omega mega.},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
1 Introduction \Omega mega is a language with an infinite hierarchy of computational levels: value, type, kind, sort, etc. Data, and functions manipulating data, can be introduced at any level. Data is introduced by declaring the type of constructors, and functions are introduced by writing (possibly recursive) pattern matching equations. Terms at each level are classified by terms at the next level. Thus values are classified by types, types are classified by kinds, kinds are classified by sorts, etc. As discussed earlier, programmers are allowed to introduce new terms and functions at every level, but any particular program will have terms at only a finite number of levels. We illustrate the level hierarchy for the many of the examples given in this paper in Figure 1.
