Jim Laird  Home/Search
Context
Related
| cogs.susx.ac.uk/users/jiml...seqa.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cogs.susx.ac.uk/users/jiml/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The relationship between Hyland-Ong-style games and Berry-Curien sequential algorithms is investigated, with the object of describing semantic solutions to two problems | to characterise e ectively the \minimal models" of the simply-typed -calculus and the fully abstract model of PCF with control operators | which are shown to be equivalent. (Update)
Active bibliography (related documents): More All
0.7: Fully Abstract Bidomain Models of the λ-Calculus - Laird (2001) (Correct)
0.7: A game semantics of Idealized CSP - Laird (2001) (Correct)
0.7: Bistability and Bisequentiality - Draft Jim Laird (Correct)
Similar documents based on text: More All
1.4: Full Abstraction for PCF - Abramsky, Jagadeesan, Malacaria (1996) (Correct)
0.7: Full Abstraction for PCF (Extended Abstract) - Abramsky, Malacaria, Jagadeesan (Correct)
0.7: Games and Full Abstraction for PCF: Preliminary.. - Abramsky, Jagadeesan.. (1993) (Correct)
BibTeX entry: (Update)
@misc{ laird-games,
author = "Jim Laird",
title = "Games and Sequential Algorithms",
url = "citeseer.ist.psu.edu/laird01games.html" }
Citations (may not include all citations):306 LCF considered as a programming language (context) - Plotkin - 1977
175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
138 The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1992
134 calculus: an algorithmic interpretation of classical natural.. (context) - Parigot - 1992
66 What is a categorical model of intuitionistic linear logic - Bierman - 1995
61 Sequential algorithms on concrete data structures (context) - Berry, Curien - 1982
58 A fully abstract games semantics for general references (context) - Abramsky, Honda et al. - 1998
56 Game theoretic analysis of call-by-value computation - Honda, Yoshida - 1997
54 Games and full abstraction for a functional metalanguage wit.. (context) - McCusker - 1996
51 Sharing and State: a fully abstract game semantics for Ideal.. (context) - Abramsky, McCusker - 1997
48 Hereditarily sequential functionals - Nickau - 1994
40 Full abstraction for functional languages with control - Laird - 1997
35 Games semantics and abstract machines (context) - Danos, Herbelin et al. - 1996
24 Fully abstract semantics for observably sequential languages (context) - Cartwright, Curien et al. - 1994
22 Game semantics - Abramsky, McCusker
21 games and linear logic (context) - Lamarche - 1992
19 Axioms for full abstraction and full completeness (context) - Abramsky
18 Observable sequentiality and full abstraction - Cartwright, Felleisen - 1991
16 The sequentially realizable functionals (context) - Longley - 1998
16 Projecting sequential algorithms on strongly stable function.. - Ehrhard - 1996
15 Sound and complete axiomatisation of call-by-value control o.. - Hofmann - 1995
11 continuation semantics and abstract machines (context) - Streicher, Reus - 1998
11 the symmetry of sequentiality (context) - Curien - 1993
9 Accepted for publication in Information and Computation (context) - Abramsky, Jagadeesan et al. - 1996
7 Decidability of all minimal models (context) - Padovani - 1996
7 A fully abstract game semantics of local exceptions (context) - Laird - 2001
6 To appear in Theoretical Computer Science (context) - Hyland, Ong et al. - 1995
5 Department of Computer Science (context) - Laird, Analysis et al. - 1998
5 A fully abstract games semantics for nite non-determinism (context) - Harmer, McCusker - 1998
3 To appear in Theoretical Computer Science (context) - Loader, is et al. - 1997
2 invariance and -denability (context) - Statman - 1982
2 An algorithm for the minimal model - Loader - 1997
1 Completeness of continuation models for -calculus (context) - Hofmann, Streicher - 1998
Documents on the same site (http://www.cogs.susx.ac.uk/users/jiml/): More
Fully Abstract Bidomain Models of the λ-Calculus - Laird (2001) (Correct)
A game semantics of Idealized CSP - Laird (2001) (Correct)
Full Abstraction for Functional Languages with Control - Laird (1997) (Correct)
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