| #3734868 in Books | 1991-08-28 | Original language:English | PDF # 1 | 9.75 x6.75 x.50l,2.62 | File type: PDF | 238 pages||5 of 5 people found the following review helpful.| Table of Contents|By Kim|Preface List of figures 1 Introduction 1.1 Functional Programming Languages and Lazy Evaluation 1.2 The Evaluation Transformer Model of Reduction 1.3 An Introduction to Abstract Interpretation 1.4 Outline of Book 2 Operational and Denotational Semantics of the Typed Lambda Calculus 2.1 The Typed Lambda-Cal|About the Author||Geoffrey Burn is Lecturer at Imperial College of Science, Technology, and Medicine, London.
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 ...
You easily download any file type for your gadget.Lazy Functional Languages: Abstract Interpretation and Compilation (Research Monographs in Parallel and Distributed Computing) | Geoffrey Burn.Not only was the story interesting, engaging and relatable, it also teaches lessons.
