University of Cambridge > > Logic & Semantics for Dummies > Introduction to game semantics for programming languages

Introduction to game semantics for programming languages

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Nathanael Arkor.

This year, the field of game semantics celebrates the 25th anniversary of one of its cornerstone results: a fully abstract model for the programming language PCF . In this talk, I will give an introduction to game semantics for programming languages, a semantics that interprets types as 2-player games and programs as strategies over these games.

Starting with some reminders from operational and denotational semantics as to the notion of full abstraction, I will then move on presenting a (decidable) game semantics for a small imperative programming language with first order functions, fIA. In the time remaining, I will try to emphasize the expressiveness of game semantics by showing how other programming language features such as recursion or concurrency can be represented in game models.

This talk is part of the Logic & Semantics for Dummies series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity