No CrossRef data available.
Published online by Cambridge University Press: 12 March 2014
In this paper some partial models for combinators with weak reduction are proposed. The underlying ideas are due to Church [1]. The results are extensions of the previous results of the author proved in [8].
(Note by Jonathan P. Seldin.) This is a revised version of a paper submitted in May, 1979 for publication in To H.B. Curry: Essays in Combinatory Logic, Lambda-Calculus, and Formalism, edited by Roger Hindley and me, Academic Press, London, 1980. At the end of May, 1979, I found an error in Lemma 2.7 of §4 of [8] and wrote to the author about it. The error turns out to be easily repaired (see footnote 4 below), but unfortunately at the time I wrote the author was in the process of moving to Moscow for six months, and so my letter did not reach him until November, 1979, and by that time a deadline set by the publishers had forced us to decide on the final contents of the book before receiving a reply from the author, and as a result this paper did not appear in the book.