TSPL Assignment 3: fixes two spelling errors

This commit is contained in:
Marko Dimjašević 2019-07-04 20:51:07 +02:00 committed by Wen Kokke
parent d2145da417
commit 715e81af59

View file

@ -99,7 +99,7 @@ data Tree (A B : Set) : Set where
leaf : A → Tree A B leaf : A → Tree A B
node : Tree A B → B → Tree A B → Tree A B node : Tree A B → B → Tree A B → Tree A B
\end{code} \end{code}
Define a suitabve map operator over trees. Define a suitable map operator over trees.
\begin{code} \begin{code}
postulate postulate
map-Tree : ∀ {A B C D : Set} map-Tree : ∀ {A B C D : Set}
@ -144,7 +144,7 @@ postulate
#### Exercise `map-is-fold-Tree` #### Exercise `map-is-fold-Tree`
Demonstrate an anologue of `map-is-foldr` for the type of trees. Demonstrate an analogue of `map-is-foldr` for the type of trees.
#### Exercise `sum-downFrom` (stretch) #### Exercise `sum-downFrom` (stretch)