Scott's models and illative combinatory logic
暂无分享,去创建一个
[1] Martin W. Bunder. Some notes on: "A deduction theorem for restricted generality" , 1976, Notre Dame J. Formal Log..
[2] Martin W. Bunder,et al. A deduction theorem for restricted generality , 1973, Notre Dame J. Formal Log..
[3] Martin W. Bunder. Propositional and predicate calculuses based on combinatory logic , 1974, Notre Dame J. Formal Log..
[4] Martin W. Bunder. Various systems of set theory based on combinatory logic , 1974, Notre Dame J. Formal Log..
[5] Dana S. Scott,et al. Combinators and classes , 1975, Lambda-Calculus and Computer Science Theory.
[6] Robert K. Meyer,et al. On the inconsistency of systems similar to , 1978 .
[7] D. Scott. Models for Various Type-Free Calculi , 1973 .
[8] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..