Inhabitation in Intersection and Union Type Assignment Systems
暂无分享,去创建一个
[1] Fabio Alessi,et al. Strong Conjunction and Intersection Types , 1991, MFCS.
[2] Mariangiola Dezani-Ciancaglini,et al. Intersection Types for Combinatory Logic , 1992, Theor. Comput. Sci..
[3] Mariangiola Dezani-Ciancaglini,et al. Intersection and Union Types , 1991, TACS.
[4] J. Roger Hindley. Coppo-Dezani Types do not Correspond to Propositional Logic , 1984, Theor. Comput. Sci..
[5] Grigori Mints,et al. The Completeness of Provable Realizability , 1989, Notre Dame J. Formal Log..
[6] Steffen van Bakel,et al. Complete Restrictions of the Intersection Type Discipline , 1992, Theor. Comput. Sci..
[7] G. Pottinger,et al. A type assignment for the strongly normalizable |?-terms , 1980 .
[8] E. G. K. Lopez-Escobar,et al. Proof functional connectives , 1985 .
[9] J. Krivine. Lambda-calcul : types et modèles , 1990 .