Compilation from Lambda Calculus with Algebraic Simplification to Record Calculus

• Item type: Trans(1)
• 公開日: 2017-06-16
• タイトル: Compilation from Lambda Calculus with Algebraic Simplification to Record Calculus
• タイトル / 言語: en
• タイトル: Compilation from Lambda Calculus with Algebraic Simplification to Record Calculus
• 言語: jpn
• キーワード / 主題Scheme: Other
• キーワード / 主題: [発表概要]
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Graduate School of Arts and Sciences, The University of Tokyo
• 著者所属(英): en
• 著者所属(英): Graduate School of Arts and Sciences, The University of Tokyo
• 著者名: Akimasa, Morihata
• 著者名(英): Akimasa, Morihata
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Lambda-p (Morihata, PPL 2016) is an extension of simply-typed lambda calculus. Its characteristic feature is aggressive simplification based on algebraic properties, which is useful to express parallel algorithms. In the previous presentation, the calculus is developed from scratch. This is not satisfactory. Theoretically, relationships with other calculi were unclear; in fact, because of this issue, it was difficult to develop a type system that guarantees efficiency of simplifications. From a practical point of view, it was unclear whether it could be implemented on existing systems. To resolve this problem, in this presentation, a compilation from lambda-p to a record calculus is shown. The compilation consists of two phases. First, lambda-p is translated into a polymorphic-typed record calculus to eliminate the parallel primitive. Then, the polymorphic-typed record calculus is further translated into typeless record calculus to address simplification. The compilation is fairly intuitive, and these two phases provide appropriate operational semantics and type system to lambda-p.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Lambda-p (Morihata, PPL 2016) is an extension of simply-typed lambda calculus. Its characteristic feature is aggressive simplification based on algebraic properties, which is useful to express parallel algorithms. In the previous presentation, the calculus is developed from scratch. This is not satisfactory. Theoretically, relationships with other calculi were unclear; in fact, because of this issue, it was difficult to develop a type system that guarantees efficiency of simplifications. From a practical point of view, it was unclear whether it could be implemented on existing systems. To resolve this problem, in this presentation, a compilation from lambda-p to a record calculus is shown. The compilation consists of two phases. First, lambda-p is translated into a polymorphic-typed record calculus to eliminate the parallel primitive. Then, the polymorphic-typed record calculus is further translated into typeless record calculus to address simplification. The compilation is fairly intuitive, and these two phases provide appropriate operational semantics and type system to lambda-p.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11464814
• 書誌情報: 情報処理学会論文誌プログラミング（PRO）; 巻 10, 号 3, p. 21-21, 発行日 2017-06-16
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7802
• 出版者 / 言語: ja
• 出版者: 情報処理学会