項書き換えシステムの単純停止性のモジュラ性〔英文〕 (〔情報処理学会〕創立30周年記念論文特集) -- (佳作〔論文〕)

スポンサーリンク

概要

• 論文の詳細を見る

• A term rewriting system, which is a computer program written as a set of rewrite rules,is said to be simply-terminating if,intuitively,its termination is proved with the simplification ordering method of Dershowitz.The direct sum R_0〓R_1 of term rewriting systems R_0 and R_1 is their disjoint union.In this paper,we prove that R_0〓R_1 is simply-terminating if and only if each of R_0 and R_1 is so.The result is novel and practically useful for the semi-mechanical termination proof of'modular'computer programs written as the set of term rewriting systems.

• 一般社団法人情報処理学会の論文
• 1990-05-15

著者

• Ohuchi Azuma

  Department Of Information Engineering (faculty Of Engineering Hokkaido University).

• KURIHARA Mashito

  Department of Information Engineering,(Faculty of Engineering,Hokkaido University).

• 栗原 正仁

  Department of Information Engineering,(Faculty of Engineering,Hokkaido University).

• 大内 東

  Department of Information Engineering,(Faculty of Engineering,Hokkaido University).

関連論文

• 項書き換えシステムの単純停止性のモジュラ性〔英文〕 (〔情報処理学会〕創立30周年記念論文特集) -- (佳作〔論文〕)

スポンサーリンク