Back to Basics: Deriving Representations Changers Without Relations (1994)
Cached
Download Links
by
G. Hutton
,
E. Meijer
| Citations: | 6 - 0 self |
BibTeX
@MISC{Hutton94backto,
author = {G. Hutton and E. Meijer},
title = {Back to Basics: Deriving Representations Changers Without Relations},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A representation changer is a function that can be specified in a particular way in terms of two other functions. Examples of representation changers include binary addition and multiplication, base conversion, and compilers. There has been much recent work in using a relational language, namely Jones and Sheerans' Ruby, to derive representation changers from their specifications using equational reasoning. In this paper
