1996
AUTHORSAndrei P. Nemytykh , Victoria A. Pinchuk , Valentin F. Turchin
ABSTRACTA supercompiler is a program which can perform a deep transformation of programs using a principle which is similar to partial evaluation, and can be referred to as metacomputation. Supercompilers that have been in existence up to now (see [12], [13]) were not self-applicable: this is a more difficult problem than self-application of a partial evaluator, because of the more intricate logic of supercompilation. In the present paper we describe the first self-applicable model of a supercompiler and present some tests. Three features distinguish it from the previous models and make self-application possible: (1) The input language is a subset of Refal which we refer to as flat Refal. (2) The process of driving is performed as a transformation of pattern-matching graphs. (3) Metasystem jumps are implemented, which allows the supercompiler to avoid interpretation whenever direct computation is possible. More... »
PAGES322-337
Partial Evaluation
ISBN
978-3-540-61580-4
978-3-540-70589-5
http://scigraph.springernature.com/pub.10.1007/3-540-61580-6_16
DOIhttp://dx.doi.org/10.1007/3-540-61580-6_16
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1019454974
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/22",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Philosophy and Religious Studies",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/2203",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Philosophy",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Programming Systems Institute, Pereslavl-Zalesski, Russia",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Programming Systems Institute, Pereslavl-Zalesski, Russia"
],
"type": "Organization"
},
"familyName": "Nemytykh",
"givenName": "Andrei P.",
"id": "sg:person.014244604173.11",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014244604173.11"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Programming Systems Institute, Pereslavl-Zalesski, Russia",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Programming Systems Institute, Pereslavl-Zalesski, Russia"
],
"type": "Organization"
},
"familyName": "Pinchuk",
"givenName": "Victoria A.",
"id": "sg:person.016453755153.38",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016453755153.38"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "The City College of New York, USA",
"id": "http://www.grid.ac/institutes/grid.254250.4",
"name": [
"The City College of New York, USA"
],
"type": "Organization"
},
"familyName": "Turchin",
"givenName": "Valentin F.",
"id": "sg:person.016540237767.41",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016540237767.41"
],
"type": "Person"
}
],
"datePublished": "1996",
"datePublishedReg": "1996-01-01",
"description": "A supercompiler is a program which can perform a deep transformation of programs using a principle which is similar to partial evaluation, and can be referred to as metacomputation. Supercompilers that have been in existence up to now (see [12], [13]) were not self-applicable: this is a more difficult problem than self-application of a partial evaluator, because of the more intricate logic of supercompilation. In the present paper we describe the first self-applicable model of a supercompiler and present some tests. Three features distinguish it from the previous models and make self-application possible: (1) The input language is a subset of Refal which we refer to as flat Refal. (2) The process of driving is performed as a transformation of pattern-matching graphs. (3) Metasystem jumps are implemented, which allows the supercompiler to avoid interpretation whenever direct computation is possible.",
"editor": [
{
"familyName": "Danvy",
"givenName": "Olivier",
"type": "Person"
},
{
"familyName": "Gl\u00fcck",
"givenName": "Robert",
"type": "Person"
},
{
"familyName": "Thiemann",
"givenName": "Peter",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/3-540-61580-6_16",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-540-61580-4",
"978-3-540-70589-5"
],
"name": "Partial Evaluation",
"type": "Book"
},
"keywords": [
"program",
"subset",
"evaluation",
"test",
"evaluators",
"model",
"features",
"difficult problem",
"direct computation",
"REFAL",
"interpretation",
"previous models",
"driving",
"present paper",
"process of driving",
"process",
"transformation",
"problem",
"existence",
"computation",
"input language",
"graph",
"principles",
"jump",
"partial evaluation",
"partial evaluator",
"supercompiler",
"intricate logic",
"language",
"metacomputation",
"logic",
"deep transformation",
"paper",
"supercompilation"
],
"name": "A Self-Applicable supercompiler",
"pagination": "322-337",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1019454974"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/3-540-61580-6_16"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/3-540-61580-6_16",
"https://app.dimensions.ai/details/publication/pub.1019454974"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:36",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_102.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/3-540-61580-6_16"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
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/3-540-61580-6_16'
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/3-540-61580-6_16'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-61580-6_16'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-61580-6_16'
This table displays all metadata directly associated to this object as RDF triples.
121 TRIPLES
23 PREDICATES
60 URIs
53 LITERALS
7 BLANK NODES