Fix typos

- Of cause => Of course
- EOL spaces removed
- arguemnts => arguments
- communicate communicate => communicate

docs/network-spec/architecture.tex

@@ -32,9 +32,9 @@ \section{Protocols and node design}
 \end{figure}
 
 Figure~\ref{node-diagram-concurrency} illustrates design of a node. Circles
-represents threads that run one of the mini-protocols. 
+represents threads that run one of the mini-protocols.
 Each mini-protocols communicate with a remote node over the network.
-Threads communicate communicate by means of a shared mutable variables, which
+Threads communicate by means of a shared mutable variables, which
 are represented by boxes in Figure~\ref{node-diagram-concurrency}.
 We heavily use
 \href{https://en.wikipedia.org/wiki/Software_transactional_memory}{Software
@@ -71,7 +71,7 @@ \section{Congestion Control}
 its memory limits, that is there must be defined limits, breaches of which
 being treated like protocol violations.
 
-Of cause it makes no sense if the system design is robust, but so defensive
+Of course it makes no sense if the system design is robust, but so defensive
 that it fails to meet performance goals. An example would be a protocol that
 never transmits a message unless it has received an explicit ACK for the
 previous message. This approach might avoid overloading the network, but would

docs/network-spec/intro.tex

@@ -601,7 +601,7 @@ \section{Congestion Control}
 In any condition, a node must not exceed its memory limits,
 that is there must be defined limits, breaches of which being treated like protocol violations.
 
-Of cause it makes no sense if the system design is robust,
+Of course it makes no sense if the system design is robust,
 but so defensive that it fails to meet performance goals.
 An example would be a protocol that never transmits a message unless it has received an
 explicit ACK for the previous message. This approach might avoid overloading the network,

docs/network-spec/miniprotocols.tex

@@ -670,7 +670,7 @@ \subsection{State Machine}
  shall be ordered by perference (e.g. points with highest slot number
  first) and it is up to the producer to find the first intersection point
  on its chain and send it back to the consumer. If an empty list of
- points is send with \MsgFindIntersect{} the server will reply with
+ points is sent with \MsgFindIntersect{} the server will reply with
  \MsgIntersectNotFound{}.
 \item [\MsgIntersectFound{} {\boldmath $(point_{intersect} ,tip)$}]
  The producer replies with the first point of the request that is on his current chain.

ouroboros-network-framework/src/Ouroboros/Network/Protocol/Handshake.hs

@@ -75,7 +75,7 @@ tryHandshake doHandshake = do
 
 
 --
--- Record arguemnts
+-- Record arguments
 --
 
 -- | Common arguments for both 'Handshake' client & server.