Stanly T. Shebs. "Implementing primitive datatypes for higher-level languages". Technical Report UUCS-88-020, University of Utah, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Representing Type Information in Dynamically Typed Languages - Gudeman (1993) (19 citations) (Correct)
....timul(i,j) i (j 4) #define tidiv(i,j) i j) 4 If a different tag is used, then the C operation (i 4) t int is arithmetically equivalent to 16i t int. So, since Gamma(16i t int) 2t int = 16( Gammai) t int negation can be implemented by #define tineg(i) i 2 tint as mentioned in [19]. Similarly, since (16i t int) 16j t int) Gamma t int = 16(i j) t int addition can be implemented by #define tiadd(i,j) i j tint and since (16i t int) Gamma (16j t int) t int = 16(i Gamma j) t int subtraction can be implemented by #define tisub(i,j) i j tint Note ....
....would take a machine description and some sort of description of type frequencies and produce a good representation scheme. Of course the number of representations is exponential in several parameters, so asking for an optimal scheme is probably not reasonable. There has been a program written [19, 18] that actually implements a great deal of this suggestion for a subset of the possible representations ( 19] contains an excelent summary of data representations used in many language systems) This program is intended to help decide on representations for a given implementation of a runtime ....
[Article contains additional citation context not shown here]
Stanly T. Shebs. "Implementing primitive datatypes for higher-level languages". Technical Report UUCS-88-020, University of Utah, 1988.
Analysis of Recursive Types in an Imperative Language - Wang (1994) (9 citations) (Correct)
....provisions to allow errors to remain undetected, thus removing the need for type checking. This book is also available in HTML on the Internet [33] 6 The literature on this subject is scattered and fragmentary. There are a few papers on the specific topic of tagging and data representation [16, 30]. More information can be found in papers that describe particular Lisp implementations [4, 7, 6, 8, 15, 14, 21, 35, 38] and in the description of Lisp systems evaluated by Richard Gabriel [12] In addition, at least one system, Allegro Common Lisp, uses the address alignment trap available on ....
Stanley T. Shebs. Implementing Primitive Datatypes for Higher-Level Languages. PhD thesis, University of Utah, 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC