This is a preview of subscription content, log in via an institution to check access.
Literature Cited
D. Scott, A Type-Theoretical Alternative to CUCH, OWHY, ISWIN, Oxford University (1969).
Yu. L. Ershov, “Computable functionals of finite types,” Algebra Logika,11, No. 4, 367–437 (1972).
V. Yu. Sazonov, “Sequentially and parallelly computable functionals (extended abstract),” in: Proceedings of the Symposium held in Rome, 1975, Lecture Notes in Computer Science, Vol. 37, Springer-Verlag (1975), pp. 312–318.
V. Yu. Sazonov, “On expressibility and computability of objects in D. Scott's LCF language,” in: Third All-Union Conference on Mathematical Logic [in Russian], Novosibirsk (1974), pp. 191–194.
J. R. Hindley, B. Lercher, and J. P. Seldin, Introduction to Combinatory Logic, Lecture Note Series,7, London Math. Soc. (1972).
D. Scott, Continuous Lattices, Lecture Notes in Math., No. 274 (1972), pp. 97–136.
M. B. Trakhtenbrot, “On the representation of serial and parallel functions,” in: Computational Mathematics and Programming [in Russian], Novosibirsk (1974), pp. 74–80.
D. Scott, “Lambda calculus and recursion theory,” Proceedings of the Third Scandinavian Logic Symposium, North-Holland (1975).
Additional information
Translated from Algebra i Logika, Vol. 15, No. 3, pp. 308–330, May–June, 1976.
Rights and permissions
About this article
Cite this article
Sazonov, V.Y. Expressibility of functions in D. Scott's LCF language. Algebra and Logic 15, 192–206 (1976). https://doi.org/10.1007/BF01876321
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01876321