Abstract Computing Machines: A Lambda Calculus Perspective / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$92.59
Used and New from Other Sellers
Used and New from Other Sellers
from $87.62
Usually ships in 1-2 business days
(Save 19%)
Other sellers (Paperback)
  • All (4) from $87.62   
  • New (3) from $87.62   
  • Used (1) from $135.09   

Overview

The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines.

Read More Show Less

Editorial Reviews

From the Publisher
From the reviews:

"This remarkable monograph is an extremely well-written and pleasant and reading about abstract computing machines … . The author chooses a somewhat ‘imperative’ approach to teaching, which results in the survey of a vast number of concepts provided with many useful examples. The expository style is most favourable, which could be of special value for a reader with no strong background in the area. … Altogether, this is a book worth reading." (Vladimir Komendantsky, Mathematical Reviews, Issue 2007 k)

Read More Show Less

Product Details

  • ISBN-13: 9783642059384
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 12/15/2010
  • Series: Texts in Theoretical Computer Science. An EATCS Series
  • Edition description: Softcover reprint of hardcover 1st ed. 2005
  • Edition number: 1
  • Pages: 384
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.82 (d)

Meet the Author

Received a Dr. rer. nat. degree in physics from the Technical University Munich/Germany in 1968; worked in industrie/research institutes at the central laboratories of Siemens AG between 1963 and 1968, at Bell Northern Research Ltd in Ottawa/Canada between 1969, and 1972 at the Gesellschaft fuer Mathematik und Datenverarbeitung in St. Augustin/Germany between 1973 and 1978; became an associate professor of computer science at the University of Bonn/Germany in 1978; became a full professor of computer science at the University of Kiel/Germany retired in 2003.

Read More Show Less

Table of Contents

Algorithms and Programs.- An Algorithmic Language.- The—-Calculus.- The se(m)cd Machine and Others.- Toward Full-Fledged—-Calculus Machines.- Interpreted Head-Order Graph Reduction.- The B-Machine.- The G-Machine.- The—-red Machinery.- Pattern Matching.- Another Functional Abstract Machine.- Imperative Abstract Machines.- Real Computing Machines.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)