Reversible representation and manipulation of constructor terms in the heap

Holger Bock Axelsen; Robert Glück

doi:10.1007/978-3-642-38986-3_9

Reversible representation and manipulation of constructor terms in the heap

Holger Bock Axelsen, Robert Glück

12 Citationer (Scopus)

Abstract

We currently have limited understanding of how complex data (e.g. algebraic data types) can be represented and manipulated in reversible machine code, in particular without generating garbage. In this paper we present methods for representing and manipulating binary trees (constructor terms) in the heap of a reversible machine. We also give methods for enforcing the so-called first-match policy for a simplified version of the recent reversible functional language RFUN by Yokoyama et al., and simple methods to support let-calls via stack environments.

Originalsprog	Engelsk
Titel	Reversible Computation. Proceedings
Redaktører	Gerhard W. Dueck, D. Michael Miller
Antal sider	14
Forlag	Springer
Publikationsdato	2013
Sider	96-109
ISBN (Trykt)	978-3-642-38985-6
ISBN (Elektronisk)	978-3-642-38986-3
DOI	https://doi.org/10.1007/978-3-642-38986-3_9
Status	Udgivet - 2013
Begivenhed	5th International Conference on Reversible Computation - Victoria, Canada Varighed: 4 jul. 2013 → 5 jul. 2013 Konferencens nummer: 5

Konference

Konference	5th International Conference on Reversible Computation
Nummer	5
Land/Område	Canada
By	Victoria
Periode	04/07/2013 → 05/07/2013

Navn	Lecture notes in computer science
Vol/bind	7948
ISSN	0302-9743

Emneord

Det Natur- og Biovidenskabelige Fakultet

Adgang til dokumentet

10.1007/978-3-642-38986-3_9

Citationsformater

Reversible representation and manipulation of constructor terms in the heap. / Axelsen, Holger Bock; Glück, Robert.

Reversible Computation. Proceedings. red. / Gerhard W. Dueck; D. Michael Miller. Springer, 2013. s. 96-109 (Lecture notes in computer science, Bind 7948).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

Axelsen, HB & Glück, R 2013, Reversible representation and manipulation of constructor terms in the heap. i GW Dueck & DM Miller (red), Reversible Computation. Proceedings. Springer, Lecture notes in computer science, bind 7948, s. 96-109, 5th International Conference on Reversible Computation, Victoria, Canada, 04/07/2013. https://doi.org/10.1007/978-3-642-38986-3_9

@inproceedings{05c086bf7ef64457969d448dabce66c3,

title = "Reversible representation and manipulation of constructor terms in the heap",

abstract = "We currently have limited understanding of how complex data (e.g. algebraic data types) can be represented and manipulated in reversible machine code, in particular without generating garbage. In this paper we present methods for representing and manipulating binary trees (constructor terms) in the heap of a reversible machine. We also give methods for enforcing the so-called first-match policy for a simplified version of the recent reversible functional language RFUN by Yokoyama et al., and simple methods to support let-calls via stack environments.",

keywords = "Faculty of Science, data structures, memory management, reversible programming",

author = "Axelsen, {Holger Bock} and Robert Gl{\"u}ck",

year = "2013",

doi = "10.1007/978-3-642-38986-3_9",

language = "English",

isbn = "978-3-642-38985-6",

series = "Lecture notes in computer science",

publisher = "Springer",

pages = "96--109",

editor = "Dueck, {Gerhard W.} and Miller, {D. Michael}",

booktitle = "Reversible Computation. Proceedings",

note = "5th International Conference on Reversible Computation ; Conference date: 04-07-2013 Through 05-07-2013",

}

TY - GEN

T1 - Reversible representation and manipulation of constructor terms in the heap

AU - Axelsen, Holger Bock

AU - Glück, Robert

N1 - Conference code: 5

PY - 2013

Y1 - 2013

N2 - We currently have limited understanding of how complex data (e.g. algebraic data types) can be represented and manipulated in reversible machine code, in particular without generating garbage. In this paper we present methods for representing and manipulating binary trees (constructor terms) in the heap of a reversible machine. We also give methods for enforcing the so-called first-match policy for a simplified version of the recent reversible functional language RFUN by Yokoyama et al., and simple methods to support let-calls via stack environments.

AB - We currently have limited understanding of how complex data (e.g. algebraic data types) can be represented and manipulated in reversible machine code, in particular without generating garbage. In this paper we present methods for representing and manipulating binary trees (constructor terms) in the heap of a reversible machine. We also give methods for enforcing the so-called first-match policy for a simplified version of the recent reversible functional language RFUN by Yokoyama et al., and simple methods to support let-calls via stack environments.

KW - Faculty of Science

KW - data structures

KW - memory management

KW - reversible programming

U2 - 10.1007/978-3-642-38986-3_9

DO - 10.1007/978-3-642-38986-3_9

M3 - Article in proceedings

SN - 978-3-642-38985-6

T3 - Lecture notes in computer science

SP - 96

EP - 109

BT - Reversible Computation. Proceedings

A2 - Dueck, Gerhard W.

A2 - Miller, D. Michael

PB - Springer

T2 - 5th International Conference on Reversible Computation

Y2 - 4 July 2013 through 5 July 2013

ER -

Reversible representation and manipulation of constructor terms in the heap

Abstract

Konference

Emneord

Adgang til dokumentet

Fingeraftryk

Citationsformater