@fraczak/k 6.1.1 → 6.1.3

package/DOCS/book/01-introduction.md

@@ -44,8 +44,8 @@ computation in a concise and understandable way.
 
 There is another concept in the language, called **filters**.
 Filters play a role in the process of reasoning about types of partial functions.
-Filters have been added to the syntax of the language as they allow explicit annotations
-of "polymorphic" expressions, i.e., expressions which make sense in different contexts.
+Filters have been added to the syntax of the language because they allow explicit annotations
+of "polymorphic" expressions, i.e., expressions that make sense in different contexts.
 Filters are similar to *type classes* in other languages.
 
 ---

package/DOCS/book/02-syntax-and-values.md

@@ -10,7 +10,7 @@ $ type_name = ...type_expression... ;
 function_name = ...expression... ;
 ```
 
-The definitions are followed in the file by the *main expression*; it represents the partial function defined by the program as a whole.
+The definitions are followed in the file by the *main expression*, which represents the partial function defined by the program as a whole.
 
 There is no syntax for values.
 Every syntactic form in an expression describes a **function** -- possibly a constant function that always returns the same value.
@@ -48,22 +48,22 @@ Every type denotes a finite tree automaton whose accepted trees are the possible
 
 ## **2.4 Projections**
 
-**Dot** notation, e.g., 
+**Dot** notation, e.g.,
 
 ```k
  . field_name
 ```
 
 is used for extracting the value of a field from a record (product type value).
-**Div** notation, e.g., 
+**Div** notation, e.g.,
 
 ```k
  / variant_name
 ```
 
 is used for asserting a particular variant of a union and extracting its value.
-Product type `{ T₁ l₁, T₂ l₂, … , Tₙ lₙ }` naturally defines `n` partial functions: `.l₁, .l₂, … , .lₙ`,  
-and union type `< T₁ l₁, T₂ l₂, … , Tₙ lₙ >` naturally defines `n` partial functions `/l₁, /l₂, … , /lₙ`.
+A product type `{ T₁ l₁, T₂ l₂, … , Tₙ lₙ }` naturally defines `n` partial functions: `.l₁, .l₂, … , .lₙ`,
+and a union type `< T₁ l₁, T₂ l₂, … , Tₙ lₙ >` naturally defines `n` partial functions `/l₁, /l₂, … , /lₙ`.
 Those partial functions are called **projections** and they constitute the basis for the definition
 of all other partial functions in the `k` language.
 
@@ -81,10 +81,10 @@ Expressions combine partial functions using the following operators:
 Parentheses around a composition may be omitted except for the empty composition `()` — the identity function.
 Empty product, `{ }`, defines a constant function (ignoring its input) returning *unit*.
 
-It is important to notice that after the three markers: `dot (.)`, `div (/)`, or `pipe (|)`, there must be a constant label literal. For that reason, it is possible and advised not to leave any blanks after the marker, e.g.:
+It is important to notice that after the three markers `dot (.)`, `div (/)`, or `pipe (|)`, there must be a constant label literal. For that reason, it is possible and recommended not to leave any blanks after the marker, e.g.:
 
 ```k-lang
-  .field /'a-tag' |"strange and long tag name ✅" 
+  .field /'a-tag' |"strange and long tag name ✅"
 ```
 
 ---
@@ -105,7 +105,7 @@ This defines a "two-variant" union type and three functions: two constants and o
 ## **2.7 Summary**
 
 * All types describe tree shapes.
-* As type expression, `{}` is the empty product type (with one value, called *unit*).
+* As a type expression, `{}` is the empty product type (with one value, called *unit*).
 * Functions, not values, are the only expressions in `k`.
 
 ---

package/DOCS/book/03-types-as-finite-automata.md

@@ -2,7 +2,7 @@
 
 ## **3.1 Motivation**
 
-A type in `k` describes a set of finite labeled trees, which can be recognized by a finite tree automaton (FTA). Equivalently, a type definition can be seen as a Context-Free Grammar (CFG), where the values of the type are the derivation trees of the grammar.
+A type in `k` describes a set of finite labeled trees, which can be recognized by a finite tree automaton (FTA). Equivalently, a type definition can be seen as a context-free grammar (CFG), where the values of the type are the derivation trees of the grammar.
 
 For example, the recursive type definition of a `list`:
 
@@ -31,7 +31,7 @@ A value of type `list` is a derivation tree of this grammar. For instance, a lis
                      -- (rule 1) --> {} |true
 ```
 
-This derivation tree corresponds to the value generated by constant function: `{ {} |true head, {} |nil tail } |cons`.
+This derivation tree corresponds to the value generated by the constant function `{ {} |true head, {} |nil tail } |cons`.
 
 Representing types as automata (or CFGs) provides each type with a well-defined structure, independent of the names used in the source code. This allows for canonical normal forms and for comparing types for equality by structure alone.
 

package/DOCS/book/04-partial-functions-and-composition.md

@@ -91,7 +91,7 @@ Here, `true_bool` and `false_bool` are constant functions. They are also **total
 
 ---
 
-## **4.6  Projection and Variant Value constructor**
+## **4.6  Projection and variant value constructors**
 
 Projection selects a field or a variant from a product or union.
 It is written with a leading dot `.` or a leading slash `/`, respectively:
@@ -141,6 +141,6 @@ The empty product `{}` is the constant function returning the unit value.
 * **Product composition** `{...}` runs functions in parallel and gathers their results.
 * **Union composition** `<...>` tries functions in order, returning the first successful result.
 * **Projections** (`.x`, `/x`) are fundamental building blocks for accessing data structures.
-* **Variant constructor** (`|tag`) allows lifting a value into a variant type value.
+* **Variant constructors** (`|tag`) allow lifting a value into a variant type value.
 
 ---

package/DOCS/book/05-typing-filters-and-normalization.md

@@ -87,13 +87,13 @@ Here:
 
 ## **5.6 Type inference and normalization**
 
-Every `k` program can be analyzed to assign an input and an output filter to every sub-expression. This process is called type inference abd normalization.
+Every `k` program can be analyzed to assign an input and an output filter to every sub-expression. This process is called type inference and normalization.
 
-Type inference and normalization proceeds as follows:
+Type inference and normalization proceed as follows:
 
 1. Build a graph of all type references appearing explicitly and implicitly in the program.
 2. Annotate each expression node with a pair of (input filter, output filter).
-3. Replace filters that match a single, concrete type with that type expression, adding any newly-discovered types to the graph.
+3. Replace filters that match a single, concrete type with that type expression, adding any newly discovered types to the graph.
 4. Repeat until a fixed point is reached and no more changes occur.
 5. Compute canonical forms for all newly introduced types.
 

package/DOCS/book/06-values-in-memory.md

@@ -138,7 +138,7 @@ The value `{}|_|0|1` or in JSON-like notation `{1:{0:{_:{}}}}` (binary 10₂ = d
 01 00 10
 ```
 
-This represents the left-most derivation of  `{}|_|0|1` from `C0`.
+This represents the leftmost derivation of `{}|_|0|1` from `C0`.
 
 #### **Prefix-free property**
 
@@ -304,7 +304,7 @@ Without DAG: Each "Engineering" string encoded separately
 - 1000 records × 30 bytes/record = 30KB
 
 With DAG: "Engineering" string shared via back-references  
-- 1 × "Engineering" (11 bytes) + 800 × back-reference (3 bytes) = 2.4KB
+- 1 × "Engineering" (11 bytes) + 800 × back-reference (3 bytes) = 2.4 KB
 - Compression ratio: ~12.5×
 ```
 
@@ -1061,7 +1061,7 @@ The final encoding strategy balances theoretical optimality with practical hardw
 - **Decode performance**: 5-10× faster than bit-level encoding  
 - **Cache behavior**: Excellent (word-aligned, sequential access)
 - **SIMD compatibility**: Yes (bulk discriminator processing)
-- **Architecture agnostic**: Optimized for x86-64 and ARM64
+- **Architecture-agnostic**: Optimized for x86-64 and ARM64
 
 **Performance characteristics**:
 

package/DOCS/book/07-the-partial-function-abi.md

@@ -3,7 +3,7 @@
 ## **7.1  Purpose**
 
 The **application binary interface (ABI)** defines how partial functions in `k` are represented and invoked at runtime.
-Its goal is to make all functions - whether user-defined or compiled - compatible with the same calling convention and data layout.
+Its goal is to make all functions, whether user-defined or compiled, compatible with the same calling convention and data layout.
 
 Every compiled `k` function receives a single argument (a runtime value) and may either produce a result or remain undefined.
 The ABI provides a uniform way to express both outcomes.

package/DOCS/book/08-operational-semantics-and-execution.md

@@ -133,7 +133,7 @@ otherwise it is an identity
 ⟨ ?F , v ⟩ ⇓ v
 ```
 
-Filters therefore act as compile time annotations for type checking only.
+Filters therefore act as compile-time annotations for type checking only.
 As operations they are identities at run time, unless they lead to fully typed
 expressions (i.e., can be replaced by a type). Their pattern information may
 still be present on the runtime value because values can carry codec patterns.

package/DOCS/book/09-compiler-architecture.md

@@ -44,7 +44,7 @@ Each stage transforms one representation of the program into another, simpler on
 
 A minimal compiler can be viewed as three connected modules:
 
-* **Front end** — reads source code, builds the AST, performs type analysis.
+* **Front end** — reads source code, builds the AST, and performs type analysis.
 * **Middle** — resolves all references, normalizes types, and simplifies expressions.
 * **Back end** — produces the executable form.
 
@@ -107,7 +107,7 @@ For `k`, the IR mirrors the structure of partial functions:
 
 | Concept in k          | IR operation                     |
 | --------------------- | -------------------------------- |
-| Projection `.x` '/x'  | `PROJECT label_id`               |
+| Projection `.x` `/x`  | `PROJECT label_id`               |
 | Composition `(f g)`   | `CALL f; CALL g`                 |
 | Union `<f,g>`         | `TRY f; IF undefined THEN TRY g` |
 | Product `{.x f, .y g}` | `PRODUCT_CALL (f, g); COMBINE`   |

package/DOCS/book/appendix-b-incorporating-external-predefined-types-and-functions.md

@@ -1,4 +1,5 @@
 # Appendix B — Incorporating External Predefined Types and Functions
+
 ## **B.1  Purpose**
 
 The k language is intentionally minimal.

package/DOCS/dependency-graph.html

@@ -0,0 +1,140 @@
+<h1 id="project-dependency-graph">Project Dependency Graph</h1>
+<p><em>Auto-generated by scripts/generate-dependency-graph.mjs.</em></p>
+<pre class="mermaid"><code>graph TD
+    classDef default fill:#fff,stroke:#333,stroke-width:2px,color:#000;
+
+    Graph_mjs[&quot;Graph.mjs (1.9 KB)&lt;br/&gt;██&quot;]
+    TypeGraph_mjs[&quot;TypeGraph.mjs (1.1 KB)&lt;br/&gt;█&quot;]
+    TypePatternGraph_mjs[&quot;TypePatternGraph.mjs (8.0 KB)&lt;br/&gt;████████&quot;]
+    Value_mjs[&quot;Value.mjs (5.4 KB)&lt;br/&gt;█████&quot;]
+    augmentation_mjs[&quot;augmentation.mjs (6.9 KB)&lt;br/&gt;███████&quot;]
+    codecs_example_pipeline_mjs[&quot;codecs/example-pipeline.mjs (5.1 KB)&lt;br/&gt;█████&quot;]
+    codecs_ieee_mjs[&quot;codecs/ieee.mjs (4.3 KB)&lt;br/&gt;████&quot;]
+    codecs_int_mjs[&quot;codecs/int.mjs (3.5 KB)&lt;br/&gt;████&quot;]
+    codecs_json_codec_mjs[&quot;codecs/json-codec.mjs (6.2 KB)&lt;br/&gt;██████&quot;]
+    codecs_json_mjs[&quot;codecs/json.mjs (1.5 KB)&lt;br/&gt;██&quot;]
+    codecs_k_parse_mjs[&quot;codecs/k-parse.mjs (3.0 KB)&lt;br/&gt;███&quot;]
+    codecs_k_print_mjs[&quot;codecs/k-print.mjs (1.5 KB)&lt;br/&gt;██&quot;]
+    codecs_runtime_codec_mjs[&quot;codecs/runtime/codec.mjs (25.7 KB)&lt;br/&gt;████████████████████&quot;]
+    codecs_runtime_ieee_pattern_mjs[&quot;codecs/runtime/ieee-pattern.mjs (1.1 KB)&lt;br/&gt;█&quot;]
+    codecs_runtime_pattern_json_mjs[&quot;codecs/runtime/pattern-json.mjs (3.5 KB)&lt;br/&gt;███&quot;]
+    codecs_runtime_prefix_codec_mjs[&quot;codecs/runtime/prefix-codec.mjs (13.7 KB)&lt;br/&gt;██████████████&quot;]
+    codecs_runtime_show_value_mjs[&quot;codecs/runtime/show-value.mjs (2.1 KB)&lt;br/&gt;██&quot;]
+    codecs_runtime_test_codec_mjs[&quot;codecs/runtime/test-codec.mjs (3.0 KB)&lt;br/&gt;███&quot;]
+    codecs_runtime_typeFromValue_mjs[&quot;codecs/runtime/typeFromValue.mjs (0.9 KB)&lt;br/&gt;█&quot;]
+    codecs_runtime_unicode_string_mjs[&quot;codecs/runtime/unicode-string.mjs (7.5 KB)&lt;br/&gt;████████&quot;]
+    codecs_show_mjs[&quot;codecs/show.mjs (1.5 KB)&lt;br/&gt;██&quot;]
+    codecs_string_codec_mjs[&quot;codecs/string-codec.mjs (4.5 KB)&lt;br/&gt;█████&quot;]
+    codecs_unit_mjs[&quot;codecs/unit.mjs (1.6 KB)&lt;br/&gt;██&quot;]
+    codecs_utf16_mjs[&quot;codecs/utf16.mjs (2.2 KB)&lt;br/&gt;██&quot;]
+    codecs_utf8_mjs[&quot;codecs/utf8.mjs (1.3 KB)&lt;br/&gt;█&quot;]
+    codes_mjs[&quot;codes.mjs (9.9 KB)&lt;br/&gt;██████████&quot;]
+    compiler_mjs[&quot;compiler.mjs (3.9 KB)&lt;br/&gt;████&quot;]
+    convergence_mjs[&quot;convergence.mjs (6.5 KB)&lt;br/&gt;██████&quot;]
+    export_mjs[&quot;export.mjs (5.2 KB)&lt;br/&gt;█████&quot;]
+    hash_mjs[&quot;hash.mjs (1.1 KB)&lt;br/&gt;█&quot;]
+    index_mjs[&quot;index.mjs (1.9 KB)&lt;br/&gt;██&quot;]
+    k_mjs[&quot;k.mjs (2.7 KB)&lt;br/&gt;███&quot;]
+    object_mjs[&quot;object.mjs (26.3 KB)&lt;br/&gt;████████████████████&quot;]
+    pretty_mjs[&quot;pretty.mjs (5.6 KB)&lt;br/&gt;██████&quot;]
+    repl_mjs[&quot;repl.mjs (29.3 KB)&lt;br/&gt;████████████████████&quot;]
+    run_mjs[&quot;run.mjs (14.4 KB)&lt;br/&gt;██████████████&quot;]
+    symbol_table_mjs[&quot;symbol-table.mjs (2.7 KB)&lt;br/&gt;███&quot;]
+    typing_mjs[&quot;typing.mjs (4.9 KB)&lt;br/&gt;█████&quot;]
+    unification_mjs[&quot;unification.mjs (5.4 KB)&lt;br/&gt;█████&quot;]
+    valueIO_mjs[&quot;valueIO.mjs (1.8 KB)&lt;br/&gt;██&quot;]
+
+    TypePatternGraph_mjs --&gt; Graph_mjs
+    TypePatternGraph_mjs --&gt; unification_mjs
+    TypePatternGraph_mjs --&gt; TypeGraph_mjs
+    augmentation_mjs --&gt; codes_mjs
+    codecs_example_pipeline_mjs --&gt; codecs_runtime_codec_mjs
+    codecs_example_pipeline_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    codecs_example_pipeline_mjs --&gt; codecs_runtime_pattern_json_mjs
+    codecs_example_pipeline_mjs --&gt; Value_mjs
+    codecs_example_pipeline_mjs --&gt; hash_mjs
+    codecs_ieee_mjs --&gt; Value_mjs
+    codecs_ieee_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    codecs_ieee_mjs --&gt; codecs_runtime_ieee_pattern_mjs
+    codecs_int_mjs --&gt; Value_mjs
+    codecs_int_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    codecs_json_codec_mjs --&gt; Value_mjs
+    codecs_json_codec_mjs --&gt; codecs_string_codec_mjs
+    codecs_json_codec_mjs --&gt; codecs_runtime_ieee_pattern_mjs
+    codecs_json_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    codecs_json_mjs --&gt; codecs_json_codec_mjs
+    codecs_k_parse_mjs --&gt; index_mjs
+    codecs_k_parse_mjs --&gt; valueIO_mjs
+    codecs_k_parse_mjs --&gt; codecs_runtime_codec_mjs
+    codecs_k_parse_mjs --&gt; codecs_runtime_pattern_json_mjs
+    codecs_k_parse_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    codecs_k_print_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    codecs_runtime_codec_mjs --&gt; Value_mjs
+    codecs_runtime_codec_mjs --&gt; TypePatternGraph_mjs
+    codecs_runtime_codec_mjs --&gt; typing_mjs
+    codecs_runtime_codec_mjs --&gt; codes_mjs
+    codecs_runtime_codec_mjs --&gt; codecs_runtime_pattern_json_mjs
+    codecs_runtime_ieee_pattern_mjs --&gt; codes_mjs
+    codecs_runtime_ieee_pattern_mjs --&gt; codecs_runtime_codec_mjs
+    codecs_runtime_ieee_pattern_mjs --&gt; codecs_runtime_pattern_json_mjs
+    codecs_runtime_prefix_codec_mjs --&gt; Value_mjs
+    codecs_runtime_prefix_codec_mjs --&gt; codecs_runtime_codec_mjs
+    codecs_runtime_prefix_codec_mjs --&gt; codecs_runtime_pattern_json_mjs
+    codecs_runtime_prefix_codec_mjs --&gt; codecs_runtime_unicode_string_mjs
+    codecs_runtime_show_value_mjs --&gt; Value_mjs
+    codecs_runtime_test_codec_mjs --&gt; codecs_runtime_codec_mjs
+    codecs_runtime_test_codec_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    codecs_runtime_test_codec_mjs --&gt; codecs_runtime_pattern_json_mjs
+    codecs_runtime_test_codec_mjs --&gt; Value_mjs
+    codecs_runtime_test_codec_mjs --&gt; hash_mjs
+    codecs_runtime_typeFromValue_mjs --&gt; Value_mjs
+    codecs_runtime_unicode_string_mjs --&gt; Value_mjs
+    codecs_show_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    codecs_show_mjs --&gt; codecs_runtime_show_value_mjs
+    codecs_string_codec_mjs --&gt; codecs_runtime_codec_mjs
+    codecs_string_codec_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    codecs_string_codec_mjs --&gt; codecs_runtime_pattern_json_mjs
+    codecs_string_codec_mjs --&gt; codecs_runtime_unicode_string_mjs
+    codecs_unit_mjs --&gt; Value_mjs
+    codecs_unit_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    codecs_utf16_mjs --&gt; codecs_string_codec_mjs
+    codecs_utf8_mjs --&gt; codecs_string_codec_mjs
+    codes_mjs --&gt; hash_mjs
+    compiler_mjs --&gt; hash_mjs
+    compiler_mjs --&gt; TypePatternGraph_mjs
+    compiler_mjs --&gt; Graph_mjs
+    compiler_mjs --&gt; codes_mjs
+    compiler_mjs --&gt; augmentation_mjs
+    compiler_mjs --&gt; export_mjs
+    compiler_mjs --&gt; convergence_mjs
+    convergence_mjs --&gt; pretty_mjs
+    convergence_mjs --&gt; typing_mjs
+    export_mjs --&gt; hash_mjs
+    export_mjs --&gt; pretty_mjs
+    index_mjs --&gt; Value_mjs
+    index_mjs --&gt; valueIO_mjs
+    index_mjs --&gt; compiler_mjs
+    index_mjs --&gt; run_mjs
+    index_mjs --&gt; codes_mjs
+    k_mjs --&gt; index_mjs
+    k_mjs --&gt; codecs_runtime_prefix_codec_mjs
+    k_mjs --&gt; object_mjs
+    object_mjs --&gt; index_mjs
+    object_mjs --&gt; run_mjs
+    object_mjs --&gt; codes_mjs
+    object_mjs --&gt; TypePatternGraph_mjs
+    object_mjs --&gt; pretty_mjs
+    pretty_mjs --&gt; TypePatternGraph_mjs
+    repl_mjs --&gt; index_mjs
+    repl_mjs --&gt; run_mjs
+    repl_mjs --&gt; codes_mjs
+    repl_mjs --&gt; Value_mjs
+    repl_mjs --&gt; pretty_mjs
+    repl_mjs --&gt; object_mjs
+    repl_mjs --&gt; codecs_runtime_show_value_mjs
+    run_mjs --&gt; Value_mjs
+    run_mjs --&gt; codecs_runtime_codec_mjs
+    run_mjs --&gt; codecs_runtime_pattern_json_mjs
+    symbol_table_mjs --&gt; hash_mjs
+    typing_mjs --&gt; TypePatternGraph_mjs
+    valueIO_mjs --&gt; Value_mjs</code></pre>

package/DOCS/dependency-graph.md

@@ -0,0 +1,144 @@
+# Project Dependency Graph
+
+_Auto-generated by scripts/generate-dependency-graph.mjs._
+
+```mermaid
+graph TD
+    classDef default fill:#fff,stroke:#333,stroke-width:2px,color:#000;
+
+    Graph_mjs["Graph.mjs (1.9 KB)<br/>██"]
+    TypeGraph_mjs["TypeGraph.mjs (1.1 KB)<br/>█"]
+    TypePatternGraph_mjs["TypePatternGraph.mjs (8.0 KB)<br/>████████"]
+    Value_mjs["Value.mjs (5.4 KB)<br/>█████"]
+    augmentation_mjs["augmentation.mjs (6.9 KB)<br/>███████"]
+    codecs_example_pipeline_mjs["codecs/example-pipeline.mjs (5.1 KB)<br/>█████"]
+    codecs_ieee_mjs["codecs/ieee.mjs (4.3 KB)<br/>████"]
+    codecs_int_mjs["codecs/int.mjs (3.5 KB)<br/>████"]
+    codecs_json_codec_mjs["codecs/json-codec.mjs (6.2 KB)<br/>██████"]
+    codecs_json_mjs["codecs/json.mjs (1.5 KB)<br/>██"]
+    codecs_k_parse_mjs["codecs/k-parse.mjs (3.0 KB)<br/>███"]
+    codecs_k_print_mjs["codecs/k-print.mjs (1.5 KB)<br/>██"]
+    codecs_runtime_codec_mjs["codecs/runtime/codec.mjs (25.7 KB)<br/>████████████████████"]
+    codecs_runtime_ieee_pattern_mjs["codecs/runtime/ieee-pattern.mjs (1.1 KB)<br/>█"]
+    codecs_runtime_pattern_json_mjs["codecs/runtime/pattern-json.mjs (3.5 KB)<br/>███"]
+    codecs_runtime_prefix_codec_mjs["codecs/runtime/prefix-codec.mjs (13.7 KB)<br/>██████████████"]
+    codecs_runtime_show_value_mjs["codecs/runtime/show-value.mjs (2.1 KB)<br/>██"]
+    codecs_runtime_test_codec_mjs["codecs/runtime/test-codec.mjs (3.0 KB)<br/>███"]
+    codecs_runtime_typeFromValue_mjs["codecs/runtime/typeFromValue.mjs (0.9 KB)<br/>█"]
+    codecs_runtime_unicode_string_mjs["codecs/runtime/unicode-string.mjs (7.5 KB)<br/>████████"]
+    codecs_show_mjs["codecs/show.mjs (1.5 KB)<br/>██"]
+    codecs_string_codec_mjs["codecs/string-codec.mjs (4.5 KB)<br/>█████"]
+    codecs_unit_mjs["codecs/unit.mjs (1.6 KB)<br/>██"]
+    codecs_utf16_mjs["codecs/utf16.mjs (2.2 KB)<br/>██"]
+    codecs_utf8_mjs["codecs/utf8.mjs (1.3 KB)<br/>█"]
+    codes_mjs["codes.mjs (9.9 KB)<br/>██████████"]
+    compiler_mjs["compiler.mjs (3.9 KB)<br/>████"]
+    convergence_mjs["convergence.mjs (6.5 KB)<br/>██████"]
+    export_mjs["export.mjs (5.2 KB)<br/>█████"]
+    hash_mjs["hash.mjs (1.1 KB)<br/>█"]
+    index_mjs["index.mjs (1.9 KB)<br/>██"]
+    k_mjs["k.mjs (2.7 KB)<br/>███"]
+    object_mjs["object.mjs (26.3 KB)<br/>████████████████████"]
+    pretty_mjs["pretty.mjs (5.6 KB)<br/>██████"]
+    repl_mjs["repl.mjs (29.3 KB)<br/>████████████████████"]
+    run_mjs["run.mjs (14.4 KB)<br/>██████████████"]
+    symbol_table_mjs["symbol-table.mjs (2.7 KB)<br/>███"]
+    typing_mjs["typing.mjs (4.9 KB)<br/>█████"]
+    unification_mjs["unification.mjs (5.4 KB)<br/>█████"]
+    valueIO_mjs["valueIO.mjs (1.8 KB)<br/>██"]
+
+    TypePatternGraph_mjs --> Graph_mjs
+    TypePatternGraph_mjs --> unification_mjs
+    TypePatternGraph_mjs --> TypeGraph_mjs
+    augmentation_mjs --> codes_mjs
+    codecs_example_pipeline_mjs --> codecs_runtime_codec_mjs
+    codecs_example_pipeline_mjs --> codecs_runtime_prefix_codec_mjs
+    codecs_example_pipeline_mjs --> codecs_runtime_pattern_json_mjs
+    codecs_example_pipeline_mjs --> Value_mjs
+    codecs_example_pipeline_mjs --> hash_mjs
+    codecs_ieee_mjs --> Value_mjs
+    codecs_ieee_mjs --> codecs_runtime_prefix_codec_mjs
+    codecs_ieee_mjs --> codecs_runtime_ieee_pattern_mjs
+    codecs_int_mjs --> Value_mjs
+    codecs_int_mjs --> codecs_runtime_prefix_codec_mjs
+    codecs_json_codec_mjs --> Value_mjs
+    codecs_json_codec_mjs --> codecs_string_codec_mjs
+    codecs_json_codec_mjs --> codecs_runtime_ieee_pattern_mjs
+    codecs_json_mjs --> codecs_runtime_prefix_codec_mjs
+    codecs_json_mjs --> codecs_json_codec_mjs
+    codecs_k_parse_mjs --> index_mjs
+    codecs_k_parse_mjs --> valueIO_mjs
+    codecs_k_parse_mjs --> codecs_runtime_codec_mjs
+    codecs_k_parse_mjs --> codecs_runtime_pattern_json_mjs
+    codecs_k_parse_mjs --> codecs_runtime_prefix_codec_mjs
+    codecs_k_print_mjs --> codecs_runtime_prefix_codec_mjs
+    codecs_runtime_codec_mjs --> Value_mjs
+    codecs_runtime_codec_mjs --> TypePatternGraph_mjs
+    codecs_runtime_codec_mjs --> typing_mjs
+    codecs_runtime_codec_mjs --> codes_mjs
+    codecs_runtime_codec_mjs --> codecs_runtime_pattern_json_mjs
+    codecs_runtime_ieee_pattern_mjs --> codes_mjs
+    codecs_runtime_ieee_pattern_mjs --> codecs_runtime_codec_mjs
+    codecs_runtime_ieee_pattern_mjs --> codecs_runtime_pattern_json_mjs
+    codecs_runtime_prefix_codec_mjs --> Value_mjs
+    codecs_runtime_prefix_codec_mjs --> codecs_runtime_codec_mjs
+    codecs_runtime_prefix_codec_mjs --> codecs_runtime_pattern_json_mjs
+    codecs_runtime_prefix_codec_mjs --> codecs_runtime_unicode_string_mjs
+    codecs_runtime_show_value_mjs --> Value_mjs
+    codecs_runtime_test_codec_mjs --> codecs_runtime_codec_mjs
+    codecs_runtime_test_codec_mjs --> codecs_runtime_prefix_codec_mjs
+    codecs_runtime_test_codec_mjs --> codecs_runtime_pattern_json_mjs
+    codecs_runtime_test_codec_mjs --> Value_mjs
+    codecs_runtime_test_codec_mjs --> hash_mjs
+    codecs_runtime_typeFromValue_mjs --> Value_mjs
+    codecs_runtime_unicode_string_mjs --> Value_mjs
+    codecs_show_mjs --> codecs_runtime_prefix_codec_mjs
+    codecs_show_mjs --> codecs_runtime_show_value_mjs
+    codecs_string_codec_mjs --> codecs_runtime_codec_mjs
+    codecs_string_codec_mjs --> codecs_runtime_prefix_codec_mjs
+    codecs_string_codec_mjs --> codecs_runtime_pattern_json_mjs
+    codecs_string_codec_mjs --> codecs_runtime_unicode_string_mjs
+    codecs_unit_mjs --> Value_mjs
+    codecs_unit_mjs --> codecs_runtime_prefix_codec_mjs
+    codecs_utf16_mjs --> codecs_string_codec_mjs
+    codecs_utf8_mjs --> codecs_string_codec_mjs
+    codes_mjs --> hash_mjs
+    compiler_mjs --> hash_mjs
+    compiler_mjs --> TypePatternGraph_mjs
+    compiler_mjs --> Graph_mjs
+    compiler_mjs --> codes_mjs
+    compiler_mjs --> augmentation_mjs
+    compiler_mjs --> export_mjs
+    compiler_mjs --> convergence_mjs
+    convergence_mjs --> pretty_mjs
+    convergence_mjs --> typing_mjs
+    export_mjs --> hash_mjs
+    export_mjs --> pretty_mjs
+    index_mjs --> Value_mjs
+    index_mjs --> valueIO_mjs
+    index_mjs --> compiler_mjs
+    index_mjs --> run_mjs
+    index_mjs --> codes_mjs
+    k_mjs --> index_mjs
+    k_mjs --> codecs_runtime_prefix_codec_mjs
+    k_mjs --> object_mjs
+    object_mjs --> index_mjs
+    object_mjs --> run_mjs
+    object_mjs --> codes_mjs
+    object_mjs --> TypePatternGraph_mjs
+    object_mjs --> pretty_mjs
+    pretty_mjs --> TypePatternGraph_mjs
+    repl_mjs --> index_mjs
+    repl_mjs --> run_mjs
+    repl_mjs --> codes_mjs
+    repl_mjs --> Value_mjs
+    repl_mjs --> pretty_mjs
+    repl_mjs --> object_mjs
+    repl_mjs --> codecs_runtime_show_value_mjs
+    run_mjs --> Value_mjs
+    run_mjs --> codecs_runtime_codec_mjs
+    run_mjs --> codecs_runtime_pattern_json_mjs
+    symbol_table_mjs --> hash_mjs
+    typing_mjs --> TypePatternGraph_mjs
+    valueIO_mjs --> Value_mjs
+```