Higher order indexed monadic systems

نویسندگان

  • Didier Caucal
  • Teodor Knapik
چکیده

A word rewriting system is called monadic if each of its right hand sides is either a single letter or the empty word. We study the images of higher order indexed languages (defined by Maslov) under inverse derivations of infinite monadic systems. We show that the inverse derivations of deterministic level n indexed languages by confluent regular monadic systems are deterministic level n+1 languages, and that the inverse derivations of level n indexed monadic systems preserve level n indexed languages. Both results are established using a fine structural study of classes of infinite automata accepting level n indexed languages. Our work generalizes formerly known results about regular and context-free languages which form the first two levels of the indexed language hierarchy. 1998 ACM Subject Classification F.4

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The semantic marriage of monads and effects

Wadler and Thiemann unified type-and-effect systems with monadic semantics via a syntactic correspondence and soundness results with respect to an operational semantics. They conjecture that a general, “coherent” denotational semantics can be given to unify effect systems with a monadic-style semantics. We provide such a semantics based on the novel structure of an indexed monad, which we intro...

متن کامل

ar X iv : 1 40 1 . 53 91 v 1 [ cs . P L ] 2 1 Ja n 20 14 The semantic marriage of monads and effects Extended abstract Dominic Orchard

Wadler and Thiemann unified type-and-effect systems with monadic semantics via a syntactic correspondence and soundness results with respect to an operational semantics. They conjecture that a general, “coherent” denotational semantics can be given to unify effect systems with a monadic-style semantics. We provide such a semantics based on the novel structure of an indexed monad, which we intro...

متن کامل

Monadic Type Systems: Pure Type Systems for Impure Settings

Pure type systems and computational monads are two parameterized frameworks that have proved to be quite useful in both theoretical and practical applications. We join the foundational concepts of both of these to obtain monadic type systems. Essentially, monadic type systems inherit the parameterized higher-order type structure of pure type systems and the monadic term and type structure used ...

متن کامل

Towards a Model-Theoretic Characterization of Indexed Grammars

The strong generative capacity of a certain type of indexed grammar is investigated within a model-theoretic framework. Such grammars are found to be equivalent in capacity to a certain fragment of a language obtained by the addition of unary function variables to a monadic second-order language previously used to characterize the context-free grammars.

متن کامل

The evaluation of first-order substitution is monadic second-order compatible

We denote rst-order substitutions of nite and in nite terms by function symbols indexed by the sequences of rst-order variables to which substitutions are made. We consider the evaluation mapping from in nite terms to in nite terms that evaluates these substitution operations. This mapping may perform in nitely many nested substitutions, so that a term which has the structure of an in nite stri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011