michael/csci8980-f21
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Merge branch 'master' of github.com:wenkokke/sf

Browse source 
Merging in pull requests for typo fixes.
This commit is contained in:
wadler 2018-05-14 14:16:30 -03:00
commit 5ffb1c9876
3 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
src/Connectives.lagda
View file

@ -6,7 +6,7 @@ permalink : /Connectives
This chapter introduces the basic logical connectives, by observing This chapter introduces the basic logical connectives, by observing
a correspondence between connectives of logic and data types, a correspondence between connectives of logic and data types,
a principal known as *Propositions as Types*. a principle known as *Propositions as Types*.
+ *conjunction* is *product* + *conjunction* is *product*
+ *disjunction* is *sum* + *disjunction* is *sum*

2
src/Equality.lagda
View file

@ -402,7 +402,7 @@ as earlier examples have shown.
## Extensionality {#extensionality} ## Extensionality {#extensionality}
Extensionality asserts that they only way to distinguish functions is Extensionality asserts that the only way to distinguish functions is
by applying them; if two functions applied to the same argument always by applying them; if two functions applied to the same argument always
yield the same result, then they are the same functions. It is the yield the same result, then they are the same functions. It is the
converse of `cong-app`, introduced earlier. converse of `cong-app`, introduced earlier.

4
src/Naturals.lagda
View file

@ -522,7 +522,7 @@ _ =
1 1
∎ ∎
\end{code} \end{code}
We did not use the third equation at all, but it will be required We did not use the second equation at all, but it will be required
if we try to subtract a smaller number from a larger one. if we try to subtract a smaller number from a larger one.
\begin{code} \begin{code}
_ = _ =
@ -575,7 +575,7 @@ second argument. This trick goes by the name *currying*.
Agda, like other functional languages such as Agda, like other functional languages such as
ML and Haskell, is designed to make currying easy to use. Function ML and Haskell, is designed to make currying easy to use. Function
arrows associate to the left and application associates to the right. arrows associate to the right and application associates to the left.
ℕ → ℕ → ℕ stands for ℕ → (ℕ → ℕ) ℕ → ℕ → ℕ stands for ℕ → (ℕ → ℕ)