A monad for full ground reference cells

February 16, 2017 Β· Declared Dead Β· πŸ› Logic in Computer Science

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ohad Kammar, Paul B. Levy, Sean K. Moss, Sam Staton arXiv ID 1702.04908 Category cs.PL: Programming Languages Cross-listed cs.LO, math.CT Citations 21 Venue Logic in Computer Science Last Checked 3 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted