1. A new type assignment for λ-terms
2. , and , Functional characterization of some semantic equalitites inside Λ-calculus. In: Automata, Languages and Programming, ed. E. MAURER, Lecture Notes in Computer Science 71 (1979), 133–146.
3. An extension of the basic functionality theory for the $\lambda$-calculus.
4. , and , Principal type schemes and Λ-calculus semantics. In: Essays in Combinatory Logic, Lambda-calculus and Formalism, eds. and , Academic Press 1980, 535–560.
5. Modified basic functionality in combinatory logic