Author:
Adams Norman,Curtis Pavel,Spreitzer Mike
Abstract
In most programming language implementations, the compiler has detailed knowledge of the representations of and operations on primitive data typed and data-type constructors. In SCHEMEXEROX, this knowledge is almost entirely external to the compiler, in ordinary, procedural user code. The primitive representations and operations are embodied in first-class “representation types” that are constructed and implemented in an abstract and high-level fashion. Despite this abstractness, a few generally-useful optimizing transformations are sufficient to allow the SCHEMEXEROX compiler to generate efficient code for the primitive operations, essentially as good as could be achieved using more contorted, traditional techniques.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference9 articles.
1. Clinger William and Jonathan Rees editors Revised4 Report on the Algorithmic Programming Language Scheme LiSP Pointers 4(3) 1991. Clinger William and Jonathan Rees editors Revised4 Report on the Algorithmic Programming Language Scheme LiSP Pointers 4(3) 1991.
2. The scheme of things
3. A module system for scheme
4. ORBIT: an optimizing compiler for scheme
5. An open-ended data representation model for EU_LISP