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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
