Cantitate/Preț
Produs

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

Autor Guy McCusker
en Limba Engleză Hardback – 21 iun 1998
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.
Citește tot Restrânge

Toate formatele și edițiile

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

Din seria Distinguished Dissertations

Preț: 58015 lei

Preț vechi: 68252 lei
-15% Nou

Puncte Express: 870

Preț estimativ în valută:
11104 11443$ 9375£

Carte tipărită la comandă

Livrare economică 01-15 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540762553
ISBN-10: 3540762558
Pagini: 189
Greutate: 0.47 kg
Editura: Springer Verlag
Colecția Springer
Seriile Distinguished Dissertations, CSCW: Computer Supported Cooperative Work

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