Skip to main content
SpringerLink
Log in

From semantics to rules: A machine assisted analysis

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1993)

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

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. M. Abadi, L. Cardelli, P-L. Curien and J-J Lévy. Explicit Substitutions. ACM Conference on Principles of Programming Languages, San Francisco, 1990.

    Google Scholar 

  2. U. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. Proceedings of LICS 91.

    Google Scholar 

  3. U. Berger. Program extraction from normalization proofs. Proceedings of TLCA'93, LNCS vol. 664

    Google Scholar 

  4. V. Breazu-Tannen, Th. Coquand, C.A. Gunter and A. Scedrov. Inheritance as implicit coercion. Logic and Computation, feb 1991.

    Google Scholar 

  5. C. Coquand Analysis of simply typed lambda-calculus in ALF. Proceedings of the Winter Meeting, Tanum Strand, 1993.

    Google Scholar 

  6. Th. Coquand and P. Dybjer. Intuitionistic Model Constructions and Normalization Proofs. Paper in preparation.

    Google Scholar 

  7. Th. Coquand and J. Gallier. A proof of strong normalization for the theory of constructions using a Kripke-like interpretation. Proceedings of the first workshop in Logical Frameworks.

    Google Scholar 

  8. Th. Coquand. Pattern Matching with Dependent Types. Proceedings of the 1992 Workshop on Types for Proofs and Programs, eds B. Nordström, K. Petersson and G. Plotkin.

    Google Scholar 

  9. R. O. Gandy. On the Axiom of Extensionality — Part I. The Journal of symbolic logic, volume 21, March 1956, p 36–48.

    MATH  MathSciNet  Google Scholar 

  10. S. A. Kripke Semantical analysis of intutionistic logic 1 Formal systems and recursive functions, 1965, eds J.N. Crossley and M.A.E. Dummet, North-Holland.

    Google Scholar 

  11. L. Magnusson. The new implementation of ALF. Proceedings of the 1992 Workshop on Types for Proofs and Programs, eds B. Nordström, K. Petersson and G. Plotkin.

    Google Scholar 

  12. P. Martin-Löf. Substitution calculus. Handwritten notes, Göteborg, 1992.

    Google Scholar 

  13. P. Martin-Löf. An Intuitionistic Theory of Types: Predicative Part. Logic Colloquium '73, 1975, p. 73–118, eds. H. E. Rose and J. C. Shepherdson, North-Holland.

    Google Scholar 

  14. J. C. Mitchell and E. Moggi. Kripke-style models for typed lambda calculus. Annals for Pure and Applied Logic 51, 1991, p 99–124, North-Holland.

    Google Scholar 

  15. B. Nordström, K. Petersson and J. Smith. Programming in Martin-Löf's Type Theory. An Introduction. Oxford University Press, 1990.

    Google Scholar 

  16. Eike Ritter. Categorical abstract machine for higher-order typed λ-calculus. Phd thesis, Univ. of Cambridge, 30 Sept, 1992.

    Google Scholar 

  17. Dana S. Scott. Relating theories of the lambda-calculus. To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, Academic Press, 1980.

    Google Scholar 

  18. R. Statman. Logical Relation and the Typed λ-calculus. Information and Control, 65, 1985.

    Google Scholar 

  19. A. Tasistro. Formulation of Martin-Löf's theory of types with explicit substitutions. Licentiate thesis, 1993.

    Google Scholar 

  20. R.D. Tennant. Semantical analysis of specification logic. Logics of programs. LNCS, vol. 193 Springer, 1985, p.373–386.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Catarina Coquand

Authors
  1. Catarina Coquand
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Yuri Gurevich Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coquand, C. (1994). From semantics to rules: A machine assisted analysis. In: Börger, E., Gurevich, Y., Meinke, K. (eds) Computer Science Logic. CSL 1993. Lecture Notes in Computer Science, vol 832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049326

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58277-9

  • Online ISBN: 978-3-540-48599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation