Reversible representation and manipulation of constructor terms in the heap
HB Axelsen, R Glück - … : 5th International Conference, RC 2013, Victoria …, 2013 - Springer
Reversible Computation: 5th International Conference, RC 2013, Victoria, BC …, 2013•Springer
We currently have limited understanding of how complex data (eg 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 …
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 …
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果