• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2005 Fiscal Year Final Research Report Summary

Study on Rewriting Theory for Analysis, Verification and Efficient Execution of Functional Programs

Research Project

Project/Area Number 15500007
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionNagoya University

Principal Investigator

SAKAI Masahiko  Nagoya University, Grad.School of Information Science, Prof., 大学院・情報科学研究科, 教授 (50215597)

Co-Investigator(Kenkyū-buntansha) SAKABE Toshiki  Nagoya Univ., Grad.School of Information Science, Prof., 大学院・情報科学研究科, 教授 (60111829)
KUSAKARI Keiichirou  Nagoya Univ., Grad.School of Information Science, Lecturer, 大学院・情報科学研究科, 講師 (90323112)
NISHIDA Naoki  Nagoya Univ., Grad.School of Information Science, Aesearch Associate, 大学院・情報科学研究科, 助手 (00397449)
KASUYA Hideto  Auchi Prefectural Univ., School of Information Science, Research Associate, 情報科学部, 助手 (10295579)
Project Period (FY) 2003 – 2005
Keywordsterm rewriting system / functional language / normalizing strategy / termination proof / implicit induction / outer-most strategy
Research Abstract

This research is toward removing gaps that prevent from applying results of term rewriting systems (TRS for short) to fuctional languages. The following results were obtained ;
(1) The previously proposed dependency pair method for proving termination of higher-order rewrite systems cannot be applied for ones containing nested variable in a right-hand side and containing copy rules. We succeeded to remove the strong restriction from it for proving termination of simple-typed rewriting systems.
(2) We showed that the needed redexes with respect to strong sequential or NV approximation are decidable by using tree-automata technique and the de Bruijn notations.
(3) It appeared that theorems provable by implicit induction in higher-order rewrite systems are the subclass of the inductive theorems. The case happens that some inductive theorems are judged to be not inductive. We gave a condition to prevent this situation.
(4) We gave a condition that guarantees the outer-most reduction strategy to be complete for overlapping TRSs, and showed a transformation of TRSs that produce TRSs that satisfy the condition.
(5) We developed a transformation of TRSs whose outputs define the inverse computation of the input constructor TRSs. In the computation, innermost narrowing is effective for obtaining all results in case of linear TRSs with extra variables.

  • Research Products

    (12 results)

All 2005 2004 2003

All Journal Article (12 results)

  • [Journal Article] 構成子項書換え系の逆計算プログラムの生成2005

    • Author(s)
      西田直樹, 酒井正彦, 坂部俊樹
    • Journal Title

      電子情報通信学会論文誌 J88-D-I・8

      Pages: 1171-1183

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] 関数プログラムの再帰構造解析と強計算性に基づく十分完全性の証明法2005

    • Author(s)
      櫻井, 草刈, 西田, 酒井, 坂部
    • Journal Title

      情報科学技術レターズ LA-001

      Pages: 1-4

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Primitive Indeuctive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting2005

    • Author(s)
      K.Kusakari, M.Sakai, T.Sakabe
    • Journal Title

      IEICE Trans. on Information and Systems E88-D・12

      Pages: 2715-2726

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems2005

    • Author(s)
      M.Sakai, K.Kusakari
    • Journal Title

      IEICE Trans. on Information and Systems E88-D・3

      Pages: 583-593

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Computation Programs for Constructor Term Rewriting Systems2005

    • Author(s)
      Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
    • Journal Title

      IEICE Trans. on Information and Systems(in Japanese) Vol.J88-D-I, No.8

      Pages: 1171-1183

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Proving Sufficient Completeness of Functional Programs based on Recursive Structure Analysis and Strong Computability2005

    • Author(s)
      Keita Sakurai, Keiichirou Kusakari, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
    • Journal Title

      Information Technology Letters(in Japanese) Vol.LA-001

      Pages: 1-4

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Primitive Indeuctive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting2005

    • Author(s)
      K.Kusakari, M.Sakai, T.Sakabe
    • Journal Title

      IEICE Trans. on Information and Systems Vol.E88-D, No.12

      Pages: 2715-2726

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems2005

    • Author(s)
      M.Sakai, K.Kusakari
    • Journal Title

      IEICE Trans. on Information and Systems Vol.E88-D, No.3

      Pages: 583-593

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Higher-Order Path Orders based on Computability2004

    • Author(s)
      K.Kusakari
    • Journal Title

      IEICE Trans. on Information and Systems E87-D・2

      Pages: 352-359

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Higher-Order Path Orders based on Computability2004

    • Author(s)
      K.Kusakari
    • Journal Title

      IEICE Transactions on Information and Systems Vol.E87-D, No.2

      Pages: 352-359

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] 右辺のみに現れる変数を持つ項書換え系の計算モデル2003

    • Author(s)
      西田直樹, 酒井正彦, 坂部俊樹
    • Journal Title

      コンピュータソフトウェア 20・5

      Pages: 85-89

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] A Computation Model of Term Rewriting Systems with Extra Variables2003

    • Author(s)
      Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
    • Journal Title

      Computer Software (in Japanese) Vol.20, No.5

      Pages: 85-89

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2007-12-13  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi