Compiling functional languages
Our rough guess is there are 72,250 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 49 minutes to read. With a half hour per day, this will take 10 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Word Count
72,250 words, Guess
Page Count
289 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL2038001M
- ISBN-100471920274
- OCLC Control Number17953755
- Library of Congress Control Number88014349
- LibraryThing2549227
and 1 more
- Goodreads3468677
Classifications
- DDC005.13
- LCCQA76.73.F86 D55 1988
Description
How Turner's combinator-based graph-reducers can be used to implement functional programming languages.
Subjects
Topics
Other Editions
- Compiling functional languages
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!