Advertisement

Schemes with recursion on higher types

  • Klaus Indermark
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)

Abstract

This discussion leads to the problem whether the hierarchy of (5) is strict. A positive answer would demonstrate that procedures with recursion on higher types enlarge the computational power of a programming language.

This research is being continued in collaboration with Werner DAMM, and I take the opportunity to thank him for many helpful and stimulating discussions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. 1.
    DAMM, W.: Einfach-rekursive und rekursive Schemata mit stetigen Interpretationen — Diplomarbeit Bonn (1976)Google Scholar
  2. 2.
    ENGELFRIET, J.: Simple Program Schemes and Formal Languages — Lecture Notes in Computer Science 20 (1974)Google Scholar
  3. 3.
    GOGUEN, J.A., THATCHER, J.W.: Initial Algebra Semantics — IEEE Conf. Rec. SWAT 15 (1974), 63–77Google Scholar
  4. 4.
    GREIBACH, S.A.: Theory of Program Structures: Schemes, Semantics, Verification — Lecture Notes in Computer Science 36 (1975)Google Scholar
  5. 5.
    INDERMARK, K.: Theorie rekursiver Definitionen — Vorlesung, Universität Bonn (1975)Google Scholar
  6. 6.
    NIVAT, M.: On the Interpretation of Recursive Program Schemes — IRIA — Rapport de Recherche 84 (1974)Google Scholar
  7. 7.
    WAND, M.: A Concrete Approach to Abstract Recursive Definitions — in: Automata, Languages, and Programming (ed. NIVAT), Amsterdam (1973), 331–341Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Klaus Indermark
    • 1
  1. 1.Lehrstuhl für Informatik IIRWTH AachenAachen

Personalised recommendations