@@ -101,7 +101,7 @@ atoms (in this case each with an aura of `%ud`, i.e. unsigned
103To parse Hoon source into a hoon AST, use `ream` on a `cord`
103To parse Hoon source into a hoon AST, use `ream` on a `cord`
104−containing Hoon source, try the following in `dojo`:
104+containing Hoon source. Try the following in `dojo`:
107(ream ':+(12 7 %a)')
107(ream ':+(12 7 %a)')
@@ -122,10 +122,10 @@ information, a [`hoon`](#hoon) is a parsed expression (AST), and a
122and a parsed source expression; it produces a product type and an
122and a parsed source expression; it produces a product type and an
123executable formula.
123executable formula.
125−Calculating the output type from the input `hoon` is called "type
125+Calculating the output type from the input `hoon` and subject type
126−inference". If you've used another typed functional language, like
126+is called "type inference". If you've used another typed functional
127−Haskell, the Hoon compiler's type inference does the same job but
127+language, like Haskell, the Hoon compiler's type inference does the
128−with less intelligence.
128+same job but with less intelligence.
130Haskell infers backward and forward; Hoon only infers forward.
130Haskell infers backward and forward; Hoon only infers forward.
131Hoon can't figure out the type of a noun from how you use it,
131Hoon can't figure out the type of a noun from how you use it,