Output details
11 - Computer Science and Informatics
University of Bath
Return to search
Output 0 of 0 in the submission
Article title
A graph model for imperative computation
Type
D - Journal article
Title of journal
Logical Methods in Computer Science
Article number
Paper 2
Volume number
6
Issue number
1
First page of article
-
ISSN of journal
1860-5974
Year of publication
2010
Number of additional authors
0
Additional information
<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).
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Mathematical Foundations
Citation count
8
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
