Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/1Lab/Path.lagda.md
Original file line number Diff line number Diff line change
Expand Up @@ -1593,8 +1593,8 @@ _∙'_ {x = x} p q = transport (λ i → x ≡ q i) p
Since we know that `transport`{.Agda} reduces when applied to type
formers, the definition above is *not* neutral, even when $p$ and $q$
are variables. But what does it reduce *to*? A natural attempt would be
to say that, at a point $i : \bI$, the path $\transport{(\lam{i}. x \is
q(i))}{p}$ is $t = \transport{(\lam{i}. A)}{p(i)}$ --- i.e., transport
to say that, at a point $i : \bI$, the path $\transport{(\lam{i} x \is
q(i))}{p}$ is $t = \transport{(\lam{i} A)}{p(i)}$ --- i.e., transport
of paths is, pointwise, transport along the base. But this can't be the
case, since $t$ has endpoints

Expand Down
1 change: 1 addition & 0 deletions support/shake/app/Shake/Markdown.hs
Original file line number Diff line number Diff line change
Expand Up @@ -452,6 +452,7 @@ renderMarkdown authors references modname baseUrl digest markdown@(Pandoc (Meta
don'tFold :: Set.Set Text
don'tFold = Set.fromList
[ "`⟨" -- used in CC.Lambda
, "‶⟨" -- used in Cat.Diagram.Product.Solver
]

-- | Removes the RHS of equation reasoning steps?? IDK, ask Amelia.
Expand Down
Loading