From ad6411e9ec256b03f20b9195e25cb128fe02c628 Mon Sep 17 00:00:00 2001 From: Miguel Date: Sun, 17 Mar 2019 13:56:23 +0100 Subject: minor cosmetics --- 080_blog/00040_Haskell/00065_Base64-Encoder/index.md | 3 ++- 080_blog/00040_Haskell/00120_Lambda-Calculus/index.md | 9 +++++---- 2 files changed, 7 insertions(+), 5 deletions(-) diff --git a/080_blog/00040_Haskell/00065_Base64-Encoder/index.md b/080_blog/00040_Haskell/00065_Base64-Encoder/index.md index cabf19e..bdbae41 100644 --- a/080_blog/00040_Haskell/00065_Base64-Encoder/index.md +++ b/080_blog/00040_Haskell/00065_Base64-Encoder/index.md @@ -1,6 +1,7 @@ + February 2018 Miguel's Base64 Encoder ======================= - February 19, 2018 + Initially coded on a cold winter afternoon to fully understand **base64 encoding** and play with **Haskell**, which is always an indisputable pleasure. Hacked together in _big anger_, due to my friend Nick's fairy tales about saving his encrypted binary data in plain _ASCII_ diff --git a/080_blog/00040_Haskell/00120_Lambda-Calculus/index.md b/080_blog/00040_Haskell/00120_Lambda-Calculus/index.md index 25c6b83..b86950f 100644 --- a/080_blog/00040_Haskell/00120_Lambda-Calculus/index.md +++ b/080_blog/00040_Haskell/00120_Lambda-Calculus/index.md @@ -1,12 +1,11 @@ + May 2018 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]. +intruced them along Lambda Calculus in the 1930s [[1]](#ref). ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ {.haskell .numberLines} {-# LANGUAGE Rank2Types #-} @@ -35,4 +34,6 @@ ifThenElse p a b = p a b main = print $ (ifThenElse fFalse fFalse $ fAnd fTrue $ fNot fFalse) "T" "F" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - [1] https://en.wikipedia.org/wiki/Lambda_calculus +## Ref + +* [1] -- cgit v1.2.3