Isbn: 9780521403849 - Two-level Functional Languages: 34 (cambridge Tracts in Theoretical Computer Science, Series Number 34) (16 results)

Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condition: New. pp. 311.

Condition: New. pp. 311 4 Illus.

Condition: New. pp. 311.

Condition: New.

Condition: 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.…

Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: New. In.

Condition: 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. . . . .…

Hardcover. Condition: Brand New. 311 pages. 10.25x7.25x0.75 inches. In Stock.

Condition: 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. . . . . Books ship from the US and Ireland.…

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Condition: gut. 1992. Two-Level Functional Languages In englischer Sprache. pages.

Condition: 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.…

Hardcover. Condition: 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.…

Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.