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.Please note: Oversized books/sets MAY require additional postage then what is quoted for 2.2lb book.

Bestandsnummer des Verk�ufers SKU1043807

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel

Implementation of Non-Strict Functional Programming Languages (Research Monographs in Parallel and Distributed Computing)

Verlag

Mit Pr

Ver�ffentlichungsdatum

1991

Sprache

Englisch

ISBN-10

0262700425

ISBN-13

9780262700429

Bindung

paperback

Zustand

Very Good

Verk�uferkataloge

Math Text Books

�ber diesen Titel

Inhaltsangabe

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.

Rese�a del editor

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.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Independent online booksellers since 1994, we carry a nice selection of general stock with an emphasis on modern first editions, higher math science titles with a strong selection of cornerstone quantum, astro and celestial mechanic titles all in collectible condition, family genealogies, town and county history, military and firearm books. We also publish and offer on ABE a line of mystery/crime letterpress broadsides, original short short stories by today's finest authors, signed & limited and illustrated by woodcuts.

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

Lavendier Books
RI, U.S.A.

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Versandbedingungen

Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. All books are securely and professionally packaged for shipment, please let us know if you have any special requests.