Reversible representation and manipulation of constructor terms in the heap

Holger Bock Axelsen, Robert Glück

12 Citations (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.

Original languageEnglish
Title of host publicationReversible Computation. Proceedings
EditorsGerhard W. Dueck, D. Michael Miller
Number of pages14
PublisherSpringer
Publication date2013
Pages96-109
ISBN (Print)978-3-642-38985-6
ISBN (Electronic)978-3-642-38986-3
DOIs
Publication statusPublished - 2013
Event5th International Conference on Reversible Computation - Victoria, Canada
Duration: 4 Jul 20135 Jul 2013
Conference number: 5

Conference

Conference5th International Conference on Reversible Computation
Number5
Country/TerritoryCanada
CityVictoria
Period04/07/201305/07/2013
SeriesLecture notes in computer science
Volume7948
ISSN0302-9743

Keywords

  • Faculty of Science
  • data structures
  • memory management
  • reversible programming

Fingerprint

Dive into the research topics of 'Reversible representation and manipulation of constructor terms in the heap'. Together they form a unique fingerprint.

Cite this