A monad for full ground reference cells
Programming Languages
2017-04-20 v2 Logic in Computer Science
Category Theory
Abstract
We present a denotational account of dynamic allocation of potentially cyclic memory cells using a monad on a functor category. We identify the collection of heaps as an object in a different functor category equipped with a monad for adding hiding/encapsulation capabilities to the heaps. We derive a monad for full ground references supporting effect masking by applying a state monad transformer to the encapsulation monad. To evaluate the monad, we present a denotational semantics for a call-by-value calculus with full ground references, and validate associated code transformations.
Keywords
Cite
@article{arxiv.1702.04908,
title = {A monad for full ground reference cells},
author = {Ohad Kammar and Paul B. Levy and Sean K. Moss and Sam Staton},
journal= {arXiv preprint arXiv:1702.04908},
year = {2017}
}