Order Total (1 Item Items):
Shipping Destination:
Mccusker Guy (23 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (23)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (15)
- As New, Fine or Near Fine (5)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (3)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (10)
- Not Print on Demand (19)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Introduction to Programming and Further Programming Course Numbers G5066 & G5067
Seller: SAVERY BOOKS, Brighton, East Sussex, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Like New. Soft cover. 30x21cm. 152 pages. Flat covers. Clean & tight. No inscriptions. Flat pages. Dispatched ROYAL MAIL FIRST CLASS with TRACKING next working day or sooner securely boxed in cardboard. ref D32. Introduction to Programming and Further Programming Course Numbers G5066 & G5067. Compiled by Rudi Lutz & Guy McCusker.
-
Games and Full Abstraction for a Functional Metalanguage with Recursive Types (Distinguished Dissertations)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 50.43
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
PF. Condition: New.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Paperback. Condition: Brand New. 202 pages. 9.25x6.10x0.47 inches. In Stock.
-
Condition: Used. pp. 189 1st Edition.
-
-
Games and Full Abstraction for a Functional Metalanguage with Recursive Types (Distinguished Dissertations)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 77.87
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
-
Games and Full Abstraction for a Functional Metalanguage With Recursive Types
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
-
Taschenbuch. Condition: Neu. Games and Full Abstraction for a Functional Metalanguage with Recursive Types | Guy McCusker | Taschenbuch | Distinguished Dissertations | xiii | Englisch | 2012 | Springer | EAN 9781447111658 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is a minor revision of the thesis submitted in August 1996; no major changes have been made. However, I would like to take this opportunity to mention that since the thesis was written, discoveries have been made which would allow a substantial simplification and strengthening of the results in Chapters 3 and 6. In particular, it is now possible to model sums correctly in the category I as well as in Pds. , which means that the definability results of Chapter 6 can be stated and proved at the intensional level, making them simpler and much closer in spirit to the original proofs of Abramsky, Jagadeesan, Malacaria, Hyland, Ong and Nickau [10,61,79]. This also leads quite straightforwardly to an understanding of call-by-value languages. Details of these improvements can be found in [14,73]. It is also worth mentioning that progress has been made on some of the topics suggested for future research in Chapter 7. In particular, fully abstract models have been found for various kinds of languages with local variables [8,13-16], and a fully complete games model of the polymorphic language System F has been constructed by Hughes [59]. Guy McCusker February 1998 Acknowledgements First of all, I must thank my supervisor, Samson Abramsky. It was he who first introduced me to game semantics and suggested avenues of research in the area; this book would certainly not exist were it not for him.
-
Paperback. Condition: Like New. Like New. book.
-
Hardcover. Condition: Brand New. 189 pages. 9.50x6.25x0.75 inches. In Stock.
-
Games and Full Abstraction for a Functional Metalanguage With Recursive Types
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 114.99
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Hardcover. Condition: Like New. Like New. book.
-
Condition: As New. Unread book in perfect condition.
-
Condition: New. The Distinguished Dissertation series is published on behalf of the Conference of Professors and Heads of Computing and The British Computer Society, who annually select the best British PhD dissertations in computer science for publication. The dissertatio.
-
Condition: new. Questo è un articolo print on demand.
-
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
Language: English
Published by Springer London Okt 2012, 2012
ISBN 10: 1447111656 ISBN 13: 9781447111658
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is a minor revision of the thesis submitted in August 1996; no major changes have been made. However, I would like to take this opportunity to mention that since the thesis was written, discoveries have been made which would allow a substantial simplification and strengthening of the results in Chapters 3 and 6. In particular, it is now possible to model sums correctly in the category I as well as in Pds. , which means that the definability results of Chapter 6 can be stated and proved at the intensional level, making them simpler and much closer in spirit to the original proofs of Abramsky, Jagadeesan, Malacaria, Hyland, Ong and Nickau [10,61,79]. This also leads quite straightforwardly to an understanding of call-by-value languages. Details of these improvements can be found in [14,73]. It is also worth mentioning that progress has been made on some of the topics suggested for future research in Chapter 7. In particular, fully abstract models have been found for various kinds of languages with local variables [8,13-16], and a fully complete games model of the polymorphic language System F has been constructed by Hughes [59]. Guy McCusker February 1998 Acknowledgements First of all, I must thank my supervisor, Samson Abramsky. It was he who first introduced me to game semantics and suggested avenues of research in the area; this book would certainly not exist were it not for him. 208 pp. Englisch.
-
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. * Contains the first treatment of recursive types using game semantics, and the first fully abstract model of a recursively typed language * The first exposition of game semantics for programming languages at such a high level of detail * The mathematics re.
-
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
Language: English
Published by Springer, Springer Okt 2012, 2012
ISBN 10: 1447111656 ISBN 13: 9781447111658
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book is a minor revision of the thesis submitted in August 1996; no major changes have been made. However, I would like to take this opportunity to mention that since the thesis was written, discoveries have been made which would allow a substantial simplification and strengthening of the results in Chapters 3 and 6. In particular, it is now possible to model sums correctly in the category I as well as in £, which means that the definability results of Chapter 6 can be stated and proved at the intensional level, making them simpler and much closer in spirit to the original proofs of Abramsky, Jagadeesan, Malacaria, Hyland, Ong and Nickau [10,61,79]. This also leads quite straightforwardly to an understanding of call-by-value languages. Details of these improvements can be found in [14,73]. It is also worth mentioning that progress has been made on some of the topics suggested for future research in Chapter 7. In particular, fully abstract models have been found for various kinds of languages with local variables [8,13-16], and a fully complete games model of the polymorphic language System F has been constructed by Hughes [59]. Guy McCusker February 1998 Acknowledgements First of all, I must thank my supervisor, Samson Abramsky. It was he who first introduced me to game semantics and suggested avenues of research in the area; this book would certainly not exist were it not for him.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 208 pp. Englisch.
