Reversible representation and manipulation of constructor terms in the heap

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 -