- Full text PDF available (2)
- This year (0)
- Last 5 years (3)
- Last 10 years (4)
Journals and Conferences
We present a uniqueness type system that is simpler than both Clean’s uniqueness system and a system we proposed previously. The new type system is straightforward to implement and add to existing… (More)
By dynamically recoding data on the basis of current intercharacter probabilities, the entropy of encoded messages can be significantly reduced.
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique such that data… (More)
We modify Clean’s uniqueness type system in two ways. First, while Clean functions that are partially applied to a unique argument are necessarily unique (they cannot lose their uniqueness), we just… (More)
Entry time into the extended writable control store on the VAX-11/780 can be reduced to 200 nanoseconds by means of this simple hardware modification.
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion by a number of… (More)