A monad for full ground reference cells

Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)
146 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationProceedings of 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS2017)
PublisherIEEE Computer Society Press
Number of pages12
ISBN (Electronic)978-1-5090-3018-7
DOIs
Publication statusPublished - 18 Aug 2017
Event32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017) - Reykjavik, Iceland
Duration: 20 Jun 201723 Jun 2017

Conference

Conference32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017)
Country/TerritoryIceland
CityReykjavik
Period20/06/1723/06/17

Keywords

  • cs.PL
  • cs.LO
  • math.CT

Fingerprint

Dive into the research topics of 'A monad for full ground reference cells'. Together they form a unique fingerprint.

Cite this