Skip to main content
SpringerLink
Log in

Top-down tree-transducers for infinite trees I

  • Contributed Papers
  • Conference paper
  • First Online:
CAAP '81 (CAAP 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 112))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4 References

  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 Verlag

    Google Scholar 

  2. DAMM, W. The IO-and OI-Hierarchies, Schriften zur Informatik und Angewandten Mathematik, Bericht Nr. 41 (1980), RWTH Aachen

    Google Scholar 

  3. DAMM, W. Top-down tree transducers for infinite trees, in preparation

    Google Scholar 

  4. 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 Verlag

    Google Scholar 

  5. 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. DAMM, W. / GUESSARIAN, I. Combining T and level-N, LITP-report, Universite' Paris VII, (1981), to appear

    Google Scholar 

  7. ENGELFRIET, J. / SCHMIDT, E.M. IO and OI, JCSS Vol. 15, 3 (1977), 328–353 and Vol. 16, 1 (1978), 67–99

    Google Scholar 

  8. FEHR, E. Lambda calculus as control structure of programming languages, Schriften zur Informatik und Angewandten Mathematik, Bericht Nr. 57 (1980), RWTH Aachen

    Google Scholar 

  9. GOGUEN, J.A. / THATCHER, J.W. / WAGNER, E.G. / WRIGHT, J.B., Initial Algebra Semantics and Continuous Algebras JACM Vol. 24, 1 (1977), 68–95

    Google Scholar 

  10. MAIBAUM, T.S.E. A generalized approach to formal languages, JCSS Vol. 8, (1974), 409–439

    Google Scholar 

  11. NIVAT, M. On the interpretation of recursive program schemes, Atti del convegno d'Informatica theoretica (1972), Rome

    Google Scholar 

  12. 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 Verlag

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik II, RWTH Aachen, Büchel 29–31, D-5100, Aachen

    J. Bilstein & W. Damm

Authors
  1. J. Bilstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Damm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egidio Astesiano Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bilstein, J., Damm, W. (1981). Top-down tree-transducers for infinite trees I. In: Astesiano, E., Böhm, C. (eds) CAAP '81. CAAP 1981. Lecture Notes in Computer Science, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10828-9_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-10828-9_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10828-3

  • Online ISBN: 978-3-540-38716-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation