Cambridge tracts in theoretical computer science - 9780521018470 - two level functional languages di nielson, flemming (15 risultati)
Lingua: Inglese
Editore: Cambridge University Press, 2008
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
Da: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, GermaniaAntiquariat Thomas Haker GmbH & Co. KG
Contatta il venditoreVenditore con 5 stelleMembro dell’associazione: GIAQ
Condizione: Usato - Come nuovo
EUR 12,50
EUR 20,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Wie neu. 312 S. Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 610.
Lingua: Inglese
Editore: Cambridge University Press, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 70,95
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
Da: Anybook.com, Lincoln, Regno UnitoAnybook.com
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 57,53
EUR 15,83 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
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.
Lingua: Inglese
Editore: Cambridge University Press, GB, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 78,10
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. 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.
Lingua: Inglese
Editore: Cambridge University Press, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 70,72
EUR 13,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
Lingua: Inglese
Editore: Cambridge University Press, 2008
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 75,98
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: Più di 20 disponibili
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 Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theore…tical 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 17. Weight in Grams: 500. . 2008. Pbk Version ed. paperback. . . . .
Lingua: Inglese
Editore: Cambridge University Press, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 93,36
EUR 9,04 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
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 Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theore…tical 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 17. Weight in Grams: 500. . 2008. Pbk Version ed. paperback. . . . . Books ship from the US and Ireland.
Lingua: Inglese
Editore: Cambridge University Press, GB, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 75,44
EUR 75,65 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. 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.
Lingua: Inglese
Editore: Cambridge University Press, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 75,10
EUR 7,56 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 312 Illus.
Lingua: Inglese
Editore: Cambridge University Press CUP, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
- Print on Demand
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 82,21
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 312.
Lingua: Inglese
Editore: Cambridge University Press, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 76,95
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 312.
Lingua: Inglese
Editore: Cambridge University Press, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
- Print on Demand
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 82,22
EUR 18,68 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
- Print on Demand
Da: CitiRetail, Stevenage, Regno UnitoCitiRetail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 77,30
EUR 43,06 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
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 im…proved. 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 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.
Lingua: Inglese
Editore: Cambridge University Press, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 73,66
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
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.
Altre immaginiLingua: Inglese
Editore: Cambridge University Press, 2005
Serie: Libro 39 di 40 - Cambridge Tracts in Theoretical Computer Science
- Brossura
- Print on Demand
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 78,30
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Two-Level Functional Languages | Flemming Nielson (u. a.) | Taschenbuch | Kartoniert / Broschiert | Englisch | 2005 | Cambridge University Press | EAN 9780521018470 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on De…mand.
