Games and Full Abstraction for a Functional Metalanguage with Recursive Types: Distinguished Dissertations
Autor Guy McCuskeren Limba Engleză Paperback – 23 oct 2012
Din seria Distinguished Dissertations
- 15%
Preț: 609.22 lei - 15%
Preț: 620.55 lei - 20%
Preț: 628.77 lei - 20%
Preț: 622.77 lei - 20%
Preț: 956.27 lei - 20%
Preț: 623.22 lei - 20%
Preț: 616.56 lei - 20%
Preț: 298.86 lei - 20%
Preț: 314.83 lei - 20%
Preț: 890.95 lei - 20%
Preț: 614.83 lei - 20%
Preț: 615.94 lei - 20%
Preț: 652.46 lei - 20%
Preț: 612.94 lei - 20%
Preț: 618.46 lei - 20%
Preț: 615.76 lei - 20%
Preț: 615.45 lei - 20%
Preț: 318.30 lei - 20%
Preț: 315.26 lei
Preț: 317.70 lei
Preț vechi: 397.14 lei
-20%
Puncte Express: 477
Carte tipărită la comandă
Livrare economică 08-22 iunie
Specificații
ISBN-13: 9781447111658
ISBN-10: 1447111656
Pagini: 208
Ilustrații: XIII, 189 p.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.32 kg
Ediția:Softcover reprint of the original 1st ed. 1998
Editura: Springer
Colecția Distinguished Dissertations
Seria Distinguished Dissertations
Locul publicării:London, United Kingdom
ISBN-10: 1447111656
Pagini: 208
Ilustrații: XIII, 189 p.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.32 kg
Ediția:Softcover reprint of the original 1st ed. 1998
Editura: Springer
Colecția Distinguished Dissertations
Seria Distinguished Dissertations
Locul publicării:London, United Kingdom
Public țintă
ResearchCuprins
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