Towards a substrate framework of computation

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    A grand challenge in computing is to establish a substrate computational model that encompasses diverse forms of non-sequential computation. This paper demonstrates how a hypergraph rewriting framework nicely integrates various forms and ingredients of concurrent computation and how simple static analyses help the understanding and optimization of programs. Hypergraph rewriting treats processes and messages in a unified manner, and treats message sending and parameter passing as symmetric reaction between two entities. Specifically, we show how fine-grained strong reduction of the λ-calculus can be concisely encoded into hypergraph rewriting with a small set of primitive operations.

    Original languageEnglish
    Pages (from-to)341-366
    Number of pages26
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume8665
    Publication statusPublished - 2014

    Fingerprint

    Rewriting
    Hypergraph
    Substrate
    Substrates
    Computational Model
    Concurrent
    Calculus
    Integrate
    Optimization
    Computing
    Demonstrate
    Framework
    Form

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    @article{47acce062abb46429546ee143d2f6f8b,
    title = "Towards a substrate framework of computation",
    abstract = "A grand challenge in computing is to establish a substrate computational model that encompasses diverse forms of non-sequential computation. This paper demonstrates how a hypergraph rewriting framework nicely integrates various forms and ingredients of concurrent computation and how simple static analyses help the understanding and optimization of programs. Hypergraph rewriting treats processes and messages in a unified manner, and treats message sending and parameter passing as symmetric reaction between two entities. Specifically, we show how fine-grained strong reduction of the λ-calculus can be concisely encoded into hypergraph rewriting with a small set of primitive operations.",
    author = "Kazunori Ueda",
    year = "2014",
    language = "English",
    volume = "8665",
    pages = "341--366",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

    TY - JOUR

    T1 - Towards a substrate framework of computation

    AU - Ueda, Kazunori

    PY - 2014

    Y1 - 2014

    N2 - A grand challenge in computing is to establish a substrate computational model that encompasses diverse forms of non-sequential computation. This paper demonstrates how a hypergraph rewriting framework nicely integrates various forms and ingredients of concurrent computation and how simple static analyses help the understanding and optimization of programs. Hypergraph rewriting treats processes and messages in a unified manner, and treats message sending and parameter passing as symmetric reaction between two entities. Specifically, we show how fine-grained strong reduction of the λ-calculus can be concisely encoded into hypergraph rewriting with a small set of primitive operations.

    AB - A grand challenge in computing is to establish a substrate computational model that encompasses diverse forms of non-sequential computation. This paper demonstrates how a hypergraph rewriting framework nicely integrates various forms and ingredients of concurrent computation and how simple static analyses help the understanding and optimization of programs. Hypergraph rewriting treats processes and messages in a unified manner, and treats message sending and parameter passing as symmetric reaction between two entities. Specifically, we show how fine-grained strong reduction of the λ-calculus can be concisely encoded into hypergraph rewriting with a small set of primitive operations.

    UR - http://www.scopus.com/inward/record.url?scp=84921655429&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84921655429&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:84921655429

    VL - 8665

    SP - 341

    EP - 366

    JO - Lecture Notes in Computer Science

    JF - Lecture Notes in Computer Science

    SN - 0302-9743

    ER -