Coercive subtyping

Journal of Logic and Computation

Volumn 9, Issue 1, 1999, Pages 105-130

  Luo, Zhaohui ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Coercion; Formal reasoning; Logical framework; Subtyping; Type theory

Indexed keywords

COMPUTER AIDED ANALYSIS;

COERCIVE SUBTYPING; MARTIN-LOF'S TYPE THEORY;

FORMAL LOGIC;

EID: 0033075029     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/9.1.105     Document Type: Article

References (20)

1. P. Aczel. Simple overloading for type theories. Draft, 1994.
2. D. Aspinall and A. Compagnoni. Subtyping dependent types. In Proceedings of LICS96, 1996.
3. A. Bailey. Lego with implicit coercions. 1996. Draft.
4. A. Bailey. The Machine-checked Literate Formalisation of Algebra in Type Theory. PhD thesis, University of Manchester, 1998.
5. H.P. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science, Vol. 2, S. Abramsky, D. Gabbay, and T. Maibaum, eds. Clarendon Press, Oxford, 1992.
6. G. Barthes. Implicit coercions in type systems. In Proceedings of Types'95, LNCS 1128, 1996.
7. M. J. Beeson. Foundations of Constructive Mathematics. Springer-Verlag, 1985.
8. V. Breazu-Tannen, T. Coquand, C. Gunter and A. Scedrov. Inheritance and explicit coercion. Information and Computation, 93, 1991.
9. K. Bruce and G. Longo. A modest model of records, inheritance, and bounded quantification. Information and Computation, 87, 1990.
10. R. Burstall. Extended Calculus of Constructions as a specification language. In Mathematics of Program Construction, R. Bird and C. Morgan, eds. Invited talk, 1993.
11. R. Burstall and J. McKinna. Deliverables: a categorical approach to program development in type theory. LFCS report ECS-LFCS-92-242, Dept of Computer Science, University of Edinburgh, 1992.
12. L. Cardelli. Type-checking dependent types and subtypes. Lecture Notes in Computer Science, 306, 1988.
13. L. Cardelli and P. Wegner. On understanding types, data abstraction and polymorphism. Computing Surveys, 17, 1985.
14. R.L. Constable et al. Implementing Mathematics with the NuPRL Proof Development System. Prentice-Hall, 1986.
15. Th. Coquand. Pattern matching with dependent types. Talk given at the BRA workshop on Proofs and Types, Bastad, 1992.
16. Th. Coquand and G. Huet. The calculus of constructions. Information and Computation, 76, 1988.
17. Th. Coquand and Ch. Paulin-Mohring. Inductively defined types. Lecture Notes in Computer Science, 417, Springer-Verlag, Berlin, 1990.
18. G. Dowek. The undecidability of typability in the lambda-Pi calculus. In Proc of Typed Lambda Calculi and Applications, LNCS 664, Springer-Verlag, Berlin,1993.
19. G. Dowek et al. The Coq Proof Assistent: User's Guide (version 5.6). INRIA-Rocquencourt and CNRS-ENS Lyon, 1991.
20. P. Dybjer. Inductive sets and families in Martin-Löfs type theory and their set-theoretic semantics. In Logical Frameworks, G. Huet and G. Plotkin, eds. Cambridge University Press, 1991.