Benefits of Hypergraphs for Program Transformation View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1997

AUTHORS

Andrea Mößle , Heiko Vogler

ABSTRACT

Tupling is a transformation tactic which introduces new functions with the property that redundant function calls and multiple traversals of the input tree are avoided. In the area of functional programming the tupling technique is often based on the unfold/fold technique of [1]. For this reason, most of the different techniques require the intervention of the programmer. We present how easily and obviously tupling can be realized fully automatically in the framework of hypergraphs. More... »

PAGES

572-581

Book

TITLE

Informatik ’97 Informatik als Innovationsmotor

ISBN

978-3-540-63066-1
978-3-642-60831-5

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-60831-5_77

DOI

http://dx.doi.org/10.1007/978-3-642-60831-5_77

DIMENSIONS

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


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/0803", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computer Software", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Fakult\u00e4t f\u00fcr Informatik, Universitat Ulm, 89069, Ulm, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6582.9", 
          "name": [
            "Fakult\u00e4t f\u00fcr Informatik, Universitat Ulm, 89069, Ulm, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "M\u00f6\u00dfle", 
        "givenName": "Andrea", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Fakult\u00e4t Informatik, TU Dresden, 01062, Dresden, Germany", 
          "id": "http://www.grid.ac/institutes/grid.4488.0", 
          "name": [
            "Fakult\u00e4t Informatik, TU Dresden, 01062, Dresden, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Vogler", 
        "givenName": "Heiko", 
        "id": "sg:person.014562633673.93", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014562633673.93"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1997", 
    "datePublishedReg": "1997-01-01", 
    "description": "Tupling is a transformation tactic which introduces new functions with the property that redundant function calls and multiple traversals of the input tree are avoided. In the area of functional programming the tupling technique is often based on the unfold/fold technique of [1]. For this reason, most of the different techniques require the intervention of the programmer. We present how easily and obviously tupling can be realized fully automatically in the framework of hypergraphs.", 
    "editor": [
      {
        "familyName": "Jarke", 
        "givenName": "Matthias", 
        "type": "Person"
      }, 
      {
        "familyName": "Pasedach", 
        "givenName": "Klaus", 
        "type": "Person"
      }, 
      {
        "familyName": "Pohl", 
        "givenName": "Klaus", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-60831-5_77", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-63066-1", 
        "978-3-642-60831-5"
      ], 
      "name": "Informatik \u201997 Informatik als Innovationsmotor", 
      "type": "Book"
    }, 
    "keywords": [
      "intervention", 
      "benefits", 
      "function", 
      "technique", 
      "different techniques", 
      "new functions", 
      "calls", 
      "area", 
      "reasons", 
      "tactics", 
      "redundant function calls", 
      "transformation tactics", 
      "properties", 
      "function calls", 
      "multiple traversals", 
      "input trees", 
      "trees", 
      "functional programming", 
      "programming", 
      "programmers", 
      "hypergraphs", 
      "program transformations", 
      "transformation", 
      "tupling", 
      "traversal", 
      "framework"
    ], 
    "name": "Benefits of Hypergraphs for Program Transformation", 
    "pagination": "572-581", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1004087264"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-60831-5_77"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-60831-5_77", 
      "https://app.dimensions.ai/details/publication/pub.1004087264"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:43", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_194.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-60831-5_77"
  }
]
 

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-60831-5_77'

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-60831-5_77'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-60831-5_77'

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-60831-5_77'


 

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

105 TRIPLES      23 PREDICATES      52 URIs      45 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-60831-5_77 schema:about anzsrc-for:08
2 anzsrc-for:0803
3 schema:author Ndabdcb7000c44dc4a30deaabd9a799a4
4 schema:datePublished 1997
5 schema:datePublishedReg 1997-01-01
6 schema:description Tupling is a transformation tactic which introduces new functions with the property that redundant function calls and multiple traversals of the input tree are avoided. In the area of functional programming the tupling technique is often based on the unfold/fold technique of [1]. For this reason, most of the different techniques require the intervention of the programmer. We present how easily and obviously tupling can be realized fully automatically in the framework of hypergraphs.
7 schema:editor N4320db81724e46e999dc2d428bbde167
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N90b6a52d8ac0433eb7fdd9f1e390f2ef
12 schema:keywords area
13 benefits
14 calls
15 different techniques
16 framework
17 function
18 function calls
19 functional programming
20 hypergraphs
21 input trees
22 intervention
23 multiple traversals
24 new functions
25 program transformations
26 programmers
27 programming
28 properties
29 reasons
30 redundant function calls
31 tactics
32 technique
33 transformation
34 transformation tactics
35 traversal
36 trees
37 tupling
38 schema:name Benefits of Hypergraphs for Program Transformation
39 schema:pagination 572-581
40 schema:productId N0116196851c14ff69f936a3785c57149
41 N8d091b0be0cc457d9052a74f4abf68ab
42 schema:publisher N3ebc9e35dd4d4d938afe4d0612306d9f
43 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004087264
44 https://doi.org/10.1007/978-3-642-60831-5_77
45 schema:sdDatePublished 2022-05-20T07:43
46 schema:sdLicense https://scigraph.springernature.com/explorer/license/
47 schema:sdPublisher N87fb0d909c274222b152aa39446c233b
48 schema:url https://doi.org/10.1007/978-3-642-60831-5_77
49 sgo:license sg:explorer/license/
50 sgo:sdDataset chapters
51 rdf:type schema:Chapter
52 N0116196851c14ff69f936a3785c57149 schema:name dimensions_id
53 schema:value pub.1004087264
54 rdf:type schema:PropertyValue
55 N271cbf340db747a3a1e4867305ac0a51 schema:affiliation grid-institutes:grid.6582.9
56 schema:familyName Mößle
57 schema:givenName Andrea
58 rdf:type schema:Person
59 N3ebc9e35dd4d4d938afe4d0612306d9f schema:name Springer Nature
60 rdf:type schema:Organisation
61 N4320db81724e46e999dc2d428bbde167 rdf:first N4eb85dc6166746ba8d2a1ac8450ffb8a
62 rdf:rest Nb092f2ec5bbe4349bb7b6e351ed776f2
63 N4eb85dc6166746ba8d2a1ac8450ffb8a schema:familyName Jarke
64 schema:givenName Matthias
65 rdf:type schema:Person
66 N6223db1b39d846a0a97a4fa2c6de3b1b rdf:first sg:person.014562633673.93
67 rdf:rest rdf:nil
68 N64183d2da39b4725acfdc91f338e40ec schema:familyName Pasedach
69 schema:givenName Klaus
70 rdf:type schema:Person
71 N87fb0d909c274222b152aa39446c233b schema:name Springer Nature - SN SciGraph project
72 rdf:type schema:Organization
73 N8d091b0be0cc457d9052a74f4abf68ab schema:name doi
74 schema:value 10.1007/978-3-642-60831-5_77
75 rdf:type schema:PropertyValue
76 N90b6a52d8ac0433eb7fdd9f1e390f2ef schema:isbn 978-3-540-63066-1
77 978-3-642-60831-5
78 schema:name Informatik ’97 Informatik als Innovationsmotor
79 rdf:type schema:Book
80 Nb092f2ec5bbe4349bb7b6e351ed776f2 rdf:first N64183d2da39b4725acfdc91f338e40ec
81 rdf:rest Nfa6e771a202c4fa2bc6f766d5ba4dfba
82 Nbd5412ca66b14f4f9e5db4cc9a9ddc7e schema:familyName Pohl
83 schema:givenName Klaus
84 rdf:type schema:Person
85 Ndabdcb7000c44dc4a30deaabd9a799a4 rdf:first N271cbf340db747a3a1e4867305ac0a51
86 rdf:rest N6223db1b39d846a0a97a4fa2c6de3b1b
87 Nfa6e771a202c4fa2bc6f766d5ba4dfba rdf:first Nbd5412ca66b14f4f9e5db4cc9a9ddc7e
88 rdf:rest rdf:nil
89 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
90 schema:name Information and Computing Sciences
91 rdf:type schema:DefinedTerm
92 anzsrc-for:0803 schema:inDefinedTermSet anzsrc-for:
93 schema:name Computer Software
94 rdf:type schema:DefinedTerm
95 sg:person.014562633673.93 schema:affiliation grid-institutes:grid.4488.0
96 schema:familyName Vogler
97 schema:givenName Heiko
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014562633673.93
99 rdf:type schema:Person
100 grid-institutes:grid.4488.0 schema:alternateName Fakultät Informatik, TU Dresden, 01062, Dresden, Germany
101 schema:name Fakultät Informatik, TU Dresden, 01062, Dresden, Germany
102 rdf:type schema:Organization
103 grid-institutes:grid.6582.9 schema:alternateName Fakultät für Informatik, Universitat Ulm, 89069, Ulm, Germany
104 schema:name Fakultät für Informatik, Universitat Ulm, 89069, Ulm, Germany
105 rdf:type schema:Organization
 




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


...