Coherence and transitivity in coercive subtyping

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

Volumn 2250, Issue , 2001, Pages 249-265

  Luo, Yong ^a   Luo, Zhaohui ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY;

COERCIVE SUBTYPING; DEPENDENT TYPE THEORY; SUBTYPINGS;

FORMAL LANGUAGES;

EID: 84937431227     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_17     Document Type: Conference Paper

References (16)

1. B. Barras et al. The Coq Proof Assistant Reference Manual (Version 6.3.1). INRIA-Rocquencourt, 2000.
2. A. Bailey. The Machine-checked Literate Formalisation of Algebra in Type Theory. PhD thesis, University of Manchester, 1999.
3. G. Chen. Subtyping, Type Conversion and Transitivity Elimination. PhD thesis, University of Paris VII, 1998.
4. P. Callaghan and Z. Luo. An implementation of LF with coercive subtyping and universes. Journal of Automated Reasoning, 27(1):3-27, 2001.
5. P. C. Callaghan, Z. Luo, and J. Pang. Object languages in a type-theoretic meta-framework. Workshop of Proof Transformation and Presentation and Proof Complexities (PTP'01), 2001.
6. A. Jones, Z. Luo, and S. Soloviev. Some proof-theoretic and algorithmic aspects of coercive subtyping. Types for proofs and programs (eds, E. Gimenez and C. Paulin-Mohring), Proc. of the Inter. Conf. TYPES'96, LNCS 1512, 1998.
7. Z. Luo and P. Callaghan. Coercive subtyping and lexical semantics (extended abstract). LACL'98, 1998.
8. Y. Luo, Z. Luo, and S. Soloviev. Weak transitivity in coercive subtyping. In preparation, 2001.
9. Z. Luo and R. Pollack. LEGO Proof Development System: User's Manual. LFCS Report ECS-LFCS-92-211, Department of Computer Science, University of Edinburgh, 1992.
10. Z. Luo and S. Soloviev. Dependent coercions. The 8th Inter. Conf. on Category Theory and Computer Science (CTCS'99), Edinburgh, Scotland. Electronic Notes in Theoretical Computer Science, 29, 1999.
11. Z. Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.
12. Z. Luo. Coercive subtypingin type theory. Proc. of CSL'96, the 1996 Annual Conference of the European Association for Computer Science Logic, Utrecht. LNCS 1258, 1997.
13. Z. Luo. Coercive subtyping. Journal of Logic and Computation, 9(1):105-130, 1999.
14. B. Nordström, K. Petersson, and J. Smith. Programming in Martin-Löf's Type Theory: An Introduction. Oxford University Press, 1990.
15. A. Saibi. Typingalgorithm in type theory with inheritance. Proc of POPL'97, 1997.
16. S. Soloviev and Z. Luo. Coercion completion and conservativity in coercive subtyping. To be published in Annals of Pure and Applied Logic, 2001.