A Tractable Scheme Implementation

A Tractable Scheme Implementation (0)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Richard Kelsey Kelsey , Jonathan A. Rees

Venue:	Lisp and Symbolic Computation
Citations:	54 - 4 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Tractable Scheme Implementation	user correction - Legacy Corrections
AUTHOR NAME	Richard Kelsey Kelsey	user correction - Legacy Corrections
AUTHOR AFFIL	Northeastern University	user correction - Legacy Corrections
AUTHOR NAME	Jonathan A. Rees	user correction - Legacy Corrections
AUTHOR AFFIL	MIT and Cornell University	user correction - Legacy Corrections
ABSTRACT	. Scheme 48 is an implementation of the Scheme programming language constructed with tractability and reliability as its primary design goals. It has the structural properties of large, compiler-based Lisp implementations: it is written entirely in Scheme, is bootstrapped via its compiler, and provides numerous language extensions. It controls the complexity that ordinarily attends such large Lisp implementations through clear articulation of internal modularity and by the exclusion of features, optimizations, and generalizations that are of only marginal value. 1. Introduction Scheme 48 is an implementation of the Scheme programming language constructed with tractability and reliability as its primary design goals. By tractability we mean the ease with which the system can be understood and changed. Although Lisp dialects, including Scheme, are relatively simple languages, implementation tractability is often threatened by the demands of providing high performance and extended funct...	user correction - Legacy Corrections
YEAR	0	user correction - Legacy Corrections
VENUE	Lisp and Symbolic Computation	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
VOLUME	7	INFERENCE
CITATIONS	13 found	ParsCit 1.0