Standard
Reference counting for reversible languages. / Mogensen, Torben Ægidius.
Reversible Computation: 6th International Conference, RC 2014, Kyoto, Japan, July 10-11, 2014. Proceedings. red. / Shigeru Yamashita; Shin-ichi Minato. Springer, 2014. s. 82-94 (Lecture notes in computer science, Bind 8507).
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Mogensen, TÆ 2014,
Reference counting for reversible languages. i S Yamashita & S Minato (red),
Reversible Computation: 6th International Conference, RC 2014, Kyoto, Japan, July 10-11, 2014. Proceedings. Springer, Lecture notes in computer science, bind 8507, s. 82-94, 6th International Conference on Reversible Computation, Kyoto, Japan,
10/07/2014.
https://doi.org/10.1007/978-3-319-08494-7_7
APA
Mogensen, T. Æ. (2014).
Reference counting for reversible languages. I S. Yamashita, & S. Minato (red.),
Reversible Computation: 6th International Conference, RC 2014, Kyoto, Japan, July 10-11, 2014. Proceedings (s. 82-94). Springer. Lecture notes in computer science Bind 8507
https://doi.org/10.1007/978-3-319-08494-7_7
Vancouver
Mogensen TÆ.
Reference counting for reversible languages. I Yamashita S, Minato S, red., Reversible Computation: 6th International Conference, RC 2014, Kyoto, Japan, July 10-11, 2014. Proceedings. Springer. 2014. s. 82-94. (Lecture notes in computer science, Bind 8507).
https://doi.org/10.1007/978-3-319-08494-7_7
Author
Mogensen, Torben Ægidius. / Reference counting for reversible languages. Reversible Computation: 6th International Conference, RC 2014, Kyoto, Japan, July 10-11, 2014. Proceedings. red. / Shigeru Yamashita ; Shin-ichi Minato. Springer, 2014. s. 82-94 (Lecture notes in computer science, Bind 8507).
Bibtex
@inproceedings{4e4d3e2b7fa64fc59c85f60d6b48788c,
title = "Reference counting for reversible languages",
abstract = "Modern programming languages and operating systems use heap memorythat allows allocation and deallocation of memory to be decoupled, sothey don't follow a stack discipline. Axelsen and Gl{\"u}ck havepresented a reversible heap manager where allocation and deallocationare each other's logical inverses: Freeing a block of memory is doneby running the allocation procedure backwards.Axelsen and Gl{\"u}ck use this heap manager to sketch implementation of asimple reversible functional language where pattern matching aconstructor is the inverse of construction, so pattern-matchingimplies deallocation. This requires the language to be linear: Apointer can not be copied and it can only be eliminated bydeallocating the node to which it points.We overcome this limitation by adding reference counts to nodes:Copying a pointer to a node increases the reference count of the nodeand eliminating a pointer decreases the reference count. We showreversible implementations of operations on nodes with referencecounts. We then show these operations can be used when implementing areversible functional language RCFUN to the reversible imperativelanguage Janus.",
author = "Mogensen, {Torben {\AE}gidius}",
note = "@inproceedings{DBLP:conf/rc/Mogensen14, author = {Torben {\AE}gidius Mogensen}, title = {Reference Counting for Reversible Languages}, booktitle = {Reversible Computation - 6th International Conference, {RC} 2014, Kyoto, Japan, July 10-11, 2014. Proceedings}, pages = {82--94}, year = {2014}, crossref = {DBLP:conf/rc/2014}, url = {http://dx.doi.org/10.1007/978-3-319-08494-7_7}, doi = {10.1007/978-3-319-08494-7_7}, timestamp = {Mon, 07 Jul 2014 13:59:14 +0200}, biburl = {http://dblp.uni-trier.de/rec/bib/conf/rc/Mogensen14}, bibsource = {dblp computer science bibliography, http://dblp.org} } ; 6th International Conference on Reversible Computation, RC 2014 ; Conference date: 10-07-2014 Through 11-07-2014",
year = "2014",
doi = "10.1007/978-3-319-08494-7_7",
language = "English",
isbn = "978-3-319-08493-0",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "82--94",
editor = "Shigeru Yamashita and Shin-ichi Minato",
booktitle = "Reversible Computation",
address = "Switzerland",
}
RIS
TY - GEN
T1 - Reference counting for reversible languages
AU - Mogensen, Torben Ægidius
N1 - Conference code: 6
PY - 2014
Y1 - 2014
N2 - Modern programming languages and operating systems use heap memorythat allows allocation and deallocation of memory to be decoupled, sothey don't follow a stack discipline. Axelsen and Glück havepresented a reversible heap manager where allocation and deallocationare each other's logical inverses: Freeing a block of memory is doneby running the allocation procedure backwards.Axelsen and Glück use this heap manager to sketch implementation of asimple reversible functional language where pattern matching aconstructor is the inverse of construction, so pattern-matchingimplies deallocation. This requires the language to be linear: Apointer can not be copied and it can only be eliminated bydeallocating the node to which it points.We overcome this limitation by adding reference counts to nodes:Copying a pointer to a node increases the reference count of the nodeand eliminating a pointer decreases the reference count. We showreversible implementations of operations on nodes with referencecounts. We then show these operations can be used when implementing areversible functional language RCFUN to the reversible imperativelanguage Janus.
AB - Modern programming languages and operating systems use heap memorythat allows allocation and deallocation of memory to be decoupled, sothey don't follow a stack discipline. Axelsen and Glück havepresented a reversible heap manager where allocation and deallocationare each other's logical inverses: Freeing a block of memory is doneby running the allocation procedure backwards.Axelsen and Glück use this heap manager to sketch implementation of asimple reversible functional language where pattern matching aconstructor is the inverse of construction, so pattern-matchingimplies deallocation. This requires the language to be linear: Apointer can not be copied and it can only be eliminated bydeallocating the node to which it points.We overcome this limitation by adding reference counts to nodes:Copying a pointer to a node increases the reference count of the nodeand eliminating a pointer decreases the reference count. We showreversible implementations of operations on nodes with referencecounts. We then show these operations can be used when implementing areversible functional language RCFUN to the reversible imperativelanguage Janus.
U2 - 10.1007/978-3-319-08494-7_7
DO - 10.1007/978-3-319-08494-7_7
M3 - Article in proceedings
SN - 978-3-319-08493-0
T3 - Lecture notes in computer science
SP - 82
EP - 94
BT - Reversible Computation
A2 - Yamashita, Shigeru
A2 - Minato, Shin-ichi
PB - Springer
T2 - 6th International Conference on Reversible Computation
Y2 - 10 July 2014 through 11 July 2014
ER -
