Some Algorithmic and Proof-Theoretical Aspects of Coercive Subtyping
暂无分享,去创建一个
[1] Healfdene Goguen. A typed operational semantics for type theory , 1994 .
[2] Amokrane Saïbi. Typing algorithm in type theory with inheritance , 1997, POPL '97.
[3] Zhaohui Luo,et al. Coercive Subtyping in Type Theory , 1996, CSL.
[4] Hugo Herbelin,et al. The Coq proof assistant : reference manual, version 6.1 , 1997 .
[5] Zhaohui Luo,et al. Program specification and data refinement in type theory , 1991, Mathematical Structures in Computer Science.
[6] Zhaohui Luo,et al. Program Speciication and Data Reenement in Type Theory , 1991 .
[7] David Aspinall,et al. Subtyping dependent types , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[8] Gift Siromoney,et al. A Perspective in Theoretical Computer Science - Commemorative Volume for Gift Siromoney , 1989, A Perspective in Theoretical Computer Science.
[9] T. Coquand. An algorithm for testing conversion in type theory , 1991 .
[10] Bengt Nordström,et al. Programming in Martin-Lo¨f's type theory: an introduction , 1990 .
[11] Gérard P. Huet,et al. The Constructive Engine , 1989, A Perspective in Theoretical Computer Science.
[12] Healfdene Goguen. Typed Operational Semantics , 1995, TLCA.
[13] Giuseppe Longo,et al. A logic of subtyping , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.
[14] Luca Cardelli,et al. Typechecking Dependent Types and Subtypes , 1986, Foundations of Logic and Functional Programming.
[15] Zhaohui Luo,et al. Computation and reasoning - a type theory for computer science , 1994, International series of monographs on computer science.