From semantics to rules: A machine assisted analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 832 LNCS, Issue , 1994, Pages 91-105

  Coquand, Catarina ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84977597839     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0049326     Document Type: Conference Paper

References (20)

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.
2. U. Berger and H. Schwiclitenberg. An inverse of the evaluation functional for typed λ-calculus. Proceedings of LICS 91.
3. U. Berger. Program extraction from normalization proofs. Proceedings of TLCA’93, LNCS vol. 664
4. V. Breazu-Tannen, Th. Coquand, C.A. Gunter and A. Scedrov. Inheritance as implicit coercion. Logic and Computation, feb 1991.
5. C. Coquand Analysis of simply typed lambda-calculus in ALF. Proceedings of the Winter Meeting, Tanum Strand, 1993.
6. Th. Coquand and P. Dybjer. Intuitionistic Model Constructions and Normalization Proofs. Paper in preparation.
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.
8. Th. Coquand. Pattern Matching with Dependent Types. Proceedings of the 1992 Workshop on Types for Proofs and Programs, eds B. Nordstrom, K. Petersson and G. Plotkin.
9. R. O. Gandy. On the Axiom of Extensionality - Part I. The Journal of symbolic logic, volume 21, March 1956, p 36-48.
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.
11. L. Magnusson. The new implementation of ALF. Proceedings of the 1992 Workshop on Types for Proofs and Programs, eds B. Nordstrom, K. Petersson and G. Plotkin.
12. P. Martin-Löf. Substitution calculus. Handwritten notes, Goteborg, 1992.
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.
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.
15. B. Nordström, K. Petersson and J. Smith. Programming in Martin-Lof’s Type Theory. An Introduction. Oxford University Press, 1990.
16. Eike Ritter. Categorical abstract machine for higher-order typed λ-calculus. Phd thesis, Univ. of Cambridge, 30 Sept, 1992.
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.
18. R. Statman. Logical Relation and the Typed λ-calculus. Information and Control, 65, 1985.
19. A. Tasistro. Formulation of Martin-Löf’s theory of types with explicit substitutions. Licentiate thesis, 1993.
20. R.D. Tennant. Semantical analysis of specification logic. Logics of programs. LNCS, vol. 193 Springer, 1985, p.373-386.