Lambda-calculus, combinators and functional programming
نویسندگان
چکیده
منابع مشابه
Lambda-Calculus and Functional Programming
ion operator; this is because [x]M is an abbreviation for a term in which M and its subterms do not occur. On the other hand, in the natural reduction for lambda-calculus, replacements inside the scope of an abstraction are extremely natural. Thus, what is now called λβ -reduction satisfies a scheme which weak reduction does not, namely (ξ): if M reduces to N, then λx.M reduces to λx.N. (The sa...
متن کاملLambda-calculus, Combinators and the Comprehension Scheme Lambda-calculus, Combinators and the Comprehension Scheme
The presentations of type theory based on a comprehension scheme and on -calculus are equivalent, both in the sense that the latter is a conservative extension of the former and that it can be encoded into it preserving provability. A similar result holds for set theory. A short version of this paper appeared in the proceedings of the conference Typed Lambda-calculi and Applications (1995). Key...
متن کاملIntroduction to Combinators and Lambda-Calculus
As known, to finish this book, you may not need to get it at once in a day. Doing the activities along the day may make you feel so bored. If you try to force reading, you may prefer to do other entertaining activities. But, one of concepts we want you to have this book is that it will not make you feel bored. Feeling bored when reading will be only unless you don't like the book. introduction ...
متن کاملLambda-Calculus and Combinators in the 20th Century
P.726, lines 3–4. Replace “However, none of these authors gave formal definitions of substitution and conversion, which are characteristic of CL and λ proper. These did not appear ...” by “However, none of these authors showed the interplay between reduction, substitution and conversion explicitly by means of a formal theory, as is done in CL and λ. The latter theories did not appear ...”. P.72...
متن کاملSequent combinators: a Hilbert system for the lambda calculus
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the more widespread adoption of natural deduction systems in computer science. This suggests that Hilbert systems, with their more uniform approach to meta-variables and substitution, may be a more suitable framework than l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1990
ISSN: 0001-8708
DOI: 10.1016/0001-8708(90)90053-p