Articles liés à Two Level Functional Languages
Synopsis
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.
Présentation de l'éditeur
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.
Acheter neuf
Afficher cet article
EUR 64,41
EUR 4,61 expédition depuis Royaume-Uni vers France
Destinations, frais et délais
Résultats de recherche pour Two Level Functional Languages
Image d'archives
Two-Level Functional Languages (Cambridge Tracts in Theoretical Computer Science, Series Number 34)
Edité par
Cambridge University Press, 2005
ISBN 10 : 0521018471
ISBN 13 : 9780521018470
Neuf
Couverture souple
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780521018470_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Two-Level Functional Languages
Edité par
Cambridge University Press, 2005
ISBN 10 : 0521018471
ISBN 13 : 9780521018470
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 530. N° de réf. du vendeur C9780521018470
Quantité disponible : Plus de 20 disponibles
Image d'archives
Two-Level Functional Languages
impression à la demandeVendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
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)
Image fournie par le vendeur
Two-Level Functional Languages
Edité par
Cambridge University Press, 2005
ISBN 10 : 0521018471
ISBN 13 : 9780521018470
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 446920869
Quantité disponible : Plus de 20 disponibles
Image d'archives
Two-Level Functional Languages (Paperback)
Edité par
Cambridge University Press, Cambridge, 2005
ISBN 10 : 0521018471
ISBN 13 : 9780521018470
Neuf
Paperback
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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 our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9780521018470
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Two-Level Functional Languages
Edité par
Cambridge University Press, 2005
ISBN 10 : 0521018471
ISBN 13 : 9780521018470
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9780521018470
Quantité disponible : 1 disponible(s)
Image d'archives
Two-Level Functional Languages (Paperback)
Edité par
Cambridge University Press, Cambridge, 2005
ISBN 10 : 0521018471
ISBN 13 : 9780521018470
Neuf
Paperback
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9780521018470
Quantité disponible : 1 disponible(s)
Image d'archives
Two-Level Functional Languages (Cambridge Tracts in Theoretical Computer Science, Series Number 34)
Edité par
Cambridge University Press, 2005
ISBN 10 : 0521018471
ISBN 13 : 9780521018470
Neuf
Couverture souple
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Feb2215580238601
Quantité disponible : Plus de 20 disponibles
Image d'archives
Two-Level Functional Languages (Paperback)
Edité par
Cambridge University Press, Cambridge, 2005
ISBN 10 : 0521018471
ISBN 13 : 9780521018470
Neuf
Paperback
Vendeur : Grand Eagle Retail, Mason, OH, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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. N° de réf. du vendeur 9780521018470
Quantité disponible : 1 disponible(s)