We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 8f3d7eb commit 14108d7Copy full SHA for 14108d7
1 file changed
src/plfa/part3/Compositional.lagda.md
@@ -257,7 +257,7 @@ We proceed by induction on the semantics.
257
`v′ → v ⊑ v′ → v₁`.
258
259
260
-The forward direction is proved by cases on the premise `(ℰ L ● ℰ M) γ v`.
+The backward direction is proved by cases on the premise `(ℰ L ● ℰ M) γ v`.
261
In case `v ⊑ ⊥`, we obtain `Γ ⊢ L · M ↓ ⊥` by rule `⊥-intro`.
262
Otherwise, we conclude immediately by rule `↦-elim`.
263
0 commit comments