michael/blog
1
0
Fork 0
Code Issues 2 Pull requests Releases Packages 1 Wiki Activity

add headers
All checks were successful
ci/woodpecker/push/woodpecker Pipeline was successful
Details

Browse source
This commit is contained in:
Michael Zhang 2023-05-08 00:39:10 -05:00
parent 2f68aae3dd
commit 7f8137b9f6
Signed by: michael
GPG key ID: BDA47A31A3C8EE6B
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
content/posts/2023-04-21-proving-true-from-false.lagda.md
View file

@ -71,7 +71,7 @@ compile.
It looks like it's not obvious to the interpreter that this statement is It looks like it's not obvious to the interpreter that this statement is
actually true. Why is that actually true. Why is that
--- ## Intuition
Well, in constructive logic / constructive type theory, proving something is Well, in constructive logic / constructive type theory, proving something is
false is actually a bit different. You see, the definition of the `not` false is actually a bit different. You see, the definition of the `not`
@ -119,7 +119,7 @@ true≢false2 : true ≢ false
true≢false2 p = transport (λ i → bool-map2 (p i)) refl true≢false2 p = transport (λ i → bool-map2 (p i)) refl
``` ```
--- ## Note on proving divergence on equivalent values
Let's make sure this isn't broken by trying to apply this to something that's Let's make sure this isn't broken by trying to apply this to something that's
actually true: actually true: