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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
8. References
DAMM, W.: Einfach-rekursive und rekursive Schemata mit stetigen Interpretationen — Diplomarbeit Bonn (1976)
ENGELFRIET, J.: Simple Program Schemes and Formal Languages — Lecture Notes in Computer Science 20 (1974)
GOGUEN, J.A., THATCHER, J.W.: Initial Algebra Semantics — IEEE Conf. Rec. SWAT 15 (1974), 63–77
GREIBACH, S.A.: Theory of Program Structures: Schemes, Semantics, Verification — Lecture Notes in Computer Science 36 (1975)
INDERMARK, K.: Theorie rekursiver Definitionen — Vorlesung, Universität Bonn (1975)
NIVAT, M.: On the Interpretation of Recursive Program Schemes — IRIA — Rapport de Recherche 84 (1974)
WAND, M.: A Concrete Approach to Abstract Recursive Definitions — in: Automata, Languages, and Programming (ed. NIVAT), Amsterdam (1973), 331–341
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Indermark, K. (1976). Schemes with recursion on higher types. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_198
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_198
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive