The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Optimization of Series Expressions: Part II: Overview of the Theory and Implementation
Optimization of Series Expressions: Part II: Overview of the Theory and Implementation
Implementation of a “Lisp comprehension” macro
ACM SIGPLAN Lisp Pointers
| Hi-index | 0.00 |
The benefits of programming in a functional style are well known. Algorithms that are expressed as compositions of functions operating on series/vectors/streams of data elements are much easier to understand and modify than equivalent algorithms expressed as loops. Unfortunately, many programmers hesitate to use series expressions. In part, this is due to the fact that series expressions are typically implemented very inefficiently.A portable Common Lisp macro package (called Series) has been implemented that can evaluate a wide class of series expressions very efficiently by transforming them into iterative loops. When using this class of series expressions, programmers can obtain the advantages of expressing computations as series expressions without incurring any runtime overhead.