A Graph Model for Imperative Computation-Reference-Cited by-同舟云学术

A Graph Model for Imperative Computation

Published:2010-01-12 Issue:1 Volume:6 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

McCusker Guy

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. InProceedings, Thirteenth Annual IEEE Symposium on Logic in Computer Science, pages 334-344. IEEE Computer Society Press, 1998.

2. S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In P. W. O'Hearn and R. D. Tennent, editors,Algol-like Languages, pages 297-329 of volume 2. Birkhaüser, 1997.

3. Countable nondeterminism and random assignment

4. H. P. Barendregt.The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition, 1984.

5. D. Flanagan and Y. Matsumoto.The Ruby Programming Language. O'Reilly Media, Inc., January 2008.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language;Logical Methods in Computer Science;2024-01-26

2. Syntactic control of interference for separation logic;ACM SIGPLAN Notices;2012-01-18

3. Geometry of synthesis iv;ACM SIGPLAN Notices;2011-09-18

4. Geometry of synthesis III;ACM SIGPLAN Notices;2011-01-26

5. Geometry of synthesis III;Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11;2011