Abstract
This work expounds the notion that (structured) categories are syntax free presentations of type theories, and shows some of the ideas involved in deriving categorical semantics for given type theories. It is intended for someone who has some knowledge of category theory and type theory, but who does not fully understand some of the intimate connections between the two topics. We begin by showing how the concept of a category can be derived from some simple and primitive mechanisms of monadic type theory. We then show how the notion of a category with finite products can model the most fundamental syntactical constructions of (algebraic) type theory. The idea of naturality is shown to capture, in a syntax free manner, the notion of substitution, and therefore provides a syntax free coding of a multiplicity of type theoretical constructs. Using these ideas we give a direct derivation of a cartesian closed category as a very general model of simply typed λ-calculus with binary products and a unit type. This article provides a new presentation of some old ideas. It is intended to be a tutorial paper aimed at audiences interested in elementary categorical type theory. Further details can be found in [5].
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
M. Barr and C. Wells. Category Theory for Computing Science. International Series in Computer Science. Prentice Hall, 1990.
A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5: 56–68, 1940.
A. Church. The Calculi of Lambda Conversion. Princeton University Press, 1941.
R.L. Croie. Programming Metalogics wath a Fixpoint Type. PhD thesis, Computer Laboratory, University of Cambridge, 1991.
R.L. Croie. Categories for Types Cambridge Mathematical Textbooks. Cambridge University Press, 1993. To appear: ISBN 0521 450926 HB.
J. Lambek. From A-calculus to cartesian closed categories. In J.P. Seldin and J.R. Hindley, editors, To H.B.Curry: Essays on Combinatory Logic,Lambda Calculus and Formalism. Academic Press, 1980.
S. Mac Lane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer-Verlag, 1971.
B. Nordstróm, K. Petersson, and J.M. Smith. Programming in Martin-LJf’s Type Theory, volume 7 of Monographs on Computer Science. Oxford University Press, 1990.
B.C. Pierce. Basic Category Theory for Computer Scientists. Foundations of Computing Series. The MIT Press, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
Crole, R.L. (1993). Deriving Category Theory from Type Theory. In: Burn, G., Gay, S., Ryan, M. (eds) Theory and Formal Methods 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3503-6_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3503-6_2
Publisher Name: Springer, London
Print ISBN: 978-3-540-19842-0
Online ISBN: 978-1-4471-3503-6
eBook Packages: Springer Book Archive