Advertisement

Languages defined by higher type program schemes

  • Werner Damm
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)

Keywords

High Type Program Scheme Constant Symbol Tree Language Substitution Symbol 
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.

4. 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 program schemes and their tree languages, Proc. 3rd GI conference on Theoretical Computer Science, Lecture Notes in Computer Science, 48, Springer Verlag, 1977Google Scholar
  4. [4]
    Damm, W. Higher type program schemes, to appear as a technical report of the RWTH AachenGoogle Scholar
  5. [5]
    Engelfriet, J./Schmidt, E.M. IO and OI, Datalogisk Afdelning report, DAIMI PB-47, Aarhus University, Denmark, 1975Google Scholar
  6. [6]
    Fisher, M.J. Grammars with macro-like productions, Proc. 9th IEEE conference on Switching and Automata Theory, 1968Google Scholar
  7. [7]
    Indermark, K. Schemes with recursion on higher types, Proc. 5th conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, 45, Springer Verlag, 1976Google Scholar
  8. [8]
    Maibaum, T.S.E. A generalized approach to formal languages, JCSS 8 (1974), 409–439Google Scholar
  9. [9]
    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, 1973Google Scholar
  10. [10]
    Nivat, M. On the interpretation of recursive program schemes, Symposia Matematica, Vol. 15, Academic Press, 1975Google Scholar
  11. [11]
    Wand, M. A concrete approach to abstract recursive definitions, in: Automata, Languages and Programming, ed. M. Nivat, North-Holland Publishing Company, Amsterdam, 1973Google Scholar
  12. [12]
    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

  • Werner Damm
    • 1
  1. 1.Lehrstuhl für Informatik II RWTH AachenGermany

Personalised recommendations