From 5c530e67256f8ecbd93336ba4e876acbba73f716 Mon Sep 17 00:00:00 2001
From: Miguel <m.i@gmx.at>
Date: Tue, 19 Feb 2019 12:25:40 +0100
Subject: cleaning up more..

---
 080_blog/00120_Lambda-Calculus-(Haskell)/index.md | 38 -----------------------
 1 file changed, 38 deletions(-)
 delete mode 100644 080_blog/00120_Lambda-Calculus-(Haskell)/index.md

(limited to '080_blog/00120_Lambda-Calculus-(Haskell)/index.md')

diff --git a/080_blog/00120_Lambda-Calculus-(Haskell)/index.md b/080_blog/00120_Lambda-Calculus-(Haskell)/index.md
deleted file mode 100644
index 25c6b83..0000000
--- a/080_blog/00120_Lambda-Calculus-(Haskell)/index.md
+++ /dev/null
@@ -1,38 +0,0 @@
-Lambda Calculus
-===============
-
-    May 2, 2018
-
-Playing with Type Quantifiers and Haskell's Rank 2 Type Polymorphsim,
-implementing Boolean logic from scratch. We use the conventional 
-definitions for `True` an `False` also known as Church booleans, after Alonzo Church, who 
-intruced them along Lambda Calculus in the 1930s [1].
-
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ {.haskell .numberLines}
-{-# LANGUAGE Rank2Types #-}
-
-fTrue :: forall a. a->a->a
-fTrue   x y = x
-
-fFalse :: forall a. a->a->a
-fFalse  x y = y
-
-fAnd :: (forall a. a->a->a)->(forall a. a->a->a)->(forall a. a->a->a)
-fAnd p q = p q p
-
-fOr :: (forall a. a->a->a)->(forall a. a->a->a)->(forall a. a->a->a)
-fOr p q = p p q
-
-fNot :: (forall a. a->a->a)->(forall a. a->a->a)
-fNot p = p fFalse fTrue
-
-ifThenElse :: (forall a. a->a->a)->(forall a. a->a->a)
-            ->(forall a. a->a->a)->(forall a. a->a->a)
-ifThenElse p a b = p a b
-
--- Example --
-
-main = print $ (ifThenElse fFalse fFalse $ fAnd fTrue $ fNot fFalse) "T" "F"
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-
-    [1] https://en.wikipedia.org/wiki/Lambda_calculus
-- 
cgit v1.2.3