Games in the semantics of programming languages – an elementary introduction
Synthese 133 (1-2):131-158 (2002)
| Abstract | Mathematical models are an important tool in the development ofsoftware technology, including programming languages and algorithms.During the last few years, a new class of such models has beendeveloped based on the notion of a mathematical game that isespecially well-suited to address the interactions between thecomponents of a system. This paper gives an introduction to thesegame-semantical models of programming languages, concentrating onmotivating the basic intuitions and putting them into context. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesCarlos Viegas Damásio & Luís Moniz Pereira (2002). Hybrid Probabilistic Logic Programs as Residuated Logic Programs. Studia Logica 72 (1):113 - 138.
P. -L. Curien (2003). Symmetry and Interactivity in Programming. Bulletin of Symbolic Logic 9 (2):169-180.
Frederick R. Adams, Kenneth Aizawa & Gary Fuller (1992). Rules in Programming Languages and Networks. In J. Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum.
Raymond Turner (2007). Understanding Programming Languages. Minds and Machines 17 (2).
Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #203,804 of 556,837 )Recent downloads (6 months)1 ( #64,847 of 556,837 )How can I increase my downloads? |
My notes
Discussion
