Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

(Algorithms)

(Algorithms) I Ravel Curtis, editor Xerox PARC 3333 Coyote Hill Rd. Palo Alto, CA 94304 Pavel.pa@Xerox.Com Now that Lisp Pointers is being sponsored by SIGPLAN, it seems worthwhile to repeat the charter of this department. The (algorithms) department consists of articles that fit into one or more of three broad categories: Annotated implementations of interesting and relevant algorithms; they should make particularly good or novel use of the unique features of the Lisp family of programruing languages (e.g., closures, continuations, code as data, polymorphism), Annotated implementations of algorithms whose subject m a t t e r is the Lisp family of languages (e.g., code analysis tools, iteration facilities, generic arithmetic), and Discussion of performance issues, benchmarking, or implementation experiences for interesting algorithms written in or a b o u t the Lisp fanfily of languages. So far, ( a l g o r i t h m s ) has included articles on the o x t o n d - s y n t a x macro definition facility, an elegant hidden-line elimination program, Common Lisp s o t f methods, and a higher-order programndng solution to the infamous x p l puz- s}.-o zle. Of these, two http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGPLAN Lisp Pointers Association for Computing Machinery

(Algorithms)

Curtis, Pavel
ACM SIGPLAN Lisp Pointers , Volume III (1) – Jul 1, 1989
Download PDF
14 pages

Loading next page...
 
/lp/association-for-computing-machinery/algorithms-gYUB6fFXGA

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1989 by ACM Inc.
ISSN
1045-3563
DOI
10.1145/121999.122005
Publisher site
See Article on Publisher Site

Abstract

I Ravel Curtis, editor Xerox PARC 3333 Coyote Hill Rd. Palo Alto, CA 94304 Pavel.pa@Xerox.Com Now that Lisp Pointers is being sponsored by SIGPLAN, it seems worthwhile to repeat the charter of this department. The (algorithms) department consists of articles that fit into one or more of three broad categories: Annotated implementations of interesting and relevant algorithms; they should make particularly good or novel use of the unique features of the Lisp family of programruing languages (e.g., closures, continuations, code as data, polymorphism), Annotated implementations of algorithms whose subject m a t t e r is the Lisp family of languages (e.g., code analysis tools, iteration facilities, generic arithmetic), and Discussion of performance issues, benchmarking, or implementation experiences for interesting algorithms written in or a b o u t the Lisp fanfily of languages. So far, ( a l g o r i t h m s ) has included articles on the o x t o n d - s y n t a x macro definition facility, an elegant hidden-line elimination program, Common Lisp s o t f methods, and a higher-order programndng solution to the infamous x p l puz- s}.-o zle. Of these, two

Journal

ACM SIGPLAN Lisp Pointers – Association for Computing Machinery

Published: Jul 1, 1989

There are no references for this article.