An Intuitionistic Theory of Types with Assumptions of High-Arity Variables
暂无分享,去创建一个
[1] Bengt Nordström,et al. Programming in Martin-Lo¨f's type theory: an introduction , 1990 .
[2] Bengt Nordström,et al. Types and Specifications , 1983, IFIP Congress.
[3] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[4] P. Martin-Löf. Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions , 1971 .
[5] William W. Tait,et al. Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.
[6] Jan M. Smith,et al. Program Derivation in Type Theory: A Partitioning Problem , 1986, Comput. Lang..
[7] Anne Sjerp Troelstra,et al. On the Syntax of Martin-Löf's Type Theories , 1987, Theor. Comput. Sci..
[8] P. Martin-Löf. An Intuitionistic Theory of Types: Predicative Part , 1975 .
[9] Robert L. Constable,et al. Proofs as programs , 1985, TOPL.
[10] de Ng Dick Bruijn,et al. Telescopic Mappings in Typed Lambda Calculus , 1991, Inf. Comput..
[11] S. Allen. A Non-Type-Theoretic Semantics for Type-Theoretic Language , 1987 .
[12] Stuart Allen. A Non-Type-Theoretic Definition of Martin-Löf's Types , 1987, LICS.
[13] RICHARD BEALS. I. Introduction , 1973 .
[14] R. Lathe. Phd by thesis , 1988, Nature.
[15] Jan M. Smith,et al. Propositions and specifications of programs in Martin-Löf's type theory , 1984, BIT.
[16] Bengt Nordström,et al. Programming in Martin-Löf's Type Theory , 1990 .
[17] Per Martin-Löf,et al. Constructive mathematics and computer programming , 1984 .
[18] D. Prawitz. Natural Deduction: A Proof-Theoretical Study , 1965 .