Skip to main content
SpringerLink
Log in

The identification of propositions and types in Martin-Löf's type theory: A programming example

  • Conference paper
  • First Online:
Foundations of Computation Theory (FCT 1983)

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

Included in the following conference series:

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

  1. E.Bishop, Foundations of Constructive Analysis (McGraw-Hill 1967).

    Google Scholar 

  2. E.Bishop, Mathematics as a numerical language, Myhill, Kino and Vesley, eds., Intuitionism and Proof Theory pp.53–71 (North-Holland 1970).

    Google Scholar 

  3. R.M.Burstall, D.B.McQueen and D.T.Sanella, Hope: An experimental applicative language, Proceedings of the 1980 LISP conference, pp.136–143.

    Google Scholar 

  4. R.Constable, Constructive Mathematics and Automatic Program Writers, Information Processing 71 (North-Holland 1972).

    Google Scholar 

  5. M.J.Gordon, A.J.Milner and C.P.Wadsworth, Edinburgh LCF, Lecture Notes in Computer Science 78 (Springer-Verlag 1979).

    Google Scholar 

  6. K. Gödel, Über eine bisher noch nicht benütze Erweiterung des finiten Standpunktes, Dialectica, Vol. 12, 1958, pp.280–287.

    Google Scholar 

  7. A.Heyting, Intuitionism, an introduction (North-Holland 1956).

    Google Scholar 

  8. S.C.Kleene, Introduction to Metamathematics (North-Holland 1952).

    Google Scholar 

  9. Z. Manna and R. Waldinger, A deductive approach to program synthesis, ACM Transactions on Programming Languages and Systems, Vol.2, No.1, pp.92–121, 1980.

    Google Scholar 

  10. P.Martin-Löf, An Intuitionistic Theory of Types: Predicative Part, Logic Colloquium 73, Rose and Shepardson, eds., pp.73–118 (North-Holland 1975).

    Google Scholar 

  11. P.Martin-Löf, Constructive Mathematics and Computer Programming, Logic, Methodology and Philosophy of Science VI, pp.153–175 (North-Holland 1982).

    Google Scholar 

  12. B.Nordström, Programming in Constructive Set Theory, Some Examples, Proceedings of the Conference on Functional Programming Languages and Computer Architecture, ACM, Portsmouth, New Hampshire 1981.

    Google Scholar 

  13. K. Petersson, A programming system for type theory, LPM Memo 21, 1982, Dept. of Computer Science, Chalmers Univ. of Technology, Göteborg, Sweden.

    Google Scholar 

  14. D.Turner, SASL Language Manual, St.Andrews University, Technical report 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Göteborg Chalmers University of Technology, S-412 96, Göteborg, Sweden

    Jan Smith

Authors
  1. Jan Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smith, J. (1983). The identification of propositions and types in Martin-Löf's type theory: A programming example. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_125

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_125

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation