Date of Original Version



Conference Proceeding

Rights Management

© ACM, 2013. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published at

Abstract or Description

We present a logical correspondence between natural semantics and abstract machines. This correspondence enables the mechanical and fully-correct construction of an abstract machine from a natural semantics. Our logical correspondence mirrors the Reynolds functional correspondence, but we manipulate semantic specifications encoded in a logical framework instead of manipulating functional programs. Natural semantics and abstract machines are instances of substructural operational semantics. As a byproduct, using a substructurallogical framework, we bring concurrent and stateful models into the domain of the logical correspondence.





Published In

Proceedings of the Symposium on Principles and Practice of Declarative Programming, 2013, 109-119.