Web-Projects/blog-static
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix more line numbers

Browse Source 
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
This commit is contained in:
Danila Fedorin 2024-08-18 13:31:08 -10:00
parent fb071e55aa
commit 7c65afbc93
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
content/blog/03_spa_agda_fixed_height.md
View File

@ -192,7 +192,7 @@ three or more comparisons.
Thus, the above-below lattice has a length of two comparisons (or alternatively,
three elements).
{{< codelines "agda" "agda-spa/Lattice/AboveBelow.agda" 357 358 >}}
{{< codelines "agda" "agda-spa/Lattice/AboveBelow.agda" 357 363 >}}
And that's it.
@ -300,7 +300,7 @@ Having decomposed the product chain into constituent chains, we simply combine
the facts that they have to be bounded by the height of the `A` and `B` lattices,
as well as the fact that they bound the combined chain.
{{< codelines "agda" "agda-spa/Lattice/Prod.agda" 165 175 "hl_lines = 8-9" >}}
{{< codelines "agda" "agda-spa/Lattice/Prod.agda" 165 175 "hl_lines = 8-10" >}}
This completes the proof!
@ -476,7 +476,7 @@ conversion functions, in both directions:
With that, we can prove the second lattice's finite height:
{{< codelines "agda" "agda-spa/Isomorphism.agda" 66 73 >}}
{{< codelines "agda" "agda-spa/Isomorphism.agda" 66 80 >}}
The conversion functions are also not too difficult to define. I give