A monad for full ground reference cells

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

doi:10.1109/LICS.2017.8005109

A monad for full ground reference cells

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

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

203 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 language	English
Title of host publication	Proceedings of 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS2017)
Publisher	IEEE Computer Society Press
Number of pages	12
ISBN (Electronic)	978-1-5090-3018-7
DOIs	https://doi.org/10.1109/LICS.2017.8005109
Publication status	Published - 18 Aug 2017
Event	32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017) - Reykjavik, Iceland Duration: 20 Jun 2017 → 23 Jun 2017

Conference

Conference	32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017)
Country/Territory	Iceland
City	Reykjavik
Period	20/06/17 → 23/06/17

Keywords

cs.PL
cs.LO
math.CT

Access to Document

10.1109/LICS.2017.8005109

lics-17-ref-cells
(c) 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. Eligibility for repository: Checked on 5/5/2017
Accepted author manuscript, 418 KBLicence: None: All rights reserved

Cite this

@inproceedings{a3ebe16a62b4489eb55d6c38635dd17a,

title = "A monad for full ground reference cells",

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 foradding 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 = "cs.PL, cs.LO, math.CT",

author = "Ohad Kammar and Levy, {Paul Blain} and Moss, {Sean K.} and Sam Staton",

year = "2017",

month = aug,

day = "18",

doi = "10.1109/LICS.2017.8005109",

language = "English",

booktitle = "Proceedings of 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS2017)",

publisher = "IEEE Computer Society Press",

note = "32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017) ; Conference date: 20-06-2017 Through 23-06-2017",

}

TY - GEN

T1 - A monad for full ground reference cells

AU - Kammar, Ohad

AU - Levy, Paul Blain

AU - Moss, Sean K.

AU - Staton, Sam

PY - 2017/8/18

Y1 - 2017/8/18

N2 - 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 foradding 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.

AB - 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 foradding 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.

KW - cs.PL

KW - cs.LO

KW - math.CT

UR - https://arxiv.org/abs/1702.04908

U2 - 10.1109/LICS.2017.8005109

DO - 10.1109/LICS.2017.8005109

M3 - Conference contribution

BT - Proceedings of 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS2017)

PB - IEEE Computer Society Press

T2 - 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017)

Y2 - 20 June 2017 through 23 June 2017

ER -

A monad for full ground reference cells

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this