Get Free Shipping on orders over $0
Two-Level Functional Languages : Cambridge Tracts in Theoretical Computer Science - No Information Available

Two-Level Functional Languages

By: No Information Available

Hardcover | 14 September 1992

At a Glance

Hardcover


RRP $243.95

$212.99

13%OFF

or 4 interest-free payments of $53.25 with

 or 

Ships in 15 to 25 business days

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.

Other Editions and Formats

Paperback

Published: 25th August 2005

More in Mathematical Theory of Computation

Discrete Mathematics for Computing : Grassroots - Peter Grossman
AI Engineering : Building Applications with Foundation Models - Chip Huyen
Foundation Mathematics - K. A. Stroud

RRP $128.99

$109.99

15%
OFF
Introduction to Modern Cryptography : Revised Third Edition - Jonathan  Katz
Applied Mathematics with F# - Sudipta Mukherjee
Axiomatic Set Theory : An Introduction - George Tourlakis