Two-Level Functional Languages: 34 (Cambridge Tracts in Theoretical Computer Science, Series Number 34)

-

ISBN 10: 0521403847 / ISBN 13: 9780521403849

Published by - -, 1992

About this Item

This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping.

Seller Inventory # 6545-9780521403849

Bibliographic Details

• Title: Two-Level Functional Languages: 34 (Cambridge Tracts in Theoretical Computer Science, Series Number 34)
• Publisher: - -
• Publication Date: 1992
• Language: English
• ISBN 10: 0521403847
• ISBN 13: 9780521403849
• Binding: Hardcover
• Condition: Very Good

About this title

Synopsis

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 generalises Wadler's analysis for lists.

Book Description

The authors describe here a framework in which the type notation of functional languages is extended to include a distinguishing notation for run-times and compile-times. Consequently the ability to specify code and verify program correctness can be improved.