An Universal Resolving Algorithm for Inverse Computation of Lazy Languages View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2007-01-01

AUTHORS

Sergei Abramov , Robert Glück , Yuri Klimov

ABSTRACT

The Universal Resolving Algorithm was originally formulated for inverse computation of tail-recursive programs. We present an extension to general recursion that improves the efficiency and termination of inverse computation because partially produced output is used to reduce the search space. In addition, we present a transformation using a new unification-based equality operator. Examples demonstrate the advantages of the new technique. We found that these extensions can also improve inverse computation in the context of functional-logic languages. More... »

PAGES

27-40

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-70881-0_6

DOI

http://dx.doi.org/10.1007/978-3-540-70881-0_6

DIMENSIONS

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


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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Program Systems Institute, Russian Academy of Sciences, RU-152140 Pereslavl-Zalessky, Russia", 
          "id": "http://www.grid.ac/institutes/grid.4886.2", 
          "name": [
            "Program Systems Institute, Russian Academy of Sciences, RU-152140 Pereslavl-Zalessky, Russia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Abramov", 
        "givenName": "Sergei", 
        "id": "sg:person.010307436465.27", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010307436465.27"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "DIKU, Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen, Denmark", 
          "id": "http://www.grid.ac/institutes/grid.5254.6", 
          "name": [
            "DIKU, Department of Computer Science, University of Copenhagen, DK-2100 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"
      }, 
      {
        "affiliation": {
          "alternateName": "M.V.\u00a0Keldysh Institute for Applied Mathematics, Russian Academy of Sciences, RU-125047 Moscow, Russia", 
          "id": "http://www.grid.ac/institutes/grid.4886.2", 
          "name": [
            "M.V.\u00a0Keldysh Institute for Applied Mathematics, Russian Academy of Sciences, RU-125047 Moscow, Russia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Klimov", 
        "givenName": "Yuri", 
        "type": "Person"
      }
    ], 
    "datePublished": "2007-01-01", 
    "datePublishedReg": "2007-01-01", 
    "description": "The Universal Resolving Algorithm was originally formulated for inverse computation of tail-recursive programs. We present an extension to general recursion that improves the efficiency and termination of inverse computation because partially produced output is used to reduce the search space. In addition, we present a transformation using a new unification-based equality operator. Examples demonstrate the advantages of the new technique. We found that these extensions can also improve inverse computation in the context of functional-logic languages.", 
    "editor": [
      {
        "familyName": "Virbitskaite", 
        "givenName": "Irina", 
        "type": "Person"
      }, 
      {
        "familyName": "Voronkov", 
        "givenName": "Andrei", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-70881-0_6", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-70880-3", 
        "978-3-540-70881-0"
      ], 
      "name": "Perspectives of Systems Informatics", 
      "type": "Book"
    }, 
    "keywords": [
      "inverse computation", 
      "functional-logic languages", 
      "Universal Resolving Algorithm", 
      "search space", 
      "equality operator", 
      "tail-recursive programs", 
      "lazy languages", 
      "general recursion", 
      "computation", 
      "algorithm", 
      "language", 
      "new technique", 
      "recursion", 
      "extension", 
      "operators", 
      "advantages", 
      "space", 
      "technique", 
      "efficiency", 
      "output", 
      "example", 
      "context", 
      "program", 
      "transformation", 
      "addition", 
      "termination", 
      "Resolving Algorithm", 
      "new unification-based equality operator", 
      "unification-based equality operator"
    ], 
    "name": "An Universal Resolving Algorithm for Inverse Computation of Lazy Languages", 
    "pagination": "27-40", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1047218411"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-70881-0_6"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-70881-0_6", 
      "https://app.dimensions.ai/details/publication/pub.1047218411"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-11-01T19:02", 
    "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_450.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-70881-0_6"
  }
]
 

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-540-70881-0_6'

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-540-70881-0_6'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-70881-0_6'

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-540-70881-0_6'


 

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

112 TRIPLES      23 PREDICATES      54 URIs      47 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-70881-0_6 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Neff29ee993a449829dde8569cc43051d
4 schema:datePublished 2007-01-01
5 schema:datePublishedReg 2007-01-01
6 schema:description The Universal Resolving Algorithm was originally formulated for inverse computation of tail-recursive programs. We present an extension to general recursion that improves the efficiency and termination of inverse computation because partially produced output is used to reduce the search space. In addition, we present a transformation using a new unification-based equality operator. Examples demonstrate the advantages of the new technique. We found that these extensions can also improve inverse computation in the context of functional-logic languages.
7 schema:editor N3e45e18b99a343278a4345be7135c88c
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N6c683d65d56c4bd3a60eea173071c884
12 schema:keywords Resolving Algorithm
13 Universal Resolving Algorithm
14 addition
15 advantages
16 algorithm
17 computation
18 context
19 efficiency
20 equality operator
21 example
22 extension
23 functional-logic languages
24 general recursion
25 inverse computation
26 language
27 lazy languages
28 new technique
29 new unification-based equality operator
30 operators
31 output
32 program
33 recursion
34 search space
35 space
36 tail-recursive programs
37 technique
38 termination
39 transformation
40 unification-based equality operator
41 schema:name An Universal Resolving Algorithm for Inverse Computation of Lazy Languages
42 schema:pagination 27-40
43 schema:productId Nd494ce5377774d95915b929eaf41aaa5
44 Nfa44ac9dc6f54396855c2feeb5f2ceed
45 schema:publisher Ndbc10407d52943a88aee761f4f0d1621
46 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047218411
47 https://doi.org/10.1007/978-3-540-70881-0_6
48 schema:sdDatePublished 2021-11-01T19:02
49 schema:sdLicense https://scigraph.springernature.com/explorer/license/
50 schema:sdPublisher N5d9122e4a8c44b20b05157043c0451c2
51 schema:url https://doi.org/10.1007/978-3-540-70881-0_6
52 sgo:license sg:explorer/license/
53 sgo:sdDataset chapters
54 rdf:type schema:Chapter
55 N3e45e18b99a343278a4345be7135c88c rdf:first Ne6dd027256c94670baa1172db0fa43b1
56 rdf:rest N729716bb14a24237a6c3b802f146597d
57 N59811d387d68400c997d7b827acc4b44 schema:familyName Voronkov
58 schema:givenName Andrei
59 rdf:type schema:Person
60 N5d9122e4a8c44b20b05157043c0451c2 schema:name Springer Nature - SN SciGraph project
61 rdf:type schema:Organization
62 N6c683d65d56c4bd3a60eea173071c884 schema:isbn 978-3-540-70880-3
63 978-3-540-70881-0
64 schema:name Perspectives of Systems Informatics
65 rdf:type schema:Book
66 N729716bb14a24237a6c3b802f146597d rdf:first N59811d387d68400c997d7b827acc4b44
67 rdf:rest rdf:nil
68 Nbbfe4c9fd7194ec2af97ade848252009 schema:affiliation grid-institutes:grid.4886.2
69 schema:familyName Klimov
70 schema:givenName Yuri
71 rdf:type schema:Person
72 Nbfc4738cca694dd287428e94da1d0ec6 rdf:first Nbbfe4c9fd7194ec2af97ade848252009
73 rdf:rest rdf:nil
74 Nd494ce5377774d95915b929eaf41aaa5 schema:name dimensions_id
75 schema:value pub.1047218411
76 rdf:type schema:PropertyValue
77 Ndbc10407d52943a88aee761f4f0d1621 schema:name Springer Nature
78 rdf:type schema:Organisation
79 Ne6dd027256c94670baa1172db0fa43b1 schema:familyName Virbitskaite
80 schema:givenName Irina
81 rdf:type schema:Person
82 Ne74019e9765540da92b5c51cadb83cb7 rdf:first sg:person.010754010217.31
83 rdf:rest Nbfc4738cca694dd287428e94da1d0ec6
84 Neff29ee993a449829dde8569cc43051d rdf:first sg:person.010307436465.27
85 rdf:rest Ne74019e9765540da92b5c51cadb83cb7
86 Nfa44ac9dc6f54396855c2feeb5f2ceed schema:name doi
87 schema:value 10.1007/978-3-540-70881-0_6
88 rdf:type schema:PropertyValue
89 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
90 schema:name Information and Computing Sciences
91 rdf:type schema:DefinedTerm
92 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
93 schema:name Computation Theory and Mathematics
94 rdf:type schema:DefinedTerm
95 sg:person.010307436465.27 schema:affiliation grid-institutes:grid.4886.2
96 schema:familyName Abramov
97 schema:givenName Sergei
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010307436465.27
99 rdf:type schema:Person
100 sg:person.010754010217.31 schema:affiliation grid-institutes:grid.5254.6
101 schema:familyName Glück
102 schema:givenName Robert
103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010754010217.31
104 rdf:type schema:Person
105 grid-institutes:grid.4886.2 schema:alternateName M.V. Keldysh Institute for Applied Mathematics, Russian Academy of Sciences, RU-125047 Moscow, Russia
106 Program Systems Institute, Russian Academy of Sciences, RU-152140 Pereslavl-Zalessky, Russia
107 schema:name M.V. Keldysh Institute for Applied Mathematics, Russian Academy of Sciences, RU-125047 Moscow, Russia
108 Program Systems Institute, Russian Academy of Sciences, RU-152140 Pereslavl-Zalessky, Russia
109 rdf:type schema:Organization
110 grid-institutes:grid.5254.6 schema:alternateName DIKU, Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen, Denmark
111 schema:name DIKU, Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen, Denmark
112 rdf:type schema:Organization
 




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


...