This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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. Oxford Science Publications. Abramsky, S., Gabbay, D.M. and Maibaum, T.S.E., pp. 118–310, Oxford University Press, Oxford, 1992.
Beeson, M.J. Foundations of Constructive Mathematics, Springer-Verlag Berlin, 1985.
Martin-Lof, P. An intuitionistic theory of sets, predicative part. In Logic Colloquim, 73. North-Holland, Amsterdam, 1975.
Pierce, B.C. Types and Programming Languages. MIT Press, Cambridge, MA, 2002.
Thompson, S. Type Theory and Functional Programming. Addison-Wesley, Reading, MA, 1991.
Turner, R. Type inference for set theory. Theor. Comput. Sci. 266(1–2): 951–974, 2001.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag London
About this chapter
Cite this chapter
Turner, R. (2009). Typed Predicate Logic. In: Computable Models. Springer, London. https://doi.org/10.1007/978-1-84882-052-4_2
Download citation
DOI: https://doi.org/10.1007/978-1-84882-052-4_2
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)