Coercive subtyping in type theory

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

Volumn 1258, Issue , 1997, Pages 276-296

  Luo, Zhaohui ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; RECONFIGURABLE HARDWARE;

COERCIVE SUBTYPING; COMPUTER ASSISTED; DEPENDENT TYPE THEORY; FORMAL DEVELOPMENT; FORMAL REASONING; LOGICAL FRAMEWORKS; TYPE STRUCTURES; UNIFORM FRAMEWORK;

FORMAL LANGUAGES;

EID: 84958780590     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63172-0_45     Document Type: Conference Paper

References (34)

1. D. Aspinall and A. Compagnoni. Subtyping dependent types. Proc. of LICS96, 1996. To appear.
2. P. Aczel. Simple overloading for type theories. Draft, 1994.
3. A. Bailey. Lego with implicit coercions. 1996. Draft.
4. V. Breazu-Tannen, T. Coquand, C. Gunter, and A. Scedrov. Inheritance and explicit coercion. Information and Computation, 93, 1991.
5. M.J. Beeson. Foundations of Constructive Mathematics. Springer-Verlag, 1985.
6. K. Bruce and G. Longo. A modest model of records, inheritance, and bounded quantification. Information and Computation, 87, 1990.
7. R. Burstall and J. McKirma. Deliverables: a categorical approach to program development in type theory. LFCS report ECS-LFCS-92-242, Dept of Computer Science, University of Edinburgh, 1992.
8. R. Burstall. Extended Calculus of Constructions as a specification language. In R. Bird and C. Morgan, editors, Mathematics of Program Construction, 1993. Invited talk.
9. R.L. Constable et al. Implementing Mathematics with the NuPRL Proof Development System. Pretice-Hall, 1986.
10. L. Cardelli. Type-checking dependent types and subtypes. Lecture Notes in Computer Science, 306, 1988.
11. Th. Coquand. Pattern matching with dependent types. Talk given at the BRA workshop on Proofs and Types, Bastad, 1992.
12. Th. Coquand and Ch. Paulin-Mohring. Inductively defined types. Lecture Notes in Computer Science, 417, 1990.
13. L. Cardelli and P. Wegner. On understanding types, data abstraction and polymorphism. Computing Surveys, 17, 1985.
14. G. Dowek et al. The Coq Proof Assistent: User's Guide (version 5.6). INRIA-Rocquencourt and CNRS-ENS Lyon, 1991.
15. P. Dybjer. Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics. In G. Huet and G. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.
16. H. Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, 1994.
17. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Proc. 2nd Ann. Syrup. on Logic in Computer Science. IEEE, 1987.
18. G. Longo, K. Milsted, and S. Soloviev. A logic of subtyping. In Proc. of LICS'95, 1995.
19. 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.
20. Z. Luo. ECC, an extended calculus of constructions. In Proc. of the Fourth Ann. Syrup. on Logic in Computer Science, Asilomar, California, U.S.A., June 1989. IEEE.
21. Z. Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinbm-gh, 1990. Also as Report CST-65-90/ECS-LFCS-90-118, Department of Computer Science, University of Edinburgh.
22. Z. Luo. A higher-order calculus and theory abstraction. Information and Computation, 90(1):107-137, 1991.
23. Z. Luo. A unifying theory of dependent types: the schematic approach. Proc. of Syrup. on Logical Foundations of Computer Science (Logic at Tver'92), LNCS 620, 1992. Also as LFCS Report ECS-LFCS-92-202, Dept. of Computer Science, University of Edinburgh.
24. Z. Luo. Program specification and data refinement in type theory. Mathematical Structures in Computer Science, 3(3), 1993.
25. Z. Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.
26. Z. Luo. Developing reuse technology in proof engineering. Proceedings of AISB95, Workshop on Automated Reasoning: bridging the gap between theory and practice, Sheffield, U.K., April 1995.
27. P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, 1984.
28. P. Martin-Löf. Analytic and synthetic judgements in type theory. In P. Parrini, editor, Kant and Contemporary Epistemology. Khiwer Accadenfic Publishers, 1994.
29. L. Magnusson and B. NordstrSm. The ALF proof editor and its proof engine. In Types for Proof and Programs, LNCS, 1994.
30. B. Nordström, K. Petersson, and J. Smith. Programming in Martin-Löf's Type Theory: An Introduction. Oxford University Press, 1990.
31. F. Pfemfing. Refinement types for logical frameworks. Preliminary Proceedings of BRA Workshop on Types and Proofs, 1993.
32. R. Pollack. Implicit syntax. In the preliminary Proceedings of the 1st Workshop on Logical Frameworks, 1990.
33. R. Pollack. The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions. PhD thesis, Edinburgh University, 1994.
34. A. Salbi. Typing algorithm in type theory with inheritance. Draft, 1996.