@wactbprot
Yes great lecture about #lambda calculus and #functionalprogramming.

When I tried to program the AND combinator in #haskell I failed. Maybe because of the static type system but more likely because of my inability?

Is there a simple solution for AND: (\p q -> p q p ) in #haskell?

This is as far as I got:

tr :: a -> b -> a
tr = \p q -> p
fs :: a -> b -> b
fs = \p q -> q

and' = \p q -> p q fs
or' = \p q -> p tr q
-- ghci> or' tr fs True False
-- True
-- ghci> and' tr fs True False
-- False

-- and'' = \p q -> p q p -- does not work
-- or'' = \p q -> p p q -- does not work