Two Level Functional Languages by Nielson Flemming (31 results)
Language: English
Published by Cambridge University Press, 2008
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
Seller: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, GermanyAntiquariat Thomas Haker GmbH & Co. KG
Contact seller5-star sellerAssociation member: GIAQ
Condition: Used - As new
£ 11.07
£ 17.18 shippingShips from Germany to U.S.A.Quantity: 1 available
Paperback. Condition: Wie neu. 312 S. Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 610.
Language: English
Published by Cambridge University Press, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
£ 60.96
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Cambridge University Press, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
Seller: Anybook.com, Lincoln, United KingdomAnybook.com
Contact seller5-star sellerCondition: Used - Good
£ 47.99
£ 13.60 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
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.
Language: English
Published by Cambridge University Press, GB, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
£ 67.10
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: 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.
Language: English
Published by Cambridge University Press, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 59.00
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
Language: English
Published by Cambridge University Press, 2008
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
£ 67.24
£ 8.16 shippingShips from Ireland to U.S.A.Quantity: Over 20 available
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 Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theoret…ical 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. . . . .
Language: English
Published by Cambridge University Press, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
£ 80.22
£ 7.77 shippingShips within U.S.A.Quantity: Over 20 available
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 Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theoret…ical 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.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
£ 108.01
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Language: English
Published by Cambridge University Press CUP, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 113.71
£ 2.95 shippingShips within U.S.A.Quantity: 1 available
Condition: New. pp. 311.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 115.24
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: New. pp. 311 4 Illus.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Antiquariat Bernhardt, Kassel, GermanyAntiquariat Bernhardt
Contact seller5-star sellerCondition: Used - Fine
£ 81.55
£ 42.87 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 120.46
£ 8.55 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: New. pp. 311.
Language: English
Published by Cambridge University Press, GB, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
£ 62.93
£ 65.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: 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.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
£ 137.93
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 119.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 135.80
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
£ 154.61
£ 8.16 shippingShips from Ireland to U.S.A.Quantity: Over 20 available
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) Pr…ofessional & Vocational. Dimension: 247 x 174 x 19. Weight in Grams: 714. . 1992. hardcover. . . . .
Language: English
Published by Cambridge Univ Pr, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 176.84
£ 12.50 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 311 pages. 10.25x7.25x0.75 inches. In Stock.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
£ 188.47
£ 7.77 shippingShips within U.S.A.Quantity: Over 20 available
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) Pr…ofessional & Vocational. Dimension: 247 x 174 x 19. Weight in Grams: 714. . 1992. hardcover. . . . . Books ship from the US and Ireland.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 184.14
£ 26.20 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
Language: English
Published by Cambridge University Press, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, GermanyBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Contact seller5-star sellerCondition: Used - Very good
£ 230.00
£ 34.32 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: gut. 1992. Two-Level Functional Languages In englischer Sprache. pages.
Language: English
Published by Cambridge University Press, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 64.53
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand pp. 312 Illus.
Language: English
Published by Cambridge University Press CUP, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
- Print on Demand
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 70.64
£ 2.95 shippingShips within U.S.A.Quantity: 4 available
Condition: New. Print on Demand pp. 312.
Language: English
Published by Cambridge University Press, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 68.10
£ 8.55 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. 312.
Language: English
Published by Cambridge University Press, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
- Print on Demand
Seller: THE SAINT BOOKSTORE, Southport, United KingdomTHE SAINT BOOKSTORE
Contact seller5-star sellerCondition: New
£ 68.59
£ 16.05 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Language: English
Published by Cambridge University Press, Cambridge, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
£ 64.49
£ 37.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
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 imp…roved. 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.
Language: English
Published by Cambridge University Press, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 65.19
£ 42.09 shippingShips from Germany to U.S.A.Quantity: Over 20 available
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 v…erify program correctness can be improve.
More imagesLanguage: English
Published by Cambridge University Press, 2005
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 69.29
£ 60.14 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: 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 Dem…and.
Language: English
Published by Cambridge University Press, 2014
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 143.82
£ 42.09 shippingShips from Germany to U.S.A.Quantity: Over 20 available
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 v…erify program correctness can be improve.
Language: English
Published by Cambridge University Press, Cambridge, 1992
Series: Book 39 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
£ 145.49
£ 37.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
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 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 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.
