Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1992: Computer Science Logic pp 395–402Cite as

Kleene's slash and existence of values of open terms in type theory

  • Conference paper
  • First Online:

  • 138 Accesses

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

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. Peter Aczel. The strength of Martin-Löf's type theory with one universe. In Proceedings of the Symposium on Mathematical Logic, Oulu, 1974, pages 1–32. Report No 2, Department of Philosophy, University of Helsinki, 1977.

    Google Scholar 

  2. Rod Burstall. Proving Properties of Programs by Structural Induction. Computer Journal, 12(1):41–48, 1969.

    Google Scholar 

  3. Thierry Coquand. An algorithm for testing conversion in type theory. In Logical Frameworks. Cambridge University Press, 1991.

    Google Scholar 

  4. Thierry Coquand. Pattern matching with dependent types. In In the informal proceeding from the logical framework workshop at Båstad, June 1992.

    Google Scholar 

  5. Lars Hallnäs. Partial Inductive Definitions. Theoretical Computer Science, (87), 1991.

    Google Scholar 

  6. R. Harrop. Concerning formulas of the types A → B ∨ C, A → (∃x)B(x) in intuitionistic formal systems. Journal of Symbolic Logic, 25:27–32, 1960.

    Google Scholar 

  7. N. D. Jones, P. Sestoft, and H. Søndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, (2):9–50, 1989.

    Google Scholar 

  8. S. C. Kleene. Disjunction and existence under implication in elementary intuitionistic formalisms. Journal of Symbolic Logic, 27:11–18, 1962.

    Google Scholar 

  9. J. Lambek and P. J. Scott. New proofs of some intuitionistic principles. Zeit. f Math. Logik und Grundlagen d. Math., 29:493–504, 1983.

    Google Scholar 

  10. Per Martin-Löf. An Intuitionistic Theory of Types. Technical report, University of Stockholm, 1972.

    Google Scholar 

  11. Bengt Nordström, Kent Petersson, and Jan M. Smith. Programming in Martin-Löf 's Type Theory. An Introduction. Oxford University Press, 1990.

    Google Scholar 

  12. Christine Paulin-Mohring. Extraction de Programmes dans le Calcul des Constructions. PhD thesis, L'Universite Paris VII, 1989.

    Google Scholar 

  13. Jan M. Smith. An interpretation of kleene's slash in type theory. In G. Huet, G. Plotkin, and C. Jones, editors, Informal Proceedings of the Second Workshop on Logical Frameworks, pages 337–342. Esprit Basic Research Action, May 1991. To appear in G. Huet and G. Plotkin, editors, Logical Frameworks, Cambridge University Press.

    Google Scholar 

  14. Catarina Svensson. A normalization proof for Martin-Löf's type theory. Licentiate Thesis, Chalmers University of Technology and University of Göteborg, Sweden, March 1990.

    Google Scholar 

  15. W. W. Tait. Intensional interpretation of functionals of finite type I. Journal of Symbolic Logic, 32(2):198–212, 1967.

    Google Scholar 

  16. Yukihide Takayama. Extracting redundancy-free programs from proofs in first order arithmetic. To appear in Journal of Symbolic Computation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Jan M. Smith

Authors
  1. Jan M. Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Jäger H. Kleine Büning S. Martini M. M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smith, J.M. (1993). Kleene's slash and existence of values of open terms in type theory. In: Börger, E., Jäger, G., Kleine Büning, H., Martini, S., Richter, M.M. (eds) Computer Science Logic. CSL 1992. Lecture Notes in Computer Science, vol 702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56992-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-56992-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56992-3

  • Online ISBN: 978-3-540-47890-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation