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": "2022-01-01T19:12", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_218.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 N511c8ac99dbe4196a33c1ecd64726615
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 Ne9fbb99c4e5c4dfeac1af90df4dda445
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Nfccdf9f5916a4486891726dfee5f6228
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 N9fc5fbafb04a4db88601c64e28dab73b
39 Na957b03c2cad4037b1e5f8e46c9fefc6
40 schema:publisher Naa4c7f1a890442ff8aede14333f0e078
41 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008881277
42 https://doi.org/10.1007/11784180_15
43 schema:sdDatePublished 2022-01-01T19:12
44 schema:sdLicense https://scigraph.springernature.com/explorer/license/
45 schema:sdPublisher N3c61158b93fa46cbbaef85ff7bffff02
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 N0acaad48f2b748b6b715ab2064081941 schema:familyName Vene
51 schema:givenName Varmo
52 rdf:type schema:Person
53 N3c61158b93fa46cbbaef85ff7bffff02 schema:name Springer Nature - SN SciGraph project
54 rdf:type schema:Organization
55 N511c8ac99dbe4196a33c1ecd64726615 rdf:first sg:person.015633306630.74
56 rdf:rest N846febd2ac5e4db1b0b828cd484282e6
57 N846febd2ac5e4db1b0b828cd484282e6 rdf:first sg:person.016645332751.01
58 rdf:rest rdf:nil
59 N9fc5fbafb04a4db88601c64e28dab73b schema:name doi
60 schema:value 10.1007/11784180_15
61 rdf:type schema:PropertyValue
62 Na957b03c2cad4037b1e5f8e46c9fefc6 schema:name dimensions_id
63 schema:value pub.1008881277
64 rdf:type schema:PropertyValue
65 Naa4c7f1a890442ff8aede14333f0e078 schema:name Springer Nature
66 rdf:type schema:Organisation
67 Nddda5a48f1654e3c9a437d30ecbd7fb2 schema:familyName Johnson
68 schema:givenName Michael
69 rdf:type schema:Person
70 Ne9fbb99c4e5c4dfeac1af90df4dda445 rdf:first Nddda5a48f1654e3c9a437d30ecbd7fb2
71 rdf:rest Necceec8b58664f26bb49304c0f5dd846
72 Necceec8b58664f26bb49304c0f5dd846 rdf:first N0acaad48f2b748b6b715ab2064081941
73 rdf:rest rdf:nil
74 Nfccdf9f5916a4486891726dfee5f6228 schema:isbn 978-3-540-35633-2
75 978-3-540-35636-3
76 schema:name Algebraic Methodology and Software Technology
77 rdf:type schema:Book
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)


...