Skip to main content
SpringerLink
Log in

A note on categorical datatypes

  • Conference paper
  • First Online:
Category Theory and Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 389))

Abstract

It is shown how Hagino's categorical datatypes can be expressed in the polymorphic typed λ-calculus. This gives a way of passing from a description of a datatype in terms of its universal properties, to a representation in terms of λ-expressions.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • K.B. Bruce, A.R. Meyer (1984) The semantics of second order polymorphic lambda-calculus. SLNCS 173 pp 131–144

    Google Scholar 

  • J.Bell (1988) Toposes and Local set Theories. Oxford University Press

    Google Scholar 

  • T. Coquand, V. Breazu-Tannen (1988) Extensional Models of Polymorphism. T.C.S. 59 pp 85–114

    Google Scholar 

  • Jon Fairbairn (1985) Design and Implementation of a simple typed language based on the lambda-calculus. University of Cambridge Technical Report No. 75

    Google Scholar 

  • T. Hagino (1987) A Typed Lambda Calculus with Categorical Type Constructors. Preprint.

    Google Scholar 

  • T. Hagino (1987) A Categorical Programming Language. Thesis. Edinburgh University.

    Google Scholar 

  • D.B.MacQueen, R.Sethi, G.Plotkin (1984) An Ideal Model for Recursive Polymorphic Types. 11-th Annual ACM Symposium on the Principles of Programming Languages.

    Google Scholar 

  • P. Mendler (1987) Inductive Definitions in type Theory. Thesis — Cornell University.

    Google Scholar 

  • Mendler, Constable (1985) Recursive Definitions in Type Theory. LNCS 193 pp 61–78

    Google Scholar 

  • J.C. Reynolds (1984) Polymorphism is not Set-Theoretic. SLNCS 173 pp 145–156

    Google Scholar 

  • J.C. Reynolds (1985) Three approaches to type structure. TAPSOFT. SLNCS 185 pp 97–138

    Google Scholar 

  • A.Pitts (1987) Polymorphism is Set-Theoretic Constructively. Preprint. University of Sussex.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Sussex, UK

    G. C. Wralth

Authors
  1. G. C. Wralth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David H. Pitt David E. Rydeheard Peter Dybjer Andrew M. Pitts Axel Poigné

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wralth, G.C. (1989). A note on categorical datatypes. In: Pitt, D.H., Rydeheard, D.E., Dybjer, P., Pitts, A.M., Poigné, A. (eds) Category Theory and Computer Science. Lecture Notes in Computer Science, vol 389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018348

Download citation

  • DOI: https://doi.org/10.1007/BFb0018348

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51662-0

  • Online ISBN: 978-3-540-46740-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation