Computability and Complexity of Higher Type Functions

This publication has 14 references indexed in Scilit:

• Feasible Real Functions and Arithmetic Circuits
  SIAM Journal on Computing, 1990
• Characterizations of the basic feasible functionals of finite type
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• The polynomial hierarchy and intuitionistic Bounded Arithmetic
  Published by Springer Nature ,1986
• Computational complexity of real functions
  Theoretical Computer Science, 1982
• LCF considered as a programming language
  Theoretical Computer Science, 1977
• Recursion in Higher Types*
  Published by Elsevier ,1977
• Maximal and everywhere-defined functionals
  Algebra and Logic, 1974
• Type two computational complexity
  Published by Association for Computing Machinery (ACM) ,1973
• Computable functionals of finite types
  Algebra and Logic, 1972
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971