Abstract
In the setting of the language of finitely typed λ-terms with if-then else and fixpoints we investigate the question: In which respect do higher types bear on the expressive strength of programming languages?
We restrict attention to the set of closed λ-terms of first-order type, the set of programs. (Terms of first-order type have type i →...→ i → i, i for individuals, they have subterms of arbitrary types.) The set of programs can be naturally classified into an infinite syntactic hierarchy: A program is in the n'th level of this hierarchy, i. e. a level-n-program, if n is an upper bound on the functional level of its subterms.
Using a novel diagonalization technique over a class of finite interpretations, such that the set of cardinalities of the interpretations of this class has no finite upper bound, we show: Level-(n+1)-programs define more functions (in the sense of the theory of program schemes) than level-n-programs. Using reductions to already established hierarchies KfTiUr 87 shows: Level-(n+2)-programs define more functions than level-n-programs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W. Damm, The OI-and IO-hierarchies, Theoretical Computer Science, vol. 20, pp 95–207, 1982.
W. Damm, E. Fehr, K. Indermark, Higher type recursion and self application as control structures, in Formal Description of Programming Concepts, ed. Neuhold, pp 461–478,1978
J. Engelfriet, Iterated pushdown-automata and complexity classes, Proc. 15th STOC, pp 365–373, 1983.
J. Engelfriet, E. M. Schmidt, IO and OI, J. Comp. and System Sciences, vol 15, pp328–353 1977,/vol 16, pp 67–99,1978
W. Damm, A. Goerdt, An automata-theoretic characterization of the OI-hierarchy, Information and Control, vol 71, pp 1–32, 1986.
A. Goerdt, On the expressive strength of the finitely typed lambda-terms, Technical report, University of Duisburg, 1988.
K. Indermark, Schemes with recursion on higher types, Proc. 5th MFCS, LNCS 45, Springer-Verlag, pp 352–358, 1976.
A. J. Kfoury, P. Urzyczyn, Necessary and sufficient conditions for the universality of programming formalisms, Acta Informatica, vol 22, pp 347–377, 1985.
A. Kfoury, J. Tiuryn, P. Urzyczyn, The hierarchy of functional programs, Proc. LICS 1987, pp 225–235, 1987.
H. Langmaack, On procedures as open subroutines, Acta informatica, vol 2, pp 311–333, 1973 and vol 3 pp 227–241, 1974.
D. Leivant, Characterization of complexity classes in higher order logic, Proc. of the 2nd annual conference Structure in Complexity, pp 203–217, 1987.
G. Plotkin, LCF considered as a programming language, Theoretical Computer Science, vol 5, pp 223–255, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goerdt, A. (1988). On the expressive strength of the finitely typed lambda — terms. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017155
Download citation
DOI: https://doi.org/10.1007/BFb0017155
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50110-7
Online ISBN: 978-3-540-45926-2
eBook Packages: Springer Book Archive