Output details
11 - Computer Science and Informatics
University of Bath
A graph model for imperative computation
<10>This gives a simple new presentation of a model of a higher-order imperative programming language, originally formulated by Reddy (Lisp and Symbolic Computation, 9:7-76, 1996), and demonstrates the previously unknown fact that this model is fully abstract. Reddy and Reynolds (ACM SIGPLAN Notices 47:1 2012) recognise that it is therefore "the first fully abstract model ever discovered for a higher-order imperative programming language".
This discovery inspired the Royal Society project "Graph Models of Functional, Imperative and Logic Programming" (£11950) which led to work on weighted relational models of programs (Laird, McCusker, Manzonetto, Pagani LICS 2013).