On Jones-Optimal Specializers: A Case Study Using Unmix View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2006

AUTHORS

Johan Gade , Robert Glück

ABSTRACT

Jones optimality is a criterion for assessing the strength of a program specializer. Here, the elements required in a proof of Jones optimality are investigated and the first formal proof for a non-trivial polyvariant specializer (Unmix) is presented. A simplifying element is the use of self-application. Variations of the original criterion are discussed. More... »

PAGES

406-422

References to SciGraph publications

  • 2001-06-01. On Jones-Optimal Specialization for Strongly Typed Languages in SEMANTICS, APPLICATIONS, AND IMPLEMENTATION OF PROGRAM GENERATION
  • 2004. The Translation Power of the Futamura Projections in PERSPECTIVES OF SYSTEM INFORMATICS
  • 1990. Arity raiser and its use in program specialization in ESOP '90
  • 2003-02-28. Tagging, Encoding, and Jones Optimality in PROGRAMMING LANGUAGES AND SYSTEMS
  • 1999. Inherited Limits in PARTIAL EVALUATION
  • 1996. Type specialisation for the λ-calculus; or, a new paradigm for partial evaluation based on type inference in PARTIAL EVALUATION
  • 1989-02. Mix: A self-applicable partial evaluator for experiments in compiler generation in LISP AND SYMBOLIC COMPUTATION
  • 1988-09. Challenging problems in partial evaluation and mixed computation in NEW GENERATION COMPUTING
  • 2001. Tag Elimination and Jones-Optimality in PROGRAMS AS DATA OBJECTS
  • 1986. The structure of a self-applicable partial evaluator in PROGRAMS AS DATA OBJECTS
  • Book

    TITLE

    Programming Languages and Systems

    ISBN

    978-3-540-48937-5
    978-3-540-48938-2

    Author Affiliations

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/11924661_25

    DOI

    http://dx.doi.org/10.1007/11924661_25

    DIMENSIONS

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


    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/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "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"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "University of Copenhagen", 
              "id": "https://www.grid.ac/institutes/grid.5254.6", 
              "name": [
                "Dept. of Mathematical Informatics, University of Tokyo, 113-8656, Tokyo, Japan", 
                "DIKU, Dept. of Computer Science, University of Copenhagen, DK-2100, Copenhagen, Denmark"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Gade", 
            "givenName": "Johan", 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Copenhagen", 
              "id": "https://www.grid.ac/institutes/grid.5254.6", 
              "name": [
                "DIKU, Dept. 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"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/3-540-16446-4_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000053549", 
              "https://doi.org/10.1007/3-540-16446-4_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-61580-6_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000439084", 
              "https://doi.org/10.1007/3-540-61580-6_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01806312", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007653765", 
              "https://doi.org/10.1007/bf01806312"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01806312", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007653765", 
              "https://doi.org/10.1007/bf01806312"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-52592-0_73", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011836818", 
              "https://doi.org/10.1007/3-540-52592-0_73"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-45350-4_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012278693", 
              "https://doi.org/10.1007/3-540-45350-4_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-45350-4_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012278693", 
              "https://doi.org/10.1007/3-540-45350-4_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-44978-7_15", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031192844", 
              "https://doi.org/10.1007/3-540-44978-7_15"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-36575-3_23", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033644800", 
              "https://doi.org/10.1007/3-540-36575-3_23"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-36575-3_23", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033644800", 
              "https://doi.org/10.1007/3-540-36575-3_23"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf03037143", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1034432539", 
              "https://doi.org/10.1007/bf03037143"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-47018-2_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038408397", 
              "https://doi.org/10.1007/3-540-47018-2_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-39866-0_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048960688", 
              "https://doi.org/10.1007/978-3-540-39866-0_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-39866-0_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048960688", 
              "https://doi.org/10.1007/978-3-540-39866-0_16"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2006", 
        "datePublishedReg": "2006-01-01", 
        "description": "Jones optimality is a criterion for assessing the strength of a program specializer. Here, the elements required in a proof of Jones optimality are investigated and the first formal proof for a non-trivial polyvariant specializer (Unmix) is presented. A simplifying element is the use of self-application. Variations of the original criterion are discussed.", 
        "editor": [
          {
            "familyName": "Kobayashi", 
            "givenName": "Naoki", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/11924661_25", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": {
          "isbn": [
            "978-3-540-48937-5", 
            "978-3-540-48938-2"
          ], 
          "name": "Programming Languages and Systems", 
          "type": "Book"
        }, 
        "name": "On Jones-Optimal Specializers: A Case Study Using Unmix", 
        "pagination": "406-422", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1003898112"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/11924661_25"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "1292447b9c5ab25b23386cbaca3b81580d076e3e6c269391e81046388b8c34a6"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/11924661_25", 
          "https://app.dimensions.ai/details/publication/pub.1003898112"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T07:32", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000356_0000000356/records_57902_00000000.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F11924661_25"
      }
    ]
     

    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/11924661_25'

    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/11924661_25'

    Turtle is a human-readable linked data format.

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

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

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


     

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

    112 TRIPLES      23 PREDICATES      37 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/11924661_25 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author Nbf98e90095b84811894c9e9d5b33886b
    4 schema:citation sg:pub.10.1007/3-540-16446-4_14
    5 sg:pub.10.1007/3-540-36575-3_23
    6 sg:pub.10.1007/3-540-44978-7_15
    7 sg:pub.10.1007/3-540-45350-4_11
    8 sg:pub.10.1007/3-540-47018-2_6
    9 sg:pub.10.1007/3-540-52592-0_73
    10 sg:pub.10.1007/3-540-61580-6_10
    11 sg:pub.10.1007/978-3-540-39866-0_16
    12 sg:pub.10.1007/bf01806312
    13 sg:pub.10.1007/bf03037143
    14 schema:datePublished 2006
    15 schema:datePublishedReg 2006-01-01
    16 schema:description Jones optimality is a criterion for assessing the strength of a program specializer. Here, the elements required in a proof of Jones optimality are investigated and the first formal proof for a non-trivial polyvariant specializer (Unmix) is presented. A simplifying element is the use of self-application. Variations of the original criterion are discussed.
    17 schema:editor N5503a79705f340489ccdfe3388d8532f
    18 schema:genre chapter
    19 schema:inLanguage en
    20 schema:isAccessibleForFree false
    21 schema:isPartOf N56594bfaa9c54e5a9d35db3394c0bdd9
    22 schema:name On Jones-Optimal Specializers: A Case Study Using Unmix
    23 schema:pagination 406-422
    24 schema:productId N31e0afcd36954d008e4c1dec0726f645
    25 N5fd15f7f71924e77a0fd6e04da426c25
    26 Nd77029a43b324cc08c5b70809512cc7b
    27 schema:publisher Nc05119d5983f4eee8b0989d775a710dc
    28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003898112
    29 https://doi.org/10.1007/11924661_25
    30 schema:sdDatePublished 2019-04-16T07:32
    31 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    32 schema:sdPublisher N99b09c60779e4743adc9f864e8691f82
    33 schema:url https://link.springer.com/10.1007%2F11924661_25
    34 sgo:license sg:explorer/license/
    35 sgo:sdDataset chapters
    36 rdf:type schema:Chapter
    37 N31e0afcd36954d008e4c1dec0726f645 schema:name doi
    38 schema:value 10.1007/11924661_25
    39 rdf:type schema:PropertyValue
    40 N5503a79705f340489ccdfe3388d8532f rdf:first Na998ced6ba6a4228ba91cbc930877c3e
    41 rdf:rest rdf:nil
    42 N56594bfaa9c54e5a9d35db3394c0bdd9 schema:isbn 978-3-540-48937-5
    43 978-3-540-48938-2
    44 schema:name Programming Languages and Systems
    45 rdf:type schema:Book
    46 N5fd15f7f71924e77a0fd6e04da426c25 schema:name readcube_id
    47 schema:value 1292447b9c5ab25b23386cbaca3b81580d076e3e6c269391e81046388b8c34a6
    48 rdf:type schema:PropertyValue
    49 N99b09c60779e4743adc9f864e8691f82 schema:name Springer Nature - SN SciGraph project
    50 rdf:type schema:Organization
    51 Na998ced6ba6a4228ba91cbc930877c3e schema:familyName Kobayashi
    52 schema:givenName Naoki
    53 rdf:type schema:Person
    54 Nbf98e90095b84811894c9e9d5b33886b rdf:first Nd4f64981d67d4e9b96a0017caa65e19b
    55 rdf:rest Nd626b1b23a704d90b595bc7d108332ff
    56 Nc05119d5983f4eee8b0989d775a710dc schema:location Berlin, Heidelberg
    57 schema:name Springer Berlin Heidelberg
    58 rdf:type schema:Organisation
    59 Nd4f64981d67d4e9b96a0017caa65e19b schema:affiliation https://www.grid.ac/institutes/grid.5254.6
    60 schema:familyName Gade
    61 schema:givenName Johan
    62 rdf:type schema:Person
    63 Nd626b1b23a704d90b595bc7d108332ff rdf:first sg:person.010754010217.31
    64 rdf:rest rdf:nil
    65 Nd77029a43b324cc08c5b70809512cc7b schema:name dimensions_id
    66 schema:value pub.1003898112
    67 rdf:type schema:PropertyValue
    68 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    69 schema:name Information and Computing Sciences
    70 rdf:type schema:DefinedTerm
    71 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    72 schema:name Computation Theory and Mathematics
    73 rdf:type schema:DefinedTerm
    74 sg:person.010754010217.31 schema:affiliation https://www.grid.ac/institutes/grid.5254.6
    75 schema:familyName Glück
    76 schema:givenName Robert
    77 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010754010217.31
    78 rdf:type schema:Person
    79 sg:pub.10.1007/3-540-16446-4_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000053549
    80 https://doi.org/10.1007/3-540-16446-4_14
    81 rdf:type schema:CreativeWork
    82 sg:pub.10.1007/3-540-36575-3_23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033644800
    83 https://doi.org/10.1007/3-540-36575-3_23
    84 rdf:type schema:CreativeWork
    85 sg:pub.10.1007/3-540-44978-7_15 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031192844
    86 https://doi.org/10.1007/3-540-44978-7_15
    87 rdf:type schema:CreativeWork
    88 sg:pub.10.1007/3-540-45350-4_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012278693
    89 https://doi.org/10.1007/3-540-45350-4_11
    90 rdf:type schema:CreativeWork
    91 sg:pub.10.1007/3-540-47018-2_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038408397
    92 https://doi.org/10.1007/3-540-47018-2_6
    93 rdf:type schema:CreativeWork
    94 sg:pub.10.1007/3-540-52592-0_73 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011836818
    95 https://doi.org/10.1007/3-540-52592-0_73
    96 rdf:type schema:CreativeWork
    97 sg:pub.10.1007/3-540-61580-6_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000439084
    98 https://doi.org/10.1007/3-540-61580-6_10
    99 rdf:type schema:CreativeWork
    100 sg:pub.10.1007/978-3-540-39866-0_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048960688
    101 https://doi.org/10.1007/978-3-540-39866-0_16
    102 rdf:type schema:CreativeWork
    103 sg:pub.10.1007/bf01806312 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007653765
    104 https://doi.org/10.1007/bf01806312
    105 rdf:type schema:CreativeWork
    106 sg:pub.10.1007/bf03037143 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034432539
    107 https://doi.org/10.1007/bf03037143
    108 rdf:type schema:CreativeWork
    109 https://www.grid.ac/institutes/grid.5254.6 schema:alternateName University of Copenhagen
    110 schema:name DIKU, Dept. of Computer Science, University of Copenhagen, DK-2100, Copenhagen, Denmark
    111 Dept. of Mathematical Informatics, University of Tokyo, 113-8656, Tokyo, Japan
    112 rdf:type schema:Organization
     




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


    ...