Reversible Representation and Manipulation of Constructor Terms in the Heap View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2013

AUTHORS

Holger Bock Axelsen , Robert Glück

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. More... »

PAGES

96-109

Book

TITLE

Reversible Computation

ISBN

978-3-642-38985-6
978-3-642-38986-3

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-38986-3_9

DOI

http://dx.doi.org/10.1007/978-3-642-38986-3_9

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1036592869


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "DIKU, Department of Computer Science, University of Copenhagen, Denmark", 
          "id": "http://www.grid.ac/institutes/grid.5254.6", 
          "name": [
            "DIKU, Department of Computer Science, University of Copenhagen, Denmark"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Axelsen", 
        "givenName": "Holger Bock", 
        "id": "sg:person.015546427711.73", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015546427711.73"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "DIKU, Department of Computer Science, University of Copenhagen, Denmark", 
          "id": "http://www.grid.ac/institutes/grid.5254.6", 
          "name": [
            "DIKU, Department of Computer Science, University of Copenhagen, Denmark"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gl\u00fcck", 
        "givenName": "Robert", 
        "id": "sg:person.010754010217.31", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010754010217.31"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2013", 
    "datePublishedReg": "2013-01-01", 
    "description": "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.", 
    "editor": [
      {
        "familyName": "Dueck", 
        "givenName": "Gerhard W.", 
        "type": "Person"
      }, 
      {
        "familyName": "Miller", 
        "givenName": "D. Michael", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-38986-3_9", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-642-38985-6", 
        "978-3-642-38986-3"
      ], 
      "name": "Reversible Computation", 
      "type": "Book"
    }, 
    "keywords": [
      "complex data", 
      "simplified version", 
      "binary tree", 
      "reversible machine", 
      "constructor terms", 
      "et al", 
      "simple method", 
      "representation", 
      "version", 
      "code", 
      "machine", 
      "terms", 
      "first-match policy", 
      "machine code", 
      "trees", 
      "data", 
      "al", 
      "heap", 
      "understanding", 
      "policy", 
      "Yokoyama et al", 
      "environment", 
      "manipulation", 
      "garbage", 
      "paper", 
      "method", 
      "stack environment", 
      "reversible representation", 
      "reversible machine code", 
      "recent reversible functional language RFUN", 
      "reversible functional language RFUN", 
      "functional language RFUN", 
      "language RFUN", 
      "RFUN"
    ], 
    "name": "Reversible Representation and Manipulation of Constructor Terms in the Heap", 
    "pagination": "96-109", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1036592869"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-38986-3_9"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-38986-3_9", 
      "https://app.dimensions.ai/details/publication/pub.1036592869"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-12-01T20:12", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/chapter/chapter_76.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-38986-3_9"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-38986-3_9'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-38986-3_9'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-38986-3_9'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-38986-3_9'


 

This table displays all metadata directly associated to this object as RDF triples.

106 TRIPLES      23 PREDICATES      60 URIs      53 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-38986-3_9 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N0e01b09f99b84e369ba775113fffb7c9
4 schema:datePublished 2013
5 schema:datePublishedReg 2013-01-01
6 schema:description 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.
7 schema:editor Nc746f75100c94686b37e3bbf4a0dfcb6
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Na3bcaee2395f4924bd98e4b2b4341504
12 schema:keywords RFUN
13 Yokoyama et al
14 al
15 binary tree
16 code
17 complex data
18 constructor terms
19 data
20 environment
21 et al
22 first-match policy
23 functional language RFUN
24 garbage
25 heap
26 language RFUN
27 machine
28 machine code
29 manipulation
30 method
31 paper
32 policy
33 recent reversible functional language RFUN
34 representation
35 reversible functional language RFUN
36 reversible machine
37 reversible machine code
38 reversible representation
39 simple method
40 simplified version
41 stack environment
42 terms
43 trees
44 understanding
45 version
46 schema:name Reversible Representation and Manipulation of Constructor Terms in the Heap
47 schema:pagination 96-109
48 schema:productId N63515d9a29b8452388f47dd727d65fef
49 Nc6e05052bd2d491d95891338965dd635
50 schema:publisher N6fe75a49b1a940409f863d00d72296ad
51 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036592869
52 https://doi.org/10.1007/978-3-642-38986-3_9
53 schema:sdDatePublished 2021-12-01T20:12
54 schema:sdLicense https://scigraph.springernature.com/explorer/license/
55 schema:sdPublisher N3df6230fc10548a2ac9e2adbe4c8bb03
56 schema:url https://doi.org/10.1007/978-3-642-38986-3_9
57 sgo:license sg:explorer/license/
58 sgo:sdDataset chapters
59 rdf:type schema:Chapter
60 N0e01b09f99b84e369ba775113fffb7c9 rdf:first sg:person.015546427711.73
61 rdf:rest N85931e524dbb46088a63dc3ab2f210f4
62 N18bdf2b2ae5349b8989ccabcef451b01 schema:familyName Dueck
63 schema:givenName Gerhard W.
64 rdf:type schema:Person
65 N3df6230fc10548a2ac9e2adbe4c8bb03 schema:name Springer Nature - SN SciGraph project
66 rdf:type schema:Organization
67 N63515d9a29b8452388f47dd727d65fef schema:name doi
68 schema:value 10.1007/978-3-642-38986-3_9
69 rdf:type schema:PropertyValue
70 N6fe75a49b1a940409f863d00d72296ad schema:name Springer Nature
71 rdf:type schema:Organisation
72 N85931e524dbb46088a63dc3ab2f210f4 rdf:first sg:person.010754010217.31
73 rdf:rest rdf:nil
74 Na3bcaee2395f4924bd98e4b2b4341504 schema:isbn 978-3-642-38985-6
75 978-3-642-38986-3
76 schema:name Reversible Computation
77 rdf:type schema:Book
78 Na503e1118a1e4aeda3e89ce32a81681e schema:familyName Miller
79 schema:givenName D. Michael
80 rdf:type schema:Person
81 Nbc4438ee5fa94561899be9e44cb9cce5 rdf:first Na503e1118a1e4aeda3e89ce32a81681e
82 rdf:rest rdf:nil
83 Nc6e05052bd2d491d95891338965dd635 schema:name dimensions_id
84 schema:value pub.1036592869
85 rdf:type schema:PropertyValue
86 Nc746f75100c94686b37e3bbf4a0dfcb6 rdf:first N18bdf2b2ae5349b8989ccabcef451b01
87 rdf:rest Nbc4438ee5fa94561899be9e44cb9cce5
88 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
89 schema:name Information and Computing Sciences
90 rdf:type schema:DefinedTerm
91 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
92 schema:name Artificial Intelligence and Image Processing
93 rdf:type schema:DefinedTerm
94 sg:person.010754010217.31 schema:affiliation grid-institutes:grid.5254.6
95 schema:familyName Glück
96 schema:givenName Robert
97 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010754010217.31
98 rdf:type schema:Person
99 sg:person.015546427711.73 schema:affiliation grid-institutes:grid.5254.6
100 schema:familyName Axelsen
101 schema:givenName Holger Bock
102 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015546427711.73
103 rdf:type schema:Person
104 grid-institutes:grid.5254.6 schema:alternateName DIKU, Department of Computer Science, University of Copenhagen, Denmark
105 schema:name DIKU, Department of Computer Science, University of Copenhagen, Denmark
106 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...