Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

LICS
1997
IEEE

favoriteEmaildiscussreport

98views Automated Reasoning» more LICS 1997»

Games and Definability for System F

13 years 8 months ago

Games and Definability for System F

Download boole.stanford.edu

We present a game-theoretic model of the polymorphic -calculus, system F, as a fibred category. Every morphism of the model defines an -expanded, -normal form ^ of system F whose interpretation is . Thus the model gives a precise, non-syntactic account of the calculus.

Dominic J. D. Hughes

Real-time Traffic

Automated Reasoning | Fibred Category | Game-theoretic Model | LICS 1997 | Model |

claim paper

Related Content

» Defining Agents Via Strategies Towards a View of MAS as Games

» Dinatural Terms in System F

» NonCooperative Cost Sharing Games via Subsidies

» Defining a Digital Earth System

» A Temporal Proof System for General Game Playing

» A type directed translation of MLF to system F

» Simple partial typeinference for System F based on typecontainment

» Defining and Using Ideal Teammate and Opponent Agent Models

» Games played by Boole and Galois

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1997
Where	LICS
Authors	Dominic J. D. Hughes

Comments (0)