(Enter summary)
Abstract: A recent development in programming language theory is the application of games
to describe semantics of programs. In this report we give an exposition of Abramsky's
game theory using a functional language to explain the concepts. We implement games,
and strategies over them, in the functional language Haskell. It has been shown that the
category with games as objects and strategies as morphisms is symmetric, monoidal and
closed. Such categories have been used to describe the semantics of... (Update)
Active bibliography (related documents): More All
0.2: Full Abstraction for PCF - Samson Abramsky Radha (1994)
(Correct)
0.2: Full Abstraction for PCF (Extended Abstract) - Abramsky, Malacaria, Jagadeesan
(Correct)
0.0: Game Theoretic Analysis Of Call-By-Value Computation - Kohei Honda (1997)
(Correct)
Similar documents based on text: More All
0.2: Types and Effects for Asymmetric Cryptographic Protocols - Gordon, Jeffrey (2002)
(Correct)
0.1: Categorical Semantics as a Basis for Program Transformation - Verwer (1990)
(Correct)
0.1: Staging a Public Poetry Performance in a.. - Benford.. (1997)
(Correct)
BibTeX entry: (Update)
@misc{ taylor-fun,
author = "Colin J. Taylor",
title = "Fun and Games with the Linear lambda-Calculus",
url = "citeseer.ist.psu.edu/taylor98fun.html" }
Citations (may not include all citations):
233
Computational interpretations of linear logic
- Abramsky - 1993
233
The formulae-as-types notion of construction (context) - Howard - 1980
215
Theoretical Computer Science (context) - Girard - 1987
144
Full abstraction for PCF
- Abramsky, Jagadeesan - 1994 ACM DBLP
68
On full abstraction for PCF (context) - Hyland, Ong - 1994
51
autonomous categories and cofree coalgebras (context) - Seely - 1989
49
Annals of Pure and Applied Logic (context) - Blass, semantics et al. - 1992
46
Term assignment for intuitionistic linear logic (context) - Benton, Bierman et al. - 1992
37
dialogue games and PCF (context) - Hyland, Ong - 1995
35
Linear logic and lazy computation (context) - Girard, Lafont - 1987 ACM DBLP
29
A syntax for linear logic
- Wadler - 1993 ACM DBLP
23
Games and full abstraction for the lazy -calculus (context) - Abramsky, McCusker - 1995
15
A type--theoretic alternative to CUCH (context) - Scott - 1969
5
Announcement on the types mailing list (context) - Abramsky, Jagadeesan et al. - 1993
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC