Monadic Recursion Schemes with Two Exits

この論文をさがす

抄録

This paper presents the "K-language" for generalized monadic recursion schemes and also presents a formal axiom system which derives strong equivalences among monadic recursion schemes. The distinct features of the K-system are (1)that each scheme has two exits but its control structure is still well-structured. Therefore this can be a candidate of a new extended framework of control structure in computer languages; and (2)that the equivalence-proving ability of the K-system seems to be the most powerful among all systems proposed before. The axiom system apparently is a kind of a mixture of Boolean algebra and Salomaa's formal system for the regular expression.

This paper presents the "K-language" for generalized monadic recursion schemes, and also presents a formal axiom system which derives strong equivalences among monadic recursion schemes. The distinct features of the K-system are (1)that each scheme has two exits, but its control structure is still well-structured. Therefore, this can be a candidate of a new extended framework of control structure in computer languages; and (2)that the equivalence-proving ability of the K-system seems to be the most powerful among all systems proposed before. The axiom system apparently is a kind of a mixture of Boolean algebra and Salomaa's formal system for the regular expression.

収録刊行物

詳細情報

  • CRID
    1050845762823475840
  • NII論文ID
    110002673416
  • NII書誌ID
    AA00700121
  • ISSN
    18826652
  • Web Site
    http://id.nii.ac.jp/1001/00059852/
  • 本文言語コード
    en
  • 資料種別
    article
  • データソース種別
    • IRDB
    • CiNii Articles

問題の指摘

ページトップへ