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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Allemagne
Paperback. Etat : Wie neu. 312 S. Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 610. N° de réf. du vendeur 818117
Quantité disponible : 1 disponible(s)
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9780521018470
Quantité disponible : Plus de 20 disponibles
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Etat : Good. 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. N° de réf. du vendeur 3718239
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 311 pages. 9.40x6.50x0.70 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __0521018471
Quantité disponible : 1 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9780521018470_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. 312 Illus. N° de réf. du vendeur 8374322
Quantité disponible : 4 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. 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. Series Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 312 pages, 4 b/w illus. 35 tables. BIC Classification: UMX; UYA. Category: (P) Professional & Vocational. Dimension: 247 x 174 x 17. Weight in Grams: 500. . 2008. Pbk Version ed. paperback. . . . . N° de réf. du vendeur V9780521018470
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. Print on Demand pp. 312. N° de réf. du vendeur 26554989
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND pp. 312. N° de réf. du vendeur 18554983
Quantité disponible : 4 disponible(s)
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. N° de réf. du vendeur C9780521018470
Quantité disponible : Plus de 20 disponibles