Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-17T17:23:04.991Z Has data issue: false hasContentIssue false
  • English
  • Français

Completeness of transfinite evaluation in an extension of the lambda calculus

Published online by Cambridge University Press:  12 March 2014

Luis E. Sanchis
Luis E. Sanchis*
Affiliation:
School of Computer and Information Science, Syracuse University, Syracuse, New York 13210
Get access Rights & Permissions [Opens in a new window]

Extract

The lambda calculus was conceived by Church, and to some extent by Curry (see [1] and [2]), as a general theory of functions, more precisely as a formalization of two basic functional concepts: application and abstraction. This claim to universality was impossible to maintain, for it soon became apparent that functions in the calculus are required to have properties which are by no means universal. Self-application is certainly a very special feature, but more relevant from our point of view is the existence of fixed points, which is definitely a nonuniversal property of functions. This situation was not ignored, but was considered rather as a form of inconsistency very much related to the paradoxes of set theory (for example, see the discussion of the paradoxical combinator in [2]).

More recently, the lambda calculus has been studied by people in computer science, and as a result the algorithmic nature of the system has been more explicitly recognized. Eventually, the right approach was taken by D. Scott (see [4] and [5]) who restricted the objects of the calculus to continuous functionals over complete lattices, which can be combined in structures where application and abstraction are properly interpreted. It soon became clear that complete lattices were not necessary, and more general structures were introduced. On the other hand the requirement of continuity was essential for the construction, and has remained a basic feature. It is one of the purposes of this paper to show that in the general situation continuity can be replaced by monotonicity.

The work of Scott was extended by Wadsworth [6], who gave a precise formulation of the operational semantics, and proved the equivalence to Scott's interpretation.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 52 , Issue 1 , March 1987 , pp. 243 - 275
Copyright
Copyright © Association for Symbolic Logic 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Church, A., The calculi of lambda-conversion, Annals of Mathematics Studies, vol. 6, Princeton University Press, Princeton, New Jersey, 1941.Google Scholar
[2] Curry, H. B. and Feys, Robert, Combinatory logic, North-Holland, Amsterdam, 1958.Google Scholar
[3] Sanchis, L. E., Reflexive domains, To H. B. Curry: essays on combinatory logic, lambda calculus and formalism (Hindley, J. R. and Seldin, J. P., editors), Academic Press, New York, 1980, pp. 339–361.Google Scholar
[4] Scott, D. S., Continuous lattices, Toposes, algebraic geometry and logic (conference, Dalhousie University, Halifax, Nova Scotia, 1971; Lawvere, F. W., editor), Lecture Notes in Mathematics, vol. 274, Springer-Verlag, New York, 1972, pp. 97–136.Google Scholar
[5] Scott, D. S., Lambda calculus and recursion theory, Proceedings of the third Scandinavian logic symposium (Uppsala, 1973; Kanger, S., editor), North-Holland, Amsterdam, 1975, pp. 154–193.CrossRefGoogle Scholar
[6] Wadsworth, C. P., The relation between computational and denotational properties for Scott's D∞-models of the lambda-calculus, SIAM Journal of Computing, vol. 5 (1976), pp. 488–521.CrossRefGoogle Scholar