Some algorithmic and proof-theoretical aspects of coercive subtyping

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

Volumn 1512, Issue , 1998, Pages 173-195

  Jones, Alex ^a   Luo, Zhaohui ^a   Soloviev, Sergei ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY;

COERCIVE SUBTYPING; COMPUTATIONAL PROPERTIES; SUBTYPINGS; THEORETICAL ASPECTS; TYPE THEORY;

FORMAL LANGUAGES;

EID: 84958969382     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0097792     Document Type: Conference Paper

References (19)

1. D. Aspinall and A. Compagnonl. Subtyping dependent types. Proc. of LICS96, 1996.
2. Anthony Bailey. Representing algebra in LEGO. Master’s thesis, Department of Computer Science, University of Edinburgh, 1993.
3. A. Bailey. Lego with implicit coercions. 1996. Draft.
4. L. Cardelli. Type-checking dependent types and subtypes. Lecture Notes in Computer Science, 306, 1988.
5. L. Cardelli. Typeful programming. Lecture notes for the IFIP State of the Art Seminar on Formal Description of Programming Concepts, Rio de Janeiro, Brazil, 1989.
6. Th. Coquand. An algorithm for testing conversion in Type Theory. In G. Huet and G. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.
7. H. Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, 1994.
8. G. Huet et al. The Cog Proof Assistant Reference Manual. INRIA-Rocquencourt, February 1996.
9. Gérard Huet. The constructive engine. In R. Narasimhan, editor, A Perspective in Theoretical Computer Science. World Scientific Publishing, 1989. Commemorative Volume for Gift Siromoney.
10. Alex Jones. The formalization of linear algebra in LEGO: The decidable dependency theorem. Master’s thesis, Department of Mathematics, University of Manchester, 1995.
11. Giuseppe Longo, Kathleen Milsted, and Sergei Soloviev. Coherence and transitivity of subtyping as entailment. To appear in Journal of Logic and Computation.
12. G. Longo, K. Milsted, and S. Soloviev. A logic of subtyping. In Proc. of LICS’95, 1995.
13. Zhaohui Luo and Robert Pollack. LEGO proof development system: User’s manual. Technical Report LFCS Report ECS-LFCS-92-211, Department of Computer Science, University of Edinburgh, 1992.
14. Z. Luo. Program specification and data refinement in type theory. Mathematical Structures in Computer Science, 3(3), 1993.
15. Z. Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.
16. Z. Luo. Coercive subtyping in type theory. Proc. of CSL’96, the 1996 Annual Conference of the European Association for Computer Science Logic, Utrecht. LNCS 1258, 1996.
17. Z. Luo. Coercive suptyping. Draft submitted for publication, 1997.
18. B. Nordström, K. Petersson, and J. Smith. Programming in Martin-Löf’s Type Theory: An Introduction. Oxford University Press, 1990.
19. A. Saibi. Typing algorithm in type theory with inheritance. Proc of POPL '97, 1997.