Jan Jürjens  Home/Search
Context
Related
| www4.in.tum.de/publ/papers...Jur02f.pdf 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: www4.in.tum.de/publ/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Mathematical models are an important tool in the development of software technology, including programming languages and algorithms. During the last few years, a new class of such models has been developed based on the notion of a mathematical game that is especially well-suited to address the interactions between the components of a system. This paper gives an introduction to these game-semantical models of programming languages, concentrating on motivating the basic intuitions and putting... (Update)
Active bibliography (related documents): More All
5.4: Games in the Semantics of Programming Languages - An Elementary.. - Jürjens (1999) (Correct)
0.4: Boolean Games - Harrenstein, van der Hoek, Meyer.. (Correct)
0.4: Probabilistic Game Semantics - Danos, Harmer (2000) (Correct)
Similar documents based on text: More All
0.6: The Category Of Inner Models - Koepke (1999) (Correct)
0.2: Revision Sequences and Computers with an Infinite Amount of Time - Löwe (1999) (Correct)
0.2: Set-Theoretic Absoluteness and The Revision Theory of Truth - Löwe, Welch (2000) (Correct)
BibTeX entry: (Update)
@inproceedings{ jurjens99games,
author = "Jan J{\"u}rjens",
title = "Games In The Semantics Of Programming Languages --- An Elementary Introduction"
editor = "Benedikt L{\"o}we and Florian Rudolph",
booktitle = "Foundations of the Formal Sciences --- Refereed Papers of a Research
Colloquium, Humboldt--Universitat zu Berlin, May 7-9, 1999",
pages = "101--120",
year = "1999",
url = "citeseer.ist.psu.edu/680050.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
982 Theoretical Computer Science (context) - Girard, logic - 1987
306 LCF considered as a programming language (context) - Plotkin - 1977
175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1992
144 Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994
68 Towards a geometry of interaction (context) - Girard - 1989
61 Sequential algorithms on concrete data structures (context) - Berry, Curien - 1982
58 A fully abstract game semantics for general references (context) - Abramsky, Honda et al. - 1998
56 Game Theoretic Analysis of Call-by-value Computation - Honda, Yoshida - 1997
51 sharing and state: a fully abstract game semantics for IDEAL.. (context) - Abramsky, McCusker - 1997
49 Annals of Pure and Applied Logic (context) - Blass, semantics et al. - 1992
43 Game Semantics for Linear Logic (context) - Lafont, Streicher - 1991
42 Game-theoretical Semantics (context) - Hintikka, Sandu - 1997
40 Full Abstraction for Functional Languages with Control - Laird - 1997
39 Retracing some paths (context) - Abramsky - 1996
31 Concurrent Games and Full Completeness - Abramsky, Melli - 1999
29 Fair Games and Full Completeness for Multiplicative Linear L.. - Hyland, Ong - 1993
22 Full Abstraction for Idealized Algol with Passive Expression.. - Abramsky, McCusker
22 Game Semantics - Abramsky, McCusker - 1998
21 games and linear logic (context) - Lamarche - 1994
16 Semantics of interaction: an introduction to game semantics (context) - Abramsky - 1997
15 Dialogues as a foundation for intuitionistic logic (context) - Felscher - 1986
14 Hereditarily Sequential Functionals: A Game-Theoretic Approa.. - Nickau - 1996
13 to appear in: Information and Computation (context) - Hyland, Ong et al.
13 Non-deterministic Games and Program Analysis: An application.. - Malacaria, Hankin - 1999
11 Logik und Agon (context) - Lorenzen - 1960
10 Remarques sur la theorie des jeux a deux personnes (context) - Joyal - 1977
9 Games in the Semantics of Programming Languages - Abramsky - 1997
9 A fully abstract game semantics for finite nondeterminism - Harmer, McCusker - 1999
3 A note on Reactive Refinement (context) - Abramsky - 1999
2 contributed talk at the Marktoberdorf Summer School (context) - Jurjens, Refinement - 1999
2 Categorical models of concurrency (context) - Jurjens, of et al. - 1999
2 accepted by: Information and Computation (context) - Abramsky, Jagadeesan et al.
2 Game Semantics and full abstraction for sequential programmi.. (context) - Abramsky - 1999
2 Principles of Refinement (context) - Mantel
2 Finite games for a predicate logic without contractions (context) - Mey - 1994
2 Tarski's fixed-point theorem and higher-order term rewrite s.. - Matthes
2 Model Checking and Beyond: On the Analysis of Reactive Syste.. (context) - Merz
1 Process Realizability / Concurrent Games & Full Completeness.. (context) - Abramsky - 1999
Documents on the same site (http://www4.in.tum.de/publ/papers/): More
The Amsterdam Manifesto on OCL - Cook, Kleppe, Mitchell, Rumpe.. (1999) (Correct)
Structured Specifications and Implementation of.. - Walicki, Broy (1995) (Correct)
Modeling Dynamic Component Interfaces - Huber, Rausch, Rumpe (1998) (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