A model for impredicative type systems, universes, intersection types and subtyping
暂无分享,去创建一个
[1] Zhaohui Luo,et al. Computation and reasoning - a type theory for computer science , 1994, International series of monographs on computer science.
[2] Herman Geuvers,et al. The Church-Rosser property for beta eta -reduction in typed lambda -calculi , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[3] Andrée Bastiani,et al. Théorie des ensembles , 1970 .
[4] Paola Giannini,et al. Type Inference: Some Results, Some Problems , 1993, Fundamenta Informaticae.
[5] Hugo Herbelin,et al. The Coq proof assistant : reference manual, version 6.1 , 1997 .
[6] R. Lathe. Phd by thesis , 1988, Nature.
[7] Christine Paulin-Mohring,et al. The coq proof assistant reference manual , 2000 .
[8] C. Paulin-Mohring. Définitions Inductives en Théorie des Types , 1996 .
[9] J. Girard,et al. Proofs and types , 1989 .
[10] P. Tichý. Constructions , 1986, Philosophy of Science.
[11] Mark-Jan Nederhof,et al. Modular proof of strong normalization for the calculus of constructions , 1991, Journal of Functional Programming.
[12] Benjamin Werner,et al. Une Théorie des Constructions Inductives , 1994 .
[13] Thorsten Altenkirch,et al. Constructions, inductive types and strong normalization , 1993, CST.
[14] Nicolas Bourbaki,et al. Théorie des ensembles , 1954 .