Author:
Sazonov Vladimir,Voronkov Andrei
Reference14 articles.
1. S.R. Buss. The polynomial hierarchy and intuitionistic bounded arithmetic. In Structure in Complexity Theory, volume 223 of Lecture Notes in Computer Science, pages 77–103, 1986.
2. A. Carboni, P. Freyd, and A. Scedrov. A categorical approach to realizability and polymorphic types. In M. Main e.a., editors, Proceedings of 3rd ACM Workshop on Mathematical Foundations of Programming Languages Semantics, volume 298 of Lecture Notes in Computer Science, pages 23–42. Springer Verlag, New Orleans, 1988.
3. S. Cook and A. Urquhart. Functional interpretations of feasibly constructive arithmetic. In Proc. 21st ACM STOC, pages 107–112, 1989.
4. S.C. Kleene. Introduction to Metamathematics. Van Nostrand P.C., Amsterdam, 1952.
5. G.Longo and E.Moggi. The hereditary partial effective functionals and recursion theory in higher types. The Journal of Symbolic Logic, 49(4) 1319–1332, 1984.