Coercion completion and conservativity in coercive subtyping

Annals of Pure and Applied Logic

Volumn 113, Issue 1-3, 2001, Pages 297-322

  Soloviev, Sergei ^a   Luo, Zhaohui ^b  

^a UNIVERSITÉ PAUL SABATIER   (France)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

03B15; 68T15; Dependent types; Subtyping

Indexed keywords

EID: 0035960965     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(01)00063-X     Document Type: Article

References (22)

1. A. Bailey, Lego with implicit coercions, 1996, Draft.
2. A. Bailey, The Machine-checked Literate Formalisation of Algebra in Type Theory, Ph.D. Thesis, University of Manchester, 1998.
3. V. Breazu-Tannen, T. Coquand, C. Gunter, A. Scedrov, Inheritance and explicit coercion, Inform. Comput. 93 (1991).
4. P.C. Callaghan, Plastic: an implementation of typed LF with coercions, Talk given in the Ann. Conf. of TYPES'99, June 1999.
5. Gang Chen, Dependent type system with subtyping, Technical Report LIENS-96-27, Ecole Normale Superieure- Paris, 1996.
6. Gang Chen, Sous-typage, Conversion de Types et Elimination de la Transitivite, Ph.D. Thesis, Université Paris VII, 1998.
7. P.C. Callaghan, Z. Luo, Plastic: an implementation of typed LF with coercive subtyping and universes, Draft paper submitted, 2000.
8. Coq, The Coq Proof Assistant Reference Manual (version 6.1), INRIA-Rocquencourt and CNRS-ENS Lyon, 1996.
9. Th. Coquand, Ch. Paulin-Mohring, in: Inductively defined types, Lecture Notes in Computer Science, Springer, Berlin, 1990.
10. P. Dybjer, Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics, in: G. Huet, G. Plotkin (Eds.), Logical Frameworks, Cambridge University Press, Cambridge, 1991.
11. A. Jones, Z. Luo, S. Soloviev, Some proof-theoretic and algorithmic aspects of coercive subtyping, in: E. Gimenez, C. Paulin-Mohring (Eds.), Types for proofs and programs, Proc. Int. Conf. TYPES'96, Lecture Notes in Computer Science, Vol. 1512, Springer, Berlin, 1998.
12. G. Longo, K. Milsted, S. Soloviev, A logic of subtyping, Proc. LICS'95, 1995.
13. Luo Z. Computation and Reasoning: A Type Theory for Computer Science. 1994;Oxford University Press, Oxford.
14. Z. Luo, Coercive subtyping in type theory. Proc. CSL'96, the 1996 Ann. Conf. of the European Association for Computer Science Logic, Utrecht, Lecture Notes in Computer Science, Springer, Berlin, Vol. 1258, 1997.
15. Luo Z. Coercive subtyping. J. Logic Comput. 9(1):1999;105-130.
16. Z. Luo, R. Pollack, Lego Proof Development System: user's Manual, LFCS Report ECS-LFCS-92-211, Department of Computer Science, University of Edinburgh, 1992.
17. Z. Luo, S. Soloviev, Dependent coercions. The 8th Int. Conf. on Category Theory and Computer Science (CTCS'99), Edinburgh, Scotland, Electronic Notes in Theoretical Computer Science, 1999.
18. J.C. Mitchell, L. Cardelli, S. Martini, A. Schedrov, An extension of system f with subtyping, Inform. Comput. 1994.
19. Nordström B., Petersson K., Smith J. Programming in Martin-Löf's Type Theory: An Introduction. 1990;Oxford University Press, Oxford.
20. B. Pierce, M. Steffen, Higher-order subtyping, Proc. IFIP Working Conf. on Programming Concepts, Methods and Calculi (PROCOMET), 1994.
21. A. Saibi, Typing algorithm in type theory with inheritance, Proc. POPL'97, 1997.
22. J. Tiurin, Equational axiomatization of bicoercibility for polymorphic types, Lecture Notes in Computer Science, Springer, Berlin, Vol. 1026, 1995.