Modern "non-strict" functional programming languages are a powerful means of programming highly parallel computers, but are intrinsically difficult to compile well because decisions about ordering of subcomputations must be taken at compile time. This book represents a new technique for compiling such languages by partitioning a program into sequential threads. While the interleaving of threads can vary at run time, within each thread the order is fixed.A program is compiled by analyzing its data dependences, and developing ...
Read More
Modern "non-strict" functional programming languages are a powerful means of programming highly parallel computers, but are intrinsically difficult to compile well because decisions about ordering of subcomputations must be taken at compile time. This book represents a new technique for compiling such languages by partitioning a program into sequential threads. While the interleaving of threads can vary at run time, within each thread the order is fixed.A program is compiled by analyzing its data dependences, and developing from that a set of partitioning constraints. These practical algorithms are founded on a new theory of data dependence and ordering within functional programs, which defines dependence graphs in terms of a rewrite-rule operational semantics for the language.By attacking the ordering problem directly, the book departs from previous approaches that obtain partitioning as a byproduct of optimizing lazy evaluation, and cleanly separates partitioning from other code generation issues. Furthermore, the method is flexible enough to produce both lazy code and also a less restrictive "lenient" variant which allows larger threads with only a slight decrease in expressive power. Code generation and optimization are explored in depth for both uniprocessor and multiprocessor targets.Kenneth R. Traub is a researcher with the Motorola Cambridge Research Center.Contents: Introduction. Background - Functional Language Compilers. Lenient Evaluation. Functional Quads. Code Generation. A Syntactic Theory of Data Dependence. Dependence-Based Partitioning. Conclusion.
Read Less
Add this copy of Implementation of Non-Strict Functional Programming to cart. $28.33, good condition, Sold by BooksRun rated 5.0 out of 5 stars, ships from Philadelphia, PA, UNITED STATES, published 1991 by The MIT Press.
Add this copy of Implementation of Non-Strict Functional Programming to cart. $47.00, very good condition, Sold by Lavendier Books rated 5.0 out of 5 stars, ships from Foster, RI, UNITED STATES, published 1991 by Mit Pr.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very Good. Size: 7x0x9; The MIT Press; Cambridge, 1991. Trade paperback. Review Copy with Review Slip laid in. A Very Good, binding sturdy and intact, some handling/scuff marks to covers, bit of cover edge/corner wear, readers crease, few scuff marks bottom text block edge, a nice, clean and unmarked copy in wraps. 8vo[octavo or approx. 6 x 9], 171pp., bibliography. We pack securely and ship daily w/delivery confirmation on every book. Please Note: Depending on site, actual book for sale may differ physically from picture listed. Additional scan(s) are available for any item, please inquire.
Add this copy of Implementation of Non-Strict Functional Programming to cart. $75.44, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1991 by Mit Pr.
