Skip to content
Merged
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
8 changes: 4 additions & 4 deletions src/1Lab/Path.lagda.md
Original file line number Diff line number Diff line change
Expand Up @@ -188,9 +188,9 @@ typing rules, if that helps.

$$
\frac{
\Gamma, i : \bI \vdash e : A \quad
\Gamma \vdash e(\iZ) = a : A(\iZ) \quad
\Gamma \vdash e(\iO) = b : A(\iO) \quad
\Gamma, i : \bI \vdash e : A(i) \quad
\Gamma \vdash e[\iZ / i] = a : A(\iZ) \quad
\Gamma \vdash e[\iO / i] = b : A(\iO) \quad
}{
\Gamma \vdash (\lam{i}{e}) : \PathP{A}{a}{b}
}
Expand Down Expand Up @@ -871,7 +871,7 @@ of the path. When $i = \iZ$, we have exactly `transport refl x`; but
when $i = \iO$, the entire `transp`{.Agda} computes away, and we're left
with just $x$. In fact, the proof of `transport-refl`{.Agda} generalises
to a natural operation computing a dependent path: we call it the
*filler* of the transport, since it *fills* a line $\PathP{p}{x}{\transport{p}{x}}$.
*filler* of the transport, since it *fills* a line $\PathP{p}{x}{(\transport{p}{x})}$.

```agda
transport-filler
Expand Down
Loading