你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Lazy Functional Languages: Abstract Interpretation and Compilation (Research Monographs in Parallel and Distributed Computing)
Type
Physical Book
Publisher
Author
Language
English
Pages
252
Format
Paperback
ISBN13
9780262521604

Lazy Functional Languages: Abstract Interpretation and Compilation (Research Monographs in Parallel and Distributed Computing)

Geoffrey Burn (Author) · Mit Press · Paperback

Lazy Functional Languages: Abstract Interpretation and Compilation (Research Monographs in Parallel and Distributed Computing) - Geoffrey Burn

New Book Imported to Taiwan
Delivery: 13 Oct - 26 Oct Shipping: 15 to 19 business days.
NT$ 1,958
NT$ 1,958

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Lazy Functional Languages: Abstract Interpretation and Compilation (Research Monographs in Parallel and Distributed Computing)"

This book explores a subclass known as lazy functional languages, beginning with the theoretical issues and continuing through abstract interpretation and offering improved techniques for implementation.The class of programming languages commonly known as functional includes Lisp, Scheme, ML, and Miranda TM. This book explores a subclass known as lazy functional languages, beginning with the theoretical issues and continuing through abstract interpretation and offering improved techniques for implementation. Now that advanced compiler technology has made it possible for lazy functional languages to compare favorably in run-time with more traditional languages such as C and Pascal, this monograph tackles problems of implementation such as time and memory overheads and restrictions on parallelism. Specifically, it describes a more efficient implementation model, the evaluation transformer model, that can be used when information is known about how functions use their arguments, develops a semantically sound analysis technique called abstract interpretation, which can determine this information, and shows how to use the information to compile more efficient code for sequential and parallel machines.ContentsIntroduction - Operational and Denotational Semantics of the Typed Lambda Calculus - A Framework for the Abstract Interpretation of Functional Languages - Some Example Abstract Interpretations - Evaluation Transformers - Implementing Functional Languages on Sequential and Parallel Machines - Relationship to Other Work - Epilogue - Appendixes: Additional Proofs - The Spineless G-Machine

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews