or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
Sell Back Your Copy
For a $1.95 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Abstract Computing Machines
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Abstract Computing Machines [Hardcover]

Werner Kluge (Author)

List Price: $109.00
Price: $71.55 & this item ships for FREE with Super Saver Shipping. Details
You Save: $37.45 (34%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 2 left in stock--order soon (more on the way).
Want it delivered Tuesday, February 14? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Hardcover $71.55  
Paperback $109.00  

Book Description

April 6, 2005 Texts in Theoretical Computer Science. An EATCS Series
The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines.

Frequently Bought Together

Customers buy this book with Let Over Lambda $35.81

Abstract Computing Machines + Let Over Lambda
Price For Both: $107.36

One of these items ships sooner than the other. Show details

  • This item: Abstract Computing Machines

    In Stock.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details

  • Let Over Lambda

    Usually ships within 1 to 3 weeks.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details



Editorial Reviews

Review

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)

From the Back Cover

The book addresses ways and means of organizing computations, highlighting the relationship between algorithms and the basic mechanisms and runtime structures necessary to execute them using machines. It completely abstracts from concrete programming languages and machine architectures, taking instead the lambda calculus as the basic programming and program execution model to design various abstract machines for its correct implementation. The emphasis is on fully normalizing machines based on full-fledged beta-reductions as essential prerequisites for symbolic computations that treat functions and variables truly as first-class objects. Their weakly normalizing counterparts are shown to be functional abstract machines that sacrifice the flavors of full beta-reductions for decidedly simpler runtime structures and improved runtime efficiency. Further downgrading of the lambda calculus leads to classical imperative machines that permit side-effecting operations on the runtime environment.

Product Details


More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews


There are no customer reviews yet.
Video reviews
Video reviews
Amazon now allows customers to upload product video reviews. Use a webcam or video camera to record and upload reviews to Amazon.



Inside This Book (learn more)
First Sentence:
This text looks at computer organization and architecture from a strictly conceptual point of view. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
normalized spine, topmost apply node, unapplied abstractions, suspension referenced, backup stack, categorial abstract machine, binding indices, mismatching arities, nested suspensions, real computing machines, string reduction machine, cur cdr, lambs sequence, normalizing machines, abstract evaluator, registers srl, various abstract machines, full normal forms, arity index, compiled graph reduction, runaway recursions, letrec expression, weak normal form, letrec construct, abstraction body
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Interpreted Head-Order Graph Reduction, Another Functional Abstract Machine, The Strict Abstract Stack Machine, The Lazy Abstract Stack Machine, Executing B-Machine Code, Output Mappings, Peyton Jones, The Evaluation of AL Expressions, The Controlling Instructions
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




What Other Items Do Customers Buy After Viewing This Item?


Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums



So You'd Like to...

Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject