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": "Lehrstuhl f\u00fcr Informatik II, RWTH Aachen, Aachen, Germany", 
          "id": "http://www.grid.ac/institutes/grid.1957.a", 
          "name": [
            "Lehrstuhl f\u00fcr Informatik II, RWTH Aachen, Aachen, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fassbender", 
        "givenName": "Heinz", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Lehrstuhl f\u00fcr Informatik II, RWTH Aachen, Aachen, Germany", 
          "id": "http://www.grid.ac/institutes/grid.1957.a", 
          "name": [
            "Lehrstuhl f\u00fcr Informatik II, RWTH Aachen, Aachen, 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"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/3-540-52592-0_69", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034083248", 
          "https://doi.org/10.1007/3-540-52592-0_69"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-75332-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1045461842", 
          "https://doi.org/10.1007/978-3-642-75332-9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-11490-4_19", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028249143", 
          "https://doi.org/10.1007/3-540-11490-4_19"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf01704020", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1006876172", 
          "https://doi.org/10.1007/bf01704020"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf01695769", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1033919759", 
          "https://doi.org/10.1007/bf01695769"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1992-07", 
    "datePublishedReg": "1992-07-01", 
    "description": "This paper contributes to the field of functional programming languages. We investigate the call-by-name and call-by-need implementation of a restricted type of functional programming, calledsyntax directed functional programming; the target of this implementation is an abstract machine that is based on nested stacks. In fact, the technical kernel of this paper is a refinement of an automata theoretical result that, roughly speaking, investigates the well-known relationship \u201crecursion = iteration + stack\u201d in the framework of tree transducers. More precisely, in the underlying result the class of functions computed by total deterministic macro tree-to-string transducers with the call-by-name computation strategy is characterized by total deterministic checking-tree nested-stack transducers. Note that total deterministic macro tree-to-string transducers are term rewriting systems by means of which the reduction semantics of syntax directed functional programming languages can be described.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/bf01211311", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136737", 
        "issn": [
          "0934-5043", 
          "1433-299X"
        ], 
        "name": "Formal Aspects of Computing", 
        "publisher": "Association for Computing Machinery (ACM)", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "4", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "4"
      }
    ], 
    "keywords": [
      "functional programming language", 
      "functional programming", 
      "programming language", 
      "abstract machine", 
      "need implementation", 
      "computation strategy", 
      "reduction semantics", 
      "implementation", 
      "programming", 
      "machine", 
      "language", 
      "restricted type", 
      "syntax", 
      "tree transducers", 
      "string transducers", 
      "semantics", 
      "calls", 
      "stack", 
      "kernel", 
      "recursion", 
      "iteration", 
      "framework", 
      "trees", 
      "theoretical results", 
      "class of functions", 
      "system", 
      "refinement", 
      "results", 
      "field", 
      "name", 
      "class", 
      "strategies", 
      "terms", 
      "means", 
      "types", 
      "fact", 
      "function", 
      "target", 
      "relationship", 
      "transducer", 
      "paper"
    ], 
    "name": "An implementation of syntax directed functional programming on nested-stack machines", 
    "pagination": "341-375", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1021650925"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf01211311"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf01211311", 
      "https://app.dimensions.ai/details/publication/pub.1021650925"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-05-20T07:19", 
    "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/article/article_257.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/bf01211311"
  }
]

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

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

125 TRIPLES      22 PREDICATES      72 URIs      59 LITERALS      6 BLANK NODES