Monadic Recursion Schemes with Two Exits

    • KANAYAMA YUTAKA
    • University of Tsukuba, Institute of Information Science: Present address:Center for Robotic Systems, Department of Computer Science, University of California

Abstract

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.

Journal

Journal of information processing   [List of Volumes]

Journal of information processing 9(2), 70-78, 1986-09-30  [Table of Contents]

Information Processing Society of Japan (IPSJ)

Preview

Preview

Codes

  • NII Article ID (NAID) :
    110002673416
  • NII NACSIS-CAT ID (NCID) :
    AA00700121
  • Text Lang :
    ENG
  • ISSN :
    03876101
  • Databases :
    NII-ELS 

Share