Soundness of the logical framework for its typed operational semantics

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

Volumn 1581, Issue , 1999, Pages 177-197

  Goguen, Healfdene ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; PATHOLOGY;

ETA-REDUCTION; INDUCTION PRINCIPLES; LAMBDA-CALCULUS; LOGICAL FRAMEWORKS; OPERATIONAL BEHAVIOR; OPERATIONAL SEMANTICS; STRONG NORMALIZATION; SUBJECT REDUCTION;

SEMANTICS;

EID: 84856631548     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48959-2_14     Document Type: Conference Paper

References (19)

1. H. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbai, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2. Oxford University Press, 1991.
2. A. Compagnoni and H. Goguen. Typed operational semantics for higher order subtyping. Technical Report ECS-LFCS-97-361, Edinburgh Univ., July 1997. Submitted to Information and Computation.
3. H. Geuvers. Logics and Type Systems. PhD thesis, Katholieke Universiteit Nijmegen, Sept. 1993.
4. H. Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, Edinburgh Univ., Aug. 1994.
5. H. Goguen. Typed operational semantics. In Proceedings of TLCA, volume 902 of Lecture Notes in Computer Science, pages 186-200. Springer-Verlag, Apr. 1995.
6. F. Joachimski and R. Matthes. Short proofs of strong normalization, 1998. Draft, submitted for publication.
7. A. Jones, Z. Luo, and S. Soloviev. Some algorithmic and proof-theoretical aspects of coercive subtyping. In Proceedings of TYPES’96, 1996. To appear.
8. P. Leleu. Metatheoretic results for a modal lambda calculus. Technical Report RR-3361, INRIA, 1998.
9. R. Loader. Normalisation by translation. Note distributed on TYPES list, Apr. 1995.
10. Z. Luo. An Extended Calculus of Constructions. PhD thesis, Edinburgh Univ., Nov. 1990.
11. Z. Luo. Computation and Reasoning. Oxford University Press, 1994.
12. J. McKinna and R. Pollack. Pure type systems formalized. In M. Bezem and J. F. Groote, editors, Proceedings of TLCA, pages 289-305. Springer-Verlag, LNCS 664, Mar. 1993.
13. B. Nordström, K. Petersson, and J. Smith. Programming in Martin-Löf’s Type Theory: An Introduction. Oxford University Press, 1990.
14. G. Pottinger. Strong normalization for the terms of the theory of constructions. Technical Report TR 11-7, Odyssey Research Associates, Inc., 1987.
15. A. Salvesen. The Church-Rosser property for pure type systems with βη-reduction, Nov. 1991. Unpublished manusript.
16. M. Takahashi. Parallel reductions in λ-calculus. Information and Computation, 118:120-127, 1995.
17. L. van Benthem Jutting, J. McKinna, and R. Pollack. Typechecking in pure type systems. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programming. Springer-Verlag, 1993.
18. F. van Raamsdonk and P. Severi. On normalisation. Technical Report CS-R9545, CWI Amsterdam, 1995.
19. B. Werner. Une Théorie des Constructions Inductives. PhD thesis, Universite Paris 7, 1994.