This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barendregt, H.P. Lambda calculus with types. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, (Eds), Handbook of Logic in Computer Science, pp. 118–310, Oxford University Press, Oxford, 1992.
Couquand, T. An analysis of Girard’s paradox. Proc. IEEE Symp. Log. Comp. Sci. 227–236, 1986.
Feferman, S. Constructive theories of functions and classes. In: M. Boffa, D. van Dalen, and K. McAloon (Eds.), Logic Colloquium ’78, pp. 159–225, North-Holland, Amsterdam, 1979.
Havel, P. Metamathematics of First Order Arithmetic. Springer-Verlag, New York, 1991.
Reynolds, J.C. Introduction to polymorphic lambda-calculus. In: G. Huet (Ed.), Logical Foundations of Functional Programming, pp. 77–86. Addison-Wesley, Reading, MA, 1990.
Russell, B.A.W. Mathematical logic as based on the theory of types Ameri. J. of Math. 30: 222–262.
Russell, B.A.W. Letter to Frege. In: J. van Heijenoort, (ed.). From Frege to G¨odel, pp 124–1250. Harvard University Press, Cambridge, MA, 1967.
Smorynski, C. Logical Number Theory I: An Introduction. Springer-Verlag, New York, 1991.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag London
About this chapter
Cite this chapter
Turner, R. (2009). A Type of Types. In: Computable Models. Springer, London. https://doi.org/10.1007/978-1-84882-052-4_11
Download citation
DOI: https://doi.org/10.1007/978-1-84882-052-4_11
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84882-051-7
Online ISBN: 978-1-84882-052-4
eBook Packages: Computer ScienceComputer Science (R0)