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

Nielson, Flemming

Softcover

ISBN 10: 0521018471 ISBN 13: 9780521018470

Publisher: Cambridge University Press, 2008

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.

About this title

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.

Edition details

• Publisher: Cambridge University Press
• Publication date: 2008
• Language: English
• ISBN 10: 0521018471
• ISBN 13: 9780521018470
• Binding: Paperback
• Number of pages: 312