Skip to main content

Deriving Category Theory from Type Theory

  • Conference paper
Theory and Formal Methods 1993

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 74 Accesses

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].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Barr and C. Wells. Category Theory for Computing Science. International Series in Computer Science. Prentice Hall, 1990.

    MATH  Google Scholar 

  2. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5: 56–68, 1940.

    Article  MathSciNet  MATH  Google Scholar 

  3. A. Church. The Calculi of Lambda Conversion. Princeton University Press, 1941.

    Google Scholar 

  4. R.L. Croie. Programming Metalogics wath a Fixpoint Type. PhD thesis, Computer Laboratory, University of Cambridge, 1991.

    Google Scholar 

  5. R.L. Croie. Categories for Types Cambridge Mathematical Textbooks. Cambridge University Press, 1993. To appear: ISBN 0521 450926 HB.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. S. Mac Lane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer-Verlag, 1971.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. B.C. Pierce. Basic Category Theory for Computer Scientists. Foundations of Computing Series. The MIT Press, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics