scientific article; zbMATH DE number 3866573
[For the entire collection see Zbl 0534.00019.] A logical reconstruction of the type system of Russell is presented. The type abstraction system of Russell is explained using language from universal algebra, and this abstraction mechanism is related to constructive mathematics. A small kernel language, KR, incorporating these ideas, is given by specifying the syntax, type inference rules, and operational semantics. The formal properties of KR are briefly explored. Several standard meta-theorems about the inference rules are stated. The most interesting observation is that the standard subject-reduction theorem of the \(\lambda\)-calculus fails in the system. The paper concludes with a discussion of the translation of Russell into KR. The author is continuing to explore the relationship between KR and the intuitionistic type theory of Martin-Löf. Semantic soundness results should be appearing as Cornell University technical reports in early 1985.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334068)