[Alta-Logic] Talk this Wednesday, March 3rd

[gscruttw at ucalgary.ca]

By Brian Redmond:

Title: Combinatory logic and $\lambda$-calculus compared

Abstract:

Combinatory logic (CL) was invented by Moses Sch\"{o}nfinkel in 1920 and
independently rediscovered by Haskell Curry a few years later. CL has the
same computational power as the (untyped) lambda calculus, but avoids the
use of bound variables. In fact, CL and the untyped lambda calculus are
closely related, but there are significant differences. In this talk, I
will introduce and compare both systems, and discuss some open problems.
No previous knowledge of CL or lambda calculus will be assumed.

Place and time: Wed March 3rd, 2:30pm. SS 1253