Cantitate/Preț
Produs

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

Autor Guy McCusker
en Limba Engleză Paperback – 23 oct 2012
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 32259 lei  6-8 săpt.
  SPRINGER LONDON – 23 oct 2012 32259 lei  6-8 săpt.
Hardback (1) 57039 lei  6-8 săpt.
  Springer Verlag – 21 iun 1998 57039 lei  6-8 săpt.

Din seria Distinguished Dissertations

Preț: 32259 lei

Preț vechi: 40324 lei
-20% Nou

Puncte Express: 484

Preț estimativ în valută:
6174 6432$ 5133£

Carte tipărită la comandă

Livrare economică 10-24 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781447111658
ISBN-10: 1447111656
Pagini: 208
Ilustrații: XIII, 189 p.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.3 kg
Ediția:Softcover reprint of the original 1st ed. 1998
Editura: SPRINGER LONDON
Colecția Springer
Seria Distinguished Dissertations

Locul publicării:London, United Kingdom

Public țintă

Research

Cuprins

Introduction.- Full Abstraction.- Game Semantics.- Historical Perspective.- Contribution of This Book.- Prerequisites.- Preliminaries.- Enriched Category Theory.- Intrinsic Preorder.- Games.- Arenas, Views and Legal Positions.- Games and Strategies.- The Category.- Exponential.- A Cartesian Closed Category.- An Alternative Category.- The Extensional Category.- Sums.- Lifting.- Rational Categories and Recursive Types.- Rational Categories.- Recursive Types.- Invariant Relations.- Parameterized Invariant Relations.- IP-Categories.- Axioms for Rationality.- FPC and its Models.- The Language FPC.- Models of FPC.- Semantics of the Recursion Combinator.- Formal Approximation Relations.- Computational Adequacy.- Full Abstraction.- Conclusions.

Caracteristici

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 required for denotational semantics of recursive types is studied at a general, categorical level * A computational adequacy result is proved at this level