ORBIT: an optimizing compiler for scheme
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Revised report on the algorithmic language scheme
ACM SIGPLAN Notices
Obtaining coroutines with continuations
Computer Languages
A closer look at export and import statements
Computer Languages
Syntactic extensions in the programming language LISP
Syntactic extensions in the programming language LISP
From interpreter to compiler: a representational derivation
on Programs as data objects
A scheme for a higher-level semantic algebra
Algebraic methods in semantics
A reduction semantics for imperative higher-order languages
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Structure and interpretation of computer programs
Structure and interpretation of computer programs
Using closures for code generation
Computer Languages
Embedding continuations in procedural objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstracting timed preemption with engines
Computer Languages
A syntactic theory of sequential control
Theoretical Computer Science
The little LISPer
The SCHEME programming language
The SCHEME programming language
Reflections on Landin's J-operator: a partly historical note
Computer Languages
A calculus for assignments in higher-order languages
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
BYTE
Abstract continuations: a mathematical semantics for handling full jumps
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Scheme and the art of programming
Scheme and the art of programming
Essentials of programming languages
Essentials of programming languages
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The implementation of PC Scheme
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Expansion-passing style: beyond conventional macros
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
The mystery of the tower revealed: a non-reflective description of the reflective tower
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Continuation-Based Program Transformation Strategies
Journal of the ACM (JACM)
Design of a LISP-based microprocessor
Communications of the ACM
Finding the source of type errors
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proceedings of the Third International Conference on Logic Programming
Engines build process abstractions
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Reification: Reflection without metaphysics
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
The scheme 311 compiler an exercise in denotational semantics
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
T: a dialect of Lisp or LAMBDA: The ultimate software tool
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Continuation-based multiprocessing
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
A semantic comparison of LISP and SCHEME
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
The dream of a lifetime: A lazy variable extent mechanism
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
Macaroni is better than spaghetti
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
ACM '77 Proceedings of the 1977 annual conference
Rabbit: A Compiler for Scheme
The calculi of lambda-nu-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages
Computer
| Hi-index | 0.00 |
This is the first edition of Readings in Scheme, an irregular column featuring a comprehensive bibliography on Scheme. The core of this bibliograpy was shamelessly snarfed from [56], and has been growing ever since, thanks to further additions by Dan Friedman, Ken Dickey and Mark MacLennan.