Advertisement

Top-down tree-transducers for infinite trees I

  • J. Bilstein
  • W. Damm
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 112)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4 References

  1. [Da 1]
    DAMM, W. Languages defined by higher type program schemes, 4 th international colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 52 (1977), 164–179, Springer VerlagGoogle Scholar
  2. [Da 2]
    DAMM, W. The IO-and OI-Hierarchies, Schriften zur Informatik und Angewandten Mathematik, Bericht Nr. 41 (1980), RWTH AachenGoogle Scholar
  3. [Da 3]
    DAMM, W. Top-down tree transducers for infinite trees, in preparationGoogle Scholar
  4. [DF 1]
    DAMM, W. / FEHR, E. On the power of self application and higher type recursion, Proc. 5th international colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science Science 62 (1978), 177–191, Springer VerlagGoogle Scholar
  5. [DF 2]
    DAMM, W. / FEHR, E. A schematological approach to the analysis of the procedure concept in ALGOL-languages, Proc. 5 ième colloque sur les Arbres en Algebre et en Programmation, Lille, (1980), 130–134 (abstract)Google Scholar
  6. [DG]
    DAMM, W. / GUESSARIAN, I. Combining T and level-N, LITP-report, Universite' Paris VII, (1981), to appearGoogle Scholar
  7. [ES]
    ENGELFRIET, J. / SCHMIDT, E.M. IO and OI, JCSS Vol. 15, 3 (1977), 328–353 and Vol. 16, 1 (1978), 67–99Google Scholar
  8. [Fe]
    FEHR, E. Lambda calculus as control structure of programming languages, Schriften zur Informatik und Angewandten Mathematik, Bericht Nr. 57 (1980), RWTH AachenGoogle Scholar
  9. [GTWW]
    GOGUEN, J.A. / THATCHER, J.W. / WAGNER, E.G. / WRIGHT, J.B., Initial Algebra Semantics and Continuous Algebras JACM Vol. 24, 1 (1977), 68–95Google Scholar
  10. [Mai]
    MAIBAUM, T.S.E. A generalized approach to formal languages, JCSS Vol. 8, (1974), 409–439Google Scholar
  11. [Niv]
    NIVAT, M. On the interpretation of recursive program schemes, Atti del convegno d'Informatica theoretica (1972), RomeGoogle Scholar
  12. [Sco]
    SCOTT, D. The Lattice of Flow Diagrams, Symp. on Semantics of Algorithmic Languages, (ed. E. Engeler), Lecture Notes in Math. Vol. 188 (1971), 311–366, Springer VerlagGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • J. Bilstein
    • 1
  • W. Damm
    • 1
  1. 1.Lehrstuhl für Informatik IIRWTH AachenAachen

Personalised recommendations