Buy Functional Implementation of Lenient Programming Languages
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer programming / software engineering > Programming and scripting languages: general > Functional Implementation of Lenient Programming Languages: (Research Monographs in Parallel & Distributed Computing)
Functional Implementation of Lenient Programming Languages: (Research Monographs in Parallel & Distributed Computing)

Functional Implementation of Lenient Programming Languages: (Research Monographs in Parallel & Distributed Computing)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

In "non-strict" functional languages, a data structure may be read before all its components are written, and a function may return a value before finishing all its computation or even before all its arguments have been evaluated. Such flexibility gives expressive power to the programmer, but makes life difficult for the compiler because it may not be possible to totally order instructions at compile time; the correct order can vary dramatically with the input data. Presently, compilers for non-strict languages rely on "lazy evaluation", in which a subexpression is not evaluated until known (at run time) to contribute to the final answer. By scheduling each subexpression separately, lazy evaluation automatically deals with the varying orderings required by non-strictness, but at the same time incurs a great deal of overhead. Recent research has employed strictness analysis and/or annotations to make more scheduling decisions at compile time, and thereby reduce the overhead, but because these techniques seek to retain laziness, they are limited in effectiveness. This work presents an alternative compilation strategy which deals with non-strictness independent of laziness, through the analysis of data dependence. The analysis determines which instructions can be ordered at compile time and which must be scheduled at run time in order to implement non-strictness properly. The option is then presented of imposing laziness or ignoring it - and it is found that choosing the latter path can lead to significantly reduced overhead. Abandoning laziness means certain programs (those which use "infinite objects") may fail to terminate properly. It is suspected that non-strictness and not the ability to handle infinite objects is the more important feature for the programmer; nevertheless, annotations are provided for the programmer to achieve termination in the presence of infinite objects. Even with annotations, this approach entails less overhead. The strategy is discussed in the context of both sequential implementations and parallel implementations where the object code is partially sequentialized. It also show how lazy code can be generated from this framework.

Table of Contents:
Part 1 Introduction: notation - functional programs; notation - sets, relations and graphs. Part 2 Background - functional language compilers: strict compilers; lazy compilers - force-and-delay; lazy compilers - graph reduction; lazy compilers - abstract machines; strictness analysis. Part 3 Lenient evaluation: expressive power from non-strictness; expressive power from laziness; lenience - non-strictness without laziness; semantics or implementation techniques?; compilation as orders - sequential threads; code generation options; a footnote - non-sequentiality. Part 4 Functional quads: syntax; semantics; from a functional language to functional quads; functional quads vs sequential quads; mathematical properties of reduction; termination, weak normal forms, and lazy evaluation; denotational semantics; appendix - the structure of the set "identifier". Part 5 The analysis framework: required reductions; program requirement graphs; function requirement graphs; constraint computation; partitioning; complexity and approximations; appendix - NP-completeness of CCo. Part 6 Dependence analysis: approximate requirement graphs; outline of dependence analysis; arithmetic expressions; conditionals; interlude - dependence analysis vs strictness analysis; first-order functions; non-flat domains; higher-order functions; feedback dependences; appendix - proof of the "collapsing" lemma. Part 7 Constraint computation and partitioning: an approximation to constraint graphs; improving the approximation; improving the running time; avoiding new cycles. Part 8 Code generation: code generation concepts; basic code generation; optimizations; implementing tagged locations; partitioning for uniprocessor demand-driven execution; lazy evaluation; partitioning heuristics. Part 9 Conclusion: relationship to other work; directions for future research; concluding remarks.


Best Sellers


Product Details
  • ISBN-13: 9780273088271
  • Publisher: Financial Times Prentice Hall
  • Publisher Imprint: Financial Times Prentice Hall
  • Height: 244 mm
  • Weight: 348 gr
  • ISBN-10: 0273088270
  • Publisher Date: /12/1990
  • Binding: Paperback
  • Series Title: Research Monographs in Parallel & Distributed Computing
  • Width: 169 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Functional Implementation of Lenient Programming Languages: (Research Monographs in Parallel & Distributed Computing)
Financial Times Prentice Hall -
Functional Implementation of Lenient Programming Languages: (Research Monographs in Parallel & Distributed Computing)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Functional Implementation of Lenient Programming Languages: (Research Monographs in Parallel & Distributed Computing)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!