From be63a5d299c9d10e6a3a22e404ed2c045b218171 Mon Sep 17 00:00:00 2001 From: Theodoros Chatzigiannakis Date: Tue, 19 Feb 2019 13:50:26 +0200 Subject: [PATCH] Fix typo. (#182) * Fix typo. * Update errata.md --- errata.md | 4 ++++ src/content/1.9/function-types.tex | 2 +- 2 files changed, 5 insertions(+), 1 deletion(-) diff --git a/errata.md b/errata.md index be32669..ee8b068 100644 --- a/errata.md +++ b/errata.md @@ -8,6 +8,10 @@ * [#176](https://github.com/hmemcpy/milewski-ctfp-pdf/pull/176) - Typo (statements -> statement) +### 9. Function Types + +* [#182](https://github.com/hmemcpy/milewski-ctfp-pdf/pull/182) - Fix typo (chose -> choose) + ### 10. Natural Transformations * [#157](https://github.com/hmemcpy/milewski-ctfp-pdf/pull/157) - Adding paragraph indent diff --git a/src/content/1.9/function-types.tex b/src/content/1.9/function-types.tex index 948a0df..dfb8feb 100644 --- a/src/content/1.9/function-types.tex +++ b/src/content/1.9/function-types.tex @@ -543,7 +543,7 @@ How about a predicate that is blatantly false? For instance: if $a$ or $b$ is true then $a$ must be true. \[a \vee b \Rightarrow a\] -This is obviously wrong because you can chose an $a$ that is +This is obviously wrong because you can choose an $a$ that is false and a $b$ that is true, and that's a counter-example. Mapping this predicate into a function signature using the Curry-Howard