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 ...
Read More
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.
Read Less
Add this copy of Two-Level Functional Languages (Cambridge Tracts in to cart. $40.70, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1992 by Cambridge University Press.
Add this copy of Two-Level Functional Languages to cart. $60.23, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2005 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Trade paperback (US). Contains: Line drawings, Tables. Cambridge Tracts in Theoretical Computer Science . 4 b/w illus. 35 tables. Intended for professional and scholarly audience.
Add this copy of Two Level Functional Languages (Cambridge Tracts in to cart. $74.66, good condition, Sold by Anybook rated 5.0 out of 5 stars, ships from Lincoln, UNITED KINGDOM, published 2005 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
This is an ex-library book and may have the usual library/used-book markings inside. This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 600grams, ISBN: 9780521018470.
Add this copy of Two-Level Functional Languages to cart. $77.09, new condition, Sold by Ria Christie Books rated 5.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2005 by Cambridge University Press.
Add this copy of Two-Level Functional Languages to cart. $87.19, new condition, Sold by Booksplease rated 4.0 out of 5 stars, ships from Southport, MERSEYSIDE, UNITED KINGDOM, published 2005 by Cambridge University Press.
Add this copy of Two-Level Functional Languages (Cambridge Tracts in to cart. $101.30, new condition, Sold by discount_scientific_books rated 5.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 1992 by Cambridge University Press.
Add this copy of Two-Level Functional Languages (Cambridge Tracts in to cart. $102.46, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2005 by Cambridge University Press.
Add this copy of Two-Level Functional Languages (Cambridge Tracts in to cart. $137.78, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2005 by Cambridge University Press.
