论文信息 - On the Expressive Strength of the Finitely Typed Lambda-Terms

On the Expressive Strength of the Finitely Typed Lambda-Terms

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?

Andreas Goerdt | A. Goerdt

[1] Klaus Indermark. Schemes with Recursion on Higher Types , 1976, MFCS.

[2] Joost Engelfriet,et al. IO and OI. I , 1977, J. Comput. Syst. Sci..

[3] Werner Damm,et al. An Automata-Theoretic Characterization of the OI-Hierarchy , 1982, ICALP.

[4] Daniel Leivant. Characterization of complexity classes in higher-order logic , 1987, Computational Complexity Conference.

[5] Werner Damm,et al. Higher Type Recursion and Self-Application as Control Structures , 1977, Formal Description of Programming Concepts.

[6] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[7] Jerzy Tiuryn,et al. The Hierarchy of Finitely Typed Functional Programs (Short Version) , 1987, LICS.

[8] Werner Damm,et al. The IO- and OI-Hierarchies , 1982, Theor. Comput. Sci..

[9] J. Engelfriet,et al. IO and OI , 1975 .

[10] Joost Engelfriet,et al. Iterated pushdown automata and complexity classes , 1983, STOC.

[11] Werner Damm,et al. An Automata-Theoretical Characterization of the OI-Hierarchy , 1986, Inf. Control..