The Substitution Vanishes View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2006

AUTHORS

Armin Kühnemann , Andreas Maletti

ABSTRACT

Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient programs, which use accumulating parameters instead (like efficient list reversal). In this paper we present a generalized and automatic accumulation technique that also handles programs operating with unary functions on arbitrary tree structures and employing substitution functions on trees which may replace different designated symbols by different trees. We show that this transformation does not deteriorate the efficiency with respect to call-by-need reduction. More... »

PAGES

173-188

Book

TITLE

Algebraic Methodology and Software Technology

ISBN

978-3-540-35633-2
978-3-540-35636-3

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/11784180_15

DOI

http://dx.doi.org/10.1007/11784180_15

DIMENSIONS

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


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/06", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Biological Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0607", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Plant Biology", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Institute for Theoretical Computer Science, Department of Computer Science, Dresden University of Technology, D\u201301062, Dresden, Germany", 
          "id": "http://www.grid.ac/institutes/grid.4488.0", 
          "name": [
            "Institute for Theoretical Computer Science, Department of Computer Science, Dresden University of Technology, D\u201301062, Dresden, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "K\u00fchnemann", 
        "givenName": "Armin", 
        "id": "sg:person.015633306630.74", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015633306630.74"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Institute for Theoretical Computer Science, Department of Computer Science, Dresden University of Technology, D\u201301062, Dresden, Germany", 
          "id": "http://www.grid.ac/institutes/grid.4488.0", 
          "name": [
            "Institute for Theoretical Computer Science, Department of Computer Science, Dresden University of Technology, D\u201301062, Dresden, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Maletti", 
        "givenName": "Andreas", 
        "id": "sg:person.016645332751.01", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016645332751.01"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2006", 
    "datePublishedReg": "2006-01-01", 
    "description": "Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient programs, which use accumulating parameters instead (like efficient list reversal). In this paper we present a generalized and automatic accumulation technique that also handles programs operating with unary functions on arbitrary tree structures and employing substitution functions on trees which may replace different designated symbols by different trees. We show that this transformation does not deteriorate the efficiency with respect to call-by-need reduction.", 
    "editor": [
      {
        "familyName": "Johnson", 
        "givenName": "Michael", 
        "type": "Person"
      }, 
      {
        "familyName": "Vene", 
        "givenName": "Varmo", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11784180_15", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-35633-2", 
        "978-3-540-35636-3"
      ], 
      "name": "Algebraic Methodology and Software Technology", 
      "type": "Book"
    }, 
    "keywords": [
      "accumulation technique", 
      "technique", 
      "arbitrary tree structures", 
      "efficiency", 
      "parameters", 
      "structure", 
      "respect", 
      "reduction", 
      "function", 
      "transformation", 
      "tree structure", 
      "program", 
      "substitution function", 
      "need reduction", 
      "substitution", 
      "efficient programs", 
      "symbols", 
      "different trees", 
      "trees", 
      "functional programs", 
      "unary functions", 
      "paper", 
      "append functions", 
      "automatic accumulation technique"
    ], 
    "name": "The Substitution Vanishes", 
    "pagination": "173-188", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1008881277"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11784180_15"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11784180_15", 
      "https://app.dimensions.ai/details/publication/pub.1008881277"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-11-01T18:55", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/chapter/chapter_316.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/11784180_15"
  }
]
 

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/11784180_15'

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/11784180_15'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/11784180_15'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/11784180_15'


 

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

96 TRIPLES      23 PREDICATES      50 URIs      43 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/11784180_15 schema:about anzsrc-for:06
2 anzsrc-for:0607
3 schema:author N7294093c64f2430586ac9187f91af710
4 schema:datePublished 2006
5 schema:datePublishedReg 2006-01-01
6 schema:description Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient programs, which use accumulating parameters instead (like efficient list reversal). In this paper we present a generalized and automatic accumulation technique that also handles programs operating with unary functions on arbitrary tree structures and employing substitution functions on trees which may replace different designated symbols by different trees. We show that this transformation does not deteriorate the efficiency with respect to call-by-need reduction.
7 schema:editor Na46fd52d452644d49bd3c555954e3db8
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N5b3b50e0844f4a899ee4b3e646f2e770
12 schema:keywords accumulation technique
13 append functions
14 arbitrary tree structures
15 automatic accumulation technique
16 different trees
17 efficiency
18 efficient programs
19 function
20 functional programs
21 need reduction
22 paper
23 parameters
24 program
25 reduction
26 respect
27 structure
28 substitution
29 substitution function
30 symbols
31 technique
32 transformation
33 tree structure
34 trees
35 unary functions
36 schema:name The Substitution Vanishes
37 schema:pagination 173-188
38 schema:productId N0ccf6346c5224da48861475dfbd596e1
39 N39d6b8e3f3db4007af70df956758824f
40 schema:publisher Ne9632e73254948f8a395a51a733c4be8
41 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008881277
42 https://doi.org/10.1007/11784180_15
43 schema:sdDatePublished 2021-11-01T18:55
44 schema:sdLicense https://scigraph.springernature.com/explorer/license/
45 schema:sdPublisher N9d74c0bccf9c45a885e49fc29f390173
46 schema:url https://doi.org/10.1007/11784180_15
47 sgo:license sg:explorer/license/
48 sgo:sdDataset chapters
49 rdf:type schema:Chapter
50 N0ccf6346c5224da48861475dfbd596e1 schema:name dimensions_id
51 schema:value pub.1008881277
52 rdf:type schema:PropertyValue
53 N15d6822fc8d74f869299e4f97b058116 rdf:first sg:person.016645332751.01
54 rdf:rest rdf:nil
55 N2bf1dd5441ba48ff9aa36611b8c63b05 rdf:first N4bd2c7c210854cba9a7f2b90b1bf68fc
56 rdf:rest rdf:nil
57 N39d6b8e3f3db4007af70df956758824f schema:name doi
58 schema:value 10.1007/11784180_15
59 rdf:type schema:PropertyValue
60 N4bd2c7c210854cba9a7f2b90b1bf68fc schema:familyName Vene
61 schema:givenName Varmo
62 rdf:type schema:Person
63 N5b3b50e0844f4a899ee4b3e646f2e770 schema:isbn 978-3-540-35633-2
64 978-3-540-35636-3
65 schema:name Algebraic Methodology and Software Technology
66 rdf:type schema:Book
67 N7294093c64f2430586ac9187f91af710 rdf:first sg:person.015633306630.74
68 rdf:rest N15d6822fc8d74f869299e4f97b058116
69 N9d74c0bccf9c45a885e49fc29f390173 schema:name Springer Nature - SN SciGraph project
70 rdf:type schema:Organization
71 Na46fd52d452644d49bd3c555954e3db8 rdf:first Nd1836b10c5ce4f39bfb66e2d67e2ff25
72 rdf:rest N2bf1dd5441ba48ff9aa36611b8c63b05
73 Nd1836b10c5ce4f39bfb66e2d67e2ff25 schema:familyName Johnson
74 schema:givenName Michael
75 rdf:type schema:Person
76 Ne9632e73254948f8a395a51a733c4be8 schema:name Springer Nature
77 rdf:type schema:Organisation
78 anzsrc-for:06 schema:inDefinedTermSet anzsrc-for:
79 schema:name Biological Sciences
80 rdf:type schema:DefinedTerm
81 anzsrc-for:0607 schema:inDefinedTermSet anzsrc-for:
82 schema:name Plant Biology
83 rdf:type schema:DefinedTerm
84 sg:person.015633306630.74 schema:affiliation grid-institutes:grid.4488.0
85 schema:familyName Kühnemann
86 schema:givenName Armin
87 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015633306630.74
88 rdf:type schema:Person
89 sg:person.016645332751.01 schema:affiliation grid-institutes:grid.4488.0
90 schema:familyName Maletti
91 schema:givenName Andreas
92 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016645332751.01
93 rdf:type schema:Person
94 grid-institutes:grid.4488.0 schema:alternateName Institute for Theoretical Computer Science, Department of Computer Science, Dresden University of Technology, D–01062, Dresden, Germany
95 schema:name Institute for Theoretical Computer Science, Department of Computer Science, Dresden University of Technology, D–01062, Dresden, Germany
96 rdf:type schema:Organization
 




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


...