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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
The authors describe here a framework in which the type notation of functional languages is extended to include a distinguishing notation for run-times and compile-times. Consequently the ability to specify code and verify program correctness can be improved.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEOCT25-98120
Quantità: 1 disponibili
Da: Books Puddle, Woodside, NY, U.S.A.
Condizione: New. pp. 311. Codice articolo 26435341
Quantità: 1 disponibili
Da: Antiquariat Bernhardt, Kassel, Germania
Condizione: Sehr gut. XII, 299 Seiten, Cambridge Tracts in Theoretical Computer Science, Band 34. Zust: Gutes Exemplar. Mit Vorbesitzereintrag. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 710 gebundene Ausgabe gebundene Ausgabe. Codice articolo 492636
Quantità: 1 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. pp. 311 4 Illus. Codice articolo 7412562
Quantità: 1 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. pp. 311. Codice articolo 18435335
Quantità: 1 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780521403849
Quantità: Più di 20 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: 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: 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 19. Weight in Grams: 714. . 1992. hardcover. . . . . Codice articolo V9780521403849
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In English. Codice articolo ria9780521403849_new
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The authors describe here a framework in which the type notation of functional languages is extended to include a distinguishing notation for run-times and compile-times. Consequently the ability to specify code and verify program correctness can be improve. Codice articolo 446934339
Quantità: Più di 20 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Hardcover. Condizione: new. Hardcover. 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. The authors describe here a framework in which the type notation of functional languages is extended to include a distinguishing notation for run-times and compile-times. Consequently the ability to specify code and verify program correctness can be improved. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9780521403849
Quantità: 1 disponibili