Advertisement

Higher type program schemes and their tree languages

Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)

Abstract

We introduce classes of program schemes, which generalize the notion of a recursive program scheme in the sense of Nivat [8], by allowing recursion on higher functional types. The equivalence class of such a scheme can be characterized by an infinite tree and by a tree language. We extend the concept of schematic tree grammars (Nivat [7,8]) and prove, that this allows to generate new tree languages. With this result we prove, that the class of schemes introduced is not translatable into the class of recursive program schemes.

Keywords

High Type Program Scheme Tree Language Regular Scheme Directed Subset 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. references

  1. [1]
    ADJ: GOGUEN, J.A./THATCHER, J.W./WAGNER, E.G./WRIGHT, J.B. Initial algebra semantics IBM-Report RC 5701, 1975Google Scholar
  2. [2]
    COURCELLE, B. Ensembles Algébriques d'Arbres et Langages Déterministes; quelques applications aux Schémas de Programme IRIA report 1975Google Scholar
  3. [3]
    DAMM, W. Higher type schemes and their tree languages to appearGoogle Scholar
  4. [4]
    ENGELFRIET, J./SCHMIDT, E.M. IO and OI Datalogisk Afdelning report, DAIMI PB-47, Aarhus University, Denmark, 1975Google Scholar
  5. [5]
    INDERMARK, K. Schemes with recursion on higher types in: Mathematical foundations of Computer Science, Proc. 5th conference in Gdansk, Polen, Lecture Notes in Computer Science, 45, 1976Google Scholar
  6. [6]
    MEZEI, J./WRIGHT, J.B. Algebraic automata and context-free sets Inf. and Control, 11, 1967Google Scholar
  7. [7]
    NIVAT, M. Langages algébriques sur le magma libre et sémantique des schémas de programme in: Automata, Languages and Programming, ed. M. Nivat, North-Holland Publishing Company, Amsterdam, 1972Google Scholar
  8. [8]
    NIVAT, M. On the interpretation of recursive program schemes Symposia Matematica, Atti del convegno d'Informatica teorica, Roma, 1973Google Scholar
  9. [9]
    WAND, M. A concrete approach to abstract recursive definitions in: Automata, Languages and Programming, ed. M. Nivat, North-Holland Publishing Company, Amsterdam, 1972Google Scholar
  10. [10]
    WAND, M. An algebraic formulation of the Chomsky hierarchy in: Category theory applied to computation and control, Lecture Notes in Computer Science, 25, 1975Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • W. Damm

There are no affiliations available

Personalised recommendations