David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Synthese 133 (1-2):131-158 (2002)
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||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Carlos 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):203-216.
Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.
Added to index2009-01-28
Total downloads4 ( #252,697 of 1,099,047 )
Recent downloads (6 months)1 ( #287,293 of 1,099,047 )
How can I increase my downloads?