Games and Full Abstraction for a Functional Metalanguage with Recursive Types

Inbunden, Engelska, 1998

AvGuy McCusker,G. McCusker

1 099 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

709 kr

Skickas inom 10-15 vardagar

This work develops a theory of game semantics, a setting for modelling and reasoning about sequential programming languages, suitable for interpreting higher-order functional languages with a rich type structure. It applies it to construct a fully abstract model of the metalanguage FPC.

Produktinformation

Utgivningsdatum1998-06-01
FormatInbunden
SpråkEngelska
SerieDistinguished Dissertations
Antal sidor224
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540762553

Tillhör följande kategorier

3D-grafik och modellering inom Data och it
Programspråk inom Data och it
Optimering inom Naturvetenskap och teknik

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.