Two-Level Functional Languages (Cambridge Tracts in Theoretical Computer Science, Series Number 34) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Book Description
Describes a framework in which the type notation of functional languages is extended to include a distinguishing notation for run-times and compile-times.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Two-Level Functional Languages (Cambridge Tracts in...
Stock Image
Two-Level Functional Languages (Cambridge Tracts in Theoretical Computer Science, Series Number 34)
Published by
Cambridge University Press, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
New
Softcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2215580238601
Stock Image
Two Level Functional Languages (Cambridge Tracts in Theoretical Computer Science, Series Number 34)
Published by
Cambridge University Press, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
Used
Softcover
Seller: Anybook.com, Lincoln, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 3718239
Buy Used
US$ 64.78
Shipping:
US$ 16.96
From United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Two-Level Functional Languages (Paperback)
Published by
Cambridge University Press, Cambridge, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. It is also shown how the results of abstract interpretation may be used to improve the code generation. The work is both an exposition and synthesis of recent research and as such will be valuable to research workers and graduate students working in formal methods and functional languages. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521018470
Stock Image
Two-Level Functional Languages
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 311 pages. 9.40x6.50x0.70 inches. In Stock. This item is printed on demand. Seller Inventory # __0521018471
Buy New
US$ 73.70
Shipping:
US$ 13.11
From United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Two-Level Functional Languages (Cambridge Tracts in Theoretical Computer Science, Series Number 34)
Published by
Cambridge University Press, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
New
Softcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780521018470_new
Buy New
US$ 73.07
Shipping:
US$ 15.70
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Two-Level Functional Languages
Published by
Cambridge University Press, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 530. Seller Inventory # C9780521018470
Buy New
US$ 76.82
Shipping:
US$ 21.03
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Two-Level Functional Languages (Paperback)
Published by
Cambridge University Press, Cambridge, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
New
Paperback
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. It is also shown how the results of abstract interpretation may be used to improve the code generation. The work is both an exposition and synthesis of recent research and as such will be valuable to research workers and graduate students working in formal methods and functional languages. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521018470
Buy New
US$ 82.33
Shipping:
US$ 48.49
From United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Two-Level Functional Languages
Published by
Cambridge University Press, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
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. Seller Inventory # 446920869
Buy New
US$ 86.64
Shipping:
US$ 56.44
From Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Two-Level Functional Languages (Paperback)
Published by
Cambridge University Press, Cambridge, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
New
Paperback
Seller: AussieBookSeller, Truganina, VIC, Australia
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. It is also shown how the results of abstract interpretation may be used to improve the code generation. The work is both an exposition and synthesis of recent research and as such will be valuable to research workers and graduate students working in formal methods and functional languages. 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780521018470
Seller Image
Two-Level Functional Languages
Published by
Cambridge University Press, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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 generalizes Wadler's analysis for lists. It is also shown how the results of abstract interpretation may be used to improve the code generation. Seller Inventory # 9780521018470