Two-Level Functional Languages
Series: Cambridge Tracts in Theoretical Computer Science; 34;
- Publisher's listprice GBP 122.00
-
61 744 Ft (58 804 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 6 174 Ft off)
- Discounted price 55 570 Ft (52 924 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
61 744 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 16 July 1992
- ISBN 9780521403849
- Binding Hardback
- No. of pages312 pages
- Size 244x170x19 mm
- Weight 700 g
- Language English
- Illustrations 4 b/w illus. 35 tables 0
Categories
Short description:
This book provides a framework in which the type notation of functional languages is extended to include a distinguishing notation for run-times and compile-times.
MoreLong 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 generalises Wadler's analysis for lists.
MoreTable of Contents:
1. Introduction; 2. Types made explicit; 3. Binding-time made explicit; 4. Combinators made explicit; 5. Parametrized semantics; 6. Code generation; 7. Abstract interpretation; 8. Conclusions; Bibliography; Summary of transformation functions; Index.
More
