@@ -32,7 +32,7 @@ a few new words is a small price for avoiding this pain point.
32## Concepts
32## Concepts
34A few major Hoon concepts: `noun` (data), `nock` (interpreter),
34A few major Hoon concepts: `noun` (data), `nock` (interpreter),
35−[`mint`](#mint) (compiler), [`hoon`](#hoon) (AST node),
35+[`hoon`](#hoon) (AST node), [`mint`](#mint) (compiler),
36`gate` (function), `mold` (constructor), `core` (object), `mark`
36`gate` (function), `mold` (constructor), `core` (object), `mark`
37(protocol).
37(protocol).
@@ -117,11 +117,12 @@ Try it in the `:dojo` to get:
118### <a name="mint">`mint`</a> (compiler)
118### <a name="mint">`mint`</a> (compiler)
120−[`mint`](#mint) is the Hoon compiler. It maps a cell `[type hoon]` to a
120+[`mint`](#mint) is the Hoon compiler. It maps a cell `[type hoon]`
121−cell `[type nock]`, where a [`type`](#type) is a type, a [`hoon`](#hoon)
121+to a cell `[type nock]`, where a [`type`](#type) is type
122+information, a [`hoon`](#hoon) is a parsed expression (AST), and a
122−is a parsed expression (AST), and a `nock` is a Nock formula. `mint` accepts
123+`nock` is a Nock formula. `mint` accepts a subject type and a parsed
123−a subject type and a parsed source expression; it produces a product type
124+source expression; it produces a product type and an executable
124−and an executable formula.
125+formula.
126Calculating the output type from the input type and the source
127Calculating the output type from the input type and the source
127code is called "type inference". If you've used another typed
128code is called "type inference". If you've used another typed