Skip to main content
SpringerLink
Log in
Book cover

Category Theory and Computer Science pp 128–140Cite as

A set constructor for inductive sets in Martin-Löf's type theory

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Roland Backhouse. On the meaning and construction of the rules in Martin-Löf's theory of types. In Proceedings of the Workshop on General Logic, Edinburgh, Laboratory for the Foundations of Computer Science, University of Edinburgh, February 1987.

    Google Scholar 

  2. P. Chisholm. Derivation of a Parsing Algorithm in Martin-Löf's theory of types. Science of Computer Programming, 8:1–42, 1987.

    Google Scholar 

  3. Robert L. Constable and Nax P. Mendler. Recursive Definitions in Type Theory. In Proceedings of the LICS-Conference, Brooklyn, N. Y., Lecture Notes in Computer Science, Springer-Verlag, June 1985.

    Google Scholar 

  4. Peter Dybjer. Inductively Defined Sets in Martin-Löf's Type Theory. 1987. Presented at the Workshop on General Logic, Edinburgh.

    Google Scholar 

  5. C. A. R. Hoare. Recursive Data Structures. International Journal of Computer and Information Sciences, 4(2):105–132, 1975.

    Google Scholar 

  6. Per Martin-Löf. Constructive Mathematics and Computer Programming. In Logic, Methodology and Philosophy of Science, VI, 1979, pages 153–175, North-Holland, 1982.

    Google Scholar 

  7. Per Martin-Löf. Intuitionistic Type Theory. Bibliopolis, Napoli, 1984.

    Google Scholar 

  8. R. Milner. Standard ML Proposal. Polymorphism: The ML/LCF/Hope Newsletter, 1(3), January 1984.

    Google Scholar 

  9. Dana Scott. Domains for Denotational Semantics. In Automata, Languages and Programming, 9th Colloquium, pages 577–613, Springer-Verlag, LNCS 140, July 1982.

    Google Scholar 

  10. Dan Synek. Deriving Rules for Inductive Sets in Martin-Löf's Type Theory. Technical Report, Programming Methodology Group, Dept. of Computer Science, Chalmers University of Technology, S-412 96 Göteborg, 1989. In preparation.

    Google Scholar 

  11. A. van Wijngarden et al. Revised report on the Algorithmic Language, ALGOL 68. Acta Informatica, 5:1–236, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Methodology Group, Dept. of Computer Sciences, Univ. of Göteborg and Chalmers, S-412 96, Göteborg, Sweden

    Kent Petersson & Dan Synek

Authors
  1. Kent Petersson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dan Synek
    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

Petersson, K., Synek, D. (1989). A set constructor for inductive sets in Martin-Löf's type theory. 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/BFb0018349

Download citation

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

  • 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