Ruler: Programming type rules

19Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Some type systems are first described formally, to be sometimes followed by an implementation. Other type systems are first implemented as language extensions, to be sometimes retrofitted with a formal description. In neither case it is an easy task to keep both artefacts consistent. In this paper we introduce Ruler, a domain specific language for describing type rules. Type rules can be incrementally described, thus providing a means for building complex type systems on top of simpler ones. Besides checking well-formedness of Ruler programs we use them to generate (1) a visual L A T E X rendering, suitable for use in the presentation of formal aspects, and (2) an attribute grammar based implementation. Combining these two aspects in Ruler contributes to bridging the gap between theory and practice: mutually consistent representations can be generated for use in both theoretical and practical settings. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Dijkstra, A., & Doaitse Swierstra, S. (2006). Ruler: Programming type rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3945 LNCS, pp. 30–46). Springer Verlag. https://doi.org/10.1007/11737414_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free