Two Level Functional Languages - Brossura
Libro 39 di 40: Cambridge Tracts in Theoretical Computer Science
Sinossi
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.
Descrizione del libro
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.
Contenuti
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.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Two Level Functional Languages
Foto dell'editore
Two-Level Functional Languages (Cambridge Tracts in Theoretical Computer Science, Series Number 34)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2215580238601
Compra nuovo
EUR 59,57
Spese di spedizione:
EUR 3,44
In U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Two Level Functional Languages (Cambridge Tracts in Theoretical Computer Science, Series Number 34)
Editore:
Cambridge University Press, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
Antico o usato
Brossura
Da: Anybook.com, Lincoln, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 3718239
Compra usato
EUR 56,25
Spese di spedizione:
EUR 14,73
Da: Regno Unito a: U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Two-Level Functional Languages (Paperback)
Editore:
Cambridge University Press, Cambridge, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
Nuovo
Paperback
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521018470
Compra nuovo
EUR 73,32
Spese di spedizione:
GRATIS
In U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Two-Level Functional Languages
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 311 pages. 9.40x6.50x0.70 inches. In Stock. This item is printed on demand. Codice articolo __0521018471
Compra nuovo
EUR 64,00
Spese di spedizione:
EUR 11,38
Da: Regno Unito a: U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Two-Level Functional Languages (Cambridge Tracts in Theoretical Computer Science, Series Number 34)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780521018470_new
Compra nuovo
EUR 63,66
Spese di spedizione:
EUR 13,63
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Two-Level Functional Languages
Editore:
Cambridge University Press, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 530. Codice articolo C9780521018470
Compra nuovo
EUR 66,71
Spese di spedizione:
EUR 18,26
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Two Level Functional Languages. (=Cambridge Tracts in Theoretical Computer Science; Vol. 34).
Editore:
Cambridge University Press, 2008
ISBN 10: 0521018471
ISBN 13: 9780521018470
Antico o usato
Paperback
Da: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, Germania
Valutazione del venditore 5 su 5 stelle
Paperback. 312 S. Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 610. Codice articolo 818117
Compra usato
EUR 14,70
Spese di spedizione:
EUR 75,00
Da: Germania a: U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Two-Level Functional Languages (Paperback)
Editore:
Cambridge University Press, Cambridge, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
Nuovo
Paperback
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521018470
Compra nuovo
EUR 71,49
Spese di spedizione:
EUR 42,11
Da: Regno Unito a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Two-Level Functional Languages
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
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 446920869
Compra nuovo
EUR 73,02
Spese di spedizione:
EUR 48,99
Da: Germania a: U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Two-Level Functional Languages (Paperback)
Editore:
Cambridge University Press, Cambridge, 2005
ISBN 10: 0521018471
ISBN 13: 9780521018470
Nuovo
Paperback
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780521018470
Compra nuovo
EUR 96,96
Spese di spedizione:
EUR 31,88
Da: Australia a: U.S.A.
Quantità: 1 disponibili