Verwandte Artikel zu Games and Full Abstraction for a Functional Metalanguage...

Games and Full Abstraction for a Functional Metalanguage with Recursive Types (Distinguished Dissertations) - Softcover

 
9781447111658: Games and Full Abstraction for a Functional Metalanguage with Recursive Types (Distinguished Dissertations)
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
 
 
Reseña del editor:
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.
Reseña del editor:
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 dissertations are selected on behalf of the CPHC by a panel of eight academics. Each dissertation chosen makes a noteworthy contribution to the subject and reaches a high standard of exposition, placing all results clearly in the context of computer science as a whole. In this way computer scientists with significantly different interests are able to grasp the essentials - or even find a means of entry - to an unfamiliar research topic. This book develops a theory of game semantics, a recently discovered setting for modelling and reasoning about sequential programming languages, suitable for interpreting higher-order functional languages with rich type structure, and applies it to constr uct a fully abstract model of the metalanguage FPC.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

  • VerlagSpringer
  • Erscheinungsdatum2012
  • ISBN 10 1447111656
  • ISBN 13 9781447111658
  • EinbandTapa blanda
  • Anzahl der Seiten208

Versand: EUR 32,99
Von Deutschland nach USA

Versandziele, Kosten & Dauer

In den Warenkorb

Weitere beliebte Ausgaben desselben Titels

9783540762553: Games and Full Abstraction for a Functional Metalanguage with Recursive Types (Distinguished Dissertations)

Vorgestellte Ausgabe

ISBN 10:  3540762558 ISBN 13:  9783540762553
Verlag: Springer, 1998
Hardcover

Beste Suchergebnisse beim ZVAB

Foto des Verkäufers

Guy McCusker
Verlag: Springer London (2012)
ISBN 10: 1447111656 ISBN 13: 9781447111658
Neu Taschenbuch Anzahl: 1
Anbieter:
AHA-BUCH GmbH
(Einbeck, Deutschland)
Bewertung

Buchbeschreibung Taschenbuch. Zustand: 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. Artikel-Nr. 9781447111658

Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren

Neu kaufen
EUR 56,45
Währung umrechnen

In den Warenkorb

Versand: EUR 32,99
Von Deutschland nach USA
Versandziele, Kosten & Dauer