| Two-Level Functional Languages Pbk Version Edition Contributor(s): Nielson, Flemming (Author), Nielson, Hanne Riis (Author) |
|
 |
ISBN: 0521018471 ISBN-13: 9780521018470 Publisher: Cambridge University Press OUR PRICE: $58.89 Product Type: Paperback - Other Formats Published: August 2005 Annotation: The authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently, the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of "parametrized semantics" is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose, it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalizes Wadler's analysis for lists. It is also shown how the results of abstract interpretation may be used to improve the code generation. |
| Additional Information |
| BISAC Categories: - Computers | Programming Languages - General - Computers | Software Development & Engineering - General |
| Dewey: 005 |
| LCCN: 2006273242 |
| Series: Cambridge Tracts in Theoretical Computer Science (Paperback) |
| Physical Information: 0.65" H x 6.69" W x 9.61" (1.10 lbs) 312 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: The authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently, the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of parametrized semantics is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose, it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalizes Wadler's analysis for lists. It is also shown how the results of abstract interpretation may be used to improve the code generation. |