An Alternative Scheme for Evaluating Combinator Expressions

• Item type: JInfP(1)
• 公開日: 1985-02-05
• タイトル: An Alternative Scheme for Evaluating Combinator Expressions
• タイトル / 言語: en
• タイトル: An Alternative Scheme for Evaluating Combinator Expressions
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: （IPSJ Best Paper Award、論文賞受賞）
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of Computer Science The University of Electro-Communications.
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, The University of Electro-Communications.
• 著者名: Masato, Takeichi
• 著者名(英): Masato, Takeichi
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Turner shows how combinators can be used for implementing applicative languages. In his method a combinator expression is represented by a graph with the nodes comprising functions and their arguments. Application of a function to an argument causes graph reduction which corresponds to the beta-reduction of lambda calculus. Graph reduction is performed in a way such that the node representing a functional application is over-written by its result. Another scheme for combinator expression evaluation is proposed by Jones and Muchnick. Although their evaluator is a fixed-program and would have some advantages over Turner's graph reduction scheme it seems unusual in dealing with higher order functions. In this paper we describe an alternative scheme for evaluating combinator expressions. The evaluator is almost a fixed-program and is easily extended to include new combinators. It deals with higher order functions consistently as Turner's evaluator does. That is the proposed scheme shares both advantages of Turner's graph reduction and of a fixed-program. And it is most attractive in implementing the evaluator on conventional hardware. An experimental evaluator is also presented.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Turner shows how combinators can be used for implementing applicative languages. In his method, a combinator expression is represented by a graph with the nodes comprising functions and their arguments. Application of a function to an argument causes graph reduction which corresponds to the beta-reduction of lambda calculus. Graph reduction is performed in a way such that the node representing a functional application is over-written by its result. Another scheme for combinator expression evaluation is proposed by Jones and Muchnick. Although their evaluator is a fixed-program and would have some advantages over Turner's graph reduction scheme, it seems unusual in dealing with higher order functions. In this paper we describe an alternative scheme for evaluating combinator expressions. The evaluator is almost a fixed-program and is easily extended to include new combinators. It deals with higher order functions consistently as Turner's evaluator does. That is, the proposed scheme shares both advantages of Turner's graph reduction and of a fixed-program. And it is most attractive in implementing the evaluator on conventional hardware. An experimental evaluator is also presented.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA00700121
• 書誌情報: Journal of Information Processing; 巻 7, 号 4, p. 246-253, 発行日 1985-02-05
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-6652
• 出版者 / 言語: ja
• 出版者: 情報処理学会