Sell Back Your Copy
For a $24.87 Gift Card
Trade in
Have one to sell? Sell yours here
Compiling with Continuations
 
 
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.

Compiling with Continuations [Hardcover]

Andrew W. Appel (Author)
4.8 out of 5 stars  See all reviews (5 customer reviews)


Available from these sellers.


Textbook Student FREE Two-Day Shipping for Students. Learn more

Formats

Amazon Price New from Used from
Hardcover --  
Paperback $71.28  
Sell Back Your Copy for $24.87
Whether you buy it used on Amazon for $65.00 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $24.87.
Used Price$65.00
Trade-in Price$24.87
Price after
Trade-in
$40.13

Book Description

0521416957 978-0521416955 November 29, 1991
This book shows how continuation-passing style is used as an intermediate representation to perform optimizations and program transformations. Continuations can be used to compile most programming languages. The method is illustrated in a compiler for the programming language Standard ML. Prior knowledge of ML, however, is not necessary, as the author carefully explains each concept as it arises. This is the first book to show how concepts from the theory of programming languages can be applied to the production of practical optimizing compilers for modern languages like ML. All the details of compiling are covered, including the interface to a runtime system and garbage collector.

Customers Who Bought This Item Also Bought


Editorial Reviews

Review

"I recommend the book to language designers and implementors specializing in the functional paradigm." F.G. Pagan, Computing Reviews

Book Description

This book shows how continuation-passing style is used as an intermediate representation on which to perform optimisations and program transformations. It will be essential reading for compiler writers in both industry and academe, as well as for students and researchers in programming language theory.

Product Details

  • Hardcover: 272 pages
  • Publisher: Cambridge University Press (November 29, 1991)
  • Language: English
  • ISBN-10: 0521416957
  • ISBN-13: 978-0521416955
  • Product Dimensions: 10 x 7.1 x 0.8 inches
  • Shipping Weight: 1.4 pounds
  • Average Customer Review: 4.8 out of 5 stars  See all reviews (5 customer reviews)
  • Amazon Best Sellers Rank: #2,208,328 in Books (See Top 100 in Books)

More About the Author

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

 

Customer Reviews

5 Reviews
5 star:
 (4)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.8 out of 5 stars (5 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

17 of 17 people found the following review helpful:
4.0 out of 5 stars Surprisingly readable, given the subject matter., June 18, 1999
By A Customer
This review is from: Compiling with Continuations (Hardcover)
This is a very nice little book, and I found it to be surprisingly readable. The book is nicely written. Standard ML is used to illustrate the technique of compiling a functional language using continuations as the primary intermediate representation. Lack of familiarity with ML is not particularly burdensome. I would like to have seen more discussion of other languages, though (Scheme?).
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


6 of 6 people found the following review helpful:
5.0 out of 5 stars This book changed my life, November 2, 2008
By 
Matthew Fuchs (Silicon Valley, CA USA) - See all my reviews
(REAL NAME)   
I found this book while trying to build a interpreter for a distributed language. Appel's approach not only solved my immediate issues (a uniform means of procedure call in the presence of mobility) but opened my mind to the utility of continuations in many areas of CS. It was a real mind opener, and the explanations were clear enough that I could adopt this approach with little difficulty.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


5.0 out of 5 stars Surprisingly relevant given its age, June 20, 2011
By 
Brian L. (New York, NY) - See all my reviews
Amazon Verified Purchase(What's this?)
This book was fantastic. It opened my mind to a different mindset towards the compilation process while at the same time demystifying many concepts that I had previously only partially understood.

It is clear, concise, well-written, and unusually approachable for its genre. That said, I recommend some familiarity with ML-family languages as a prerequisite for approaching the book. He does include an appendix that's supposed to explain ML, but there are plenty of subtleties that I would have easily missed if that were my only resource.

This book doesn't discuss the front end of the compiler at all--there is no discussion of lexical analysis, parsing or type inference. If that's what you're after, look elsewhere. This is text is limited to the back end of the compiler.

The biggest quibble that I have with it is that the code generation chapter used MIPS/MAX/SPARC/68020 for case studies. In today's climate, ARM/x86/LLVM would be far more relevant and practical. This is an unfortunate consequence of the age of the text.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Most Recent Customer Reviews



Only search this product's reviews



Inside This Book (learn more)
First Sentence:
ML is a strict higher-order functional programming language with statically checked polymorphic types, garbage collection, and a complete formally defined semantics. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
hoist phase, andalso eqlist, escaping function, spill phase, spilling algorithm, current exception handler, lambda language, floating registers, call with current continuation, spill record, closure pointer, asymptotic space complexity, continuation machine, linked closures, val declaration, cache effectiveness, closure sharing, denotable values, closure record, continuation expression, reachable values, generational garbage collection, loc list, flat closures, ref cells
Key Phrases - Capitalized Phrases (CAPs): (learn more)
New Jersey
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...



Look for Similar Items by Category


Look for Similar Items by Subject