Dependent Coercions

Electronic Notes in Theoretical Computer Science

Volumn 29, Issue , 1999, Pages 152-168

  Luo, Zhaohui ^a   Soloviev, Sergei ^b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; FUNCTIONS; GRAPHIC METHODS; LINEAR EQUATIONS; SEMANTICS; TREES (MATHEMATICS);

CANONICAL OBJECTS; COERCIONS; FUNCTIONAL PROGRAMMING; META-THEORY;

COMPUTER SCIENCE;

EID: 18944369141     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80314-7     Document Type: Conference Paper

References (23)

1. Bailey A. Lego with implicit coercions. 1996;. Draft
2. Bailey A. The Machine-checked Literate Formalisation of Algebra in Type Theory. PhD thesis, University of Manchester. 1998
3. Breazu-Tannen, T. Coquand V., Gunter C., Scedrov A. Inheritance and explicit coercion. Information and Computation. 93:1991
4. Callaghan P.C. Plastic: an implementation of typed LF with coercions. Talk given in the Annual Conf of TYPES'99. June 1999
5. Chen G. Subtyping, Type Conversion and Transitivity Elimination. PhD thesis, University of Paris VII. 1998
6. Callaghan P., Luo Z. Mathematical vernacular in type theory based proof assistants. User Interfaces for Theorem Provers (UITP'98), Eindhoven. 1998
7. Coq. The Coq Proof Assistant Reference Manual (version 6.1). INRIA-Rocquencourt and CNRS-ENS Lyon. 1996
8. Coquand Th., Paulin-Mohring Ch. Inductively defined types. Lecture Notes in Computer Science. 417:1990
9. Cardelli L., Wegner P. On understanding types, data abstraction and polymorphism. Computing Surveys. 17:1985
10. Dybjer P. Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics. Huet G., Plotkin G. Logical Frameworks. 1991;Cambridge University Press
11. 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.
12. Kiessling R., Luo Z., McKinna J.M. Some issues in functional programmiung with dependent types. Talk in the Annual Conference of TYPES'99. June 1999
13. Z. Luo and P. Callaghan. Mathematical vernacular and conceptual well-formedness in mathematical language. Proceedings of the 2nd Inter. Conf. on Logical Aspects of Computational Linguistics, LNCS/LNAI 1582, 1998.
14. Longo G., Milsted K., Soloviev S. A logic of subtyping. Proc. of LICS'95. 1995
15. Luo Z., Pollack R. LEGO Proof Development System: User's Manual. LFCS Report ECS-LFCS-92-211, Department of Computer Science, University of Edinburgh. 1992
16. Luo Z. A unifying theory of dependent types: the schematic approach. Proc. of Symp. on Logical Foundations of Computer Science (Logic at Tver'92), LNCS 620 Also as LFCS Report ECS-LFCS-. 1992;92-202 Dept. of Computer Science, University of Edinburgh
17. Luo Z. Computation and Reasoning: A Type Theory for Computer Science. 1994;Oxford University Press
18. Luo Z. Coercive subtyping in type theory. Proc. of CSL'96, the 1996 Annual Conference of the European Association for Computer Science Logic, Utrecht. LNCS 1258. 1997
19. Luo Z. Coercive subtyping. Journal of Logic and Computation. 9:(1):1999;105-130
20. Martin-Löf P. Intuitionistic Type Theory. Bibliopolis. 1984
21. Nordström B., Petersson K., Smith J. Programming in Martin-Löf's Type Theory: An Introduction. 1990;Oxford University Press
22. Saibi A. Typing algorithm in type theory with inheritance. Proc of POPL'97. 1997
23. Soloviev S., Luo Z. Coercion completion and conservertivity in coercive subtyping. Draft submitted. 1998