bd37989...master · jibb

git.iko.soy/jibb

README.md+5−3

since splitsnapshots

@@ -16,7 +16,7 @@ Milestone 1 of the doc's eight, the parser and the `%jibb` mark, is done; milest

17## Golden tests

19−Each case, `tests/golden/<case>/`, holds `source.jibb`, `about.txt` (where it comes from, what it tests, the expected outcome), and the expected outputs: `tokens.txt` from the layout pass and `tree.txt` from the parser. A file holds the output plus one trailing newline. A case may also have a `path.txt` specifying its logical `/ui/.../*.jibb` path. An `expect-types:` line in `about.txt` opts it into the provisional `golden-types` checker output in `types.txt`; `--update` creates it. A case can select Hoon molds in `imports.txt` and provide each module in `sur/<module>.txt`, as described in [docs/development.md](docs/development.md).

19+Each case, `tests/golden/<case>/`, holds `source.jibb`, `about.txt` (where it comes from, what it tests, the expected outcome), and the expected outputs: `tokens.txt` from the layout pass and `tree.txt` from the parser. A file holds the output plus one trailing newline. A case may also have a `path.txt` specifying its logical `/ui/.../*.jibb` path. An `expect-types:` line in `about.txt` opts it into the provisional `golden-types` checker output in `types.txt`; `--update` creates it. A case can select Hoon molds in `imports.txt` and provide each module in `sur/<module>.txt`, or select marks in `marks.txt` and provide their source in `mar/<name>.txt`. `modules.txt` selects Jibb source fixtures; their trees go in `module-trees.txt`, and the partial checker can resolve a subset of library imports. See [docs/development.md](docs/development.md).

21Run them without a ship. This needs `urbit` on PATH and Python 3.

@@ -42,7 +42,9 @@ tools/hoon '(golden /a/b/jibb (crip "++ main view"))'

42tools/hoon --raw --cord src=tests/golden/foo/source.jibb 'tree:(golden /a/b/jibb src)'

43```

45−`tools/testdata/selftest` tests both tools against a stub library, and `tools/doc-blocks` against Markdown it writes. `tools/importer-test` compares the partial Hoon importer's fixture projections against their golden file. `tools/type-import-test` checks the importer/checker bridge under eval; the ship suite runs the same fixture.

45+`tools/testdata/selftest` tests both tools against a stub library, and `tools/doc-blocks` against Markdown it writes. `tools/importer-test` compares the partial Hoon importer's fixture projections against their golden file. `tools/type-import-test`, `tools/type-import-overlap-test`, `tools/type-import-structural-test`, `tools/type-union-source-test`, `tools/type-union-alias-overlap-test`, `tools/type-full-overlap-test`, `tools/type-generic-recursion-test`, `tools/type-generic-construction-test`, `tools/type-generic-pattern-test`, `tools/type-deferred-test`, `tools/type-deferred-prepared-test`, `tools/type-deferred-resolver-test`, `tools/type-deferred-context-test`, `tools/type-empty-test`, `tools/type-cell-branch-test`, `tools/type-tlon-test`, `tools/type-mark-test`, `tools/type-poke-test` and `tools/type-api-paths-test` check importer/checker, prelude and partial API path analysis boundaries under eval; the ship suite runs the same fixtures.

46+

47+The focused `tools/type-program-main-test` checks the narrow closed, subscription-free `main` slice and its shared fake-ship fixture. `tools/type-program-init-test` checks transactional initializer recovery for a synthetic direct program, including exact exported and imported types and rejection boundaries. `tools/type-program-watch-test` uses the real todo readers with synthetic program components to check one direct request value against merged API-source evidence and reject hand-built, indirect, parameterized, diff and ambiguous subscriptions. These are static checks only: they do not run an island or establish runtime watching.

47### The doc's examples

49### The doc's examples

@@ -86,7 +88,7 @@ A sync with nothing to commit takes about 2 s. A commit adds 3 to 10 s, and 300

87`tools/ship check-commit` proves that `|commit` stores `.jibb` files. It syncs `my-app`, reads every `/ui` file back with `%cx`, byte for byte, and converts `%jibb` to `%mime` and `%txt` and back. It commits half-written files, then deletes them. It merges a file that two desks changed on different lines, and checks that changes to the same line conflict. It can be rerun, and it leaves the two scratch desks it merges with (`%jibb-check-ours` and `%jibb-check-theirs`) holding only what `|new-desk` gives, unmounted.

89`tools/ship check-commit` proves that `|commit` stores `.jibb` files. It syncs `my-app`, reads every `/ui` file back with `%cx`, byte for byte, and converts `%jibb` to `%mime` and `%txt` and back. It commits half-written files, then deletes them. It merges a file that two desks changed on different lines, and checks that changes to the same line conflict. It can be rerun, and it leaves the two scratch desks it merges with (`%jibb-check-ours` and `%jibb-check-theirs`) holding only what `|new-desk` gives, unmounted.

89−`tools/clay-fixtures` syncs `my-app`, builds its example `/sur` files and marks through Clay, and checks selected molds read from the compiled `/sur` type graphs. It compares both results with golden files under `tests/clay-fixtures/`.

91+`tools/clay-fixtures` syncs `my-app`, builds its example `/sur` files and marks through Clay, and checks selected types read from the compiled graphs and passed to the partial checker. It compares the results with golden files under `tests/clay-fixtures/`.

91For anything else:

93For anything else:

docs/compiler.md+109−3

@@ -56,9 +56,91 @@ The core is split into chapters, `+| %name`, in this order:

56| `%span-check` | `+check-spans`, which `+golden` runs on every tree, and `+check-spans-test` |

57| `%type-inference` | The initial inference fragment and its unification helpers; not yet a module type checker |

59−The inference fragment supports fixed auras, unrestricted `@`, one-way widening into it and toward aura-family ancestors, generic variables and gates, unfaced cells, a two-binder cell pattern, a complete two-arm loobean branch, closed local mold aliases and acyclic forward value references. It instantiates generalized top-level definitions when they are used. It can infer and generalize atom constraints arising from explicit capitals or bare sample binders, preserve those constraints through aliases, instantiate them independently, and print multiple constraints. Numeric defaulting and other constraint cases remain incomplete. It does not yet check a module, its imports, faces, general patterns, deferred constraints, recursive or generic molds, dependency cycles or most errors with both conflicting excerpts. Definite cast and call mismatches, incompatible branches and overlapping union cases report both sites and excerpts. Concrete branch results can join at an explicitly present parent aura or `@`; function compatibility involving nested `@` and variable-dependent joins remain unsupported except for equal types. The current dependency pass can take quadratic time on long forward chains; the milestone's speed target remains unverified. A separate conservative pass reports unions whose cases are provably disjoint or overlapping and leaves other cases unresolved; it does not claim the mold is checked. Unsupported forms are reported as such, and the partial output says the module has not been checked.

59+The inference fragment supports fixed auras, unrestricted `@`, one-way widening into it and toward aura-family ancestors, generic variables and gates, faced and unfaced cells, cell sample binders, known record field reads, a cell pattern of two or more binders, a complete two-arm loobean branch, a complete two-arm unit-shaped branch, closed local mold aliases and acyclic forward value references. For a supported single syntactic top-level recursive gate, the checker infers the sample first and uses that exact sample, including its field faces, in a monomorphic self placeholder. The completed body must unify with the placeholder before the gate is generalized; incompatible recursive arguments can report the call and argument sites. Uses of generalized top-level definitions instantiate their schemes independently. For a complete loobean branch with one direct self-call arm, the checker can infer the other arm independently and use its closed, fully resolved type to seed the recursive result; it then checks the whole body. Open or pending base types do not seed the result, and other branch shapes still depend on the existing partial inference. A supported single local recursive gate also uses a monomorphic self reference while its body is checked, then generalizes variables free of its enclosing environment; captured variables remain shared. Acyclic local value definitions can refer forward. The checker collects written capitals per `++` before inference, excluding nested definitions: a capital used in an enclosing definition is shared with its locals, even when written later, while a capital introduced only in a local definition is generalized there. Sibling locals can introduce independent capitals with the same spelling; generic mold parameters keep their own scope. Top-level groups of syntactic gates are inferred together with monomorphic placeholders and shared substitutions, then generalized only after the whole group checks; downstream uses and library interfaces instantiate those schemes independently. A dependency graph identifies groups with two iterative depth-first passes; its conservative local-reference edges can reject otherwise valid programs. Supported local mutually recursive gate groups also use shared monomorphic placeholders and generalize only after the group checks, preserving captured outer variables. Some proven non-gate value cycles are diagnosed; other mixed gate/value cycles, polymorphic recursion, unresolved literal constraints and unresolved branch joins remain unsupported. Acyclic simple local mold aliases can also refer forward, and are scoped to the body, not its gate's sample. Nonrecursive generic aliases of supported molds can be applied at exact arity, including locally and through library interfaces; their parameters are lexical. Closed, provably disjoint nonrecursive unions and tagged single-case molds support contextual term values, `~` and `|=%tag` constructors. Literal heads compare by their runtime noun, so `|=%$` can construct an explicit null-, loobean-zero- or term-zero-headed case. Equal heads with distinct payloads can be selected when exactly one payload fit is proven; unknown or ambiguous alternatives remain unsupported. Unresolved tags and nulls remain pending, with distinct partial-inference diagnostics. Nonrecursive top-level generic union molds with provably disjoint cases also support contextual tags and constructors at exact arity; their arguments are retained through generalization and supported library interfaces. Nonrecursive generic aliases can reorder, repeat or omit parameters while preserving a supported union’s origin, including through local scopes and library interfaces. Generic unions declared directly inside a body and recursive molds outside the source-proven slices described below remain unsupported. A directly known named union can instantiate an unconstrained generic gate sample while retaining its origin, generic arguments and faces. Unnamed, pending-tag, recursive, unknown-atom and variable-bound union origins remain unsupported. A value with type variable `A` can fit a field whose type is that same `A`, including in generic union payloads and nested or repeated record fields. A differing-variable face constraint remains unsupported. When inference forces two distinct explicitly written capitals equal, it reports both source sites; forcing a capital to a concrete type remains unsupported in this fragment. It can infer and generalize atom constraints arising from explicit capitals or bare sample binders, preserve those constraints through aliases, instantiate them independently, and print multiple constraints. Unresolved decimal variables default to `@ud` for inferred types without gates; defaulting inside gate types and other constraint cases remain incomplete. It does not yet check a module, complete imports, general patterns, general deferred constraints, recursive molds, dependency cycles or most errors with both conflicting excerpts. Definite cast and call mismatches, incompatible branches and overlapping union cases report both sites and excerpts. Concrete branch results can join at an explicitly present parent aura or `@`. Some known tuple and record positions acquire matching faces; other variable-dependent face merges, general branch tag context and ambiguous call-result propagation remain unsupported; function compatibility involving nested `@` and variable-dependent joins remain unsupported except for equal types and the source-bound gate-sample proof below. For a single recursive gate outside a group, the reporting path repeats inference rather than instantiating its generalized interface inside its own body; a group report uses its stored schemes. This adds work, and the current dependency pass can take quadratic time on long forward chains; the milestone's speed target remains unverified. A separate conservative pass reports unions whose cases are provably disjoint or overlapping and leaves other cases unresolved; it does not claim the mold is checked. Unsupported forms are reported as such, and the partial output says the module has not been checked.

61−The separate `jibb-dev/lib/jibb-import.hoon` is an unfinished reader for selected Hoon type graphs. It handles named recursion, nested map, set, queue, list, unit, jar and jug arguments, direct ordered maps, and direct `$^` unions whose source branches can be proved disjoint. It also reads ordered map fields in records when the map arguments are syntactically fixed atom molds and other fields are fixed atom molds or standard collections of static atom molds. Collection names must not be shadowed. The reader can also import a nonrecursive mark door sample, removing its outer sample face and validating its build subject; recursive mark samples fail closed until their source modules are tracked. Nested `$^`, other nested ordered maps, general source-level disjointness and complete integration with the checker remain unfinished. `+golden-types-imports` can consume fixed-aura atoms and unfaced cells from caller-supplied reader results for declared `/-` imports; `+golden-types-with-marks` accepts those same shapes from declared mark imports in a separate list. Other forms remain unsupported. Its disjointness proof is conservative and can reject a valid union it cannot prove disjoint. Collection recognition requires the originating `/sur` core. The reader validates direct zuse subjects and Ford subjects consisting of faced imported cores and a validated tail, checking imported cores transitively; it rejects shadowed names, inconsistent core subjects and other subject shapes. Recursive results with Ford imports are rejected until references retain their source module. Its fixtures include three real Tlon files; `tools/importer-test` compares the internal projection under eval, and the ship test compares the same golden output. `tools/type-import-test` and `tools/type-mark-test` compare bridge reports under eval and on the ship. `tools/clay-fixtures` also passes Clay-built `/sur` molds and mark samples through the Clay-built importer and partial checker.

61+A direct unshadowed prelude call can use checked source layouts when a positional argument is a directly named, already inferred root gate. For two-slot function samples, the checker can match a named update against an unnamed generic gate sample without confusing a binder face with a nested record face. Both explicitly named slots must agree; source boundaries are evidence for this fit, not a call-arity rule. The source gate and prelude annotation must be available from their checked bindings. Local or dynamic gates, aliases without direct evidence, recursive or SCC placeholder bodies, other sample shapes and unresolved call-sample variables remain unsupported by this proof. Ordinary inference remains the fallback.

62+

63+The checker retains a per-analysis index of finalized root gates and a prelude source table bound to the entire trusted prepared interface. A dependency screen avoids building the table when the root cannot use it; changing the interface invalidates it. The host remains responsible for supplying a prepared interface paired with its source. The matcher checks each slot and product in both directions with a shared substitution. Before returning its tentative proof it requires both complete call samples to normalize to closed, tag-free types, then repeats every slot check and requires the substitution and fresh-ID counter to remain unchanged. This keeps later argument or enclosing constraints from invalidating an earlier face check, and preserves pending constraints, capital checks and projection evidence. These scans and the bounded second proof add work; they do not establish a global linear-time bound.

64+

65+Before the empty-capital optimization below, single sequential eval runs including startup showed that 2,000 ordinary gates used 70.20 seconds of user CPU at baseline and 70.64 seconds with the cached source table. Fifty unsupported eligible scalar-slot calls used 24.75 and 25.71 seconds, while fifty function-slot failures used 24.15 and 25.36 seconds. Fifty successful calls took 26.56 seconds before the final stability replay and 26.99 seconds with it. These are synthetic measurements, not production performance limits.

66+

67+Restricted-number promotion only applies to written capital variables. If none are present, it returns immediately instead of traversing the environment. In one startup-inclusive pair of runs on 2,000 independent gates, output was byte-identical and user CPU fell from 71.67 to 38.26 seconds; wall time was 72.80 versus 51.66 seconds while other checks were running. This does not establish a bound for dependent modules or a complete-checker benchmark.

68+

69+A bounded source proof can also establish distinct literal heads when a union case is a one-hop application of a uniquely resolved local generic mold. It compares literal runtime nouns and checks the original mold normally before publishing an interface. The same source proof improves the partial report, which still says the mold is not checked. The new proof declines nested or qualified applications, opaque references, recursive-index states, holes and deferred obligations; other valid unions can remain unsupported. A 256-node source budget and a separate 256-entry inherited-state budget apply per attempt. They do not bound the existing pairwise union pass, parsing, atom or name sizes, or downstream checking. Prepared interfaces and inference state remain trusted inputs. `tools/type-union-source-test` and the shared ship guard exercise source resolution, reporting, rollback and these bounds. A separate positive witness can identify overlap in two-field, literal-headed cases when a unique one-hop local, one-parameter generic alias is applied to a concrete primitive payload. It compares the literal noun values and proves the payloads have a shared noun, so an empty or unknown payload is not a witness. The partial report identifies both original case sites. `infer-jibb-file-detailed` returns structured overlap evidence for the first failed mold, including the originating path, exact source, mold name and both case spans. Ordinary Jibb imports preserve a child’s evidence through source and cache checks; the legacy `infer-jibb-file` API remains a text-result adapter and renders both excerpts. Specialized API and prepared-prelude paths retain their existing generic or text-only error boundaries. This witness uses a shared 256-node source/pair budget per attempt; generic-wrapper parameter validation has a separate 256-entry cap. An unsupported earlier case may hide a later overlap. Existing pairwise union analysis, parsing, atom and name sizes, source-excerpt rendering, and downstream checking remain outside these budgets. `tools/type-union-alias-overlap-test` checks the source proof and partial report; `tools/type-full-overlap-test` checks the detailed and legacy full-module paths, source attribution and cache behavior.

70+

71+A single-arm cell pattern can bind two or more positions, with its last binder capturing the remaining tail. Duplicate and shadowed names are rejected. A definite non-cell spine fails; an intermediate union or collection that might contain a cell remains unsupported. For a known non-union cell, a separate one-arm rule also accepts structured patterns, including nested literal and wildcard positions, when the existing coverage proof establishes the whole pattern. It binds payloads with their original types and checks result context; unknown, partially covered, union or recursive spines stay unsupported.

72+

73+String interpolation infers its pieces in order and preserves substitutions and pending constraints. A piece with a known atom aura, unrestricted `@`, or a tape `(list @tD)` is accepted; an isolated decimal literal takes its normal `@ud` default. A known cell reports that it needs a printer, and an explicitly generic atom asks for an aura at its use site. Loobeans, term singletons, non-tape collections, open types and a type fixed only later remain unsupported in this fragment.

74+

75+The Hoon bridge translates imported `*` as the any-noun type, directly or within supported nonrecursive cells. The reader may still decline a disjoint tagged union with a noun payload, and recursive imports containing `*` remain unsupported. It accepts an exact fork of the two loobean singletons as `?`, and each singleton separately as `%.y` or `%.n`, including inside supported faced cells. Contextual loobean literals specialize against a matching singleton by noun, including a proven singleton in a direct union; named loobean singletons do not silently widen to a distinct aura. Open `%f`, other values, and other forks containing loobean singletons remain unsupported; recursive Hoon molds containing flags can also fail closed.

76+

77+A bare tag that provably matches no case of a known union reports the union and tag sites. This covers casts, single-argument calls, contextual unit payloads, list items and supported branch arms, including unnamed imported unions. For syntactic tuples, ordered fit replay can identify a missing tag in a nested position; an earlier mismatch or uncertainty stops the replay instead of guessing. Existing tags whose shape or payload does not fit retain the ordinary mismatch; unresolved tags stay pending.

78+

79+A change can replace uniquely named fields on a fully known, faced record spine, including through a nested wing. Replacements receive the field type as context, substitutions and pending constraints are retained, and the resulting type remains the original record. Missing fields, empty changes and definite replacement mismatches report sites; the expected-type site is the edit, since the original field declaration location is not retained. Unknown or partly unfaced spines, ambiguous fields and repeated edits remain unsupported. A cast to a known record also supplies field context to a tuple or record initializer, including nested list and union fields. The expected-type site is the cast mold; the original field declaration location is not retained. Isolated cart-style `init` and `update` expressions infer in this fragment. The complete cart-store source fails closed because store kind and declaration scope are not yet checked.

80+

81+For supported closed unions, the type printer keeps the union’s origin separate from its displayed name. It prints an in-scope name such as `msg` or `msg.lib`, including in records and gates; an accessible imported nongeneric alias may name a transitive union. A nongeneric body-local union that escapes its scope, or an origin without an accessible name, prints its cases separated by spaces, parenthesized when nested. That case-list form is print-only. A supported generic union prints its name and all arguments, including unused arguments; when its name is unavailable, the partial printer reports that limitation instead of dropping its arguments. Two faces for the same imported origin remain compatible; compatibility between distinct union origins, including in gate types, remains unsupported. Some comparisons of generic union arguments also remain unsupported rather than deciding equality or mismatch. The Hoon bridge also translates some imported unnamed unions into this representation; unsupported cases remain errors.

82+

83+Multi-argument calls form one right-nested sample: `f a b c` supplies `[a [b c]]`, with the last argument able to be a cell itself. The fragment fits the complete sample, preserving known faces and shared variables. Known sample positions can provide list or union context to arguments; unknown sample shapes use ordinary inference and some contextual forms remain unsupported. For a definite mismatch, the diagnostic points to a specific argument when it can establish which one failed; otherwise it reports the combined sample.

84+

85+A list literal can be inferred when a cast or known gate sample supplies a list type and the supplied prelude has the validated standard list definition. Empty, nonempty and nested literals work, including contextual union tags in elements; mismatched elements report the item and expected type. Imported Hoon lists share this representation. Under the same known context, `~` and zero-valued term literals fit an empty list, and a two-item unfaced cell `[head tail]` is a cons; cons cells and list literals can be nested. Mismatched heads or tails report both sites. A known list result also supplies context through complete loobean, unit-shaped and list-shaped branches, including recursive and nested branches. Known loobean result context can propagate through supported complete branches and binder-only cell arms, with a final directional fit; a binder-only arm over a union subject remains unsupported. A known gate with an unresolved result variable can also receive an enclosing result type before its argument is inferred, for example allowing `^- (list @t) (id ~)`; unknown callees and unresolved targets retain the conservative path. A known gate sample supplies context to corresponding positions of a single tuple or record argument, including nested cells; a zero literal can therefore fit a list position. A bound zero constant still remains unsupported rather than a definite mismatch, and an unknown callee does not supply context. Uncontextualized list literals also infer with a fresh element variable, including empty and nested lists; the resulting variable can generalize. Unresolved item tags and uncertain widening remain unsupported. Faced or longer cons cells, and a missing or altered prelude list remain unsupported. For a known standard list with a supported element type, it also infers a complete two-arm branch using `~` and `[item rest]`, in either order. The binders have the element and list types and cannot shadow or duplicate names. Unknown subjects, unsupported element types, other patterns and incomplete arms remain unsupported.

86+

87+A term-headed pair such as `gap+%s2` follows the same contextual inference as `[%gap %s2]`; its synthetic head uses the pair’s span in diagnostics.

88+

89+A backtick constructs a unit when the supplied prelude has the validated standard `unit` template. Its payload is inferred normally, retaining pending literals and generic variables; nested units work and the prelude’s `some` becomes available. With ordinary result annotations, its `bind`, `biff`, `both`, `clap`, `clef` and `flit` also infer. A known unit in a cast, call, list item or record field supplies its payload context, including nested units and lists; definite mismatches identify the payload and context. Unrelated union identities, some variable-dependent fits, and missing or altered prelude templates remain unsupported.

90+

91+A known union of `~` and a null-headed cell can be matched by `~` and `[~ value]` arms in either order. The payload binder is checked for shadowing. Unknown subjects, missing or duplicate arms, and unresolved branch results remain unsupported; this fragment infers the prelude’s `fall` and `need` signatures.

92+

93+The checked inference fragment represents the empty mold `!!` explicitly. A cell with a proven-empty field is empty, while a gate returning `!!` and the empty values of `(list !!)` and `(unit !!)` remain inhabited. Supported union matches discard proven-empty cases, reject unreachable list or unit payload arms, and require a proof of reachability for fixed opaque cases. A written capital may have an inhabited instance; the existing definition-boundary checks still reject forcing it to a concrete empty type. A directly known standard `(list !!)` permits a single null arm, including in a result context. Unknown and opaque types, other one-arm list subjects, and proofs exceeding their budgets fail closed. Emptiness checks use up to 256 type-node visits per fit or list/unit reachability proof and 4,096 visits when filtering union cases. These bounds do not cover substitution walking, parsing, normalization, source lookup or repeated attempts. This is a supported checking slice, not a proof of arbitrary recursive molds or runtime execution.

94+

95+A known closed union with two or more arms can be matched when each arm provably covers or excludes each remaining case. The checker first tries whole cases; when a pattern splits a case, it can expand known `?` positions into their two noun values, up to 64 alternatives across the union. Binders retain the original case type, and one arm may bind several refinements of that case. It reports missing alternatives and arms already covered, checks tags by noun value, and supports imported and generic union cases. Other partial patterns, expansions above the limit, binders spanning distinct cases, differing arm result types and some complex two-arm subjects remain unsupported. When a cast or known call sample supplies a result type, a known union subject accessed by a wing, a grouped wing or a supported shallow call can propagate that context through whole-case arms and supported finite loobean refinements, including nested cell and list positions. Other partial-pattern contexts and subject forms remain unsupported. The Grammar’s `step` block infers in this fragment, but its module is not yet checked.

96+

97+A known closed union can also provide context to each arm of a complete loobean or unit-shaped branch in a cast or a call with a known union sample. Nested branches and transparent groups work; a mismatch reports the expected union and the offending arm. General patterns and context through bodies with local definitions remain unsupported, and unrelated unresolved tags stay pending.

98+

99+The separate `jibb-dev/lib/jibb-import.hoon` is an unfinished reader for selected Hoon type graphs. It handles named recursion, nested map, set, queue, list, unit, jar and jug arguments, direct ordered maps, and direct `$^` unions whose source branches can be proved disjoint. It also recognizes a direct ordered-map call with two simple named mold operands, as in Tlon `notes.log`, after validating provenance and operand source; revisiting the same map hold fails closed. It also reads ordered map fields in records when the map arguments are syntactically fixed atom molds and other fields are fixed atom molds or standard collections of static atom molds. Collection names must not be shadowed. The reader can also import a mark door sample, removing its outer sample face and validating its build subject. For a mark whose sample is exactly a named arm of its single Ford-imported `/sur` core, it can recover a source-proved nonrecursive union, including source-location wrappers around fields; recursive or unverified fallback results remain unsupported. The reader checks explicit Hoon `$%`, `$?` and `$^` unions against the Grammar’s disjointness rule, as @iko confirmed on 2026-10-30. For an explicit `$%` with distinct literal head tags, it can also prove restricted local named payload dependencies, including bare `~` fields, re-evaluate and validate each source branch, and recover the union before Hoon collapses it. The real Tlon `notes.u-note` exercises its `[%deleted ~]` case. A bounded fallback also recovers one level of local named tagged unions inside such a union, including Tlon `notes.u-notebook` and `notes.u-notes`. Source-proved tagged unions can also be wrapped in Hoon `$~` defaults, including a downstream union using Tlon `epic.saga`; the selected source and projected branches still undergo the same provenance and disjointness checks. The tagged-source helper peels up to four consecutive default wrappers, while default wrappers encountered inside dependency proofs consume the existing semantic-node budget. A source-proved nested self-recursive union retains its named owner, including Tlon `notes.import-node`; deeper, mutually recursive or unproven cases stay unsupported. The nested source proof has a 256-visit semantic-node budget, and source-location wrapper peeling is limited to four per node; Hoon evaluation and source scans are not metered. It rejects recursive or computed dependencies, inherited same-name collisions, unsupported nested unions and proofs exceeding a shared 4,096-node budget. It re-evaluates statically recognizable source branches before Hoon can collapse them, checks materialized fork cases, and rejects shapes it cannot prove disjoint. Static records may also have verified standard-collection and `path` siblings. One direct explicit union argument in a standard list, set, map or unit is accepted when its call wrapper and collection provenance are verified and its static cases are pairwise disjoint. A synthetic regression checks that forged wrapper subjects, samples and tails are rejected. Other collection-union forms, nested ordered maps, general source-level disjointness and complete integration with the checker remain unfinished. `+golden-types-imports` can consume fixed-aura atoms, valid term singletons, Hoon's `%n` zero singleton as Jibb `~`, nested faced or unfaced cells, unions of supported, pairwise-disjoint cases, and opaque standard collections with supported arguments from caller-supplied reader results for declared `/-` imports; `+golden-types-with-marks` accepts the same shapes for declared marks. The caller must pass unchanged results from the source-aware reader: the bridge validates the supplied graph but cannot detect source cases Hoon collapsed before that graph was built. The opaque collection types retain their names and arguments for identity, unification and printing. The validated standard prelude `list` mold shares the imported list representation; other Jibb-written collection molds and most prelude collection operations remain unsupported. Other forms remain unsupported. Its disjointness proof is conservative and can reject a valid union it cannot prove disjoint. Collection recognition requires the originating `/sur` core. The reader validates direct zuse subjects and Ford subjects consisting of faced imported cores and a validated tail, checking imported cores transitively; it rejects shadowed names, inconsistent core subjects and other subject shapes. For a recursive reference, the reader matches the exact Hoon hold against named arms in validated cores, including transitive Ford imports; it rejects missing, unlabelled or ambiguous origins. Its fixtures include three real Tlon files; `tools/importer-test` compares the internal projection under eval, and the ship test compares the same golden output. `tools/type-import-test` and `tools/type-mark-test` compare bridge reports under eval and on the ship. `tools/type-tlon-test` and its ship counterpart exercise four real Tlon presence unions and a field read through the source-aware reader and partial checker. `tools/clay-fixtures` also passes Clay-built `/sur` molds and mark samples through the Clay-built importer and partial checker.

100+

101+An import-free Jibb library can export an opaque single-parameter recursive identity when its source has exactly two distinct term-tagged cases: a text leaf and a node containing `(list (name M))`, optionally with one `$-(@t M)` event field. A module-local index records the exact parsed source, defining path and prepared prelude interface; it is shared across that module's inference passes, and its canonical `list` must be source-backed. The normal resolver publishes an interface only after all ordinary mold and value checks succeed. Same-origin aliases retain the defining identity and independently instantiate type arguments; distinct origins remain unsupported. The opaque identity is conservatively treated as gate-bearing for numeric defaulting, and gate-freedom remains unknown. Explicit literal-headed construction uses a source-proven one-layer view: the event result receives the existing type argument and recursive children keep the defining identity. It consumes the existing shared 256-step recursive inference budget, and a per-view 4,096-visit guard bounds the new face and substitution scan; longer scans decline. These bounds do not cover parsing, existing inference, atom sizes or repeated attempts. One startup-inclusive, shared-load comparison of 100 valid and 100 invalid source definitions took 29.67 s wall / 25.14 s user CPU before this slice and 33.47 s / 26.99 s with it; the former declined all 200 while the latter inferred the valid definitions. These single runs are not a production benchmark. Matches over explicit source tags, flat binder or wildcard fields, and nonbinding catch-alls use that same one-layer view and existing binder, coverage and branch checks. Up to 128 arms are screened per attempt; longer matches decline. A single-arm match on a direct in-scope wing can report its missing case, and a contextual one-arm call subject can use a nonbinding catch-all. Recursive children retain their nominal type and arguments. Subject recognition and view validation can each scan substitutions, and the scan cap applies separately to each attempt. In one separate startup-inclusive comparison of 100 valid and 100 invalid source matches, the construction-only checker took 30.18 s wall / 29.31 s user CPU and declined all 200, while the pattern slice took 28.28 s / 27.69 s and inferred or diagnosed them. These single shared-load figures are not production benchmarks. General structural fits, whole-case binders, nested recursive patterns, uncontextualized single-arm call subjects, recursive source with imports and local recursive molds remain unsupported; the test tree does not prescribe the eventual `element` representation. Caller-supplied detached interfaces and caches retain the existing trusted-input contract.

102+

103+Self-recursive `/sur` molds can cross the bridge as opaque module-and-name identities when their supported source-aware graph passes validation, including one-argument lists containing same-origin recursive references. The real Tlon `notes.import-node` reaches this bridge; it does not unfold or construct the recursive type. Aliases, foreign references, recursive marks, unfolding, construction and field access remain unsupported; the partial printer declines recursive names that are not in scope.

104+

105+The partial checker also recognizes a source-proven Jibb recursive mold consisting of `~` and one faced cell with a fixed-aura head and direct self tail. Its identity includes the defining path and name. It unfolds this shape for supported null and cell construction and for a two-arm null/cell match; static application-path literals use the verified public `qath` alias. The internal prelude defines `qath` as a transparent knot sequence and the public prelude re-exports it. Each inference attempt has 256 unfolding and static-segment steps; parsing and separate retries are not bounded by that limit. Dynamic application-path segments, broader patterns and other recursive shapes remain unsupported. Route and static-file existence checks remain milestone 4.

106+

107+Callers that have a `/sur` core and a name can use `+read-named`: it checks for a locally declared arm before asking Hoon to evaluate the mold, and reports evaluation failures with the final Hoon trace line. `+read-mold-in` remains available when the caller already has the selected type. The opt-in `+read-named-diagnostic` and `+read-mark-diagnostic` preserve successful graphs and distinguish definite `%invalid` evidence emitted directly by the reader from `%unsupported` failures. Other failures, including unverified union disjointness and vase recognition based only on a name, remain unsupported. These entry points revalidate and re-walk failed types; the opt-in `+golden-types-with-reader-diagnostics` accepts unchanged structured reader results and reports definite aura, core or proven union-overlap errors at their imported mold use sites, when the import and supplied input are unique. Ordered replay covers direct and nested cell samples, record and function casts, and non-generic same-module aliases; it stops at an unsupported prefix, cycle or shadowing failure. Union molds, generic applications, transitive modules and unsupported reader outcomes still report generic limitations. Replay repeats inference and may add work; this entry point remains partial. Existing checker entry points continue treating failed imports as unsupported. It also fails closed on repeated field faces along an imported record spine, including recursive roots; the diagnostic remains generic. Hoon type graphs can erase unfaced nested-cell boundaries, so the check may conservatively reject a valid source with equal names in distinct erased scopes. Faced nested records and union alternatives keep separate scopes.

108+

109+For supported source-aware Hoon `$?` unions, the reader can prove a definite overlap by independently evaluating and projecting the original cases, verifying each projected head against its source tag, and finding a shared runtime noun in a pair. Its positive witness traverses faces, named nodes, forks, cells, supported atom forms and `*`; `!!`, opaque references, applications and unproved aura intersections cannot themselves establish a witness. It compares singleton noun values independently of aura, and requires inhabited positions throughout a cell. Unknown or exhausted proof remains unsupported, while existing disjoint-source recovery still handles proven distinct cases. The source screen admits at most 128 cases and 4,096 raw noun nodes; dependency checking and the pair/type witness each have their own 4,096-node budget. Hoon evaluation, projected-graph validation, chapter lookup, atom byte sizes and other type-graph walks remain outside those budgets. The error points at the Jibb use; source case locations are unavailable. This is a partial named-reader analysis, not general imported-union checking or a mark-reader overlap diagnostic.

110+

111+In single startup-inclusive runs of eight Hoon reads, a benign three-case union used 37.78 seconds of user CPU with the earlier narrow witness and 39.99 seconds with the structural witness; a repeated-head union used 39.84 and 40.97 seconds. Other checks ran concurrently, so these measurements do not establish a production bound.

112+

113+The partial report can diagnose certain non-gate value dependency cycles, including cycles through gates. It requires an explicit atom or loobean result cast and a syntactically proven dependency group with unshadowed simple samples; it identifies the value and a dependency site. Untyped results, branches, nested definitions, qualified wings and complex samples remain unsupported. The proof constructs an additional dependency graph. One 24-case recursive/generic eval run took 19.7 s with it and 18.6 s before it, including startup; these single runs do not isolate the graph cost.

114+

115+The source-backed `+api-path-analysis-source` is a separate partial analysis, not an API check: it resolves reachable Jibb imports and declared mark graphs and returns path and scry segments, full and diff mark identities and their types. It also checks derived-name collisions. Full and diff payloads must be direct declared mark names; typed scry parameters must be a same-name, same-aura subset of the watch parameters, and unknown or duplicate segment binders fail closed. It creates no request gates. The caller must pass a trusted prepared prelude and unchanged source-aware reader results.

116+

117+`+api-path-evidence-source` retains that analysis with the API source, complete prepared prelude (including reserved names), supplied reader results and resolved Jibb dependency cache. `+api-path-watchability` classifies a unique declaration as watchable or not watchable, or reports unknown when evidence is absent or ambiguous. The artifact and reader results are trusted host inputs; the host must bind them to the source versions used later. This is declaration evidence, not proof about an arbitrary request value, a checked API module, a runtime validator or an island watch.

118+

119+For a unique supported declaration, `+api-request-parts` retains that evidence with the typed path parameters in source order, the full-state reply sample, and a fold type when there is one diff mark. The fold takes the tagged diff and previous full state and returns full state. Missing or ambiguous evidence, unsupported parameter auras and multiple-diff folds fail closed. These are components for a future request gate; they do not yet fix its argument order, construct a request, or prove watchability of a value.

120+

121+`+api-support-analysis-source` additionally infers supported ordinary API molds and values, resolves every declared mark, and retains their source, dependency and path evidence. Unsupported helpers or marks fail closed. An unused `/-` core is not independently validated, ordinary definitions that need derived gates remain unsupported, and this result is not a checked API interface or an exported request.

122+

123+The ordinary import resolver can infer derived request-gate types for multiple supported API paths. A case may take one typed path parameter before its reply gate, or one diff fold after the reply; a case with both, multiple parameters or diffs, or a separate scry path remains unsupported. Each reply maps the full mark type to a fresh `M` and the request result is `(ask M)`. Checked ordinary API values and molds, declared mark molds and a supported poke constructor are exported too. Every selected `/sur` core must have a directly used, successfully read mold; unselected core bindings are not independently validated, and Jibb module imports remain unsupported in this API fragment. The unchanged todo API fits this fragment.

124+

125+A call whose direct result is a known named generic union can receive a matching same-origin, same-arity result context before its arguments are inferred. This retains the ordered generic arguments and existing capital checks; pending tags, recursive or variable-bound origins and unrestricted atom cases remain conservative. Constructor fitting reports unsupported when an unresolved or opaque case could contain the requested tagged head. It keeps definite missing-case errors for proven nonmatching cases, including an explicitly atom-only faced head. The real todo callback `|=%got` can infer when an `(ask msg)` result context fixes its message union; the uncontextualized call remains unsupported.

126+

127+A two-item tuple with an explicit term, null or loobean head can receive payload context from a known union when every alternative is a literal-headed cell and its head noun is unique. The payload must be a direct wing-headed call, optionally grouped, with literal, wing or constructor arguments. The checker first retains the original inference if it already fits; otherwise it tries the contextual path once and fits the selected case and enclosing union. It declines this path if any substitution has a structural root, because a caller may have walked away variable provenance. Duplicate heads, opaque competitors and other shapes also stay conservative. The guard scans the substitution for each eligible tuple and may perform one extra shallow inference; it does not guarantee globally linear work. This lets an explicitly typed todo subscription body infer; it does not check an island or prove request watchability.

128+

129+`+gate-free-type` is a separate three-way proof over normalized checker types: it reports a gate-free result, a gate-bearing witness with its field path, or unknown. It tracks conservative inhabitance before reporting a gate in a cell, spends one shared node budget, and treats opaque recursion, open variables, unknown collection forms and `*` conservatively. Source-proven `qath` and the recognized list/unit representations have dedicated proofs. `+gate-free-mold-source` parses and resolves one named mold with a fresh active-root graph, retaining the complete prepared prelude, source bundle, trusted reader inputs, dependency cache and inferred mold. It caps classification at 256 nodes; parsing, import resolution and type inference are not covered by that cap. The host must canonicalize paths and bind trusted sources and reader results to their versions. API, store and private roots decline; other definitions and unused imported Hoon bindings are not fully checked. This is mold analysis, not a module, kind, island, watchability or runtime check, and it does not infer general gate-free constraints.

130+

131+A full ordinary module may export a narrow checked program `main` only as a direct, unqualified `(program init update view subs)` call with four simple wing arguments, modulo transparent grouping. The canonical prepared prelude must supply both the `program` value and mold. The ordinary source-backed program fit and all normal mold, value and request-graph checks complete first. The inferred `main` must be closed and invariantly match an instantiated `program` mold from that prelude. The initializer must have a closed gate scheme; its data and model contain no open variables and share the existing 256-node gate-free budget, with `%yes` required for both. The named subscription gate may syntactically return null through transparent casts, groups and definition-free bodies. Alternatively, after a successful request-graph merge, it may return one singleton list containing an unfaced `[%watch request]` pair whose request is a direct `case.face` call with one direct constructor callback. The face must resolve to an imported interface whose member has the exact plain derived-request scheme. Exactly one merged request evidence must match its API path and case, agree with the declaration's inner name, and appear in that interface's own graph; the interface source must equal the evidence's API source. The declaration must have no scry, diffs or path parameters. Pure or hand-built requests, helpers, aliases, re-exports, typed paths, folds, multiple subscriptions and missing or ambiguous evidence fail closed. Arbitrary or aliased mains, API/store kinds, and gates or unknowns in data/model also fail closed. This retains source and graph evidence and permits ordinary downstream imports; it neither executes the program nor implements runtime watching.

132+

133+When only that program's initializer and `main` are unresolved, a bounded transactional retry can derive the initializer's expected gate from the resolved update, view and subscription components. It instantiates all schemes above the greatest variable ID in the module and prelude, reuses the source-backed positional fit and stable replay, and leaves only the initializer's data variable open. The named initializer must be a direct gate whose transparent body is a tuple ending in null. Its own sample fixes data; ordinary inference, product and whole-gate fits, pending-tag and finalization checks, and a fresh ordinary `main` inference must all succeed before the ordinary kind and graph checks publish anything. Aliases, non-main libraries, simultaneous unresolved subscriptions, nonempty subscriptions and unrelated pending tags decline.

134+

135+Each case's canonical API identity and source-derived schema travel across imports in a nonrecursive graph certificate containing the exact source bundle, prelude, reserved scope and trusted reader results. Cached interfaces must match those inputs and cannot hide an active ancestor; unknown legacy entries are rebuilt from their unique supplied source. Request-bearing closures are limited to 256 paths and requests. Closed gate samples can also fit when an unnamed input slot corresponds to a named one, provided products are identical and nested value faces and ambiguous cell tails remain intact. This is type inference only: request lowering, runtime schema validation and value watchability proofs are not implemented.

136+

137+`+golden-types-with-prelude` accepts case-local Jibb module sources alongside `/sur` and mark results and the vendored prelude source. It resolves reachable ordinary library modules in dependency order, caching completed interfaces per invocation and exporting supported closed value schemes, direct generic unions, and simple or nonrecursive generic mold aliases whose bodies the fragment supports. It detects missing sources and cycles and rejects a dependency if its interface cannot be inferred by the fragment. Qualified wings can also read nested fields of an imported value, instantiating that value’s scheme independently at each use; missing, ambiguous and non-record fields remain unsupported.

138+

139+The supplied prelude is parsed into a **partial interface**: all names actually declared in the source are reserved, while only the molds and values this fragment can infer are available. These include the validated standard `list` mold, `unit`, the doc-exact generic `cmd` union, `same`, `fall`, `need`, `bond`, `lure`, `weld`, `snoc`, `turn`, `lent`, `zing`, `flop`, `rear`, `drop`, `skim`, `skip`, `murn`, `join`, `snip`, `levy`, `lien`, `cork`, `corl`, `cury`, `curr`, `lead`, `late`, `trip` and `tuba`; unsupported entries remain unavailable. The validated `list` is injected while the prelude’s gates are inferred; `weld` and `turn` use ordinary explicit result casts. An absent or altered `list` is not injected, and an altered declaration cannot leak through a direct or transitive mold alias. The same validated template is available when prelude mold aliases are prepared, so supported direct and transitive aliases can use it. A named prelude union keeps the fixed `/lib/jibb/prelude/jibb` origin in every module, and its name remains unqualified when a library exports a type containing it. The prelude inventory is incomplete, so reserving the names in this source does not establish complete shadowing coverage. The source-backed internal prelude defines `poke`, which the public prelude re-exports as an ordinary transparent type. A dedicated trusted internal-prelude preparation path also supplies private comparison, arithmetic and text-conversion schemes for the Jibb-written `gth`, `add`, `dec`, `trip` and `tuba` wrappers. Ordinary module resolution rejects that primitive path even if a caller supplies a spoofed root or bundle. The low-level prepared interface is still trusted host input; the host must select the vendored sources and canonicalize paths. Primitive execution and shape-based jet recognition are not implemented. The Jibb-written `lth`, `gte` and `lte` gates compose the source-backed `gth` and `not` gates; supported calls infer a shared atom constraint and return `?`. Their execution and jet recognition await the backend. The source-backed `add` and `dec` wrappers use private arithmetic interfaces whose shared atom variable excludes loobeans; the partial checker preserves that constraint through supported inference and prints `where A is an atom other than ?`. The partial checker resolves the supported `poke` source shape, preserves its public name, and rejects ordinary imports of the private internal path. The Jibb-written `lent` recursively counts a list using `add`; the partial checker infers its generic list argument and `@ud` result. Its execution and jet recognition remain unverified until the backend exists. The Jibb-written `zing` concatenates homogeneous lists in order using `weld`; the checker infers `(list (list A))` to `(list A)`, including for gate elements. Hoon `zing` also accepts heterogeneous noun lists, which this type does not express. `tools/hoon --raw -f tools/testdata/zing-hoon-reference.hoon` compares an equivalent Hoon recursion with Hoon `zing` on selected finite inputs; it does not execute Jibb or verify lowering or jet recognition. The Jibb-written `lead` and `late` are curried pair constructors: `((lead a) b)` returns `[a b]`, while `((late a) b)` returns `[b a]`. The checker infers independent argument types and accepts gates as ordinary values; neither helper invokes an input gate. A Hoon translation is compared with Hoon’s helpers by `tools/hoon --raw -f tools/testdata/lead-late-hoon-reference.hoon`. This does not execute Jibb or verify lowering or jet recognition. An imported API with one mark and a matching direct `+$ poke` declaration can export a derived constructor and retain agent/mark metadata when the source representation has the supported agent case. Other API shapes, complete private module checking, root API and kind checking, stores, complete `ask` and `pure` checking, lowering and runtime effects remain unfinished. A possible store or root API declaring `+$ poke` reports that kind or scope needs unsupported inference; definite duplicate declarations and unrelated shadowing still report conflicts. Prepared interfaces and caches are trusted caller inputs; the future host and linker must ensure the private source validated during preparation is the same version used to lower derived constructors. A `*` payload may contain gates, so the fragment treats it conservatively; full gate-free checks are unfinished. The shared module-scope fixture compares the prepared and source-taking paths against the real prelude and a two-module golden under eval and on the ship.

140+

141+`+prepare-prelude` derives the interface and declared-name inventory from the trusted vendored source. Hosts can reuse its result with `+golden-types-with-prepared-prelude`; they must pass the unchanged result of preparation, not an independently constructed value. Empty, malformed and duplicate-name prelude sources fail closed. The source-taking `+prepare-prelude` and `+golden-types-with-prelude` do not supply the internal module; their `-and-internal` or `-with-internal` variants accept its source for the supported private import. API files, modules with `main`, unsupported definitions and many other features remain outside this subset. The older `+golden-types-with-modules` entry point fails closed for imports because it has no prelude scope. None of these partial reports claims the module has been checked.

142+

143+The prepared interface includes the source-backed UI molds and constructors, the full nonrecursive `element` union, and the exact `program` and `page` records and builders. Its element union erases nested child, keyed-item and table payloads to `*`, while public constructor schemes retain typed composition and independent key parameters. `types-prelude-ui` checks those schemes and selected valid and invalid compositions. A child-message mismatch currently fails closed as an unsupported list-item constraint rather than a definite mismatch diagnostic. Raw-constructor encapsulation, duplicate-attribute checks, rendering, navigation, storage and execution remain outside this slice.

144

63And the design notes:

145And the design notes:

146

@@ -69,16 +151,26 @@ And the design notes:

69| 3. The parser | Why recursive descent (the grammar is LL(2) after the layout pass), the EBNF rule by rule with the node each gives, what the EBNF leaves out and how it's filled in, spacing, and where each error points, with its message |

151| 3. The parser | Why recursive descent (the grammar is LL(2) after the layout pass), the EBNF rule by rule with the node each gives, what the EBNF leaves out and how it's filled in, spacing, and where each error points, with its message |

70| 4. Printed formats | The token, tree and error formats the golden files hold |

152| 4. Printed formats | The token, tree and error formats the golden files hold |

153

154+Source-backed `like` maps the product of an existing `(like A)` result while retaining its position and remaining input. The partial checker infers supported positional calls by peeling only known sample-slot faces, retaining faces belonging to values; ambiguous variable-bound spines and nested face loss remain unsupported. Backend execution remains outstanding.

155+

156+The internal prelude defines transparent `(ask M)` cases for pure, agent and store requests; the public prelude re-exports it and defines `pure` in Jibb. Preparation supplies the private module with `list.core` and `unit.core` only from validated canonical public templates. If a template is unavailable, an isolated check validates the private molds, but only molds independently inferred against the actual available templates enter the interface. The partial checker infers supported constructors and exhaustive matches; absent versus present-zero state remains distinguishable. Agent and store receiver fields carry raw nouns and cannot prove schema validity or watchability. The public prelude also defines the documented `sub` union in Jibb; supported watch payloads retain the public `(ask M)` type. A `sub` value is not itself proof that its request is watchable. Generated decoders, source-bound runtime validation, request lowering, other derived request shapes and island watch checks remain unfinished. Public prelude preparation is partial: consumers must verify that `ask` was actually exported with its source origin.

157+

158+Public identity aliases of private generic unions retain their public name when the origin, arity and argument order match exactly, including through imported values. Fixed, reordered, repeated and phantom generic aliases remain unsupported where a safe public name cannot be recovered; a fixed nongeneric alias is not printed as though it accepted type arguments.

159+

160+The partial checker reserves `proj` in module, local, sample, pattern and import bindings, including bindings inside unsupported source; a field, tag or path segment may still have that spelling. With a known expected record type, it checks selected explicit `(proj record)` calls over closed, uniquely faced records, preserving the source expression, its type, the result type and field axes in the checked interface. Imported and private-prelude dependencies retain the source needed to lower those plans. The checker does not yet lower or execute them. It supports selecting one or more fields in their original order; a single selected field keeps its face and uses one source axis. Reordered fields, unknown or open record spines, some nested contexts and recursive groups with projections remain unsupported. A directional fit of a wider faced record fails closed instead of inserting a projection, including within supported list, unit and record positions. To limit repeated work, record-spine proofs are reused along the same closed spine and stop at 1,024 fields; field boundaries and the special handling of positional calls reset the appropriate proof. Prepared interfaces and their source remain trusted host inputs.

161+

72## The tree

162## The tree

163

74Every node is `[%tag at=span …]`, so `+span-of` finds its span in one place; the few that aren't say so in the `%tree` chapter. The kinds of node:

164Every node is `[%tag at=span …]`, so `+span-of` finds its span in one place; the few that aren't say so in the `%tree` chapter. The kinds of node:

165

76- **Module**: imports (`%sur` for `/-`, `%mark` for `/%`, `%jibb` for `/=`), then definitions (`%mold` for `+$`, `%value` for `++`).

166- **Module**: imports (`%sur` for `/-`, `%mark` for `/%`, `%jibb` for `/=`), then definitions (`%mold` for `+$`, `%value` for `++`).

77- **Expressions** (`expr`): `%lit`, `%str`, `%path`, `%qath`, `%wing`, `%change`, `%pair`, `%unit`, `%group`, `%list`, `%tuple`, `%gate-wide`, `%ctor`, `%call`, `%gate`, `%cast`, `%trace`, `%branch`, `%crash`, and `%body` for an indented body, with its local definitions if it has any.

167- **Expressions** (`expr`): `%lit`, `%str`, `%path`, `%qath`, `%wing`, `%change`, `%pair`, `%unit`, `%group`, `%list`, `%tuple`, `%gate-wide`, `%ctor`, `%call`, `%gate`, `%cast`, `%trace`, `%branch`, `%crash`, and `%body` for an indented body, with its local definitions if it has any.

78−- **Molds as written** (`shape`): `%aura`, `%noun`, `%void`, `%flag`, `%const`, `%ref`, `%tvar`, `%path`, `%apply`, `%cell`, `%union`, `%fn`, `%generic`. A `%union` spans its first through last case and has no lead token; a single case is its own mold. `%generic` spans from the `|$` after a `+$` name through its body.

168+- **Molds as written** (`shape`): `%aura`, `%hole`, `%noun`, `%void`, `%flag`, `%const`, `%ref`, `%tvar`, `%path`, `%apply`, `%cell`, `%union`, `%fn`, `%generic`. A `%hole` retains the span of `_`; an inferred typed path segment retains that span separately from its enclosing segment. A `%union` spans its first through last case and has no lead token; a single case is its own mold. `%generic` spans from the `|$` after a `+$` name through its body.

79- **Samples, fields and patterns**: a sample is `%bind`, `%face`, `%pun`, `%cell` or `%bare`, since a bare name binds anywhere in a sample; a pattern is `%lit`, `%str`, `%any`, `%bind` or `%cell`.

169- **Samples, fields and patterns**: a sample is `%bind`, `%face`, `%pun`, `%cell` or `%bare`, since a bare name binds anywhere in a sample; a pattern is `%lit`, `%str`, `%any`, `%bind` or `%cell`.

80- **Literals** (`lit`) keep the form they matched, their aura and value, and their text as written, which the printers show.

170- **Literals** (`lit`) keep the form they matched, their aura and value, and their text as written, which the printers show.

171

172+The parser accepts type holes. The partial checker records each ordinary hole with its span and validates the obligations created in a value or local definition before generalization. A solved concrete type or an explicitly written in-scope capital resolves a hole; a later use cannot repair it. Independent decimal holes may default to `@ud` when the surrounding inferred type is gate-free; variables reachable from the environment or written capitals are protected from premature defaulting. Structural named-mold holes are diagnosed at their source, while complex named molds, inferred path segments, recursive groups with holes and unresolved constraints remain unsupported. Partial prelude and API interfaces cannot silently export unchecked holes. A separate syntax-tree pass reports duplicate names within a written record at both field sites, including in unused definitions; nested and separate records have independent scopes.

173+

82The tree keeps everything the checker needs to report an error at the code as written: open and closed brackets give the same node, but every node keeps its span.

174The tree keeps everything the checker needs to report an error at the code as written: open and closed brackets give the same node, but every node keeps its span.

175

84## Positions and errors

176## Positions and errors

@@ -103,3 +195,17 @@ Note 4 has examples of each.

103## Speed

195## Speed

104

196

105Starting `urbit eval` and building the library takes about 8 s. A 2,000-line module of 400 definitions then parses in about a second. Loops over definitions, arms, lines and items are tail calls, so a long module grows no stack; nesting costs a few stack frames a level, and 100,000 nested brackets still parse (note 3).

197Starting `urbit eval` and building the library takes about 8 s. A 2,000-line module of 400 definitions then parses in about a second. Loops over definitions, arms, lines and items are tail calls, so a long module grows no stack; nesting costs a few stack frames a level, and 100,000 nested brackets still parse (note 3).

198+

199+The experimental deferred constructor path can close a small import-free library transaction when ordinary resolution stalls. It retries definitions whose earlier attempts failed from their original states, retaining only successful attempts. A transaction with at most 64 definitions makes at most 4,096 attempts; it stops after a pass with no progress. This bounds the new attempt count, not each attempt's parsing, type walks or ordinary inference. Deferred definitions are restricted to simple one-component wings, literals, static strings, gates, transparent groups and empty bodies, calls, casts and a restricted boolean branch. Each successful call or cast fit must have exactly equal normalized operands so later substitutions cannot invalidate a face check. A multi-argument call also needs closed argument, sample and product types because positional face checks depend on slot boundaries and whether the result can be a cell. Other fits fail closed. A 512-node screen bounds visited expression nodes and a separate 512-node scan bounds each stability check; neither bounds mold shapes, string-piece checks, parsing, normalization, lookup, or total repeated inference. It accepts only a direct constructor callback with a closed input, records its pending fit under the source-owned inference state, and generalizes each definition against the live environment and pending constraints. Before publication it discharges and replays every edge, rejects unresolved tags or changed replay state, and checks that all molds and values are complete. The reporter reads the committed schemes for definitions added by the transaction. API and store paths, `main`, prepared-prelude recovery, imports, recursive groups, unresolved holes or written capitals, and new projection actions remain outside this full-module path. `%grec` in the constraint or freshness scan is conservatively unsupported. This is not an island-kind, runtime, or watchability check.

200+

201+An expected cell type can supply context to both arms of a loobean branch. This slice first retains any ordinary inference that already fits. Otherwise it retries from the original state only when a syntax screen excludes nested branches, casts, gates and local bodies, and a substitution screen excludes structural bindings. Both arms must fit, their normalized results and the expected type must be closed, their result types must match, and both fits must replay without changing the final substitution or fresh-ID counter. A successful retry retains the original arm type and its written faces; a failed retry returns the original inference result. The source and substitution screens each visit at most 512 entries. This permits at most one extra attempt for an eligible branch; the screens do not bound preexisting inference, type walks, list construction, or work across separate analyses.

202+

203+In an isolated diagnostic with the real todo API and reader inputs, this cell context allowed the original update body to infer when its result type was written explicitly and experimental source-defined text helpers were supplied. The unchanged island still needs those text helpers, an actual source-backed `program` and UI interface, context propagation across definitions, island-kind checking and watchability proof. This branch change itself provides no runtime implementation or watchability evidence.

204+

205+A deferred boolean branch must use both distinct literal loobean patterns. Its subject is unified with `?`; the arms are inferred in source order without contextual retry. Equal normalized arm types are retained directly. When both written arms are direct literals that each created their own unbound pending tag, the checker can instead retain two source-owned fit obligations to a shared, monomorphic result variable. A later definition may close that variable; replay uses the ordinary literal fit, requires a closed atomic target or a union of direct constant/cell cases, and rejects faced targets and faced union cases. It replays all edges under the final substitution without adding bindings or fresh IDs. This does not support deferred list literals, union-pattern reachability, arbitrary branch expressions or prepared-prelude/imported modules. It does not establish request watchability.

206+

207+With the caller's unchanged prepared prelude, the partial report can also recover a narrow import-free, non-main ordinary library initializer. A direct tuple literal may retain one source-owned fit obligation for each newly created pending literal until a later exact result cast closes them. A separate bounded candidate screen admits a direct tuple even without a constructor call. The prepared transaction requires exact agreement among the supplied interface, value inventory and reserved molds, and retains the API, store, import and `main` exclusions. It only adds recovered entries to the partial report: the ordinary full-module resolver does not publish them. Wrong unit or draft fields, unrelated pending tags and mold-name collisions fail closed; without the later final cast, the initializer remains not checked. This does not add list-literal deferral or import-aware recovery.

208+

209+Before the no-prepared-prelude fallback, the checker screens the already parsed source for a direct single-constructor call beneath groups, gates, casts or bodies without local definitions. The screen visits at most 64 AST nodes per definition and rejects sources with more than 64 definitions or 65,536 bytes. A transaction is attempted at most once per resolver or report invocation and holds at most 64 pending edges. These limits do not bound the initial parsing, ordinary resolution, normalization, or total work across separate analyses. On the pre-recursive-index snapshot, startup-inclusive synthetic 1,000-gate comparisons had baseline/candidate user times of 25.97/29.30 seconds and 26.30/27.46 seconds in reverse order. These are limited shared-load measurements, not production benchmarks. The trimmed source-backed and direct-guard fixture passed in 28.13 seconds wall and 27.53 seconds user on one run after screening; its cases include parse-success checks in the same transaction source pass. The outer resolver and reporter each parse independently, and a fallback currently parses the source again.

210+

211+A single sequential, startup-inclusive comparison against checkpoint `c96597d` measured user CPU for an unrelated stalled library at 25.04 seconds baseline and 26.32 seconds with the screened fallback; an incompatible constructor took 25.72 and 27.16 seconds; a direct constructor that the baseline declined and the candidate resolved took 24.46 and 26.79 seconds. These are small shared-load measurements, not a production benchmark. The screen was separately checked with a trapping fallback: the unrelated source skipped it, while the eligible conflicting source reached it.

docs/development.md+103−4

@@ -14,6 +14,8 @@ From the plan's Setup and ground rules, and from @iko:

14- **Push straight to `master`.** @iko reviews work in the project's chat, not in pull requests, so there are none. Run the checks below first.

15- **Keep docs/ current**: [status.md](status.md) when a milestone moves, [open-questions.md](open-questions.md) when a question is settled or found.

17+The source-backed generic-union guard can be run under eval with `tools/type-union-source-test`; its `test-union-source` arm is also assembled for the fake ship. It checks a bounded partial inference slice, not general union completeness. `tools/type-union-alias-overlap-test` exercises the separate positive overlap witness and its shared ship test arm. `tools/type-full-overlap-test` checks structured full-module overlap evidence and the legacy error text under eval; both of its test arms are assembled for the fake ship.

18+

17## Setting up a machine

19## Setting up a machine

19The tools need Python 3 and `urbit` (vere) on `PATH`; the ship tools also need a fake `~zod` and click. Everything so far ran with vere 4.6 on Linux.

21The tools need Python 3 and `urbit` (vere) on `PATH`; the ship tools also need a fake `~zod` and click. Everything so far ran with vere 4.6 on Linux.

@@ -60,14 +62,57 @@ git clone https://github.com/urbit/tools /root/src/tools

60| --- | --- |

62| --- | --- |

61| `tools/golden` | Runs the golden cases under `urbit eval`: every case, or those matching `--case`; `--update` rewrites the expected outputs; `--show` prints them |

63| `tools/golden` | Runs the golden cases under `urbit eval`: every case, or those matching `--case`; `--update` rewrites the expected outputs; `--show` prints them |

62| `tools/importer-test` | Compares the partial Hoon importer's diagnostic trees and errors with `tests/importer/tree.txt` under `urbit eval` |

64| `tools/importer-test` | Compares the partial Hoon importer's diagnostic trees and errors with `tests/importer/tree.txt` under `urbit eval` |

65+| `tools/type-import-default-test` | Compares default-wrapped union source proofs and adversarial cases under eval; the same golden runs on the ship |

63| `tools/type-import-test` | Composes the Hoon importer with the partial checker and compares `tests/type-import/expected.txt` under eval |

66| `tools/type-import-test` | Composes the Hoon importer with the partial checker and compares `tests/type-import/expected.txt` under eval |

67+| `tools/type-import-overlap-test` | Checks source-aware Hoon union overlap, provenance and proof-budget controls under eval; the same fixture runs on the ship |

68+| `tools/type-import-structural-test` | Checks multi-case and nested Hoon union overlap witnesses under eval and on the ship |

69+| `tools/type-union-source-test` | Checks bounded local generic-alias disjointness and state guards under eval and on the ship |

70+| `tools/type-union-alias-overlap-test` | Checks source-backed generic-alias overlap witnesses under eval and on the ship |

71+| `tools/type-full-overlap-test` | Checks structured full-module overlap evidence and imported-source attribution |

72+| `tools/type-tlon-test` | Runs the real Tlon presence source through the importer and partial checker, comparing `tests/type-tlon/expected.txt` under eval |

73+| `tools/type-import-diagnostic-test` | Compares the structured reader diagnostic bridge report under eval |

64| `tools/type-mark-test` | Checks the partial checker’s mark import boundary against `tests/type-mark/expected.txt` under eval |

74| `tools/type-mark-test` | Checks the partial checker’s mark import boundary against `tests/type-mark/expected.txt` under eval |

75+| `tools/type-poke-test` | Checks source-backed prelude and poke-only API reports against `tests/type-poke/expected.txt` under eval |

76+| `tools/type-api-paths-test` | Checks partial API path analysis with real todo mark samples against `tests/type-api-paths/expected.txt` under eval |

77+| `tools/type-api-evidence-test` | Runs source, scope, reader-result and declaration-watchability evidence guards under eval and on the ship |

78+| `tools/type-hole-guards-test` | Runs the shared hole-defaulting and API interface guards under eval; the same checks run on the ship |

79+| `tools/type-list-alias-test` | Runs the shared prelude list-alias and provenance guards under eval and on the ship |

80+| `tools/type-generic-recursion-test` | Checks source-backed generic recursive identity and provenance under eval and on the ship |

81+| `tools/type-generic-construction-test` | Checks source-backed one-layer recursive construction, provenance and fuel under eval and on the ship |

82+| `tools/type-generic-pattern-test` | Checks source-backed recursive patterns, catch-all coverage, state and per-attempt fuel/arm limits under eval and on the ship |

83+| `tools/type-deferred-test` | Checks the bounded source-owned deferred inference transaction under eval and on the ship |

84+| `tools/type-deferred-resolver-test` | Checks deferred resolution, report consistency and atomic failure under eval and on the ship |

85+| `tools/type-deferred-context-test` | Checks deferred source order and literal branch contexts under eval and on the ship |

86+| `tools/type-deferred-prepared-test` | Checks prepared-prelude tuple initializer recovery, exact partial reports and fail-closed guards under eval and on the ship |

87+| `tools/type-cell-branch-test` | Checks closed-cell branch context, rollback and bounded retry screens under eval and on the ship |

88+| `tools/type-generic-alias-test` | Runs public/private generic union alias and provenance guards under eval and on the ship |

89+| `tools/type-positional-face-guards-test` | Runs positional-call and nested-face guards under eval and on the ship |

90+| `tools/type-qath-guards-test` | Runs source-provenance, recursive unfolding and face guards under eval and on the ship |

91+| `tools/type-todo-partial-test` | Reports partial inference of the unchanged todo island through the real API and readers under eval and on the ship |

92+| `tools/type-todo-api-test` | Exercises the actual todo API through the real Hoon readers and partial checker |

93+| `tools/type-direct-gate-test` | Checks a synthetic source-backed program report and direct gate provenance under eval and on the ship |

94+| `tools/type-program-main-test` | Checks the narrow closed subscription-free program-main interface, downstream import and rejection guards under eval and on the ship |

95+| `tools/type-program-init-test` | Checks transactional direct-program initializer recovery, exact exported/imported types and fail-closed boundaries under eval and on the ship |

96+| `tools/type-program-watch-test` | Checks direct singleton request-value watchability against merged real-todo evidence, exact types/imports and rejection boundaries under eval and on the ship |

97+| `tools/type-closed-gate-guards-test` | Checks closed gate sample labels and face uncertainty under eval and on the ship |

98+| `tools/type-constructor-fit-guards-test` | Checks constructor-case uncertainty and known mismatches under eval and on the ship |

99+| `tools/type-nested-union-guards-test` | Checks nested tagged-union case selection and uncertainty under eval and on the ship |

100+| `tools/type-empty-test` | Checks source-backed empty molds, inhabitedness, coverage and proof budgets under eval and on the ship |

101+| `tools/type-gate-free-guards-test` | Checks bounded gate-free verdicts, inhabitation and witness paths under eval and on the ship |

102+| `tools/type-gate-free-source-test` | Checks source-backed todo mold analysis through the real readers under eval and on the ship |

103+| `tools/type-sub-guards-test` | Checks source-backed subscription mold dependencies under eval and on the ship |

104+| `tools/type-ask-guards-test` | Runs ask origin and canonical list/unit bootstrap guards under eval and on the ship |

105+| `tools/type-request-guards-test` | Runs request evidence, source consistency and cache provenance guards under eval and on the ship |

106+| `tools/type-proj-guards-test` | Runs projection evidence, name-scope and dependency guards under eval and on the ship |

107+| `tools/type-arithmetic-guards-test` | Runs restricted atom-variable, unification and projection guards under eval and on the ship |

108+| `tools/type-module-scope-test` | Checks the partial module checker’s prelude boundary and duplicate-source rejection against `tests/type-module-scope/expected.txt` under eval |

65| `tools/clay-fixtures` | Syncs `my-app`, builds its example `/sur` files and marks through Clay, checks selected mold and mark projections and the partial checker, and records Ford and mark subject shapes on the fake ship |

109| `tools/clay-fixtures` | Syncs `my-app`, builds its example `/sur` files and marks through Clay, checks selected mold and mark projections and the partial checker, and records Ford and mark subject shapes on the fake ship |

66| `tools/hoon` | Evaluates Hoon with the library in scope, as `tools/hoon '(golden /a/b/jibb (crip "++ main view"))'`; `--cord name=file` binds a file's text, `-f` reads the expression from a file |

110| `tools/hoon` | Evaluates Hoon with the library in scope, as `tools/hoon '(golden /a/b/jibb (crip "++ main view"))'`; `--cord name=file` binds a file's text, `-f` reads the expression from a file |

67| `tools/doc-blocks` | Checks the doc's `jibb` blocks against the `doc-*` golden cases: `tools/doc-blocks docs/spec` |

111| `tools/doc-blocks` | Checks the doc's `jibb` blocks against the `doc-*` golden cases: `tools/doc-blocks docs/spec` |

68| `tools/ship` | Runs the fake ship: `start`, `stop`, `status`, `log`, `sync <desk>`, `test`, `gen-tests`, `check-commit`, `scry`, `hoon`, `run`, `poke`, `commit`, `mount`, `unmount` |

112| `tools/ship` | Runs the fake ship: `start`, `stop`, `status`, `log`, `sync <desk>`, `test`, `gen-tests`, `check-commit`, `scry`, `hoon`, `run`, `poke`, `commit`, `mount`, `unmount` |

69| `tools/testdata/selftest` | Tests `tools/golden` and `tools/hoon` against a stub library, and `tools/doc-blocks` against Markdown it writes |

113| `tools/testdata/selftest` | Tests `tools/golden` and `tools/hoon` against a stub library, and `tools/doc-blocks` against Markdown it writes |

70| `tools/testdata/ship-selftest` | Tests `tools/ship`'s test generator and runner against a stub library on the ship |

114| `tools/testdata/ship-selftest` | Tests `tools/ship`'s test generator and runner against a stub library on the ship |

115+| `tools/testdata/clay-fixtures-selftest` | Tests temporary Clay fixture cleanup and signal handling without a ship |

116

72`tools/golden` starts `urbit eval` once and builds the library, which takes about 8 s, then runs every case under `mule`, so a crash fails only its own case.

117`tools/golden` starts `urbit eval` once and builds the library, which takes about 8 s, then runs every case under `mule`, so a crash fails only its own case.

118

@@ -75,20 +120,67 @@ git clone https://github.com/urbit/tools /root/src/tools

120

76```

121```

77tools/golden # all cases pass

122tools/golden # all cases pass

123+tools/golden --case types-prelude-ui # exact UI/program/page schemes and composition

78tools/importer-test # Hoon importer fixture projections match

124tools/importer-test # Hoon importer fixture projections match

125+tools/type-import-default-test # default-wrapped source proofs match

79tools/type-import-test # importer/checker bridge golden report matches

126tools/type-import-test # importer/checker bridge golden report matches

127+tools/type-import-overlap-test # source-aware Hoon overlap and provenance controls

128+tools/type-import-structural-test # nested and multi-case Hoon overlap controls

129+tools/type-union-source-test # local generic-alias union guards

130+tools/type-union-alias-overlap-test # local generic-alias overlap diagnostics

131+tools/type-full-overlap-test # full-module overlap evidence

132+tools/type-tlon-test # real Tlon importer/checker report matches

133+tools/type-import-diagnostic-test # direct structured reader diagnostics match

80tools/type-mark-test # mark/checker bridge golden report matches

134tools/type-mark-test # mark/checker bridge golden report matches

135+tools/type-poke-test # source-backed poke/API bridge report matches

136+tools/type-api-paths-test # partial API path analysis report matches

137+tools/type-api-evidence-test # API declaration evidence guards pass

138+tools/type-hole-guards-test # hole defaulting and API guards pass

139+tools/type-list-alias-test # prelude list-alias guards pass

140+tools/type-generic-alias-test # generic union alias guards pass

141+tools/type-positional-face-guards-test # positional sample face guards pass

142+tools/type-qath-guards-test # qath source and unfolding guards pass

143+tools/type-todo-partial-test # unchanged todo partial report and reader failure controls

144+tools/type-todo-api-test # real todo API partial inference and reader guards pass

145+tools/type-direct-gate-test # direct gate source and provenance guards pass

146+tools/type-program-main-test # closed program-main interface and rejection guards pass

147+tools/type-program-init-test # transactional direct-program initializer context guards pass

148+tools/type-generic-recursion-test # source-backed recursive identities and provenance

149+tools/type-generic-construction-test # source-backed recursive construction and bounds

150+tools/type-generic-pattern-test # source-backed recursive patterns and bounds

151+tools/type-deferred-test # source-owned deferred inference guards

152+tools/type-deferred-resolver-test # resolver consistency and failure guards

153+tools/type-deferred-context-test # deferred source-order and branch guards

154+tools/type-deferred-prepared-test # prepared initializer reports and failure guards

155+tools/type-cell-branch-test # contextual branch rollback and bounds

156+tools/type-closed-gate-guards-test # closed gate fit guards pass

157+tools/type-constructor-fit-guards-test # constructor fit guards pass

158+tools/type-nested-union-guards-test # nested union selector guards pass

159+tools/type-empty-test # empty mold and uninhabited-case guards pass

160+tools/type-gate-free-guards-test # bounded gate-free classifier guards pass

161+tools/type-gate-free-source-test # real todo mold analysis and source guards pass

162+tools/type-sub-guards-test # subscription source guards pass

163+tools/type-ask-guards-test # ask source and bootstrap guards pass

164+tools/type-request-guards-test # request evidence and cache guards pass

165+tools/type-proj-guards-test # projection evidence and scope guards pass

166+tools/type-arithmetic-guards-test # arithmetic constraint guards pass

167+tools/type-module-scope-test # module/prelude scope golden report matches

81tools/hoon check-spans-test # prints <<>>

168tools/hoon check-spans-test # prints <<>>

169+tools/hoon itype-unify-test # type-unification controls pass

170+tools/hoon -f tools/testdata/zing-hoon-reference.hoon # Hoon translation agrees on four inputs

171+tools/hoon -f tools/testdata/lead-late-hoon-reference.hoon # Hoon translation agrees on selected inputs

172+tools/hoon -f tools/testdata/succ-hoon-reference.hoon # Hoon translation agrees on selected inputs

82−tools/testdata/selftest # 19 checks, 0 failed

173+tools/testdata/selftest # 22 checks, 0 failed

83tools/doc-blocks docs/spec # every jibb block has its case

174tools/doc-blocks docs/spec # every jibb block has its case

84tools/ship gen-tests --check # tests/lib/jibb.hoon is up to date

175tools/ship gen-tests --check # tests/lib/jibb.hoon is up to date

85tools/ship test # the cases pass as -test arms on the ship

176tools/ship test # the cases pass as -test arms on the ship

86tools/testdata/ship-selftest # when tools/ship changed

177tools/testdata/ship-selftest # when tools/ship changed

178+tools/testdata/clay-fixtures-selftest # scratch fixture cleanup without a ship

87tools/ship check-commit # when the mark or the desks changed

179tools/ship check-commit # when the mark or the desks changed

88−tools/clay-fixtures # when the my-app Hoon fixtures or importer changed

180+tools/clay-fixtures # builds example fixtures and real Tlon notes through Clay

89```

181```

182

91−`tools/ship test` regenerates `tests/lib/jibb.hoon` and syncs the `jibb-dev` desk before it runs, so commit the regenerated file. A run with `--stub`, `--lib`, or a custom `--golden` isolates its generated golden tests from the repository's other test programs; run the default command afterward to restore and test those programs. It also runs the independent `tests/lib/jibb-import.hoon` test against the same importer fixtures and expected diagnostic projection as `tools/importer-test`. The projection is an internal tree, not the Jibb type printer. `tests/lib/jibb-bridge.hoon` also runs the importer/checker bridge fixture on the ship; `tools/type-import-test` runs the same report under eval. The mark bridge has its own `tests/lib/jibb-mark-bridge.hoon` ship test and `tools/type-mark-test` eval test; both compare the same fixture report.

183+`tools/ship test` regenerates `tests/lib/jibb.hoon` and syncs the `jibb-dev` desk before it runs, so commit the regenerated file. Sync preflights and splits large deletion lists into bounded click requests, waiting for each Clay revision; a failure stops later batches. The ship self-test exercises this when switching from the full desk to a smaller fixture desk. A run with `--stub`, `--lib`, or a custom `--golden` isolates its generated golden tests from the repository's other test programs; run the default command afterward to restore and test those programs. It also runs the independent `tests/lib/jibb-import.hoon` test against the same importer fixtures and expected diagnostic projection as `tools/importer-test`. The projection is an internal tree, not the Jibb type printer. `tests/lib/jibb-bridge.hoon` also runs the importer/checker bridge fixture on the ship; `tools/type-import-test` runs the same report under eval. `tests/lib/jibb-tlon-bridge.hoon` and `tools/type-tlon-test` run the real Tlon presence reader/checker fixture on both. The structured reader diagnostics have their own `tests/lib/jibb-import-diagnostic.hoon` ship test and `tools/type-import-diagnostic-test` eval test. The mark bridge has its own `tests/lib/jibb-mark-bridge.hoon` ship test and `tools/type-mark-test` eval test; both compare the same fixture report. `tests/lib/jibb-poke-bridge.hoon` and `tools/type-poke-test` share the source-backed prelude and poke-only API fixture. `tests/lib/jibb-api-paths.hoon` and `tools/type-api-paths-test` share partial path analysis over the real todo marks; this does not generate request interfaces. `tests/lib/jibb-module-scope.hoon` and `tools/type-module-scope-test` compare the prelude scope report on the ship and under eval.

184

93## Golden cases

185## Golden cases

186

@@ -99,7 +191,12 @@ A case is a folder `tests/golden/<name>/` holding:

99- the expected outputs, `tokens.txt` and `tree.txt`, each the output plus one newline.

191- the expected outputs, `tokens.txt` and `tree.txt`, each the output plus one newline.

100- optionally, `path.txt`, the logical `/ui/.../*.jibb` path to pass to the compiler; the source remains `source.jibb`.

192- optionally, `path.txt`, the logical `/ui/.../*.jibb` path to pass to the compiler; the source remains `source.jibb`.

101- optionally, an `expect-types:` line in `about.txt` opts the case into `+golden-types`; `types.txt` holds its output plus one newline and `--update` creates it. A `types.txt` also opts in when the line is absent. This interface is provisional while the checker is under construction.

193- optionally, an `expect-types:` line in `about.txt` opts the case into `+golden-types`; `types.txt` holds its output plus one newline and `--update` creates it. A `types.txt` also opts in when the line is absent. This interface is provisional while the checker is under construction.

102−- optionally, `imports.txt` selects Hoon `/sur` molds, one `module mold` pair per line. Each module's source goes in `sur/<module>.txt` and is compiled against zuse by both runners. `marks.txt` selects marks, one name per line, with source in `mar/<name>.txt`; both kinds may be supplied together. The reader results go to the partial checker, and a type output is required. These fixtures currently handle only sources without Ford imports, not Jibb module fixtures.

194+- optionally, `imports.txt` selects Hoon `/sur` molds, one `module mold` pair per line. Each module's source goes in `sur/<module>.txt` and is compiled against zuse by both runners. `marks.txt` selects marks, one name per line, with source in `mar/<name>.txt`; both kinds may be supplied together. The reader results go to the partial checker, and a type output is required. Both runners reconstruct fixture text from `%txt` lines and identify the fixture if its compilation crashes; a crash fails the case without discarding its successful parse output. These fixtures currently handle only sources without Ford imports.

195+- optionally, `modules.txt` lists logical `/ui/.../*.jibb` paths, one per line. The corresponding sources live below the case's `modules/ui/` directory. Both runners parse each source at its logical path and compare the combined `module-trees.txt`; `--update` writes that output. A case with type output also supplies these sources and the vendored prelude to the partial module checker. The file opts in even when it lists no sources; use a comment such as `# no module fixtures` for an empty bundle, since zero-byte `%txt` fixtures do not sync reliably on the ship. Blank lines and comment lines are ignored. Cases without `modules.txt` keep their existing no-prelude type interface.

196+

197+The runners prepare the trusted vendored public and internal prelude sources once for their generated test core and share the partial interface. Preparation reserves all names present in the public source and supplies the molds and values the fragment can infer; an unsupported declaration remains reserved but unavailable. The source and checker are incomplete, so the output still says the module has not been checked and does not claim complete shadowing coverage. `+golden-types-with-prelude-and-internal` accepts both sources directly; callers using `+golden-types-with-prepared-prelude` pass the unchanged result of `+prepare-prelude-with-internal`. The older source-only entry points remain available for preludes without imports. Missing or malformed sources fail closed.

198+

199+A zero-byte mark fixture currently fails ship synchronization validation after commit. Use a newline-only fixture to test an empty Hoon source on the ship.

103

200

104Names say what a case is for:

201Names say what a case is for:

105

202

@@ -124,3 +221,5 @@ Write `source.jibb` and `about.txt` by hand, run `tools/golden --update --case <

124## Commits

221## Commits

125

222

126A short subject in the imperative, then a body that says what changed and why, wrapped at 72 columns, as in `git log`. Each commit leaves every check passing.

223A short subject in the imperative, then a body that says what changed and why, wrapped at 72 columns, as in `git log`. Each commit leaves every check passing.

224+

225+`tools/type-deferred-test` exercises the bounded, source-owned constructor transaction and low-level freshness/replay guards. `tools/type-deferred-resolver-test` checks the experimental import-free library resolver, report consistency, atomic failure, and that both source orders of a late face constraint decline. `tools/type-deferred-prepared-test` checks the separate partial-report-only prepared-prelude route, direct tuple-literal obligations, exact report types and its wrong-field, unrelated-tag, mold-collision and no-final-cast controls. These checks do not establish island-kind or watchability support.

docs/open-questions.md+29−3

@@ -18,12 +18,12 @@ On 2026-10-30, @iko adopted gate-free `eq` arguments and map and set keys, treat

19## Questions milestone 2 raises

21−Found while writing [prompts/milestone-2.md](prompts/milestone-2.md) and checking it against the doc's examples. The numbering is retained so existing references stay valid. The prelude inventory in question 3 and the `like` representation in question 18 remain open; the other questions are settled.

21+Found while writing [prompts/milestone-2.md](prompts/milestone-2.md), checking it against the doc's examples, and building the checker. The numbering is retained so existing references stay valid. Question 3 remains open; the field-order detail in question 32 is being clarified. The other questions are settled.

231. **Settled: how the prelude identifies jetted functions.** On 2026-10-30, @iko said the prelude functions have working Jibb implementations, and the compiler recognizes their shapes and uses the Hoon versions so jets can fire.

242. **Settled: how the prelude keeps helpers private.** On 2026-10-30, @iko chose a separate internal prelude module imported by the prelude, without exposing the imported helpers.

253. **The prelude's inventory.** On 2026-10-30, @iko chose to include all names from the listed Hoon library sections, excluding groups the spec explicitly leaves out. All of 3g is included; its Hoon `tone` is exposed as `tone.hoon`, distinct from the styling type. Hoon 1c `step` is exposed as `step.hoon`, leaving the Grammar example's `step` name available. On 2026-10-30, @iko also approved `%$` as a term literal and pattern, so Jibb can write the `%$` case of Hoon `coin`. For parsing sections 4j and 4l, only the explicitly listed `slav` and `slaw` are included; other parser helpers are left out. Jibb's `not` negates a loobean, and Hoon's bitwise `not` is exposed as `not.bit`. @iko also agreed to specifying the complete exported inventory in the doc, building its types and gates needed by the examples in milestone 2, and doing native implementations in milestone 3. Prelude unions such as spaces, roles and tones need names that other modules cannot shadow. The actual inventory and signatures still need to be specified.

26−4. **Settled: a capital in a local `++`.** On 2026-10-30, @iko said it shares the enclosing `++`'s variable of that name; a different type uses a different capital. The Grammar and Decisions record this alongside the earlier aura rules.

26+4. **Settled: a capital in a local `++`.** On 2026-10-30, @iko said it shares the enclosing `++`'s variable of that name if the enclosing `++` also uses it; otherwise the local `++` introduces and generalizes its own variable. For example, `++ inner |= y=A y` shares `A` with an enclosing gate whose sample is `x=A`, but generalizes its own `A` if the enclosing `++` does not use `A`. A different type uses a different capital. The Grammar and Decisions record this alongside the earlier aura rules.

275. **Settled: cells of no items or one.** On 2026-10-30, @iko said a single-item cell is the value and `[]` is an error. The theme's `dark=[tones=[…]]`, a record of one field, must still check.

286. **Settled: a change with no items.** On 2026-10-30, @iko said `m()` is an error. The parser still accepts it; the checker needs to reject it and add a golden case.

297. **Settled: the doc's blocks that aren't whole modules.** On 2026-10-30, @iko agreed to check each in its intended context: the `cmd` and `sub` definitions as prelude source, the Core language tab's `update` inside the todo island, and the Grammar's imports example against fixture files.

@@ -37,8 +37,34 @@ Found while writing [prompts/milestone-2.md](prompts/milestone-2.md) and checkin

3715. **Settled: unrestricted atoms and shared auras.** On 2026-10-30, @iko said `@` means any atom, independently at each occurrence, so Hoon `dime` and `pint` keep their bare-`@` fields. A specific atom such as `@ud` fits where `@` is expected; an `@` value needs a check to fit `@ud`. Shared atom types use one capital, with the atom constraint inferred from its body, as for `add` taking `[A A]` and returning `A`.

3816. **Settled: loobeans in union disjointness.** On 2026-10-30, @iko said `?` counts as its two atoms, `%.y` and `%.n`: it is disjoint from any cell and overlaps the constants 0 and 1.

3917. **Settled: empty cases in union disjointness.** On 2026-10-30, @iko said `!!` is disjoint from every case. A cell containing an empty position at any depth is itself empty and is also disjoint from every case.

40−18. **The two uses of Hoon `like`.** Hoon `+like` is a wet mold builder, but the gate it returns is callable and applies its supplied gate to the product. In a verified Hoon 135 example, applying `(like f)` to `[[1 2] [7 8 ~]]` produces an edge whose product is `8` when `f` is identity and `42` when `f` returns `42`; the resulting nail is the original input. Jibb molds are types, not callable values. The prelude now declares a generic `(like A)` mold and a `wonk` extractor; both parse, but their full type and backend validation remain outstanding. Should it also expose a value gate under `like`? If so, should the value preserve Hoon's input shape and behavior, or instead map the product of an already constructed edge? @iko is reviewing these alternatives; the exact public signature is not yet decided.

40+18. **Settled: the value gate `like`.** On 2026-10-31, @iko chose a gate `(like convert result)` that maps the product of an existing `(like A)` result with `convert=$-(A B)`, yielding `(like B)` while preserving its position and remaining input. An absent result stays absent. The `(like A)` mold remains available in the separate mold namespace. Hoon's wet `+like` instead builds a gate that constructs a result from an input noun; the chosen Jibb value gate is an adaptation of that behavior.

4119. **Settled: Hoon aura families and `step.hoon`.** On 2026-10-30, @iko chose `step.hoon` for Hoon 1c `step`, avoiding a clash with the Grammar example's `step`, and chose one-way widening across Hoon aura families: for example, `@ud` and `@ux` fit `@u`, and `@tD` fits `@t`. The reverse needs a check. The `step.hoon` group representation is not implemented yet.

42+20. **Settled: the type of `clap`.** On 2026-10-30, @iko chose one shared value type for both units and the combining gate. If either unit is absent, `clap` returns the other; if both are present, it applies the gate to their values and wraps the result.

43+21. **Settled: duplicate faces in imported Hoon records.** On 2026-10-30, @iko chose to reject an imported Hoon record with duplicate field names where its type is used. Hoon permits `[a=@ud a=@t]` and picks the first `a`; Jibb rejects it.

44+22. **Settled: overlapping imported `$%` and `$?` cases.** On 2026-10-30, @iko confirmed that the general union disjointness rule rejects imported `$%` and `$?` cases that overlap as nouns where the type is used, as it does for `$^`. The importer rejects recognizable overlaps and fails closed when it cannot verify them.

45+23. **Settled: converging explicit capitals.** On 2026-10-30, @iko chose that a body cannot force two separately written capitals to be equal. For `++ repeated |= x=(choice A A) x`, `++ f |= x=(choice A B) (repeated x)` is an error; use `A` in both positions when the type must be shared. This also applies across local captures and within generic mold applications.

46+

47+24. **Settled: how the internal prelude provides `poke`.** On 2026-10-31, @iko chose to define `poke` in the source-backed private internal prelude module and re-export it through the public prelude as an ordinary transparent type. Ordinary modules can construct and inspect its values. This settles `poke`; it does not decide the representation of `ask` or `qath`.

48+

49+25. **Settled: how the prelude provides `ask` and `qath`.** On 2026-10-31, @iko chose ordinary transparent types defined in the internal prelude and re-exported normally, as for `poke`. Callers may construct and inspect their values.

50+

51+26. **Settled: the `step` example's `at` binder.** On 2026-10-31, @iko chose to rename the `describe` pattern binder to `sent-at`, keeping Hoon's `at` in the prelude and the no-shadowing rule.

52+

53+27. **Settled: duplicate fields in a Jibb-written record.** On 2026-10-31, @iko chose to reject duplicate field names, as for imported Hoon records.

54+

55+28. **Settled: arithmetic on loobeans.** On 2026-10-31, @iko chose to reject loobean operands for arithmetic. Comparison may still accept loobeans and returns `?`. The checker needs to retain this constraint through inference, generalization and instantiation before it exports `add` or `dec`.

56+

57+29. **Settled: printing the arithmetic atom constraint.** On 2026-10-31, @iko chose `where A is an atom other than ?` for a generic arithmetic type whose atom variable excludes loobeans.

58+

59+30. **Settled: a hole inferred as a generic variable.** On 2026-10-31, @iko said a hole resolved to an explicitly written type variable counts as inferred: in `++ id |= x=A ^- _ x`, the result hole is `A`. Named molds must determine their own holes without constraints from later uses; an unconstrained hole is an error.

60+

61+31. **Settled: uses of a value with a hole.** On 2026-10-31, @iko said a value definition must determine its own holes; another definition's use cannot fix an otherwise unresolved hole. For example, `++ id |= x=_ x` remains an error even if a later definition calls `id` with a cord.

62+

63+32. **Partly settled: type-directed record projection.** On 2026-10-31, @iko chose an explicit `(proj record)` whose expected result type selects the fields. There is no automatic projection, and `proj` is reserved against definitions and imports. The result contains exactly the fields of its expected type. Whether the result may reorder fields from the source remains open.

64+

65+33. **Settled: watching a request with unknown provenance.** On 2026-10-31, @iko said an island may watch a request only if the checker proves it watchable at compile time. An unknown request, including one built or passed through a gate without sufficient evidence, is rejected rather than deferred to a runtime check.

66+

67+34. **Settled: constructors and equal noun literals.** On 2026-10-31, @iko said expressions with the same runtime representation count as equal, and cases that cannot be distinguished at runtime are rejected at compile time. Thus `|=%$` matches a case headed by `%$`, `%.y` or `~`: each is the noun 0. Cases with equal heads and overlapping payloads cannot coexist in a union.

43## Grammar questions never put to the doc's author

69## Grammar questions never put to the doc's author

docs/prelude-inventory.md+36−3

@@ -4,12 +4,20 @@ This is a working inventory, not a completed prelude interface. It lists top-lev

5The source is the fake ship's `%base` `/sys/hoon.hoon` (Hoon version 135), read through Clay with `tools/ship scry /cx/=base=/sys/hoon/hoon --raw`. SHA-256: `ef538ced0877230f02ff86f9fb7a0abc6833bb1cf0e8675742b4d6ce478fcc92`. It differs in bytes from [upstream Hoon at the inspected commit](https://github.com/urbit/urbit/blob/5a187fededc4582a34fcd6055c67bb63e0917b94/pkg/arvo/sys/hoon.hoon); verify against the actual target ship when updating this inventory.

7+The vendored prelude defines `poke` in its private internal module and re-exports it as a transparent type. The partial checker resolves its supported source shape and a narrow imported API constructor; complete checking of the private body, other API shapes, effect lowering and runtime execution remain unfinished. `qath` is defined there as a transparent recursive knot sequence and re-exported by the public prelude; the partial checker supports its named identity, selected construction and matching, and static application-path literals. The internal prelude also defines a transparent generic `ask` with pure, agent and store cases; the public prelude re-exports it and defines `pure`. Supported source construction and matching infer, while derived requests, source-schema validation and execution remain unfinished.

9+The prelude also declares the generic `cmd` mold exactly as in Overview, Effects. The partial checker infers its five cases and independent message types in the supported examples; complete module checking and backend validation remain outstanding. The public prelude also declares `sub`; the partial checker infers supported constructions, while request watchability and execution remain outstanding.

10+

11+The public prelude now defines the UI `length`, `align`, `role`, `tone` and `attr` molds, a nonrecursive generic `element` union with one case per UI node, and the exact `program` and `page` records with their builders. Nested child, keyed-item and table payloads in the runtime union are erased to `*`; the public constructors retain typed children and independent key types, and `island` stores `[program data]` in its erased payload. The focused `types-prelude-ui` golden infers the complete union and constructor schemes, including static and message-bearing composition. Raw-constructor encapsulation, duplicate-attribute rejection, rendering, storage, navigation and execution are not established by this slice.

12+

7Hoon `+$` arms are marked **mold** below; `++` arms can be gates, doors or mold generators, and need individual inspection. Jibb's loobean `not` and Hoon's bitwise `not.bit` are distinct. Parser helpers outside 3g are excluded from the intended prelude except the specifically listed `slav` and `slaw`; the raw candidates below still need to be classified.

13Hoon `+$` arms are marked **mold** below; `++` arms can be gates, doors or mold generators, and need individual inspection. Jibb's loobean `not` and Hoon's bitwise `not.bit` are distinct. Parser helpers outside 3g are excluded from the intended prelude except the specifically listed `slav` and `slaw`; the raw candidates below still need to be classified.

9## 1a

15## 1a

11`add`, `dec`, `div`, `dvr`, `gte`, `gth`, `lte`, `lth`, `max`, `min`, `mod`, `mul`, `sub`.

17`add`, `dec`, `div`, `dvr`, `gte`, `gth`, `lte`, `lth`, `max`, `min`, `mod`, `mul`, `sub`.

19+The source-backed `gth` gate calls a compiler-supplied private comparison interface. The partial checker accepts supported equal-aura atom arguments, including loobeans, and returns `?`; lowering, jet recognition and execution remain unfinished. The public `add` and `dec` gates are written in Jibb over private primitive interfaces. The partial checker infers a shared atom type that excludes loobeans, including through supported generic calls. The Jibb-written `lth`, `gte` and `lte` gates compose `gth` and `not`; supported calls infer a shared atom constraint and return `?`. Primitive execution and jet recognition remain unfinished.

20+

13## 1c

21## 1c

15`bite` (mold), `bloq` (mold), `each`, `gate` (mold), `list`, `lone`, `lest`, `mold` (mold), `pair`, `pole`, `qual`, `quip`, `step`, `trap`, `tree`, `trel`, `unit`.

23`bite` (mold), `bloq` (mold), `each`, `gate` (mold), `list`, `lone`, `lest`, `mold` (mold), `pair`, `pole`, `qual`, `quip`, `step`, `trap`, `tree`, `trel`, `unit`.

@@ -20,10 +28,31 @@ Hoon `+$` arms are marked **mold** below; `++` arms can be gates, doors or mold

21`biff`, `bind`, `bond`, `both`, `clap`, `clef`, `drop`, `fall`, `flit`, `hunt`, `lift`, `mate`, `need`, `some`.

29`biff`, `bind`, `bond`, `both`, `clap`, `clef`, `drop`, `fall`, `flit`, `hunt`, `lift`, `mate`, `need`, `some`.

31+The following is an audit of the Hoon 135 bodies, not a completed Jibb interface. The partial checker infers `fall`, `need`, `some`, `bind`, `biff`, `bond`, `both`, `clap`, `clef`, `drop` and `flit`; the remaining written implementations have been parsed, but complete checker validation remains outstanding. Backend validation and jet recognition remain outstanding for all of them.

32+

33+| Name | Hoon behavior | Jibb status |

34+| --- | --- | --- |

35+| `biff` | Applies a gate returning a unit to a present value; absent stays absent. | Written |

36+| `bind` | Applies a gate to a present value and wraps the result; absent stays absent. | Written |

37+| `bond` | Calls a fallback trap for an absent unit, otherwise returns its value. | Written and inferred as a curried gate; backend validation remains outstanding |

38+| `both` | Returns a unit of both values when both units are present. | Written |

39+| `clap` | Returns the present unit if only one is present; combines both values with a gate if both are present. | Written with one shared type for both units and the combining gate, as @iko chose |

40+| `clef` | Applies a gate returning a unit when both inputs are present; otherwise returns an absent unit. | Written |

41+| `drop` | Converts an absent unit to an empty list and a present unit to a singleton. | Written; inferred by the partial checker |

42+| `fall` | Returns the value of a present unit or the supplied fallback. | Written; inferred by the partial checker |

43+| `flit` | Returns a gate that wraps a value only if it satisfies the predicate. | Written |

44+| `hunt` | Returns the only present unit or chooses between two present values with an ordering gate. | Missing |

45+| `lift` | Takes a mold and a unit, then applies the mold to a present value as `bind` does. | Missing; Jibb molds are not callable values |

46+| `mate` | Returns the present unit if only one is present; when both are present it returns one if their values are equal and crashes otherwise. | Missing |

47+| `need` | Extracts a present value and crashes on an absent unit. | Written; inferred by the partial checker |

48+| `some` | Wraps a value in a present unit. | Written |

49+

23## 2b

50## 2b

25`snoc`, `lure`, `fand`, `find`, `flop`, `gulf`, `homo`, `join`, `bake`, `lent`, `levy`, `lien`, `limo`, `murn`, `oust`, `reap`, `rear`, `reel`, `roll`, `scag`, `skid`, `skim`, `skip`, `slag`, `snag`, `snip`, `sort`, `spin`, `spun`, `swag`, `turn`, `weld`, `snap`, `into`, `welp`, `zing`.

52`snoc`, `lure`, `fand`, `find`, `flop`, `gulf`, `homo`, `join`, `bake`, `lent`, `levy`, `lien`, `limo`, `murn`, `oust`, `reap`, `rear`, `reel`, `roll`, `scag`, `skid`, `skim`, `skip`, `slag`, `snag`, `snip`, `sort`, `spin`, `spun`, `swag`, `turn`, `weld`, `snap`, `into`, `welp`, `zing`.

54+The current prelude writes `snoc`, `lure`, `flop`, `join`, `lent`, `zing`, `levy`, `lien`, `murn`, `rear`, `reel`, `roll`, `skim`, `skip`, `snip`, `turn` and `weld`. `lent` counts items by recursion and `add`; `murn` keeps the present products of its gate in order; `join` inserts a separator between items; `snip` drops the last item, and `rear` returns it or crashes on an empty list. The folds take an explicit initial value as the Prelude table specifies. The partial checker infers `snoc`, `lure`, `weld`, `turn`, `flop`, `rear`, `skim`, `skip`, `murn`, `join`, `snip`, `lent`, `zing`, `levy` and `lien` using the validated prelude `list` mold; other list helpers remain limited by that fragment. The result casts on `drop`, `skim`, `skip`, `murn`, `join`, `snip`, `levy` and `lien` state their existing result types without changing their bodies. `zing` concatenates homogeneous lists in order; Hoon’s raw `zing` can also flatten heterogeneous noun lists, which this Jibb type does not express. A Hoon translation agrees with Hoon `zing` on selected finite inputs; this is not Jibb execution. Backend validation and jet recognition remain outstanding for all of them.

55+

27## 2c

56## 2c

29`bex`, `can`, `cat`, `cut`, `end`, `fil`, `hew`, `lsh`, `met`, `rap`, `rep`, `rev`, `rig`, `rip`, `rsh`, `run`, `rut`, `sew`, `swp`, `xeb`, `fe`.

58`bex`, `can`, `cat`, `cut`, `end`, `fil`, `hew`, `lsh`, `met`, `rap`, `rep`, `rev`, `rig`, `rip`, `rsh`, `run`, `rut`, `sew`, `swp`, `xeb`, `fe`.

@@ -72,6 +101,8 @@ Hoon `+$` arms are marked **mold** below; `++` arms can be gates, doors or mold

101

73`aftr`, `cork`, `corl`, `cury`, `curr`, `fore`, `head`, `same`, `succ`, `tail`, `test`, `lead`, `late`.

102`aftr`, `cork`, `corl`, `cury`, `curr`, `fore`, `head`, `same`, `succ`, `tail`, `test`, `lead`, `late`.

103

104+The source-backed `cork` and `corl` compose gates forward and backward, respectively; `cury` and `curr` bind the first and second item of an unfaced pair. `succ` increments an atom through `add`; the partial checker infers a shared atom type excluding loobeans. A Hoon translation agrees with Hoon on ten selected inputs; Jibb execution and jet recognition remain unverified. `lead` and `late` are curried pair constructors: `((lead a) b)` returns `[a b]`, and `((late a) b)` returns `[b a]`. Their arguments may have independent types, including gate values, and neither constructor invokes a gate. The partial checker infers their polymorphic types. A Hoon translation agrees with Hoon’s helpers on selected inputs, but this is not Jibb execution; lowering and jet recognition remain to be validated by a backend.

105+

75## 2o

106## 2o

107

77`jar`, `jug`, `map`, `qeu`, `set`.

108`jar`, `jug`, `map`, `qeu`, `set`.

@@ -90,11 +121,11 @@ Hoon 135's `3g` section has exactly 12 exports: ten `+$` molds (`coin`, `dime`,

121

91| Hoon name | Source shape and Jibb audit |

122| Hoon name | Source shape and Jibb audit |

92| --- | --- |

123| --- | --- |

93−| `coin` | A union of `[%$ p=dime]`, `[%blob p=*]`, and `[%many p=(list coin)]`. Its `$~` default is dropped: Jibb molds have no default. @iko approved `%$` as a Jibb term literal and pattern on 2026-10-30; the parser implements it and ship verification is pending. Its `%$` case uses the `dime` mold below. |

124+| `coin` | A union of `[%$ p=dime]`, `[%blob p=*]`, and `[%many p=(list coin)]`. Its `$~` default is dropped: Jibb molds have no default. @iko approved `%$` as a Jibb term literal and pattern on 2026-10-30; the parser implements it and its golden cases pass under eval and on the ship. Its `%$` case uses the `dime` mold below. |

94| `dime` | `[p=@ta q=@]` in Hoon. The `q` field accepts any atom, as does Jibb `@` after @iko's decision in question 15. |

125| `dime` | `[p=@ta q=@]` in Hoon. The `q` field accepts any atom, as does Jibb `@` after @iko's decision in question 15. |

95| `edge` | `[p=hair q=(unit [p=* q=nail])]`: a parsing position and either no result or a result and remaining input. |

126| `edge` | `[p=hair q=(unit [p=* q=nail])]`: a parsing position and either no result or a result and remaining input. |

96| `hair` | `[p=@ud q=@ud]`: a parsing position. |

127| `hair` | `[p=@ud q=@ud]`: a parsing position. |

97−| `like` | A wet mold builder parameterized by a gate `a=$-(* *)`; its generated gate takes a noun, builds an `edge`-shaped result, and applies `a` to the product on success. The prelude declares the generic mold `+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]`. A callable Jibb value form remains open in question 18. |

128+| `like` | A wet mold builder parameterized by a gate `a=$-(* *)`; its generated gate takes a noun, builds an `edge`-shaped result, and applies `a` to the product on success. The prelude declares the generic mold `+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]`. The Jibb value gate maps the product of an existing result and preserves its position and remaining input; the partial checker infers supported calls, while backend validation remains outstanding. |

98| `nail` | `[p=hair q=tape]`: parsing input. |

129| `nail` | `[p=hair q=tape]`: parsing input. |

99| `pint` | `[p=[p=@ q=@] q=[p=@ q=@]]` in Hoon. The four positions accept atoms independently; Jibb `@` now has the same meaning. |

130| `pint` | `[p=[p=@ q=@] q=[p=@ q=@]]` in Hoon. The four positions accept atoms independently; Jibb `@` now has the same meaning. |

100| `rule` | A gate mold `$-(nail edge)`; Hoon constructs its sample and product from the `nail` and `edge` molds. |

131| `rule` | A gate mold `$-(nail edge)`; Hoon constructs its sample and product from the `nail` and `edge` molds. |

@@ -123,7 +154,7 @@ The following shapes can be written as Jibb declarations once their referenced p

123 [%2 p=(list tank)]

154 [%2 p=(list tank)]

124```

155```

125

156

126−The compiler-result `tone.hoon` has the three cases listed above; the qualified name is a prelude group member, not a `+$` identifier containing a dot. Question 15 in [open-questions.md](open-questions.md) records @iko's decision that `@` is an unrestricted atom, resolving the `dime` and `pint` mismatch. The callable value form of `like` remains unresolved. The new `like` mold and `wonk` gate parse, but full type and backend validation remain outstanding.

157+The compiler-result `tone.hoon` has the three cases listed above; the qualified name is a prelude group member, not a `+$` identifier containing a dot. Question 15 in [open-questions.md](open-questions.md) records @iko's decision that `@` is an unrestricted atom, resolving the `dime` and `pint` mismatch. The source-backed value form of `like` maps an existing result's product. Supported calls infer in the partial checker; complete checking and backend validation for `like` and `wonk` remain outstanding.

127

158

128## 4a

159## 4a

129

160

@@ -133,6 +164,8 @@ The compiler-result `tone.hoon` has the three cases listed above; the qualified

133

164

134`at`, `cass`, `cuss`, `crip`, `mesc`, `runt`, `sand`, `sane`, `ruth`, `trim`, `trip`, `teff`, `taft`, `tuba`, `tufa`, `tuft`, `wack`, `wick`, `woad`, `wood`.

165`at`, `cass`, `cuss`, `crip`, `mesc`, `runt`, `sand`, `sane`, `ruth`, `trim`, `trip`, `teff`, `taft`, `tuba`, `tufa`, `tuft`, `wack`, `wick`, `woad`, `wood`.

135

166

167+The prelude writes `trip` and `tuba` over private primitives. Their inferred types are `$-(@t (list @tD))` and `$-((list @tD) (list @c))`, matching the target ship's Hoon 135 definitions. Composition with `lent` and invalid argument controls pass in the partial checker; primitive lowering, execution and jet recognition remain unfinished.

168+

136## 4k

169## 4k

137

170

138`co`.

171`co`.

docs/prompts/milestone-2.md+11−9

@@ -49,7 +49,7 @@ And from the plan's Risks:

50## First steps

52−1. **Specify the prelude inventory.** The checker needs the prelude's complete exported inventory and signatures; include all names from the listed Hoon library sections except explicitly excluded groups, as `docs/open-questions.md` question 3 records. The prelude imports private helpers and low-level primitives from a separate internal module without exposing them; its public foundational gates are implemented in Jibb on those primitives.

52+1. **Specify the prelude inventory.** The checker needs the prelude's complete exported inventory and signatures; include all names from the listed Hoon library sections except explicitly excluded groups, as `docs/open-questions.md` question 3 records. The prelude imports private helpers and low-level primitives from a separate internal module without exposing them; its public foundational gates are implemented in Jibb on those primitives. The source-backed internal module defines `poke`, `ask` and `qath`; the public prelude re-exports them as ordinary transparent types that modules can construct and inspect, as questions 24 and 25 record. Their current representations and partial checker support are described in `docs/compiler.md`.

54 The plan's three core-language rules were adopted: gate-free `eq` arguments and map and set keys, with gates opaque for union matching; jetted prelude functions taking gates; and rejection of a non-gate value that depends on itself even through a gate.

552. **Start the importer early**, as the plan's Risks ask: first on a small `/sur` file, then on Tlon's. "Suggested design" below has a way in.

@@ -59,21 +59,23 @@ And from the plan's Risks:

59The rules are scattered across the tabs. This is a map of them, not a replacement: read each in place, and where this summary and the doc differ, the doc is right.

61**Types and inference** (Grammar: Molds, Modules, Runes, Expressions; Decisions: Inference, Type variables, Sample names, Inline gates)

62−- Hindley–Milner with aura variables: "every expression has a principal type, and there is no general subtyping". A specific atom fits `@`, a specific noun fits `*`, and a more specific aura fits an ancestor in its Hoon aura family, each only in that direction; the reverse needs a check.

62+- Hindley–Milner with aura variables: "every expression has a principal type, and there is no general subtyping". A specific atom fits `@`, a specific noun fits `*`, and a more specific aura fits an ancestor in its Hoon aura family, each only in that direction; the reverse needs a check. Explicit `proj` is a type-directed operation.

63- `@` means any atom, independently at each occurrence. A specific atom such as `@ud` fits where `@` is expected; an `@` value needs a check to fit `@ud`. `@ud` and `@ux` also fit `@u`, and `@tD` fits `@t`, following Hoon aura families; the reverse needs a check. Distinct specific auras remain distinct. `add` takes `[A A]` and returns `A`, with an atom constraint inferred for the shared type variable.

64+- The reserved, explicit `(proj record)` selects fields according to its expected result type. The checker records the projection and lowering evaluates the source once and builds that layout. A direct call does not insert a projection, and a module cannot define or import another `proj`.

64- Faces are part of record types: `[a=@ b=@]` and `[x=@ y=@]` don't unify. An unnamed position can unify with a faced one and take its face, so `[0 0]` fits `[x=@ud y=@ud]`. A single-item cell `[a]` is `a`; an empty `[]` is an error.

65- Faces are part of record types: `[a=@ b=@]` and `[x=@ y=@]` don't unify. An unnamed position can unify with a faced one and take its face, so `[0 0]` fits `[x=@ud y=@ud]`. A single-item cell `[a]` is `a`; an empty `[]` is an error.

65−- Type variables are capitals, "generalized per `++`". A capital in a local `++` shares the enclosing `++`'s variable of that name; a different type takes a different capital. "A type variable used where an atom is required gains an atom constraint", so `++ clamp |= [lo=A hi=A n=A]`, calling `gth` and `max`, works on any one aura; "It can become nothing more specific: a body that makes `A` a `@ud` or a list is an error." Names "may refer to each other in any order", so infer `++` definitions in dependency order, a group of mutually recursive ones together.

66+- Type variables are capitals, "generalized per `++`". A capital in a local `++` shares the enclosing `++`'s variable of that name if the enclosing `++` also uses it; otherwise the local `++` introduces and generalizes its own variable. For example, `++ inner |= y=A y` shares `A` with an enclosing gate whose sample is `x=A`, but generalizes its own `A` if the enclosing `++` does not use `A`. A different type takes a different capital. A body cannot force two distinct capitals to be equal; use the same capital where a type is shared. "A type variable used where an atom is required gains an atom constraint", so `++ clamp |= [lo=A hi=A n=A]`, calling `gth` and `max`, works on any one aura; "It can become nothing more specific: a body that makes `A` a `@ud` or a list is an error." Names "may refer to each other in any order", so infer `++` definitions in dependency order, a group of mutually recursive ones together.

66- The checker infers a gate-free constraint for `eq` arguments and map and set keys and retains it when a type variable is generalized. The requirement applies recursively to nested values; union-case matching treats gates as opaque. Print a gate-free constraint as `$-([A A] ?) where A contains no gates` and an atom constraint as `$-([A A] A) where A is an atom`; separate multiple clauses with commas, as `where A is an atom, B contains no gates`.

67- The checker infers a gate-free constraint for `eq` arguments and map and set keys and retains it when a type variable is generalized. The requirement applies recursively to nested values; union-case matching treats gates as opaque. Print a gate-free constraint as `$-([A A] ?) where A contains no gates` and an atom constraint as `$-([A A] A) where A is an atom`; separate multiple clauses with commas, as `where A is an atom, B contains no gates`.

67- Gates may call themselves and their siblings; a non-gate value that depends on itself, even through a gate, is an error. Molds may be recursive, and "recursive molds go by name and module".

68- Gates may call themselves and their siblings; a non-gate value that depends on itself, even through a gate, is an error. Molds may be recursive, and "recursive molds go by name and module".

68- A sample's mold may be left out: every bare name in a sample binds, at any depth, as in `|=(p title.p)` "when the call fixes the type", `|= [a=@ b]` and `|=(m ~)`.

69- A sample's mold may be left out: every bare name in a sample binds, at any depth, as in `|=(p title.p)` "when the call fixes the type", `|= [a=@ b]` and `|=(m ~)`.

69- Generic molds: `+$ result |$ [V E]` with cases below, applied as `(result V E)`; `|$` goes right after a `+$`'s name, and the prelude's `cmd` and `sub` use `|$ [M]`.

70- Generic molds: `+$ result |$ [V E]` with cases below, applied as `(result V E)`; `|$` goes right after a `+$`'s name, and the prelude's `cmd` and `sub` use `|$ [M]`.

70- `!!` is the empty mold, and as an expression it has any type. `*` is the noun type, not a type variable; generic positions such as the keys in `each` and `table` use a capital. A value of a more specific noun type can be used where `*` is expected.

71- `!!` is the empty mold, and as an expression it has any type. `*` is the noun type, not a type variable; generic positions such as the keys in `each` and `table` use a capital. A value of a more specific noun type can be used where `*` is expected.

72+- `_` is an inferable hole wherever a mold can appear, including an inferred path-segment aura. A hole resolved to an explicitly named generic variable is resolved; an unconstrained hole is an error. A named mold or value definition must determine its own holes without constraints from later uses.

71−- `poke`, `ask` and `qath` are opaque, built only by derived gates, `pure` and application-path literals.

73+- `poke`, `ask` and `qath` are transparent types defined in the internal prelude and re-exported normally. Derived gates and `pure` also construct requests; application-path literals have type `qath`.

72- The Literals table gives every other literal its type: `0x1f` a `@ux`, ships `@p`, dates `@da`, durations `@dr`, `~.knot` a `@ta`, strings `@t`, `` `x `` a `(unit A)`, `~[…]` a `(list A)`, `gap+%s2` the pair `[%gap %s2]`, `/posts/~zod` a `path`, `%/blog` a `qath`.

74- The Literals table gives every other literal its type: `0x1f` a `@ux`, ships `@p`, dates `@da`, durations `@dr`, `~.knot` a `@ta`, strings `@t`, `` `x `` a `(unit A)`, `~[…]` a `(list A)`, `gap+%s2` the pair `[%gap %s2]`, `/posts/~zod` a `path`, `%/blog` a `qath`.

74**Tags, `~`, numbers and cells wait for their context** (Grammar: Tag resolution, Literals by context)

76**Tags, `~`, numbers and cells wait for their context** (Grammar: Tag resolution, Literals by context)

75- A tag or `~` gets a fresh variable and a pending constraint, checked once unification fixes the variable: against a union's cases, by shape and shared tag positions, or as a constant atom for `@tas`, `@ta`, `@` or `*`. A literal that matches nothing is "an error naming the union, such as "msg has no case %submitt"".

77- A tag or `~` gets a fresh variable and a pending constraint, checked once unification fixes the variable: against a union's cases, by shape and shared tag positions, or as a constant atom for `@tas`, `@ta`, `@` or `*`. A literal that matches nothing is "an error naming the union, such as "msg has no case %submitt"".

76−- `|=%typed` is a case's constructor: "against `$-(@t M)` it is `|=(t [%typed t])`, requiring `M` to have a case `[%typed @t]`. It works for cases tagged at their head; a bare tag is always a value."

78+- `|=%typed` is a case's constructor: "against `$-(@t M)` it is `|=(t [%typed t])`, requiring `M` to have a case `[%typed @t]`. A literal case head matches by noun value, so `|=%$` also matches `%.y` and `~` heads; a bare tag is always a value."

77- A variable constrained by tag resolution, and any it mentions, doesn't generalize; it stays open until something in the module fixes it. An island's `main` fixes its messages. A tag constraint still open when the module is checked is an error asking for a `^-`; the checker never guesses. Gate-free constraints are retained when generalized.

79- A variable constrained by tag resolution, and any it mentions, doesn't generalize; it stays open until something in the module fixes it. An island's `main` fixes its messages. A tag constraint still open when the module is checked is an error asking for a `^-`; the checker never guesses. Gate-free constraints are retained when generalized.

78- "Wing access, changes and `?-` on a type not yet known wait the same way." A change with no items, `m()`, is an error; the parser still accepts it. Patterns don't wait: they're checked against the subject's type.

80- "Wing access, changes and `?-` on a type not yet known wait the same way." A change with no items, `m()`, is an error; the parser still accepts it. Patterns don't wait: they're checked against the subject's type.

79- Number and cell literals each "takes a default when its `++` is checked": a number `@ud`, a cell a tuple. But "A number takes `@ud` only if nothing fixes its aura and its `++` isn't generic over it", so `++ inc |= n=A (add n 1)` stays generic: unlike a tag's, a number's variable doesn't stop its `++` from generalizing. A cell can also become a record or, where a list is expected, a cons.

81- Number and cell literals each "takes a default when its `++` is checked": a number `@ud`, a cell a tuple. But "A number takes `@ud` only if nothing fixes its aura and its `++` isn't generic over it", so `++ inc |= n=A (add n 1)` stays generic: unlike a tag's, a number's variable doesn't stop its `++` from generalizing. A cell can also become a record or, where a list is expected, a cons.

@@ -98,7 +100,7 @@ The rules are scattered across the tabs. This is a map of them, not a replacemen

98- `main`'s type decides a module's kind: `(element !!)` a page, `(page R D)` a page with data, `(program D X M)` an island, `(store S)` a store; no `main`, a library.

100- `main`'s type decides a module's kind: `(element !!)` a page, `(page R D)` a page with data, `(program D X M)` an island, `(store S)` a store; no `main`, a library.

101

100**Importing Hoon types** (overview: Importing Hoon types; Decisions: Hoon types)

102**Importing Hoon types** (overview: Importing Hoon types; Decisions: Hoon types)

101−- The table: `$%` and `$?` become a union; `$@` a union with an atom case; `$^` a union if its cases differ as nouns, else an error where used; `$~` dropped; `map`, `set`, `qeu`, `jar`, `jug` the same, by name; `mop` as `(mop K V)`, read with `on`; other `$|` their base type; `%0`, `%&` and `%|` tags; recursive molds recursive, matched by name; cores, gates, vases, signed and float auras an error where used.

103+- The table: `$%`, `$?` and `$^` become unions only if their cases differ as nouns, else an error where used; `$@` a union with an atom case; `$~` dropped; `map`, `set`, `qeu`, `jar`, `jug` the same, by name; `mop` as `(mop K V)`, read with `on`; other `$|` their base type; `%0`, `%&` and `%|` tags; recursive molds recursive, matched by name; imported records with duplicate field names, cores, gates, vases, signed and float auras are errors where used.

102- "Unused molds are skipped, so unsupported constructs elsewhere in a `/sur` file are fine." A field's unnamed union imports too, although Jibb cannot write one.

104- "Unused molds are skipped, so unsupported constructs elsewhere in a `/sur` file are fine." A field's unnamed union imports too, although Jibb cannot write one.

103

105

104**Islands, pages and stores** (overview: The Elm architecture on Urbit; Grammar: Modules and the store example)

106**Islands, pages and stores** (overview: The Elm architecture on Urbit; Grammar: Modules and the store example)

@@ -107,19 +109,19 @@ The rules are scattered across the tabs. This is a map of them, not a replacemen

107- "Island data and models can't hold gates; the checker names the field."

109- "Island data and models can't hold gates; the checker names the field."

108

110

109**API files, stores and derived gates** (overview: Agent APIs, Effects; Grammar: Modules)

111**API files, stores and derived gates** (overview: Agent APIs, Effects; Grammar: Modules)

110−- `/ui/api/<agent>.jibb` declares `+$ poke` and `+$ paths`; "`poke` and `paths` are declarations, not molds." "A path case is a request name, a path and a type", and "A case can name another scry path, as in `[%changes /updates (facts todos todo-update) scry=/todos]`, used only by pages." An island watching a request whose case has `scry=` has a type error.

112+- `/ui/api/<agent>.jibb` declares `+$ poke` and `+$ paths`; "`poke` and `paths` are declarations, not molds." "A path case is a request name, a path and a type", and "A case can name another scry path, as in `[%changes /updates (facts todos todo-update) scry=/todos]`, used only by pages." An island may watch a request only when the checker proves it is watchable; a separate `scry=` path or unknown watchability is a type error.

111- Each poke type gives a constructor, as `todo-action.todo`, and each path case a request, as `(todos.todo |=%got)`. A path with typed segments takes them too: the overview's `(post.api slug same)` suggests they come first. A `(facts full diff …)` case's request also takes a fold, as `$-([[%todo-update todo-update] todos] todos)`.

113- Each poke type gives a constructor, as `todo-action.todo`, and each path case a request, as `(todos.todo |=%got)`. A path with typed segments takes them too: the overview's `(post.api slug same)` suggests they come first. A `(facts full diff …)` case's request also takes a fold, as `$-([[%todo-update todo-update] todos] todos)`.

112- A store's `+$ poke` is a declaration, not a mold. A store exports a constructor per poke type and a `state` request. Clashing derived names are errors, including clashes with an import face. The checker must account for the fact that the type of `main` determines whether a module is a store.

114- A store's `+$ poke` is a declaration, not a mold. A store exports a constructor per poke type and a `state` request. Clashing derived names are errors, including clashes with an import face. The checker must account for the fact that the type of `main` determines whether a module is a store.

113

115

114**The prelude** (overview: Prelude, Layout and styling, Links and URLs, Effects)

116**The prelude** (overview: Prelude, Layout and styling, Links and URLs, Effects)

115- Hoon's standard library regrouped, "written in Jibb and vendored as `/lib/jibb/prelude`", plus `eq`, `not`, `page`, `program`, `store`, `pure`, `island`, the layout elements and molds, `attr`, `theme`, and `cmd` and `sub` as the overview's Effects block writes them.

117- Hoon's standard library regrouped, "written in Jibb and vendored as `/lib/jibb/prelude`", plus `eq`, `not`, `page`, `program`, `store`, `pure`, `island`, the layout elements and molds, `attr`, `theme`, and `cmd` and `sub` as the overview's Effects block writes them.

116−- Signatures change where the Prelude table says: maps and sets are plain gates over Hoon's trees, as `(get.by m k)`; folds take a start, as `(roll xs init f)`, `rep.by` and `rep.in`; ordered maps go through lull's `on`, as `(get.on lte m k)`.

118+- Signatures change where the Prelude table says: `clap` takes two units of one value type and a combining gate over that type; the value gate `(like convert result)` maps the product of a `(like A)` to a `(like B)`, preserving position and remaining input; maps and sets are plain gates over Hoon's trees, as `(get.by m k)`; folds take a start, as `(roll xs init f)`, `rep.by` and `rep.in`; ordered maps go through lull's `on`, as `(get.on lte m k)`.

117- Left out: signed and float gates, parser helpers outside 3g other than the explicitly listed `slav` and `slaw`, and the table's "The rest" (1b, 2p, 3d, 3f, 4c, 4n, 4o, 5a–5f); "`jam`, `cue` and `fein` run inside the runtime".

119- Left out: signed and float gates, parser helpers outside 3g other than the explicitly listed `slav` and `slaw`, and the table's "The rest" (1b, 2p, 3d, 3f, 4c, 4n, 4o, 5a–5f); "`jam`, `cue` and `fein` run inside the runtime".

118- Write the prelude in Jibb, enough to give every name its type. Foundational gates use private low-level primitives from the internal prelude module. Jetted functions have working Jibb implementations; the compiler recognizes their shapes and uses the Hoon versions so jets can fire. They may take gates as arguments; the Nock backend comes in milestone 3.

120- Write the prelude in Jibb, enough to give every name its type. Foundational gates use private low-level primitives from the internal prelude module. Jetted functions have working Jibb implementations; the compiler recognizes their shapes and uses the Hoon versions so jets can fire. They may take gates as arguments; the Nock backend comes in milestone 3.

119- Element signatures are in the Layout and styling table. Paths and unchecked cords have separate declarations, with `link-unsafe`, `image-unsafe` and `go-unsafe` for the unchecked forms. Both navigation declarations produce `[%go url=@t]`; `go` converts its application path to a cord including the app's base path. "The same attribute twice in a literal list is an error."

121- Element signatures are in the Layout and styling table. Paths and unchecked cords have separate declarations, with `link-unsafe`, `image-unsafe` and `go-unsafe` for the unchecked forms. Both navigation declarations produce `[%go url=@t]`; `go` converts its application path to a cord including the app's base path. "The same attribute twice in a literal list is an error."

120

122

121**Errors**

123**Errors**

122−- Each one the Grammar tab describes needs a golden case with its message. A start on the list: an aura mismatch; mismatched faces; "msg has no case %submitt"; an unresolved tag, as the Grammar's `add-button` ("nothing fixes the union of %add"); an open constraint at the end of a module; a `|=%tag` whose union has no such case tagged at its head; a union whose cases overlap; a missing `?-` case, named; an arm that earlier arms cover; a value that refers to itself; a shadowed name, including a prelude or imported one; a cell in `{…}` with no printer; an atom of a generic aura in `{…}` or a path's `(…)`; a capital that a body makes a `@ud` or a list; `~[text "hi"]`, where the checker suggests `~[(text "hi")]`; clashing derived names; an import cycle; from an import, a signed or float aura, a core, gate or vase, or a `$^` whose cases don't differ as nouns, each where used; a `(facts …)` outside an API file's `paths`; a gate in island data or a model, naming the field; a repeated attribute in a literal list. Read the Grammar tab, and the other tabs' mentions of "error" and "the checker", and make the list complete.

124+- Each one the Grammar tab describes needs a golden case with its message. A start on the list: an aura mismatch; mismatched faces; "msg has no case %submitt"; an unresolved tag, as the Grammar's `add-button` ("nothing fixes the union of %add"); an open constraint at the end of a module; a `|=%tag` whose union has no case with an equal literal head; a union whose cases overlap; a missing `?-` case, named; an arm that earlier arms cover; a value that refers to itself; a shadowed name, including a prelude or imported one; a cell in `{…}` with no printer; an atom of a generic aura in `{…}` or a path's `(…)`; a capital that a body makes a `@ud` or a list; `~[text "hi"]`, where the checker suggests `~[(text "hi")]`; clashing derived names; an import cycle; from an import, a signed or float aura, a core, gate or vase, or a `$%`, `$?` or `$^` whose cases don't differ as nouns, or a record with duplicate field names, each where used; a `(facts …)` outside an API file's `paths`; a gate in island data or a model, naming the field; a repeated attribute in a literal list. Read the Grammar tab, and the other tabs' mentions of "error" and "the checker", and make the list complete.

123- For a `+$` whose cases overlap or do not fit, suggest that a record or tuple leaves its `[` open on the `+$` line. `+$ pt` above `@t` and `[@ud @ud]` is a valid union.

125- For a `+$` whose cases overlap or do not fit, suggest that a record or tuple leaves its `[` open on the `+$` line. `+$ pt` above `@t` and `[@ud @ud]` is a valid union.

124- "Each error names both conflicting sites, with excerpts." Today's `error` is `[file line col msg]`, a start only; spans keep each node's end so that a type error can underline both sites.

126- "Each error names both conflicting sites, with excerpts." Today's `error` is `[file line col msg]`, a start only; spans keep each node's end so that a type error can underline both sites.

125- Messages name things in the doc's words and quote the code they're about in backticks, as milestone 1's do. Their wording is fixed by the golden tests once written.

127- Messages name things in the doc's words and quote the code they're about in backticks, as milestone 1's do. Their wording is fixed by the golden tests once written.

docs/spec/core-language.md+2−1

@@ -71,7 +71,7 @@ axis = digit { digit } ; (* at least 1 *)

72## Lowering from Jibb

74−Types, faces and casts leave nothing behind; everything else lowers by these rules.

74+Types, faces and casts leave nothing behind. Everything else lowers by these rules.

76| Jibb | Core language |

77| --- | --- |

@@ -82,6 +82,7 @@ Types, faces and casts leave nothing behind; everything else lowers by these rul

82| `gap+%s2` | `(cons %gap %s2)` |

83| `/posts/~zod`, `%/blog/(slug)` | A list of knots, typed segments printed by their aura's native; the runtime adds the base path to an application path |

84| `title.p`, `space.theme.theme` | `slot` at the field's axis, nested for longer wings |

85+| `(proj record)` | Apply a `lam` to the source once; its body constructs the expected record from the required fields using `slot` and `cons`, discarding extra fields |

85| `card.card`, an import | The qualified name `components/card:card` |

86| `card.card`, an import | The qualified name `components/card:card` |

86| `m(draft=t error=~)` | One `edit` per item, in order: `(edit 7 (edit 6 m t) ~)` |

87| `m(draft=t error=~)` | One `edit` per item, in order: `(edit 7 (edit 6 m t) ~)` |

87| `f a b c` | `(app f (cons a (cons b c)))`: the arguments are the sample |

88| `f a b c` | `(app f (cons a (cons b c)))`: the arguments are the sample |

docs/spec/decisions.md+14−8

@@ -24,25 +24,29 @@ The choices behind the Language tab, made on 2026-10-23; a later date marks a re

24| Several open brackets | The deeper lines go to the last bracket, or the last rune's body, left open on a line, and the brackets before it close with it: `(column ~ ~[` needs no `)` | Decided 2026-10-30 |

25| Jibb code blocks | Labelled `jibb` in this doc; each is a golden test | Decided 2026-10-30 |

26| Definitions | `++` for values, `+$` for molds; no `=/` | Decided |

27−| Unions | No `$?`: a `+$` with its cases on the lines below is a union, so every union written in Jibb has a name; one case is just that mold; a mold that isn't a union counts as a union of one case for tags and `\|=%tag`; a generic's `\|$` comes right after the `+$`'s name; tags anywhere; cases differ as nouns, with `?` treated as the two atoms `%.y` and `%.n`, disjoint from cells and overlapping constants 0 and 1, and `!!` or any cell with an empty position disjoint from every case; a tag literal or `~` waits for its union, and an unresolved one is an error | Decided 2026-10-30 |

27+| Unions | No `$?`: a `+$` with its cases on the lines below is a union, so every union written in Jibb has a name; one case is just that mold; a mold that isn't a union counts as a union of one case for tags and `\|=%tag`; a generic's `\|$` comes right after the `+$`'s name; tags anywhere; constructor heads and case disjointness compare literal noun values regardless of spelling, so `%$`, `%.y` and `~` are equal and overlapping cases are errors; cases differ as nouns, with `?` treated as the two atoms `%.y` and `%.n`, disjoint from cells and overlapping constants 0 and 1, and `!!` or any cell with an empty position disjoint from every case; a tag literal or `~` waits for its union, and an unresolved one is an error | Decided 2026-10-31 |

28| Printed unnamed unions | Print the cases separated by spaces, as `%approve %deny`; this is print-only, not Jibb syntax | Decided 2026-10-30 |

29−| Printed type constraints | Print an atom constraint as `$-([A A] A) where A is an atom` and a gate-free constraint as `$-([A A] ?) where A contains no gates`; separate multiple clauses with commas, as `where A is an atom, B contains no gates` | Decided 2026-10-30 |

29+| Printed type constraints | Print an atom constraint as `$-([A A] A) where A is an atom`, an arithmetic atom constraint as `where A is an atom other than ?`, and a gate-free constraint as `$-([A A] ?) where A contains no gates`; separate multiple clauses with commas, as `where A is an atom, B contains no gates` | Decided 2026-10-31 |

30| Branching | `?-` only, loobeans included; exhaustive, with explicit catch-alls; covered arms are errors; failures say `!!` | Decided 2026-10-29 |

31| Equality and negation | The gates `eq` and `not`, with Hoon's bitwise `not` exposed as `not.bit`; `eq`'s arguments and map and set keys contain no gates, even nested; the checker infers and generalizes that constraint; union matching never inspects a gate to distinguish cases | Decided 2026-10-30 |

32| Special rules | No built-ins; type-directed rules are welcome, each listed in the Grammar tab | Decided 2026-10-29 |

33| Inference | Hindley–Milner with aura variables; `@` is any atom, a specific atom fits `@` and a more specific aura fits an ancestor in its Hoon aura family, but each reverse needs a check, and repeated atom-constrained capitals give the same type; a number takes `@ud` only where its `++` isn't generic over its aura; distinct specific auras remain distinct; faces are part of record types, and an unnamed position can take a face but two different faces don't unify; principal types | Decided 2026-10-30 |

34−| Effects | The library unions `cmd` and `sub`; pokes and requests are opaque, from derived gates and `pure`; islands read agents only by watching; replies get full state, and diffs take a fold; timers carry the time; `%who` gives the owner's `@p`; nacks reach replies as text | Decided 2026-10-29 |

34+| Effects | The library unions `cmd` and `sub`; `poke`, `ask` and `qath` are transparent types defined in the internal prelude and re-exported normally; derived gates and `pure` also construct requests; islands read agents only by watching; replies get full state, and diffs take a fold; timers carry the time; `%who` gives the owner's `@p`; nacks reach replies as text | Decided 2026-10-31 |

35+| Poke representation | The source-backed private internal prelude module defines `poke`, and the public prelude re-exports it as an ordinary transparent type. Ordinary modules can construct and inspect its values | Decided 2026-10-31 |

35−| Agent APIs | `/ui/api/<agent>.jibb` with `+$ poke` and `+$ paths`, over the agent's mark types; a case is a name, a path and a type, with `(facts full diff …)` for diffs, told apart by mark; an optional scry path, for pages; an island watching such a request has a type error; typed segments by aura | Decided 2026-10-30 |

36+| Agent APIs | `/ui/api/<agent>.jibb` with `+$ poke` and `+$ paths`, over the agent's mark types; a case is a name, a path and a type, with `(facts full diff …)` for diffs, told apart by mark; an optional scry path, for pages; an island may watch a request only when the checker proves it is watchable, so a separate scry path or unknown watchability is an error; typed segments by aura | Decided 2026-10-31 |

36| Mark names | Any name: `/%` names types after marks, and constructors poke with their type's mark; no alias marks | Decided 2026-10-26 |

37| Mark names | Any name: `/%` names types after marks, and constructors poke with their type's mark; no alias marks | Decided 2026-10-26 |

37| Derived gates | API files and stores give a constructor per poke type and a checked request per path or store state; clashing names are errors, including a derived name that clashes with an import face | Decided 2026-10-30 |

38| Derived gates | API files and stores give a constructor per poke type and a checked request per path or store state; clashing names are errors, including a derived name that clashes with an import face | Decided 2026-10-30 |

38−| Hoon types | A fixed translation table; `map`, `set`, `qeu`, `jar`, `jug` by name; `mop` as `(mop K V)`, read with `on`; unused molds skipped | Decided 2026-10-29 |

39+| Hoon types | A fixed translation table; `map`, `set`, `qeu`, `jar`, `jug` by name; `mop` as `(mop K V)`, read with `on`; imported `$%`, `$?` and `$^` cases must differ as nouns, and records with duplicate field names are errors where used; unused molds skipped | Decided 2026-10-30 |

40+| Record fields | Duplicate field names in a Jibb-written record are an error, as they are in an imported Hoon record | Decided 2026-10-31 |

41+| Record projection | The explicit type-directed operation `proj` takes a record and uses its expected result type to select its fields; no projection is inserted automatically. `proj` is reserved and cannot be defined or imported under that name. The result has exactly the fields declared by its type | Decided 2026-10-31 |

39| Layout | Indentation; juxtaposed calls; a bracket open at line end takes one item per line, with no closer | Decided |

42| Layout | Indentation; juxtaposed calls; a bracket open at line end takes one item per line, with no closer | Decided |

40| Elements | Ordinary gates; containers take attribute lists; `stack` switches at `wide`; `el` adds attributes and wins; headings 1 to 6; `form` sends on Enter, the innermost when nested; `image` from an application path, sized from the file, or a sized URL; no focus control for now | Decided 2026-10-29 |

43| Elements | Ordinary gates; containers take attribute lists; `stack` switches at `wide`; `el` adds attributes and wins; headings 1 to 6; `form` sends on Enter, the innermost when nested; `image` from an application path, sized from the file, or a sized URL; no focus control for now | Decided 2026-10-29 |

41| Long calls | One argument per line inside parentheses | Decided |

44| Long calls | One argument per line inside parentheses | Decided |

43| Empty mold | `!!`, with no values; the expression has any type; pages are `(element !!)`, which keeps islands out of islands | Decided 2026-10-29 |

46| Empty mold | `!!`, with no values; the expression has any type; pages are `(element !!)`, which keeps islands out of islands | Decided 2026-10-29 |

44| Noun mold | `*` is the noun type, not a type variable; use a capital for a generic type; a value of a more specific noun type can be used where `*` is expected | Decided 2026-10-30 |

47| Noun mold | `*` is the noun type, not a type variable; use a capital for a generic type; a value of a more specific noun type can be used where `*` is expected | Decided 2026-10-30 |

45−| Type variables | Capitals, generalized per `++`; a capital in a local `++` shares the enclosing `++`'s variable of that name, and a different type takes a different capital; one used where an atom is required gains an inferred atom constraint, and cannot be fixed to a more specific type in its body | Decided 2026-10-30 |

48+| Type variables | Capitals, generalized per `++`; a capital in a local `++` shares the enclosing `++`'s variable of that name if the enclosing `++` also uses it; otherwise it is introduced and generalized locally; a different type takes a different capital; a body cannot force distinct capitals to be equal, so a shared type uses the same capital; one used where an atom is required gains an inferred atom constraint, and cannot be fixed to a more specific type in its body | Decided 2026-10-30 |

49+| Partial type annotations | `_` may appear wherever a mold may appear and marks that part of the type for inference; a hole inferred as a named type variable is resolved; an unconstrained hole is an error, and a named mold or value definition must determine its own holes without constraints from later uses | Decided 2026-10-31 |

46| Loobean mold | `?`, switched with `?-` | Decided 2026-10-26 |

50| Loobean mold | `?`, switched with `?-` | Decided 2026-10-26 |

47| Defaults | None | Decided |

51| Defaults | None | Decided |

48| Modules | Records, not cores | Decided |

52| Modules | Records, not cores | Decided |

@@ -51,6 +55,7 @@ The choices behind the Language tab, made on 2026-10-23; a later date marks a re

51| Binding patterns | In `?-` arms; the last position binds the rest | Decided 2026-10-29 |

55| Binding patterns | In `?-` arms; the last position binds the rest | Decided 2026-10-29 |

52| Text | Strings are written only as `"…"` and are always cords; tapes come from `trip`; `{…}` prints by aura, a bare `@` as `@ud`, and an atom whose aura its `++` is generic over is an error; `print-date` prints Urbit-style to the minute in the theme's zone, from jibb-dev's zone table; numbers keep Hoon's form | Decided 2026-10-30 |

56| Text | Strings are written only as `"…"` and are always cords; tapes come from `trip`; `{…}` prints by aura, a bare `@` as `@ud`, and an atom whose aura its `++` is generic over is an error; `print-date` prints Urbit-style to the minute in the theme's zone, from jibb-dev's zone table; numbers keep Hoon's form | Decided 2026-10-30 |

53| Auras | Specific auras stay distinct; `@` is any atom, a more specific aura fits an ancestor in its Hoon aura family one way, with the reverse requiring a check, and shared atom-constrained type variables preserve the same aura | Decided 2026-10-30 |

57| Auras | Specific auras stay distinct; `@` is any atom, a more specific aura fits an ancestor in its Hoon aura family one way, with the reverse requiring a check, and shared atom-constrained type variables preserve the same aura | Decided 2026-10-30 |

58+| Loobean arithmetic | Arithmetic rejects loobean operands; comparison may accept them and returns `?` | Decided 2026-10-31 |

54| Crashes | As in Hoon; an island keeps its model and shows the standard notice; a failing page, or one rendering a control outside an island, gets Jibb's error page; no render limit, so an endless render stalls the ship | Decided 2026-10-29 |

59| Crashes | As in Hoon; an island keeps its model and shows the standard notice; a failing page, or one rendering a control outside an island, gets Jibb's error page; no render limit, so an endless render stalls the ship | Decided 2026-10-29 |

55| Refinement types | None | Decided |

60| Refinement types | None | Decided |

56| Imports | `/-`, `/%` (a mark's type, with no face) and `/=`; no `/+`; cycles are errors | Decided 2026-10-29 |

61| Imports | `/-`, `/%` (a mark's type, with no face) and `/=`; no `/+`; cycles are errors | Decided 2026-10-29 |

@@ -67,7 +72,7 @@ The choices behind the Language tab, made on 2026-10-23; a later date marks a re

67| Inputs | A message per input event, none mid-composition; controls reset to the latest view after every event; fields read-only until the island starts | Decided 2026-10-29 |

72| Inputs | A message per input event, none mid-composition; controls reset to the latest view after every event; fields read-only until the island starts | Decided 2026-10-29 |

68| Transactions | None; one poke per command | Decided |

73| Transactions | None; one poke per command | Decided |

69| Reloads | Restart from the model the page is served with | Decided 2026-10-29 |

74| Reloads | Restart from the model the page is served with | Decided 2026-10-29 |

70−| Shared state | Stores: browser agents written like API files, with `state`, `+$ poke` and `(store init update)`; the store's `+$ poke` is a declaration, not a mold; poked and watched through derived gates; one per page | Decided 2026-10-30 |

75+| Shared state | Stores: browser agents written like API files, with `state`, `+$ poke` and `(store init update)`; the store's `+$ poke` is a declaration, not a mold; derived gates provide poke constructors and state requests; one per page | Decided 2026-10-31 |

71| Subscriptions | By agent and path, shared per page; the first fact is full state, so no paths that need a scry path | Decided 2026-10-29 |

76| Subscriptions | By agent and path, shared per page; the first fact is full state, so no paths that need a scry path | Decided 2026-10-29 |

72| Apps | One island under a catch-all route, given the path by `pure`; `%url` delivers the path on every change; in-section links act as `go`; focus moves to the first heading | Decided 2026-10-29 |

77| Apps | One island under a catch-all route, given the path by `pure`; `%url` delivers the path on every change; in-section links act as `go`; focus moves to the first heading | Decided 2026-10-29 |

73| Layout vocabulary | Jibb's elements and theme tokens; the stylesheet comes from the theme alone; chars and fill are inline; `[%fill n]` below 1 counts as 1 | Decided 2026-10-29 |

78| Layout vocabulary | Jibb's elements and theme tokens; the stylesheet comes from the theme alone; chars and fill are inline; `[%fill n]` below 1 counts as 1 | Decided 2026-10-29 |

@@ -76,7 +81,8 @@ The choices behind the Language tab, made on 2026-10-23; a later date marks a re

76| Dark mode | Hand-written dark tones under `dark`, used when the reader prefers dark | Decided 2026-10-27 |

81| Dark mode | Hand-written dark tones under `dark`, used when the reader prefers dark | Decided 2026-10-27 |

77| Links | All text escaped; in-app links are application paths, as `%/blog/(slug)`, with no query or fragment, checked at compile time against routes and static files; paths and unchecked `https`, `mailto` and `tel` URLs and root-relative cords such as `"/apps/groups"` have separate declarations; `link-unsafe`, `image-unsafe` and `go-unsafe` are the unchecked forms; both navigation declarations produce `[%go url=@t]`, with `go` converting the path to a cord including the app's base path; other cords render as text; a CSP on every page | Decided 2026-10-30 |

82| Links | All text escaped; in-app links are application paths, as `%/blog/(slug)`, with no query or fragment, checked at compile time against routes and static files; paths and unchecked `https`, `mailto` and `tel` URLs and root-relative cords such as `"/apps/groups"` have separate declarations; `link-unsafe`, `image-unsafe` and `go-unsafe` are the unchecked forms; both navigation declarations produce `[%go url=@t]`, with `go` converting the path to a cord including the app's base path; other cords render as text; a CSP on every page | Decided 2026-10-30 |

78| Data layer | Hoon's nouns: units, treaps, loobeans | Decided |

83| Data layer | Hoon's nouns: units, treaps, loobeans | Decided |

79−| Prelude | Hoon's standard library regrouped: all names from the listed sections except explicitly excluded groups, including all of 3g, with Hoon's `tone` exposed as `tone.hoon` and Hoon's 1c `step` as `step.hoon`; arithmetic over aura variables, units, lists, maps, sets, queues, ordered maps, function helpers, text, atom printing, a zoned date printer, time and data molds; folds take a start; jetted functions have working Jibb implementations, whose shapes the compiler recognizes to use the Hoon versions, and may take gates; private helpers and low-level primitives live in a separate internal module imported without exposing them, with public foundational gates implemented in Jibb on those primitives; no signed or float gates, or parser gates outside 3g except `slav` and `slaw`; signed or float auras are errors | Decided 2026-10-30 |

84+| Prelude | Hoon's standard library regrouped: all names from the listed sections except explicitly excluded groups, including all of 3g, with Hoon's `tone` exposed as `tone.hoon` and Hoon's 1c `step` as `step.hoon`; arithmetic over aura variables, units, lists, maps, sets, queues, ordered maps, function helpers, text, atom printing, a zoned date printer, time and data molds; folds take a start; jetted functions have working Jibb implementations, whose shapes the compiler recognizes to use the Hoon versions, and may take gates; private helpers and low-level primitives live in a separate internal module imported without exposing them, with public foundational gates implemented in Jibb on those primitives; `clap` takes two units of the same type and a combining gate over that type; no signed or float gates, or parser gates outside 3g except `slav` and `slaw`; signed or float auras are errors | Decided 2026-10-30 |

85+| `like` | The `(like A)` mold remains available; the value gate `like` maps the product of an existing `(like A)` with a gate `$-(A B)`, preserving the position and remaining input, and returns `(like B)` | Decided 2026-10-31 |

80| Wire format | Noun channels; Jibb's own noun codec in the browser | Decided 2026-10-29 |

86| Wire format | Noun channels; Jibb's own noun codec in the browser | Decided 2026-10-29 |

81| Hosting | One thin host agent on `%jibb` binds, caches and serves every Jibb desk; each desk vendors jibb-dev, names its base path in docket's `site+`, and builds and renders with its own copy through fixed entry points; install `%jibb` first; app agents stay plain Hoon; pokes only from the ship | Decided 2026-10-29 |

87| Hosting | One thin host agent on `%jibb` binds, caches and serves every Jibb desk; each desk vendors jibb-dev, names its base path in docket's `site+`, and builds and renders with its own copy through fixed entry points; install `%jibb` first; app agents stay plain Hoon; pokes only from the ship | Decided 2026-10-29 |

82| Private pages | Served by the host per request and never cached; non-owners go to the login page | Decided 2026-10-29 |

88| Private pages | Served by the host per request and never cached; non-owners go to the login page | Decided 2026-10-29 |

docs/spec/grammar.md+16−14

@@ -91,7 +91,7 @@ Imports come first:

91/= card /ui/components/card :: a Jibb module

92```

94−`/%` names a type after its mark, so it takes no face, and any mark name works; Hoon's `/%` binds the mark's core instead. Derived constructors such as `todo-action.todo` supply the agent and mark, so code never writes one. API modules re-export their `/%` types, not `/-` faces or `/=` modules. Import cycles are errors.

94+An imported Hoon record with duplicate field names is an error where used; imported union cases must differ as nouns. `/%` names a type after its mark, so it takes no face, and any mark name works; Hoon's `/%` binds the mark's core instead. Derived constructors such as `todo-action.todo` supply the agent and mark, so callers need not write those details. API modules re-export their `/%` types, not `/-` faces or `/=` modules. Import cycles are errors.

96## Modules

@@ -102,7 +102,7 @@ A file is a module: imports, then definitions.

102- Molds and values have separate namespaces, told apart by position: `todo-action.todo` is a mold and its constructor, `todos.todo` a mold and a request.

103- `main`'s type decides the kind: `(element !!)` a page; `(page R D)` a page with data, from parameters `R` to data `D`; `(program D X M)` an island, with data, model and messages; `(store S)` a store with state `S`. They're built by `(page load view)`, `(program init update view subs)` and `(store init update)`. A module without `main` is a library.

104- Everything is exported and read through the import's face, as `card.card`. The prelude keeps private helpers in a separate internal module; it imports them without exposing them.

105−- An API module, `/ui/api/<agent>.jibb`, also exports derived gates: a constructor per `poke` type, adding the agent and mark, and a request per `paths` case, taking a reply over full state, plus a fold for `(facts full diff …)`. An island that watches a request whose case has a separate `scry=` path has a type error. A store's `+$ poke` is a declaration, not a mold; a store exports a constructor per `poke` type and a `state` request. Clashing derived names are errors, including a derived name that clashes with an import face.

105+- An API module, `/ui/api/<agent>.jibb`, also exports derived gates: a constructor per `poke` type, adding the agent and mark, and a request per `paths` case, taking a reply over full state, plus a fold for `(facts full diff …)`. An island may watch a request only when the checker proves it is watchable. A request whose case has a separate `scry=` path, or whose watchability cannot be proved, is a type error. A store's `+$ poke` is a declaration, not a mold; a store exports a constructor per `poke` type and a `state` request. Clashing derived names are errors, including a derived name that clashes with an import face.

106

107Names the host reads, by file:

108

@@ -118,28 +118,30 @@ Every other name is free.

118

119## Molds

120

121−A mold is only a type: never called on a noun, and with no default. Types are inferred, Hindley–Milner with aura variables: every expression has a principal type, and there is no general subtyping. These one-way widenings are allowed: a value of a specific atom type fits `@`, a value of a specific noun type fits `*`, and a more specific aura fits an ancestor in its Hoon aura family; the reverse of each widening needs a check.

121+A mold is only a type: never called on a noun, and with no default. Types are inferred, Hindley–Milner with aura variables: every expression has a principal type, and there is no general subtyping. These one-way widenings are allowed: a value of a specific atom type fits `@`, a value of a specific noun type fits `*`, and a more specific aura fits an ancestor in its Hoon aura family; the reverse of each widening needs a check. Records can also be projected explicitly, as described below.

122

123+- **Partial annotations**: `_` may appear wherever a mold may appear. It marks a part of the type for the checker to infer, so a type annotation can specify only the parts it needs to. A hole inferred to be a named type variable is resolved: in `++ id |= x=A ^- _ x`, the result hole is `A`. An unconstrained hole is an error. A named mold or value definition must determine its own holes: `+$ box [item=_]` and `++ id |= x=_ x` do not determine their holes, and later uses cannot fix them.

123−- **Atoms**: `@` is any atom, regardless of aura; auras such as `@ud`, `@t`, `@p` and `@da` are specific atom types. An `@ud` value fits where `@` is expected, but an `@` value needs a check to fit `@ud`. A more specific aura also fits an ancestor in its Hoon aura family: `@ud` and `@ux` fit `@u`, and `@tD` fits `@t`. The reverse needs a check. Distinct specific auras remain distinct; sharing an ancestor does not make them unify. Each bare `@` independently accepts any atom: it is not an aura variable. Atoms that must share a type take one capital, as `[lo=A hi=A]`, with the atom constraint inferred from the body. `add` takes `[A A]` and returns `A`, with `A` constrained to atoms, so `(add n 1)` with `n=@ud` is a `@ud`. `?` is a loobean.

124+- **Atoms**: `@` is any atom, regardless of aura; auras such as `@ud`, `@t`, `@p` and `@da` are specific atom types. An `@ud` value fits where `@` is expected, but an `@` value needs a check to fit `@ud`. A more specific aura also fits an ancestor in its Hoon aura family: `@ud` and `@ux` fit `@u`, and `@tD` fits `@t`. The reverse needs a check. Distinct specific auras remain distinct; sharing an ancestor does not make them unify. Each bare `@` independently accepts any atom: it is not an aura variable. Atoms that must share a type take one capital, as `[lo=A hi=A]`, with the atom constraint inferred from the body. `add` takes `[A A]` and returns `A`, with `A` constrained to atoms, so `(add n 1)` with `n=@ud` is a `@ud`. Arithmetic rejects loobean operands: `?` contains only 0 and 1, while an arithmetic result need not. Comparison may take loobeans and returns `?`.

124- **Constants**: `%add`, `~` and the loobeans have one value each.

125- **Constants**: `%add`, `~` and the loobeans have one value each.

125−- **Records and tuples**: `[text=@t done=?]`, `[@t ?]`. An empty `[]` is an error. Faces are part of the type, so `[a=@ b=@]` and `[x=@ y=@]` don't unify. An unnamed position can unify with a faced position and take its face, so `[0 0]` fits `[x=@ud y=@ud]`; two different faces don't unify. A record too long for one line can leave its `[` open, with one field per deeper line, as an expression's bracket does.

126+- **Records and tuples**: `[text=@t done=?]`, `[@t ?]`. An empty `[]` is an error. Duplicate field names in a record are an error. Faces are part of the type, so `[a=@ b=@]` and `[x=@ y=@]` don't unify. An unnamed position can unify with a faced position and take its face, so `[0 0]` fits `[x=@ud y=@ud]`; two different faces don't unify. The explicit type-directed operation `(proj record)` selects fields from its argument according to the expected result type: `^- [x=@ud y=@ud] (proj wider)`, or `(f (proj wider))` when `f` expects that record. The source is evaluated once, and the result contains exactly the fields in the expected layout. No projection is inserted for a direct call. `proj` is reserved: a module cannot define or import another name `proj`. A record too long for one line can leave its `[` open, with one field per deeper line, as an expression's bracket does.

126- **Unions**: a `+$` with several cases below it. Every union written in Jibb has a name, so one used in a field, a sample, a cast, a gate's mold or an argument gets its own `+$`; only imports bring in unions without one. Tags take their union from context, as Tag resolution describes. Cases must differ as nouns: inhabited cases must differ at some position of their right-nested cells, where one is an atom and the other a cell, or both are different constants. `*`, type variables and molds that can be either, such as `(list A)`, can overlap atoms and cells. `?` counts as the two atoms `%.y` and `%.n`: it is disjoint from cells and overlaps the constants 0 and 1. The empty mold `!!` is disjoint from every case; a cell with an empty position at any depth is itself empty and is also disjoint from every case. A union whose cases don't all differ is rejected.

127- **Unions**: a `+$` with several cases below it. Every union written in Jibb has a name, so one used in a field, a sample, a cast, a gate's mold or an argument gets its own `+$`; only imports bring in unions without one. Tags take their union from context, as Tag resolution describes. Cases must differ as nouns: inhabited cases must differ at some position of their right-nested cells, where one is an atom and the other a cell, or both are different constants. `*`, type variables and molds that can be either, such as `(list A)`, can overlap atoms and cells. `?` counts as the two atoms `%.y` and `%.n`: it is disjoint from cells and overlaps the constants 0 and 1. The empty mold `!!` is disjoint from every case; a cell with an empty position at any depth is itself empty and is also disjoint from every case. A union whose cases don't all differ is rejected.

127- **Containers**: `(list A)`, `(unit A)`, `(set A)`, `(map K V)`, `(mop K V)`, `(qeu A)`, `(jar K V)`, `(jug K V)`.

128- **Containers**: `(list A)`, `(unit A)`, `(set A)`, `(map K V)`, `(mop K V)`, `(qeu A)`, `(jar K V)`, `(jug K V)`.

128−- **Gates**: `$-(A B)`. Type variables are capitals, generalized per `++`. A capital in a local `++` shares the enclosing `++`'s variable of the same name; use another capital for a different type. A type variable used where an atom is required gains an atom constraint, so `++ clamp |= [lo=A hi=A n=A]`, whose body calls `gth` and `max`, works on any one aura. It can become nothing more specific: a body that makes `A` a `@ud` or a list is an error.

129+- **Gates**: `$-(A B)`. Type variables are capitals, generalized per `++`. A capital in a local `++` shares the enclosing `++`'s variable of the same name if the enclosing `++` also uses it; otherwise the local `++` introduces and generalizes its own variable. For example, `++ inner |= y=A y` uses the enclosing `A` when its enclosing gate has a sample `x=A`; if the enclosing `++` does not use `A`, `inner` generalizes its own `A`. Use another capital for a different type. A body can't force two distinct capitals to be equal; use the same capital wherever a type must be shared. A type variable used where an atom is required gains an atom constraint, so `++ clamp |= [lo=A hi=A n=A]`, whose body calls `gth` and `max`, works on any one aura. It can become nothing more specific: a body that makes `A` a `@ud` or a list is an error.

129−- **Paths**: `/todos` is constant, `/` empty, and `/todo/[id=@ud]` typed by aura. `%/blog/(slug)` is an `qath`, checked against routes and static files.

130+- **Paths**: `/todos` is constant, `/` empty, and `/todo/[id=@ud]` typed by aura. A typed segment may use `_` for an inferred aura; it still must resolve to an aura that the path rules can print and parse. `%/blog/(slug)` is an `qath`, checked against routes and static files.

130- **Generic molds**: `+$ result |$ [V E]` with cases below; `|$` goes only right after a `+$`'s name.

131- **Generic molds**: `+$ result |$ [V E]` with cases below; `|$` goes only right after a `+$`'s name.

131- **Noun**: `*`, not a type variable; use a capital for a generic type. A value already known to have a more specific noun type, such as `@ud`, can be used where `*` is expected. **Empty**: `!!`.

132- **Noun**: `*`, not a type variable; use a capital for a generic type. A value already known to have a more specific noun type, such as `@ud`, can be used where `*` is expected. **Empty**: `!!`.

132−- **Opaque**: `poke`, `ask` and `qath`, built only by derived gates, `pure` and application-path literals. `(facts full diff …)` appears only in an API file's `paths`.

133+- **Pokes**: `poke` is defined in the source-backed private internal prelude module and re-exported by the public prelude as an ordinary transparent type. Ordinary modules can construct and inspect its values.

134+- **Effect and application-path types**: `poke`, `ask` and `qath` are transparent types, defined in the internal prelude and re-exported normally; callers can construct and inspect their values. Derived gates and `pure` also construct requests, and application-path literals have type `qath`. `(facts full diff …)` appears only in an API file's `paths`.

133- **Identity**: recursive molds go by name and module.

135- **Identity**: recursive molds go by name and module.

134

136

135−`eq`'s arguments and map and set keys must contain no gates, even nested inside another value. The checker infers this gate-free constraint on type variables and retains it when generalizing a `++`, so a generic helper that calls `eq` stays generic over gate-free types. Printed types show the constraint as `$-([A A] ?) where A contains no gates`. An inferred atom constraint prints as `$-([A A] A) where A is an atom`. Multiple clauses are comma-separated, as `where A is an atom, B contains no gates`. Union-case matching treats gates as opaque and never inspects a gate to distinguish cases.

137+`eq`'s arguments and map and set keys must contain no gates, even nested inside another value. The checker infers this gate-free constraint on type variables and retains it when generalizing a `++`, so a generic helper that calls `eq` stays generic over gate-free types. Printed types show the constraint as `$-([A A] ?) where A contains no gates`. An inferred atom constraint prints as `$-([A A] A) where A is an atom`; an arithmetic atom constraint that excludes loobeans prints as `where A is an atom other than ?`. Multiple clauses are comma-separated, as `where A is an atom, B contains no gates`. Union-case matching treats gates as opaque and never inspects a gate to distinguish cases.

136

138

137## Tag resolution

139## Tag resolution

138

140

139A tag literal or `~` gets a fresh type variable and a pending constraint: the variable must become a union with a matching case, or an atom type the term fits. A mold that isn't a union counts as a union of one case, for tags and for `|=%tag`: `[%go "x"]` fits `+$ go [%go url=@t]`, and `|=%typed` works against `$-(@t M)` when `M` is `[%typed text=@t]`. Once unification fixes the variable, each constraint is checked against the union's cases or, for `@tas`, `@ta`, `@` or `*`, makes the tag that constant atom. A literal that matches nothing is an error naming the union, such as "msg has no case %submitt".

141A tag literal or `~` gets a fresh type variable and a pending constraint: the variable must become a union with a matching case, or an atom type the term fits. A mold that isn't a union counts as a union of one case, for tags and for `|=%tag`: `[%go "x"]` fits `+$ go [%go url=@t]`, and `|=%typed` works against `$-(@t M)` when `M` is `[%typed text=@t]`. Once unification fixes the variable, each constraint is checked against the union's cases or, for `@tas`, `@ta`, `@` or `*`, makes the tag that constant atom. A literal that matches nothing is an error naming the union, such as "msg has no case %submitt".

140

142

141- A constraint records the literal's shape, such as `[@t %draft]`, and matches cases by shape and shared tag positions; a literal in a field position is checked against that field.

143- A constraint records the literal's shape, such as `[@t %draft]`, and matches cases by shape and shared tag positions; a literal in a field position is checked against that field.

142−- `|=%typed` is a case's constructor: against `$-(@t M)` it is `|=(t [%typed t])`, requiring `M` to have a case `[%typed @t]`. It works for cases tagged at their head; a bare tag is always a value.

144+- `|=%typed` is a case's constructor: against `$-(@t M)` it is `|=(t [%typed t])`, requiring `M` to have a case `[%typed @t]`. It works for cases whose head is a literal with the same noun as the tag, regardless of how that literal is written: `|=%$` also constructs a case headed by `%.y` or `~`, since each is the noun 0. A bare tag is always a value.

143- A variable constrained by tag resolution, and any it mentions, doesn't generalize; it stays open until something in the module fixes it. An island's `main` fixes its messages, so islands resolve their own tags. The inferred gate-free constraint is retained when a type variable is generalized.

145- A variable constrained by tag resolution, and any it mentions, doesn't generalize; it stays open until something in the module fixes it. An island's `main` fixes its messages, so islands resolve their own tags. The inferred gate-free constraint is retained when a type variable is generalized.

144- A constraint still open when its module is checked is an error asking for a `^-`; the checker never guesses. Library helpers can cast, as in `^- (list attr)`.

146- A constraint still open when its module is checked is an error asking for a `^-`; the checker never guesses. Library helpers can cast, as in `^- (list attr)`.

145- Wing access, changes and `?-` on a type not yet known wait the same way.

147- Wing access, changes and `?-` on a type not yet known wait the same way.

@@ -210,7 +212,7 @@ Tags can sit anywhere in a case, and a case can carry several:

210 [%move %left n] "left {n}"

212 [%move %left n] "left {n}"

211 [%move %right n] "right {n}"

213 [%move %right n] "right {n}"

212 [t %draft] t

214 [t %draft] t

213− [t %sent at] t

215+ [t %sent sent-at] t

214 %stop "stop"

216 %stop "stop"

215```

217```

216

218

@@ -260,7 +262,7 @@ rune = "|=" field ( expr | body )

260 | "?-" expr INDENT arm { NEWLINE arm } DEDENT ;

262 | "?-" expr INDENT arm { NEWLINE arm } DEDENT ;

261arm = pattern ( expr | body ) ; (* every case covered; see Patterns *)

263arm = pattern ( expr | body ) ; (* every case covered; see Patterns *)

262

264

263−mold = aura | "*" | "!!" | "?" | "~" | term | loobean | ref | typevar

265+mold = aura | "_" | "*" | "!!" | "?" | "~" | term | loobean | ref | typevar

264 | pathmold

266 | pathmold

265 | "(" ref mold { mold } ")" | "(" ref { mold } mlines

267 | "(" ref mold { mold } ")" | "(" ref { mold } mlines

266 | "[" field { field } "]" | "[" { field } flines

268 | "[" field { field } "]" | "[" { field } flines

@@ -269,7 +271,7 @@ field = [ name "=" ] mold | "=" name ; (* =msg is msg=msg *)

269mlines = INDENT mold { NEWLINE mold } DEDENT ; (* a mold's ( left open *)

271mlines = INDENT mold { NEWLINE mold } DEDENT ; (* a mold's ( left open *)

270flines = INDENT field { NEWLINE field } DEDENT ; (* a mold's [ left open *)

272flines = INDENT field { NEWLINE field } DEDENT ; (* a mold's [ left open *)

271pathmold = "/" [ segment { "/" segment } ] ;

273pathmold = "/" [ segment { "/" segment } ] ;

272−segment = knot | "[" name "=" aura "]" ;

274+segment = knot | "[" name "=" ( aura | "_" ) "]" ;

273

275

275 | "[" pattern { pattern } "]" ;

277 | "[" pattern { pattern } "]" ;

@@ -339,4 +341,4 @@ knot = { lower | digit | "-" | "." | "~" | "_" } ;

339 button "Add" %add

341 button "Add" %add

340```

342```

341

343

342−A store is written like an API file: `state`, `+$ poke` and `(store init update)`. Islands poke it with derived constructors and watch it with `(state.cart |=%got)`, whose first fact is the current state and each later fact the next. It runs in the browser, shared by the page's islands.

344+A store is written like an API file: `state`, `+$ poke` and `(store init update)`. Islands can poke it with derived constructors and watch it with `(state.cart |=%got)`, whose first fact is the current state and each later fact the next. It runs in the browser, shared by the page's islands.

docs/spec/overview.md+8−6

@@ -63,7 +63,7 @@ Hoon's runes and literals in an indentation layout, over Hoon's nouns and molds,

64| Hoon | Jibb |

65| --- | --- |

66−| `$%`, `$?` | A union |

66+| `$%`, `$?` | A union if its cases differ as nouns, else an error where used |

67| `$@` | A union with an atom case |

68| `$^` | A union if its cases differ as nouns, else an error where used |

69| `$~` | Dropped |

@@ -72,18 +72,18 @@ Hoon's runes and literals in an indentation layout, over Hoon's nouns and molds,

72| Other `$\|` | Its base type |

73| `%0`, `%&`, `%\|` | Tags |

74| Recursive molds, such as `json` | Recursive, matched by name |

75−| Cores, gates, vases, signed and float auras | An error where used |

75+| Records with duplicate field names; cores, gates, vases, signed and float auras | An error where used |

77Unused molds are skipped, so unsupported constructs elsewhere in a `/sur` file are fine. A union without a name, as a field's `?(%approve %deny)`, imports too, though Jibb can't write one. Messages and printed types show its cases separated by spaces, as `%approve %deny`; this notation is print-only.

79## Prelude

81−Hoon's standard library regrouped, written in Jibb and vendored as `/lib/jibb/prelude`; an island's bundle carries only what it uses. The exported inventory includes all names from the Hoon library sections listed below, excluding the groups explicitly left out. Jetted prelude functions have working Jibb implementations; the compiler recognizes their shapes and uses the Hoon versions so jets can fire. They may take gates as arguments (Core language). Private helpers and low-level primitives live in a separate internal prelude module, imported without exposing them; foundational public gates are implemented in Jibb on top of those primitives. The prelude also holds `eq`, `not`, `page`, `program`, `store`, `pure`, `island`, and the layout elements and molds.

81+Hoon's standard library regrouped, written in Jibb and vendored as `/lib/jibb/prelude`; an island's bundle carries only what it uses. The exported inventory includes all names from the Hoon library sections listed below, excluding the groups explicitly left out. Jetted prelude functions have working Jibb implementations; the compiler recognizes their shapes and uses the Hoon versions so jets can fire. They may take gates as arguments (Core language). Private helpers and low-level primitives live in a separate internal prelude module, imported without exposing them; foundational public gates are implemented in Jibb on top of those primitives. This source-backed internal module defines `poke`; the public prelude re-exports it as an ordinary transparent type, so ordinary modules can construct and inspect its values. The prelude also holds `eq`, `not`, `page`, `program`, `store`, `pure`, `island`, and the layout elements and molds.

83| Group | Hoon | Jibb |

84| --- | --- | --- |

85| Arithmetic | [1a](https://docs.urbit.org/hoon/stdlib/1a), [2g](https://docs.urbit.org/hoon/stdlib/2g) | Jibb gates over shared atom-constrained type variables, using private low-level primitives: `add`, `sub`, `div`, `mod`, `gth`, `max`, `pow` |

86−| Units | [2a](https://docs.urbit.org/hoon/stdlib/2a) | `fall`, `need`, `bind`, `biff` |

86+| Units | [2a](https://docs.urbit.org/hoon/stdlib/2a) | `fall`, `need`, `bind`, `biff`, `clap`; `clap` takes two units of the same type and a gate combining two values of that type into one of that type |

87| Lists | [2b](https://docs.urbit.org/hoon/stdlib/2b) | `turn`, `weld`, `snag`, `lent`, `sort`, `skim`; `(roll xs init f)` takes a start |

88| Maps, sets, queues | [2h](https://docs.urbit.org/hoon/stdlib/2h)–[2m](https://docs.urbit.org/hoon/stdlib/2m), [2o](https://docs.urbit.org/hoon/stdlib/2o) | Plain gates over Hoon's trees, such as `(get.by m k)`; `rep.by` and `rep.in` take a start; ordered maps through lull's `on`, as `(get.on lte m k)` |

89| Function helpers | [2n](https://docs.urbit.org/hoon/stdlib/2n) | `same`, `head`, `tail`, `cork`, `cury` |

@@ -97,6 +97,8 @@ Hoon's standard library regrouped, written in Jibb and vendored as `/lib/jibb/pr

97| Parsers | [4d](https://docs.urbit.org/hoon/stdlib/4d)–[4i](https://docs.urbit.org/hoon/stdlib/4i), parser helpers in 4j and 4l | Left out, except the explicitly listed `slav` and `slaw` |

98| The rest | [1b](https://docs.urbit.org/hoon/stdlib/1b), [2p](https://docs.urbit.org/hoon/stdlib/2p), [3d](https://docs.urbit.org/hoon/stdlib/3d), [3f](https://docs.urbit.org/hoon/stdlib/3f), [4c](https://docs.urbit.org/hoon/stdlib/4c), [4n](https://docs.urbit.org/hoon/stdlib/4n), [4o](https://docs.urbit.org/hoon/stdlib/4o), [5a](https://docs.urbit.org/hoon/stdlib/5a)–[5f](https://docs.urbit.org/hoon/stdlib/5f) | Left out; `jam`, `cue` and `fein` run inside the runtime |

100+The prelude's `(like A)` mold describes a result with a product of type `A`. Its value gate `(like convert result)` maps a present product with `convert=$-(A B)` and returns `(like B)`, preserving the position and remaining input; an absent result stays absent.

101+

100Maps are Hoon's trees on both sides, so equal maps are equal nouns. Requests check incoming maps and sets with `apt`.

102Maps are Hoon's trees on both sides, so equal maps are equal nouns. Requests check incoming maps and sets with `apt`.

101

103

102## The Elm architecture on Urbit

104## The Elm architecture on Urbit

@@ -150,9 +152,9 @@ Loads and renders run in Nock.

150 [%url reply=$-(path M)]

152 [%url reply=$-(path M)]

151```

153```

152

154

153−- `poke` and `ask` are opaque, built only by derived gates and `pure`. A constructor such as `(todo-action.todo [%add draft.m])` checks its value and supplies the agent and mark, so one island can poke several agents. The agent's mark rechecks on the ship; a nack's `tang` reaches the reply as text. Store constructors poke the store in the browser.

155+- `poke`, `ask` and `qath` are transparent types defined in the internal prelude and re-exported normally. Derived gates and `pure` also construct requests. A derived poke constructor such as `(todo-action.todo [%add draft.m])` checks its value and supplies the agent and mark, so one island can poke several agents. The agent's mark rechecks on the ship; a nack's `tang` reaches the reply as text. Store constructors poke the store in the browser.

154- A request such as `(todos.todo |=%got)` comes from a declared path or a store's `state`; its reply always gets full state. A path with diffs also takes a fold, `(changes.todo |=%got apply)`, which the runtime applies first. Facts are checked; a bad one crashes the reply, which counts as a crashed `update`.

156- A request such as `(todos.todo |=%got)` comes from a declared path or a store's `state`; its reply always gets full state. A path with diffs also takes a fold, `(changes.todo |=%got apply)`, which the runtime applies first. Facts are checked; a bad one crashes the reply, which counts as a crashed `update`.

155−- Islands read agents only by watching. A watch's first fact must be full state, so watching a request whose path case has a separate `scry=` path is a type error in an island. The runtime acks facts, rewatches after a kick or a dropped connection and reseeds from the first fact; a refused watch shows the crash notice.

157+- Islands read agents only by watching. A watch's first fact must be full state, so watching a request whose path case has a separate `scry=` path is a type error in an island. The checker must prove a request is watchable; unknown watchability is also a type error. The runtime acks facts, rewatches after a kick or a dropped connection and reseeds from the first fact; a refused watch shows the crash notice.

156- Watches match by agent and path, timers by gap, and the newest reply is always used. After each `update`, `subs` is diffed to start and stop watches and timers. `%now` and `%every` give the time, `%who` the owner's `@p` from `/~/name`; `%wait` is a one-shot delay.

158- Watches match by agent and path, timers by gap, and the newest reply is always used. After each `update`, `subs` is diffed to start and stop watches and timers. `%now` and `%every` give the time, `%who` the owner's `@p` from `/~/name`; `%wait` is a one-shot delay.

157

159

158Inputs send a message per `input` event, and one per IME composition, so validation runs as you type; only commands reach the ship. After every event, controls reset to the latest view, so a toggle whose poke fails unchecks. A field's text is rewritten only when it differs, which keeps the caret. Fields are read-only until their island starts.

160Inputs send a message per `input` event, and one per IME composition, so validation runs as you type; only commands reach the ship. After every event, controls reset to the latest view, so a toggle whose poke fails unchecks. A field's text is rewritten only when it differs, which keeps the caret. Fields are read-only until their island starts.

docs/status.md+194−8

@@ -1,6 +1,6 @@

1# Status

3−As of 2026-10-30. The plan is [spec/implementation-plan.md](spec/implementation-plan.md); each milestone ends with its checks passing on a fake ship.

3+As of 2026-11-01. The plan is [spec/implementation-plan.md](spec/implementation-plan.md); each milestone ends with its checks passing on a fake ship.

5| # | Milestone | Status |

6| --- | --- | --- |

@@ -19,7 +19,67 @@ On 2026-10-30, @iko decided that Jibb drops `$?`, so a `+$` takes a union's case

20## Milestone 2: in progress

22−The repository spec records the subsequent type-system and prelude decisions; those changes also need synchronization to the Claude document. An initial inference fragment and a standalone Hoon type reader are being tested. The fragment explicitly reports that it does not check a module; partial bridges pass selected Hoon atoms and unfaced cells from `/sur` molds and marks into inference. The reader handles nonrecursive mark samples, named recursion without Ford imports, nested collections, direct ordered maps, certain ordered-map fields, and direct `$^` unions whose cases can be proved disjoint. Recursive mark samples and recursive molds in Ford-importing subjects fail closed until their origin is tracked. Nested `$^`, other nested ordered maps, general union disjointness and complete import integration remain unfinished. The inference fragment supports unrestricted `@`, selected one-way widenings including aura-family ancestors, and generalized atom constraints arising from explicit capitals or bare sample binders, including aliases; other constraint cases and defaulting still need work. Collection recognition checks the originating core and fails closed on shadows or unsupported Ford subject shapes; its golden fixtures include three real Tlon files. The prelude currently has only a few functions, and [prelude-inventory.md](prelude-inventory.md) is a source audit, not the complete inventory or signatures. The milestone remains unfinished.

22+The parser accepts `_` in mold positions and typed path segments, retaining each hole’s span. The partial checker tracks ordinary annotation holes through inference and requires each value or local definition to resolve its own holes before generalization. A hole can resolve to a concrete type or an explicitly written in-scope type variable; later uses cannot fix an unresolved definition. Independent decimal holes can default, but captured variables are not defaulted prematurely. Structural named molds with an unresolved hole report its site. Complex mold forms, inferred path segments, mutual recursive groups and other unsupported constraints still fail closed, and the fragment does not claim the module is checked. A syntax-tree pass rejects duplicate field names within each written record and reports both sites. The repository spec now records that `ask` and `qath` are transparent; complete request checking remains outstanding.

23+

24+On 2026-10-31, @iko chose explicit, result-directed `(proj record)` to construct a record with exactly the expected fields, and reserved `proj` against definitions and imports. The partial checker handles selected explicit calls with known, closed record types, records field-selection evidence for later lowering, and reserves the name across source bindings. Reordered fields, some nested contexts and several open or recursive cases remain unsupported; lowering and execution are not implemented yet. The field-order question remains open.

25+

26+The internal prelude also defines `qath` as a transparent recursive knot sequence, re-exported by the public prelude. The partial checker recognizes its source identity, supports selected null/cell construction and matching, and types static application-path literals. Construction and matching for other recursive shapes, broader patterns and dynamic application-path segments remain unsupported. A 256-step limit applies per inference attempt, not to parsing or retries; checking routes and static files remains milestone 4.

27+

28+The checker also recognizes a limited source-proven generic recursive tree in an import-free defining module. Its nominal identity retains the defining path, mold name and type arguments, including across supported imports and aliases. With a known expected type it can construct supported tagged cases by checking one source-proven layer at a time. Flat matches with explicit tags or nonbinding catch-alls also work for these source-proven trees, as does a missing-case diagnostic for a supported single-arm match. At most 128 arms are screened per attempt; whole-case binders and nested patterns remain unsupported. Broader pattern matching, general structural fits and gate-free proof remain unsupported; this is not yet the prelude's `element` implementation or island checking. The source index uses fixed-shape checks during mold collection. Each construction or supported pattern attempt has 256 unfolding steps and at most 4,096 face and substitution visits per scan; pattern subject recognition and view validation can each scan separately. Parsing, other inference and retries remain outside those limits. A single startup-inclusive comparison of 1,000 ordinary gates produced identical reports and used 29.12 seconds of user CPU before the shared-resolver refactor and 28.55 seconds after it, with other work running; it is not a general performance bound.

29+

30+A bounded local source proof recognizes a narrow class of generic-alias union cases with different literal heads, then applies the ordinary mold checks. Nested or qualified aliases and several open states remain unsupported, including a valid alias used during the deferred transaction; the partial report states that the mold itself has not been checked. `tools/type-union-source-test` exercises the source and state bounds and failure paths under eval and on the ship. A separate bounded witness now reports proven collisions between supported literal-headed aliases, with both original case sites; unknown payload intersections still decline. The detailed full-module result now carries the first failed mold’s source-bound overlap evidence, including through ordinary Jibb imports; the legacy text result renders both case excerpts. Specialized API and prelude paths remain limited. The shared guards pass under eval and on the ship.

31+

32+The checker can experimentally discharge a narrowly scoped direct-constructor constraint while resolving an import-free library without a prepared prelude. It preserves independent generalized schemes and publishes only after all source molds, values, and recorded constraints close. API/store paths, `main`, imports, prepared preludes, recursive groups, open constraints, projection actions, and `%grec` in the constraint graph remain unsupported by this route. The fallback also declines source shapes outside its bounded direct-call screen. It does not yet typecheck the unchanged todo island or establish watchability.

33+

34+A prepared-prelude partial report can recover a narrow import-free, non-main ordinary library initializer by deferring source-owned literals in a direct tuple until a later exact result cast. The prepared interface and declared-name inventories must agree exactly. API/store paths, `main` and imports remain excluded, and the ordinary full-module resolver does not publish the recovered interface. Wrong field types, unrelated tags and mold collisions fail closed; a no-final-cast control remains unchecked. `tools/type-deferred-prepared-test` checks the exact recovered types and unchanged `partial inference; module not checked` disclaimer under eval and on the ship. List-literal deferral and import-aware recovery remain unsupported.

35+

36+Closed cell context can now flow through a bounded loobean branch while preserving the inferred value faces and original failed-inference behavior. Open or structurally uncertain substitutions and nested retry shapes remain unsupported. This does not by itself provide the remaining cross-definition context or complete island-kind and watchability checks needed by the unchanged todo island.

37+

38+The internal prelude defines a transparent generic `ask` with pure, agent and store cases, re-exported alongside the Jibb-written `pure` gate. The partial checker infers supported constructors and exhaustive matches. Agent and store receivers operate on raw nouns; their fields do not prove schema validity or watchability. The public prelude now defines the documented source-backed `sub` union; supported `%watch` payloads retain the public `(ask M)` type. Constructing a `sub` does not prove that its request is watchable. Request lowering, checked decoding, runtime validation and general island watch checking remain unimplemented; the separate direct-program proof below covers only one narrow static value shape.

39+

40+The public prelude now contains the source-backed UI length/attribute molds, all element constructors, and exact program/page records and builders. The full 19-case generic `element` union is nonrecursive: nested child, keyed-item and table payloads are `*`, while public constructor schemes preserve typed composition and independent key types. `island` returns `(element !!)` with `[program data]` as its erased payload. The focused UI golden checks exact schemes, static and message-bearing composition, concrete programs/pages/islands, malformed inputs and selected mismatches. A child-message mismatch fails closed as an unsupported constraint. Raw-constructor encapsulation, duplicate-attribute checks, rendering, storage, navigation and execution are not claimed.

41+

42+Known same-origin generic-union result context can now constrain a call before its arguments are inferred. An unresolved or opaque constructor target stays unsupported rather than producing a definite mismatch; proven missing tags still report errors. A todo request with explicit `(ask msg)` context can infer `|=%got`; its uncontextualized form remains unsupported. A two-item literal-headed tuple can receive payload context from a known union of uniquely headed literal cells when its payload is a shallow wing-headed call with literal, wing or constructor arguments. Existing inference takes precedence when it fits; otherwise the checker tries the contextual path once. It conservatively declines that path when any substitution has a structural root, as well as for duplicate or opaque competitors. The guard scans substitutions per eligible tuple and may add one shallow inference; no global linear-time bound is claimed. This allows an explicitly typed todo subscription body to infer, but does not check the island or prove request watchability.

43+

44+A separate source-backed analysis can prove one named mold gate-free, report a definite gate with a field path, or return unknown. It retains the prepared prelude, source bundle, reader results and resolved imports; the actual todo model proves gate-free, while a callback field reports its path and `*` remains unknown. Its classifier is capped at 256 nodes, not the surrounding parse and import work. API, store and private roots are unsupported, and the artifact does not check a module or island, infer generalized constraints, or prove watchability.

45+

46+The partial checker can also match a directly named, checked root gate against a generic gate sample in a direct, unshadowed source-backed prelude call. It uses the written two-slot sample layouts to preserve nested record faces, then requires the complete call samples to be closed and tag-free and repeats the fit under the final substitution. The proof falls back to existing inference for unavailable or ambiguous source layouts, local or dynamic gates, aliases, recursive placeholders and open generic caller types. It preserves written-capital checks and projection evidence; it does not add `program`, check islands or prove request watchability. Prepared prelude source and interface remain a trusted pair.

47+

48+A narrow full-module path now checks direct four-wing `(program init update view subs)` definitions named `main`. It requires the canonical prepared `program` value and mold, reuses ordinary source-backed program fitting, and publishes only after all ordinary module and request-graph checks. The inferred `main` must be closed and invariantly match the instantiated `program` mold. Initializer data and model must be closed and gate-free with `%yes` verdicts inside a shared 256-node budget. `subs` may syntactically return null through transparent forms, or one direct imported request watch after the request graph merges. The latter is only an unfaced two-item `[%watch (case.face |=%callback)]` singleton: the imported member must have the exact plain derived-request scheme, a unique merged request must match the API path and both case names and occur in the interface's own graph, the API source must be identical, and scry, diffs and parameters must be absent. Pure or hand-built values, helpers, aliases, re-exports, typed paths, folds, multiple watches and unknown or ambiguous evidence remain rejected. Checked interfaces retain source evidence and support ordinary downstream imports; no program execution or runtime watching is claimed. A transactional extension can recover a direct initializer whose transparent tuple body ends in null when update, view and subs are already resolved. It derives the expected gate through the ordinary positional program fit with fresh IDs and stable replay, then re-infers the actual initializer and `main` under all ordinary finalization and kind checks. Non-main libraries, aliases, nonempty or simultaneously unresolved subscriptions, and unrelated pending tags remain rejected.

49+

50+The API path analyzer can retain its source, complete prepared prelude, reader results and resolved dependencies as evidence, and classify a unique declaration as watchable, not watchable or unknown. This remains declaration evidence rather than proof about an arbitrary request value. The narrow direct-program check above composes it with final value syntax, resolved imports and merged evidence for one plain request. Prepared artifacts and reader results remain trusted host inputs.

51+

52+For a unique supported path declaration, the request-parts analysis derives ordered typed path parameters, a full-state reply sample and a fold type for one diff mark. Multiple diffs and unsupported or ambiguous evidence fail closed. By itself it does not create request gates or establish watchability of values.

53+

54+A separate supporting-definition analysis infers supported ordinary API molds and values and resolves all declared marks, retaining their source and dependency evidence. It fails closed on unsupported helpers or marks; unused `/-` cores are not independently validated, and definitions depending on derived gates remain unsupported. This does not check or export the whole API.

55+

56+Ordinary imports can infer derived request-gate types for multiple supported API paths. A case may take one typed segment before the reply or one diff fold after it; the unchanged todo API's plain, typed and diff requests infer, including a named closed fold. Checked ordinary API definitions, mark molds and a supported poke constructor are exported. Each `/sur` core must have a directly used, successfully read mold; unselected bindings are not independently validated. Jibb module imports, scry paths, multiple parameters or diffs and a parameter together with a fold remain unsupported. Source-qualified request evidence and exact trusted graph inputs survive transitive imports and cached interfaces, while stale or ambiguous evidence fails closed. This is a type-only interface: request execution, schema validation and proof that a request value is watchable remain unimplemented. In one loaded-machine run, the real-todo eval took 195.83 s wall and 67.83 s user CPU; the prior prototype took 111.81 s wall and 64.60 s user. Both include Hoon compilation and reader setup and overlapped other work, so they are not isolated checker benchmarks.

57+

58+The Hoon reader's tagged-union source proof also handles `$~` default wrappers. A shared eval and ship golden exercises the unmodified Tlon `epic.saga` mold as a named payload in a labeled downstream extension, alongside overlap, recursive, shadow and malformed-wrapper controls. The tagged-source helper peels at most four consecutive defaults; defaults inside dependency proofs spend the existing semantic-node budget. Other unverified nested unions and dependencies remain unsupported.

59+

60+The repository spec records the subsequent type-system and prelude decisions, including the chosen `like` result-mapping gate; those changes also need synchronization to the Claude document. An initial inference fragment and a standalone Hoon type reader are being tested. The fragment explicitly reports that it does not check a module; partial bridges pass Hoon `*` in supported nonrecursive molds, selected Hoon atoms, term singletons, the null singleton, the two loobean singletons and their exact fork, nested faced or unfaced cells, supported disjoint unions and opaque standard collections from `/sur` molds and marks into inference. Collections retain their names and supported arguments for printing and unification; nested supported union arguments are retained too. The bridge trusts unchanged results from the source-aware reader; a materialized type graph alone cannot reveal cases Hoon already collapsed. The source-validated standard prelude `list` mold shares this representation with imported lists; other Jibb-written collection molds and most prelude collection operations remain unsupported; malformed names and arities fail closed. Selected self-recursive `/sur` molds, including Tlon `notes.import-node` with list-wrapped self references, cross as opaque module-and-name identities; aliases, foreign references, recursive marks, unfolding and construction remain unsupported. The reader handles mark samples, including a source-proved nonrecursive union from a single Ford-imported `/sur` core, recursive molds whose origins can be verified through Ford imports, nested collections, direct ordered maps, including source-validated named operands such as Tlon `notes.log`, certain ordered-map fields, direct `$^` unions whose cases can be proved disjoint, and one verified explicit union argument in a list, set, map or unit. Tagged `$%` cases can additionally use restricted local named payload molds, bare `~` fields and one level of local named tagged unions, as in real Tlon `notes`, with bounded source proof; unsupported or ambiguous dependencies fail closed. Ambiguous recursive origins fail closed; recognizable explicit unions are checked from source before Hoon can collapse their cases, as @iko confirmed for imported `$%`, `$?` and `$^`, while other nested unions, nested ordered maps, general union disjointness and complete import integration remain unfinished. Opt-in structured reader APIs preserve successful graphs and distinguish definite unsupported-aura and core evidence from failures the reader cannot prove; unverified union disjointness and name-only vase recognition remain unsupported. They revalidate and re-walk failed types. An opt-in partial checker entry point consumes unchanged reader results and reports definite aura or core errors at imported mold use sites when their inputs are unique. Ordered replay covers nested cell samples, record and function casts, and non-generic same-module aliases; unsupported prefixes, cycles and shadowing stop it. Union molds, generic applications, transitive modules and unsupported reader outcomes remain generic. Replay repeats inference and may add work. The partial checker resolves a subset of ordinary library imports in dependency order using supplied Jibb sources and a source-derived partial prelude interface, caches completed interfaces per run, detects missing sources and cycles, and resolves nested fields of imported values with independent scheme instantiation. The source-backed internal prelude defines `poke` and the public prelude re-exports it as a transparent type. A dedicated trusted preparation path supplies private comparison and arithmetic schemes to the Jibb-written `gth`, `add` and `dec` wrappers; ordinary imports cannot access them. The public `add` and `dec` wrappers use private arithmetic interfaces; supported inference preserves the shared atom constraint that excludes loobeans. Primitive execution, jet recognition and length remain unfinished. The partial checker resolves its supported source shape and rejects ordinary imports of the private path. An imported API with one mark and a matching direct `+$ poke` declaration can export a constructor and retain agent/mark metadata when the representation has the supported agent case. A separate partial analysis resolves supported API path declarations and their full and diff mark types, including the todo paths; it does not by itself create requests or check an API module. Ordinary imports additionally infer the supported multi-path request-gate types described above. Complete private module checking, other API shapes, request lowering, root API and kind checking, stores, complete `ask` and `pure` checking and runtime effects remain unfinished. A possible store or root API with `+$ poke` reports unsupported kind or scope, while definite duplicates and unrelated shadowing still report conflicts. The prelude includes the doc-exact generic `cmd` union; the prelude inventory is incomplete. The inference fragment supports unrestricted `@`, selected one-way widenings including aura-family ancestors, generalized atom constraints arising from explicit capitals or bare sample binders, acyclic local value definitions with captures, selected single self-recursive top-level and local gates, simple and nonrecursive generic mold aliases, selected faced record casts and field reads, and contextual tags, `~` and constructors for closed disjoint unions, including direct nonrecursive generic unions and propagation through complete loobean and unit-shaped branches in casts and known union-sample calls, including nested branches. Known loobean result context also propagates through supported complete branches and binder-only cell arms; binder-only arms over union subjects remain unsupported. A directly known named union can instantiate an unconstrained generic gate sample with its origin, generic arguments and faces preserved; unnamed, pending, recursive and variable-bound cases remain unsupported. A known gate with an unresolved result variable can receive a known enclosing result type before its arguments are inferred; unknown calls and unresolved targets remain conservative. Multi-argument calls form a right-nested sample, retain known faces and shared type variables, and can use known sample positions to contextualize list and union arguments. A definite mismatch points to the failing argument when the fragment can establish it, otherwise to the combined sample; unsupported contextual forms still fail closed. For a supported recursive gate, the checker infers the sample first and uses its exact type, including field faces, for one monomorphic self reference. It generalizes after the body is checked; subsequent uses instantiate it independently. Incompatible recursive arguments can report the gate and argument sites. For a complete loobean branch with one direct self-call arm, a separately inferred closed base type can seed the recursive result before the whole body is checked. Open or pending base types do not seed it; other branch shapes remain subject to the fragment’s existing limits. A supported single local recursive gate also uses a monomorphic self reference and generalizes variables free of the enclosing environment after checking its body; captured variables remain shared. The checker collects written capitals per `++` before inference, excluding nested definitions: a capital used in an enclosing definition is shared with its locals even when written later, while a capital introduced only in a local definition is generalized there. Sibling locals can introduce independent capitals with the same spelling; generic mold parameters keep their own scope. Top-level groups of syntactic gates are inferred together with monomorphic placeholders and shared substitutions, then generalized only after the whole group checks; downstream uses and library interfaces instantiate those schemes independently. A dependency graph identifies groups with two iterative depth-first passes; its conservative local-reference edges can reject otherwise valid programs. Supported local mutually recursive gate groups also use shared monomorphic placeholders and generalize only after the group checks, preserving captured outer variables. A bounded dependency proof reports certain non-gate cycles through values and gates when an explicit atom or loobean result cast and simple unshadowed expressions establish the cycle. Other mixed gate/value cycles, polymorphic recursion, unresolved literal constraints and unresolved branch joins remain unsupported. Reporting repeats inference for a single recursive gate outside a group; grouped reports use the stored schemes. Its performance cost remains unmeasured. A single-arm cell pattern accepts two or more binders, the last capturing the remaining tail; duplicate and shadowed binders are rejected. A structured single-arm pattern also works for a known non-union cell when coverage is proven, including nested literal and wildcard positions. Intermediate union or collection tails, nested patterns, wildcards and faced records remain unsupported. String interpolation accepts known atom auras, unrestricted `@`, tapes and isolated decimal literals; a known cell asks for a printer, and an explicitly generic atom asks for an aura. Loobeans, term singletons, non-tape collections, open types and a type fixed only later remain unsupported. A known closed union with two or more arms supports patterns that provably cover or exclude each remaining case, including payload binders, imported and generic cases, and binder-free catch-alls. Partial boolean patterns can split known `?` positions into their two noun values, up to 64 alternatives across the union; binders retain their original case type. Missing alternatives and covered arms are reported. Other partial patterns, expansions above the limit, binders spanning distinct cases, differing arm result types and some complex two-arm subjects remain unsupported. A cast or known call sample can supply result context through whole-case arms and supported finite loobean refinements for a known union accessed by a wing, a grouped wing or a supported shallow call, including nested cell and list positions; other partial-pattern contexts and subject forms remain unsupported. The Grammar’s `step` block infers in this fragment, but its module is not yet checked. A bare tag proved absent from a known union reports the union and tag sites in casts, single-argument calls, unit payloads, list items and supported branch arms; imported unnamed unions print their cases. Ordered fit replay can identify a missing tag nested in a syntactic tuple, stopping at an earlier mismatch or uncertainty. Known faced records support uniquely named field changes, including nested wings, with field context passed to replacements and the original record type retained. Missing fields, empty changes and definite mismatches report sites; the expected-type site is the edit because the original field declaration location is not retained. Unknown or partly unfaced spines, ambiguous fields and repeated edits remain unsupported. A known record cast supplies field context to its tuple or record initializer, including nested list and union fields; mismatch diagnostics use the cast mold because the original field declaration location is not retained. Isolated cart-style `init` and `update` expressions infer, while the complete cart-store fails closed because its kind and declaration scope remain unchecked. Uncontextualized list literals infer a fresh element type, including empty and nested lists, with independently generalized uses. Unresolved item tags and uncertain widening remain unsupported. Backtick unit construction uses the validated standard prelude unit template, infers its payload without losing pending constraints, and makes the prelude’s `some` available. Ordinary result annotations also let its `bind`, `biff`, `both`, `clap`, `clef` and `flit` infer. A known unit in a cast, call, list item or record field supplies context to its payload, including nested units and lists; mismatches identify the payload and context. Unrelated union identities, some variable-dependent fits, and missing or altered prelude unit templates remain unsupported. Literal singleton heads compare by runtime noun, so `|=%$` also matches explicit null- and loobean-zero-headed cases. When equal heads have disjoint payloads, the constructor selects a uniquely proven compatible payload; unknown and ambiguous candidates remain unsupported. Unresolved nulls remain pending and are reported separately from tags. A known union of `~` and a null-headed cell supports a complete `~` / `[~ value]` branch in either order, including shadow checks; unknown subjects, missing or duplicate arms, and unresolved branch results remain unsupported. This fragment infers the prelude’s `fall` and `need` signatures. With the validated prelude list and a known cast or gate sample, empty, nonempty and nested list literals infer their element types, including contextual union tags; a mismatched element names both sites. In that context `~` and zero-valued terms fit an empty list, and two-item unfaced cells form cons lists, including nested cons and imported-list contexts; invalid heads or tails name both sites. A known gate sample also supplies context to matching positions in a single tuple or record argument, including nested cells; zero literals can fit list positions. A bound zero constant remains unsupported rather than a definite mismatch, and an unknown callee does not supply context. Faced or longer cells and a missing or altered prelude list fail closed. A known list result also supplies context through complete loobean, unit-shaped and list-shaped branches, including recursive and nested branches. For a known standard list with a supported element type, a complete `~` / `[item rest]` branch infers the element and tail types in either arm order and checks binders for shadowing. Unknown subjects, unsupported element types and other or incomplete list patterns remain unsupported. A value with type variable `A` can fit a field whose type is that same `A`, including in generic union payloads and nested or repeated record fields. Other variable-dependent face merges remain unsupported. Forced equality of distinct written capitals now reports both source sites, following @iko’s decision; forcing one to a concrete type remains unsupported. Imported record spines with repeated faces fail closed where used, but only with a generic unsupported diagnostic. Hoon may erase unfaced nested-cell boundaries, so the check can conservatively reject valid names in distinct erased scopes. Supported closed unions print using an in-scope name or imported alias; an unnamed nongeneric union prints its cases, parenthesized when nested. The latter is print-only. Generic union types retain all arguments in their printed name; if that name is unavailable, the partial printer reports the limitation. Different import faces for the same origin remain compatible; compatibility across distinct union origins and some generic-argument comparisons remain unsupported. Nonrecursive generic aliases can reorder, repeat or omit parameters while retaining a union’s origin, including through local scopes and library interfaces. A generic union declared directly inside a body remains unsupported, as do differing-variable face constraints in a union payload. A transitive generic union whose name is unavailable is reported as unsupported instead of hiding its arguments. Unfixed decimal literals default to `@ud` in gate-free inferred types; recursive molds, general branch tag context, other constraint cases and defaulting inside gate types still need work. Collection recognition checks the originating core and fails closed on shadows or unsupported Ford subject shapes; a wrapper regression also rejects forged subjects, samples and tails. Its golden fixtures include three real Tlon files. A Clay test passes a Ford-built nested union through the reader into partial inference. The partial prelude includes `murn`, `join`, `snip`, `rear` and the agreed shared-type `clap`; supported calls infer, while backend validation remains outstanding, and [prelude-inventory.md](prelude-inventory.md) is a source audit, not the complete inventory or signatures. The milestone remains unfinished.

61+

62+The shared prelude interface reserves every name present in the supplied vendored source and makes only supported inferred entries available, including `list`, `unit`, `same`, `fall`, `need`, `bond`, `lure`, `weld`, `snoc`, `turn` and `lent`. The validated standard `list` mold is injected when the prelude’s own gates are inferred; `weld` and `turn` have ordinary explicit result casts. An absent or altered `list` is not injected, and an altered declaration cannot leak through direct or transitive mold aliases. The same validated template is available when prelude mold aliases are prepared, so supported direct and transitive aliases can use it. Unsupported entries such as most list helpers remain reserved but unavailable; backend validation of the helpers remains outstanding. All callers use the same prelude origin, so a library can export a type containing unqualified `(unit A)` to another module. The source-only `+prepare-prelude` rejects empty, malformed, conflicting or import-bearing source; `+prepare-prelude-with-internal` also accepts the supported private internal import. Prepared values are trusted and must come unchanged from the matching preparation arm. When canonical public list or unit templates are missing or altered, independently inferred private molds remain available, while molds that depend on those templates do not. The module-scope fixture compares the prepared and source-taking paths against the real prelude and a two-module golden under eval and on the ship. The source and checker remain incomplete, so this does not establish complete shadowing coverage or a checked module.

63+

64+The prelude has a Jibb-written `succ` gate that increments through `add`; partial inference retains its arithmetic atom constraint. A Hoon translation agrees with Hoon on ten selected inputs. Jibb execution and jet recognition remain unverified.

65+

66+The prelude has Jibb-written curried `lead` and `late` pair constructors, inferred with independent argument types including gate values. Their focused golden passes under eval and on the ship, and a Hoon-reference comparison covers operand order. Jibb backend execution remains unverified.

67+

68+The prelude also has a Jibb-written `zing` that concatenates homogeneous lists via `weld`. Its focused golden infers empty, nested text, ship, generic and gate-element lists and reports a non-list error; the same golden passes on the ship. A Hoon translation agrees with Hoon `zing` on selected finite inputs, not on Jibb execution. Hoon’s raw helper additionally accepts heterogeneous noun lists, which the Jibb signature does not express. Backend lowering and jet recognition remain unverified.

69+

70+The experimental deferred constructor transaction conservatively declines general structural tuple fits, most branches, field reads, nonidentical successful call/cast fits, and multi-argument calls with open argument, sample or result types. This prevents a later substitution from invalidating an earlier face-propagation check; cases requiring deferred structural fits remain unsupported. It can retry source definitions after later dependencies become available, and a two-arm boolean branch can retain separately owned literal-result obligations until a later closed context resolves them. Faced targets or union cases, list literals and general union-pattern branches remain unsupported.

71+

72+The checked inference slice now represents `!!`, proves empty cell positions and filters proven-empty union cases. List and unit payload arms whose elements are empty are rejected as unreachable; fixed opaque cases fail closed when reachability is unknown. The new shared guard covers checked interfaces, partial diagnostics and proof budgets. Its shared guard runs under eval and on the ship.

73+

74+An eval and ship fixture now reports partial inference for the unchanged todo island with its real API and Hoon readers. It verifies that the source fixtures match `my-app` and exercises missing or duplicate imports; the report does not claim the module or island has been checked. The prelude also has a Jibb-written recursive `lent` whose supported generic calls infer `@ud`. Execution and shape-based jet recognition remain future backend work. Nested union tests check equal runtime nouns, different nested tags, empty fields and unknown inhabitation.

75+

76+The prelude now writes `lth`, `gte` and `lte` in Jibb using `gth` and `not`. Supported generic and concrete calls infer, including loobeans; mismatched explicit auras fail. Execution, jet recognition and complete import checking remain unfinished.

77+

78+The prelude also writes `trip` and `tuba` over private primitives, with inferred cord, tape and UTF-32 list types matching the target ship's Hoon 135 definitions. Their composition with `lent` and invalid argument controls pass under eval and on the ship; primitive lowering, execution and jet recognition remain unfinished. In the unchanged todo report, `update` now reaches its remaining branch-context limitation instead of failing on missing text names.

79+

80+The Hoon reader can prove overlaps among supported original `$?` source cases, including nested cells and unions with more than two cases, and report them at a Jibb use site. It evaluates each case independently and compares runtime noun values. Other overlaps, Hoon case locations and mark-reader overlap diagnostics remain unfinished. The source screen allows at most 128 cases and 4,096 source noun nodes; dependency checking and pairwise witness analysis each have a separate 4,096-node budget. These budgets do not bound chapter lookup, Hoon evaluation or graph walks.

81+

82+Restricted-number promotion now skips an environment scan when a definition has no written capitals. In a single startup-inclusive pair on 2,000 independent gates, output was identical and user CPU fell from 71.67 to 38.26 seconds; wall time was 72.80 versus 51.66 seconds with other checks running. This is a partial-inference measurement, not a complete checker or a bound on dependent modules.

24## Milestone 1: parser and mark

84## Milestone 1: parser and mark

@@ -37,9 +97,9 @@ What the plan asks for, and where it is:

38Besides the plan's list:

98Besides the plan's list:

40−- 410 golden cases: 194 that parse and 216 that fail, each failure at a stated line and column. One failing case has an unclear expectation (corpus question 3). The newer type-output cases exercise only the partial inference fragment. Each case's `about.txt` quotes the doc's words it tests.

100+- 660 golden cases: 440 that parse and 220 that fail, each failure at a stated line and column. One failing case has an unclear expectation (corpus question 3). The newer type-output cases exercise only the partial inference fragment. Each case's `about.txt` quotes the doc's words it tests.

41−- The 410-case corpus passed under `urbit eval` in 20.5 s. The fake ship passed all 414 tests, including the importer, importer/checker and mark/checker bridges, and unification checks, with 17.9 s for sync and 15.5 s for tests. The importer golden compares 68 projections; `tools/clay-fixtures` builds the example Hoon fixtures through Clay, reads selected molds and marks, and passes Clay-built types through the Clay-built importer and partial checker.

101+- The 660-case corpus passed under `urbit eval` in 103.0 s while other checks were running. The fake ship passed all 710 tests, including the source-overlap, structural-overlap, generic-union source and alias-overlap, full-module overlap, deferred-context, generic-recursion, generic-construction, generic-pattern, deferred-inference, empty-mold and cell-branch fixtures, importer, importer/checker and mark/checker bridges, module scope, unification, hole, qath, ask, default-wrapper importer, projection, arithmetic, generic-alias, positional-face, API-evidence, request, closed-gate, todo API, constructor, sub, nested-union, gate-free and direct-gate guards and the unchanged todo report. Desk sync took 101.4 s while other checks were running. The importer golden compares 221 projections; `tools/clay-fixtures` builds the example Hoon fixtures through Clay, checks a recursive Ford import's origin, and passes Clay-built types through the Clay-built importer and partial checker.

42−- `tools/testdata/selftest` (19 checks) and `tools/testdata/ship-selftest` test the tools themselves.

102+- `tools/testdata/selftest` (22 checks), `tools/testdata/ship-selftest` and `tools/testdata/clay-fixtures-selftest` test the tools themselves; the last checks temporary Clay fixture cleanup and signal handling without a ship.

43- Two independent audits before 7c739b7, one of which compared the library with a reference parser written in Python from the doc over about 19,000 generated programs. Before ab797a9, a second Python parser, written from the decisions, agreed with the library on 8,000 generated programs and 900 hand-written probes.

103- Two independent audits before 7c739b7, one of which compared the library with a reference parser written in Python from the doc over about 19,000 generated programs. Before ab797a9, a second Python parser, written from the decisions, agreed with the library on 8,000 generated programs and 900 hand-written probes.

44- Speed: starting `urbit eval` and building the library takes about 8 s. After that, a 2,000-line module of 400 definitions parses in about a second. Loops over definitions, arms, lines and items grow no stack; nesting costs a few stack frames a level, and 100,000 nested brackets still parse (library section 3).

104- Speed: starting `urbit eval` and building the library takes about 8 s. After that, a 2,000-line module of 400 definitions parses in about a second. Loops over definitions, arms, lines and items grow no stack; nesting costs a few stack frames a level, and 100,000 nested brackets still parse (library section 3).

105

@@ -60,24 +120,150 @@ Besides the plan's list:

60| 26554ac | 2026-10-30 | Infer an atom constraint, extend the prelude and read example molds through Clay |

120| 26554ac | 2026-10-30 | Infer an atom constraint, extend the prelude and read example molds through Clay |

61| fbeaa83 | 2026-10-30 | Extend atom constraints and nested ordered-map imports; connect Clay types to partial inference |

121| fbeaa83 | 2026-10-30 | Extend atom constraints and nested ordered-map imports; connect Clay types to partial inference |

62| 47a1f49 | 2026-10-30 | Read validated Ford imports, widen aura families, and show both sites of selected errors |

122| 47a1f49 | 2026-10-30 | Read validated Ford imports, widen aura families, and show both sites of selected errors |

63−| This change | 2026-10-30 | Read mark samples and test partial mark imports; reject unproven nested `$^`; preserve atom constraints through aliases |

123+| bd37989 | 2026-10-30 | Read mark samples and test partial mark imports; reject unproven nested `$^`; preserve atom constraints through aliases |

124+| 2d5deb2 | 2026-10-30 | Default gate-free decimal types, validate named Hoon mold lookup, and isolate fixture failures |

125+| 1b7dbae | 2026-10-30 | Infer acyclic local definitions and parse case-local Jibb module fixtures |

126+| 8b9c9ac | 2026-10-30 | Preserve recursive import origins, infer simple local molds, and supply Jibb module sources to the partial checker |

127+| 529736a | 2026-10-30 | Infer supported library import graphs and guard nested Hoon `$^` in collections |

128+| 8bf1b12 | 2026-10-30 | Infer selected record faces and check nested `$^` in static Hoon records |

129+| d8ac47d | 2026-10-30 | Cache library interfaces, preserve imported Hoon record faces, and check nested tagged unions |

130+| edd9277 | 2026-10-30 | Infer nonrecursive generic mold aliases with lexical parameters |

131+| 4406f6f | 2026-10-30 | Resolve selected contextual tags and check explicit imported unions |

132+| 5c73614 | 2026-10-30 | Print supported named and escaping union types |

133+| 0070584 | 2026-10-30 | Propagate union context through loobean branches, read selected unions in Hoon collections, and add `flit` |

134+| 250564c | 2026-10-30 | Infer selected named generic unions, test Hoon collection wrappers, and add list helpers |

135+| e95ef8f | 2026-10-30 | Bridge selected Hoon unions into partial inference and support generic union aliases |

136+| 56a899f | 2026-10-30 | Infer matching variable types in faced fields and bridge opaque Hoon collections |

137+| 4d45d2f | 2026-10-30 | Resolve selected contextual null literals |

138+| e878edc | 2026-10-30 | Infer complete unit-shaped branches and bridge selected recursive Hoon molds |

139+| 743dfd8 | 2026-10-30 | Propagate union context through unit-shaped branches |

140+| 3f90fa8 | 2026-10-30 | Share a partial prelude interface across module inference |

141+| 29bd39f | 2026-10-30 | Infer contextual list literals and validate prelude parity |

142+| a2a6ef5 | 2026-10-30 | Infer complete list-shaped branches |

143+| 671fe72 | 2026-10-30 | Infer contextual list nulls and cons cells |

144+| 7e69436 | 2026-10-30 | Infer selected self-recursive gates |

145+| 9ab52e8 | 2026-10-30 | Infer recursive branches with closed base types |

146+| d782b45 | 2026-10-30 | Propagate list context and apply settled type decisions |

147+| c7082e0 | 2026-10-30 | Infer multi-argument calls |

148+| 918acbd | 2026-10-30 | Infer recursive gates from their samples first |

149+| 1470d18 | 2026-10-30 | Infer selected prelude list helpers |

150+| 10cbf9c | 2026-10-30 | Infer selected local recursive gates and distinguish reader diagnostics |

151+| 45afb13 | 2026-10-30 | Infer local capital scopes and report direct reader diagnostics |

152+| 054e651 | 2026-10-30 | Report nested reader diagnostics |

153+| 98c19cd | 2026-10-30 | Infer known-aura string interpolation |

154+| ddba633 | 2026-10-30 | Infer top-level mutually recursive gates |

155+| 9f1517e | 2026-10-30 | Infer whole-case union patterns and prelude `turn` |

156+| 9dd35c8 | 2026-10-31 | Match finite boolean refinements of union cases |

157+| 54852d4 | 2026-10-31 | Contextualize tuple calls and infer known record changes |

158+| 0bc5113 | 2026-10-31 | Contextualize record initializers and infer unit construction |

159+| 264a436 | 2026-10-31 | Contextualize unit payloads in casts, calls and nested values |

160+| a140383 | 2026-10-31 | Report missing union tags and infer prelude unit helpers |

161+| d69cc52 | 2026-10-31 | Infer longer cell binder patterns and prelude unit helpers |

162+| ae35005 | 2026-10-31 | Import source-verified tagged Hoon unions |

163+| c8f894a | 2026-10-31 | Report nested missing tags and contextualize union branch results |

164+| ef2ea71 | 2026-10-31 | Import Hoon null singleton cases |

165+| 67f900e | 2026-10-31 | Infer local mutual gates and uncontextualized lists |

166+| 7ff15f1 | 2026-10-31 | Contextualize finite union patterns and record the initial poke decision |

167+| c790a9f | 2026-10-31 | Expose transparent `poke` from the internal prelude |

168+| ef4772a | 2026-10-31 | Bridge imported loobeans and loobean singletons |

169+| ad46655 | 2026-10-31 | Bridge selected imported any-noun molds |

170+| beada10 | 2026-10-31 | Import source-proved Ford mark unions, analyze API paths and infer list helpers |

171+| e28f7be | 2026-10-31 | Diagnose proven non-gate cycles and import Tlon null-payload union cases |

172+| fd2f288 | 2026-10-31 | Infer qualified fields of imported values |

173+| ed9291e | 2026-10-31 | Infer term-headed pairs and function helpers, and import nested named unions |

174+| ad0265e | 2026-10-31 | Infer proven single-case patterns and the prelude command union |

175+| 413b12b | 2026-10-31 | Propagate known result context into generic calls and batch ship deletions |

176+| c690076 | 2026-10-31 | Propagate loobean context, infer predicate helpers, and import named ordered-map operands |

177+| 0bf6178 | 2026-10-31 | Bridge recursive Tlon lists and prepare a private comparison interface |

178+| 4e472b5 | 2026-10-31 | Pass known named unions through polymorphic gates |

179+| e3e184f | 2026-10-31 | Parse type holes, reject duplicate written record fields, and extend partial union inference and imports |

180+| 80e221a | 2026-10-31 | Infer supported annotation holes and prelude list aliases |

181+| ba1fec4 | 2026-10-31 | Add the curried `bond` prelude gate |

182+| 0ea700d | 2026-10-31 | Infer a source-defined recursive `qath` subset and record the explicit `proj` decision |

183+| 75f5952 | 2026-10-31 | Check a subset of explicit `proj` calls and retain their lowering evidence |

184+| cf17925 | 2026-10-31 | Infer supported single-field projections |

185+| 1a891e2 | 2026-10-31 | Infer source-backed addition and decrement without loobean operands; record the watchability decision |

186+| 81af5fd | 2026-10-31 | Preserve public names of identity-generic union aliases and record the `like` decision |

187+| 640a442 | 2026-10-31 | Add the source-backed `like` result mapper and infer supported positional calls |

188+| 445a0a1 | 2026-10-31 | Retain source-backed API path evidence and classify declarations |

189+| f69493d | 2026-10-31 | Derive supported request components from API declarations |

190+| f0f6954 | 2026-10-31 | Analyze supported API helper definitions and declared marks |

191+| 3f55af7 | 2026-10-31 | Define source-backed transparent ask and pure |

192+| ae1ec26 | 2026-10-31 | Prove selected default-wrapped Hoon unions from source |

193+| dde791c | 2026-10-31 | Infer a source-backed request-gate type through ordinary imports |

194+| a1c5f35 | 2026-10-31 | Infer supported multi-path requests and named closed folds |

195+| 911ca0c | 2026-10-31 | Propagate union context, define subscriptions and match literal nouns |

196+| 72acdb3 | 2026-10-31 | Infer selected nested union payloads from context |

197+| 706035c | 2026-10-31 | Analyze gate-free source molds with field witnesses |

198+| 651b8ec | 2026-10-31 | Match source-proven gate samples in direct calls |

199+| cc8e389 | 2026-10-31 | Add source-backed list length and real todo regression |

200+| 4da6891 | 2026-10-31 | Add source-backed comparisons and nested Hoon union controls |

201+| 09db390 | 2026-10-31 | Skip unnecessary inference environment scans |

202+| 179d717 | 2026-10-31 | Diagnose source-proven Hoon union overlaps |

203+| 142f2e2 | 2026-10-31 | Prove structural overlaps across Hoon union cases |

204+| c96597d | 2026-10-31 | Track source-proven generic recursive identities |

205+| 190a9d5 | 2026-10-31 | Add source-backed list flattening |

206+| d9d51e6 | 2026-10-31 | Check source-proven recursive tree construction |

207+| 30b0a9e | 2026-10-31 | Match source-proven recursive tree cases |

208+| 72d85ab | 2026-10-31 | Add bounded deferred inference and expand runtime equality coverage |

209+| 22f3788 | 2026-10-31 | Check empty molds and propagate closed cell context into branches |

210+| 341bcb4 | 2026-10-31 | Keep deferred fits stable under later substitutions |

211+| b93a94b | 2026-10-31 | Prove local generic-alias union tags and add successor |

212+| 2826c93 | 2026-10-31 | Report generic-alias overlaps and retain deferred branch contexts |

213+| b5cdc80 | 2026-10-31 | Preserve full-module overlap source evidence |

214+| ab6fdc1 | 2026-10-31 | Add source-backed text conversion wrappers |

215+| aa277c9 | 2026-10-31 | Recover prepared tuple initializers in partial reports |

216+| b4703e7 | 2026-11-01 | Check narrow closed subscription-free program mains |

217+| 26bf7a7 | 2026-11-01 | Recover narrow direct-program initializer contexts |

218+| 642d2c0 | 2026-11-01 | Prove direct request-value watchability for program subscriptions |

219+| This change | 2026-11-01 | Add the source-backed UI, program and page prelude slice |

220

65## Checking it

221## Checking it

222

67On a machine set up as [development.md](development.md) says:

223On a machine set up as [development.md](development.md) says:

224

69```

225```

70−tools/golden # 410 cases under urbit eval

226+tools/golden # 660 cases under urbit eval

71tools/importer-test # the Hoon importer fixture projection

227tools/importer-test # the Hoon importer fixture projection

228+tools/type-import-default-test # default-wrapped source proof golden

72tools/type-import-test # the importer/checker bridge fixture

229tools/type-import-test # the importer/checker bridge fixture

230+tools/type-import-overlap-test # source-aware Hoon overlap and provenance fixture

231+tools/type-import-structural-test # structural overlap and multi-case source fixture

232+tools/type-union-source-test # local generic-alias union guards

233+tools/type-union-alias-overlap-test # local generic-alias overlap diagnostics

234+tools/type-full-overlap-test # full-module overlap evidence

235+tools/type-tlon-test # the real Tlon reader/checker fixture

73tools/type-mark-test # the mark/checker bridge fixture

236tools/type-mark-test # the mark/checker bridge fixture

237+tools/type-poke-test # the source-backed poke/API fixture

238+tools/type-api-evidence-test # API declaration evidence guards

239+tools/type-api-paths-test # partial API path metadata fixture

240+tools/type-hole-guards-test # hole defaulting and API interface guards

241+tools/type-list-alias-test # prelude list-alias guards

242+tools/type-generic-alias-test # generic union alias guards

243+tools/type-generic-recursion-test # source-proven generic recursion guards

244+tools/type-generic-construction-test # source-proven recursive construction guards

245+tools/type-generic-pattern-test # source-proven recursive pattern guards

246+tools/type-deferred-test # source-owned deferred inference guards

247+tools/type-deferred-resolver-test # resolver consistency and failure guards

248+tools/type-deferred-context-test # deferred source-order and branch guards

249+tools/type-deferred-prepared-test # prepared initializer reports and failure guards

250+tools/type-empty-test # empty molds and coverage guards

251+tools/type-cell-branch-test # branch context and rollback guards

252+tools/type-positional-face-guards-test # positional sample face guards

253+tools/type-qath-guards-test # qath source and unfolding guards

254+tools/type-ask-guards-test # ask source and bootstrap guards

255+tools/type-proj-guards-test # projection evidence and scope guards

256+tools/type-module-scope-test # module and prelude scope fixture

257+tools/type-program-main-test # closed program-main interface and rejection guards

258+tools/type-program-init-test # transactional direct-program initializer context guards

74tools/hoon check-spans-test # prints <<>> when the span checker works

259tools/hoon check-spans-test # prints <<>> when the span checker works

75tools/testdata/selftest # the tools themselves

260tools/testdata/selftest # the tools themselves

76tools/doc-blocks docs/spec # the doc's examples are golden cases

261tools/doc-blocks docs/spec # the doc's examples are golden cases

77tools/ship start

262tools/ship start

78tools/ship gen-tests --check # tests/lib/jibb.hoon is up to date

263tools/ship gen-tests --check # tests/lib/jibb.hoon is up to date

79−tools/ship test # the same 410 cases as -test arms on the ship

264+tools/ship test # the same 660 cases as -test arms on the ship

80tools/testdata/ship-selftest

265tools/testdata/ship-selftest

266+tools/testdata/clay-fixtures-selftest # scratch fixture cleanup without a ship

81tools/ship check-commit # |commit stores .jibb files

267tools/ship check-commit # |commit stores .jibb files

82tools/clay-fixtures # example /sur files and marks build through Clay

268tools/clay-fixtures # example /sur files and marks build through Clay

83```

269```

jibb-dev/lib/jibb-import.hoon+1386−48

@@ -8,20 +8,27 @@

8:: Hoon's %hold nodes retain the generator's Hoon and its bound arguments.

9:: Comparing that Hoon to the standard generators identifies collections

10:: before they expand into trees. Recursive holds are tracked by identity;

11−:: a repeated named hold becomes a module-qualified reference.

11+:: a repeated named hold becomes a module-qualified reference. A proven

12+:: nested self-recursive tagged union retains its own named boundary.

12::

13::

13:: A direct $^ is read from its original branches and accepted only when

14:: A direct $^ is read from its original branches and accepted only when

14−:: their imported shapes prove disjoint. Nested $^ and some valid but

15+:: their imported shapes prove disjoint. A single nested $^ in a

16+:: static record is checked by splitting and reassembling its branches;

15−:: unprovably disjoint cases remain unsupported. Source-level overlap in

17+:: other nested forms and unprovably disjoint cases remain unsupported. Source-level overlap in

16:: other unions, general nested ordered maps, broader Ford subject

18:: other unions, general nested ordered maps, broader Ford subject

17−:: shapes, recursive mark types and full error locations still need work. A nested ordered map

19+:: shapes, ambiguous recursive origins and full error locations still

20+:: need work. One direct union argument to a standard collection is

21+:: recovered only from its exact call wrapper, static independent cases,

22+:: proven disjoint branches and unshadowed standard names. Other source

23+:: shapes fail closed. A nested ordered map is recovered only when its key and

18−:: is recovered only when its key and value are fixed atom molds and

24+:: value are fixed atom molds and

19:: the other fields are fixed atoms or collections of static atoms;

25:: the other fields are fixed atoms or collections of static atoms;

20:: other source shapes fail closed.

26:: other source shapes fail closed.

21::

27::

22−:: The checker has a small bridge for successful unfaced atom and cell

28+:: The partial checker bridges supported nouns, atoms, cells, faces,

23−:: results; it rejects other importer shapes. Failures return %|; no

29+:: proven forks and collections, and keeps proven recursive roots nominal.

30+:: Unsupported shapes fail closed. Reader failures return %|; no partial

24−:: partial tree is returned as success.

31+:: tree is returned as success.

25::

32::

26|%

33|%

27+$ imported

34+$ imported

@@ -32,9 +39,16 @@

32 [%cell head=imported tail=imported]

39 [%cell head=imported tail=imported]

33 [%face name=term body=imported]

40 [%face name=term body=imported]

34 [%fork cases=(list imported)]

41 [%fork cases=(list imported)]

42+ [%named module=term name=term body=imported]

35 [%apply name=term args=(list imported)]

43 [%apply name=term args=(list imported)]

36 [%ref module=term name=term]

44 [%ref module=term name=term]

37 [%bad reason=@t]

45 [%bad reason=@t]

46+ [%invalid code=?(%aura %core) reason=@t]

47+ ==

48++$ import-diagnostic

49+ $% [%ok value=imported]

50+ [%invalid code=?(%aura %core %overlap) message=@t]

51+ [%unsupported message=@t]

38 ==

52 ==

39+$ signatures (list [name=term code=hoon])

53+$ signatures (list [name=term code=hoon])

40+$ visiting (list [typ=type name=(unit term)])

54+$ visiting (list [typ=type name=(unit term)])

@@ -65,6 +79,445 @@

65 ^- (each imported @t)

79 ^- (each imported @t)

66 (read-with module name typ ~)

80 (read-with module name typ ~)

67::

81::

82+:: When Hoon's expanded type has lost source cases, inspect the exact

83+:: selected local arm. Restrict this fallback to distinct literal head tags

84+:: and proven-safe dependencies, then verify each projected branch again.

85++$ tagged-case [tag=@ branch=spec]

86+:: Clay and eval expose different versions of the spec union. Inspect help

87+:: and source-location wrappers as nouns before checking their contained spec.

88+++ source-gist-tail

89+ |= raw=*

90+ ^- (unit *)

91+ ?: ?=([%gist [%help *] *] raw) `+.+.raw

92+ ?: ?=([%dbug * *] raw) `+.+.raw

93+ ~

94+::

95+:: Bound metadata work separately from semantic source-node visits.

96+++ source-unwrap

97+ |= [raw=* left=@ud]

98+ ^- (unit *)

99+ =/ wrapper=(unit *) (source-gist-tail raw)

100+ ?~ wrapper `raw

101+ ?: =(left 0) ~

102+ $(raw u.wrapper, left (dec left))

103+::

104+++ tagged-term

105+ |= leaf=spec

106+ ^- (unit @)

107+ =/ plain=(unit *) (source-unwrap leaf 4)

108+ ?~ plain ~

109+ ?. ?=([%leaf %tas @] u.plain) ~

110+ `+.+.u.plain

111+::

112+++ tagged-head

113+ |= branch=spec

114+ ^- (unit @)

115+ =/ plain=(unit *) (source-unwrap branch 4)

116+ ?~ plain ~

117+ =. branch ;;(spec u.plain)

118+ ?+ branch ~

119+ [%bccl *]

120+ ?~ t.p.branch ~

121+ (tagged-term i.p.branch)

122+ ==

123+::

124+++ tagged-cases

125+ |= [cases=(list spec) tags=(list @)]

126+ ^- (unit (list tagged-case))

127+ ?~ cases `~

128+ ?: |((has-spec-cell-union i.cases) (has-spec-general-union i.cases)) ~

129+ =/ tag=(unit @) (tagged-head i.cases)

130+ ?~ tag ~

131+ ?: (lien tags |=(x=@ =(x u.tag))) ~

132+ =/ rest $(cases t.cases, tags [u.tag tags])

133+ ?~ rest ~

134+ `[[u.tag i.cases] u.rest]

135+

136+::

137+:: Bound the new $? branch screen independently of the existing $% path.

138+:: Count raw noun nodes across all cases, and cap pairwise tag comparisons.

139+++ bounded-no-spec-unions

140+ |= [h=* fuel=@ud]

141+ ^- (unit @ud)

142+ ?: =(fuel 0) ~

143+ =. fuel (dec fuel)

144+ ?@ h `fuel

145+ ?: ?=([%bckt ^ ^] h) ~

146+ ?: ?=([%bcwt [^ [^ *]]] h) ~

147+ ?: ?=([%bccn [^ [^ *]]] h) ~

148+ =/ left=(unit @ud) $(h -.h)

149+ ?~ left ~

150+ $(h +.h, fuel u.left)

151+++ tagged-bounded-cases

152+ |= [cases=(list spec) tags=(list @) fuel=@ud left=@ud]

153+ ^- (unit (list tagged-case))

154+ ?~ cases `~

155+ ?: =(left 0) ~

156+ =/ remaining=(unit @ud) (bounded-no-spec-unions i.cases fuel)

157+ ?~ remaining ~

158+ =/ tag=(unit @) (tagged-head i.cases)

159+ ?~ tag ~

160+ ?: (lien tags |=(x=@ =(x u.tag))) ~

161+ =/ rest $(cases t.cases, tags [u.tag tags], fuel u.remaining, left (dec left))

162+ ?~ rest ~

163+ `[[u.tag i.cases] u.rest]

164+::

165+:: Benign source annotations have different typed representations on

166+:: Clay and under eval. Inspect the wrapper as a noun, and validate the

167+:: contained Hoon before examining an arm.

168+++ source-note-tail

169+ |= raw=*

170+ ^- (unit *)

171+ ?: ?=([%note [%help *] *] raw) `+.+.raw

172+ ?: ?=([%dbug * *] raw) `+.+.raw

173+ ~

174+::

175+++ source-note-unwrap

176+ |= [raw=* left=@ud]

177+ ^- (unit *)

178+ =/ wrapper=(unit *) (source-note-tail raw)

179+ ?~ wrapper `raw

180+ ?: =(left 0) ~

181+ $(raw u.wrapper, left (dec left))

182+::

183+:: A bounded $~ source wrapper changes the default, not the mold.

184+:: Each annotation chain and default chain is separately bounded.

185+++ tagged-default-union

186+ |= [body=spec left=@ud]

187+ ^- (unit spec)

188+ =/ plain=(unit *) (source-unwrap body 4)

189+ ?~ plain ~

190+ =. body ;;(spec u.plain)

191+ ?. ?=([%bcsg *] body) `body

192+ ?: =(left 0) ~

193+ $(body q.body, left (dec left))

194+::

195+++ tagged-source-code

196+ |= [code=hoon name=term]

197+ ^- (unit (list tagged-case))

198+ =/ found=(unit spec) (local-mold-spec code name)

199+ ?~ found ~

200+ =/ body=(unit spec) (tagged-default-union u.found 4)

201+ ?~ body ~

202+ ?- u.body

203+ [%bccn *]

204+ =/ cases=(list spec) p.u.body

205+ ?~ cases ~

206+ ?~ t.cases ~

207+ (tagged-cases cases ~)

208+ [%bcwt *]

209+ =/ cases=(list spec) p.u.body

210+ ?~ cases ~

211+ ?~ t.cases ~

212+ (tagged-bounded-cases cases ~ 4.096 128)

213+ * ~

214+ ==

215+::

216+:: Source proof for dependencies of an explicitly tagged union. Only

217+:: simple local molds, standard collections and distinct term enums are

218+:: accepted; computed molds, nested cell unions and cycles fail closed.

219+:: One shared fuel budget bounds repeated visits through acyclic aliases;

220+:: exhaustion or an inherited same-name arm leaves the result unsupported.

221+++ local-arm-source

222+ |= [cor=type name=term]

223+ ^- (unit hoon)

224+ ?. ?=([%core *] cor) ~

225+ =/ chapters=(map term tome) q.r.q.cor

226+ =/ all=(list [term tome]) ~(tap by chapters)

227+ ?: (lien all |=(e=[term tome] &(!=(-.e %$) (chapter-unsafe +.e name)))) ~

228+ =/ chapter=(unit tome) (~(get by chapters) %$)

229+ ?~ chapter ~

230+ (chapter-source u.chapter name)

231+::

232+++ local-mold-spec

233+ |= [code=hoon name=term]

234+ ^- (unit spec)

235+ =/ plain=(unit *) (source-note-unwrap code 4)

236+ ?~ plain ~

237+ =. code ;;(hoon u.plain)

238+ ?+ code ~

239+ [%ktcl *]

240+ ?. ?=([%name * *] p.code) ~

241+ ?. =(name p.p.code) ~

242+ `q.p.code

243+ ==

244+::

245+++ safe-source-enum

246+ |= [cases=(list spec) seen=(list @) fuel=@ud]

247+ ^- (unit @ud)

248+ ?~ cases `fuel

249+ ?: =(fuel 0) ~

250+ =/ tag=(unit @) (tagged-term i.cases)

251+ ?~ tag ~

252+ ?: (lien seen |=(n=@ =(n u.tag))) ~

253+ $(cases t.cases, seen [u.tag seen], fuel (dec fuel))

254+::

255+++ safe-source-specs-mode

256+ |= [xs=(list spec) cor=type seen=(list term) fuel=@ud allow-nested=?]

257+ ^- (unit @ud)

258+ ?~ xs `fuel

259+ =/ left=(unit @ud) (safe-source-spec-mode i.xs cor seen fuel allow-nested)

260+ ?~ left ~

261+ $(xs t.xs, fuel u.left)

262+::

263+++ safe-source-name-mode

264+ |= [name=term cor=type seen=(list term) fuel=@ud allow-nested=?]

265+ ^- (unit @ud)

266+ :: Permit a direct root revisit or one proven nested self-revisit.

267+ :: Mutual cycles and inherited same-name bindings remain unavailable.

268+ ?: (lien seen |=(x=term =(name x)))

269+ ?. ?=([%core *] cor) ~

270+ ?. (scope-safe p.cor name) ~

271+ ?: =(seen ~[name]) `fuel

272+ ?. allow-nested ~

273+ ?. ?=([* [* ~]] seen) ~

274+ ?. =(i.seen name) ~

275+ =/ selected=(unit hoon) (local-arm-source cor name)

276+ ?~ selected ~

277+ =/ cases=(unit (list tagged-case)) (tagged-source-code u.selected name)

278+ ?~ cases ~

279+ `fuel

280+ =/ arm=(unit hoon) (local-arm-source cor name)

281+ ?~ arm

282+ ?. &(|(=(name %ship) =(name %path)) (scope-safe cor name)) ~

283+ `fuel

284+ ?. ?=([%core *] cor) ~

285+ ?. (scope-safe p.cor name) ~

286+ =/ body=(unit spec) (local-mold-spec u.arm name)

287+ ?~ body ~

288+ (safe-source-spec-mode u.body cor [name seen] fuel allow-nested)

289+::

290+++ safe-source-spec-mode

291+ |= [shape=spec cor=type seen=(list term) fuel=@ud allow-nested=?]

292+ ^- (unit @ud)

293+ =/ plain=(unit *) (source-unwrap shape 4)

294+ ?~ plain ~

295+ =. shape ;;(spec u.plain)

296+ ?: =(fuel 0) ~

297+ =. fuel (dec fuel)

298+ ?+ shape ~

299+ [%base *] ?:(|(?=([%atom *] p.shape) =(%flag p.shape) =(%null p.shape)) `fuel ~)

300+ [%leaf *] `fuel

301+ [%bcsg *] $(shape q.shape)

302+ [%bcts *] ?@ p.shape $(shape q.shape)

303+ ~

304+ [%bccl *] (safe-source-specs-mode p.shape cor seen fuel allow-nested)

305+ [%bccn *]

306+ :: A source proof may cross one named union dependency. Deeper

307+ :: named unions stay unsupported to bound recursive reprojection.

308+ ?. allow-nested ~

309+ ?. ?=([* [* ~]] seen) ~

310+ =/ cases=(unit (list tagged-case)) (tagged-cases p.shape ~)

311+ ?~ cases ~

312+ ?~ u.cases ~

313+ ?~ t.u.cases ~

314+ (safe-source-tagged-fuel-mode u.cases cor seen fuel allow-nested)

315+ [%bcwt *] (safe-source-enum p.shape ~ fuel)

316+ [%like *]

317+ ?. ?=([@ ~] p.shape) ~

318+ ?. ?=(~ q.shape) ~

319+ (safe-source-name-mode i.p.shape cor seen fuel allow-nested)

320+ [%make *]

321+ =/ wing=(unit term) (source-single-wing p.shape)

322+ ?~ wing ~

323+ =/ n=term u.wing

324+ ?. (lien `(list term)`~[%map %set %qeu %list %unit %jar %jug] |=(x=term =(x n))) ~

325+ ?. (scope-safe cor n) ~

326+ (safe-source-specs-mode q.shape cor seen fuel allow-nested)

327+ ==

328+::

329+++ safe-source-tagged-fuel-mode

330+ |= [cases=(list tagged-case) cor=type seen=(list term) fuel=@ud allow-nested=?]

331+ ^- (unit @ud)

332+ ?~ cases `fuel

333+ =/ left=(unit @ud) (safe-source-spec-mode branch.i.cases cor seen fuel allow-nested)

334+ ?~ left ~

335+ $(cases t.cases, fuel u.left)

336+::

337+++ safe-source-name

338+ |= [name=term cor=type seen=(list term) fuel=@ud]

339+ ^- (unit @ud)

340+ (safe-source-name-mode name cor seen fuel &)

341+::

342+++ safe-source-tagged

343+ |= [cases=(list tagged-case) cor=type seen=(list term) fuel=@ud]

344+ ^- ?

345+ ?=(^ (safe-source-tagged-fuel-mode cases cor seen fuel &))

346+::

347+++ tagged-union-fallback

348+ |= [module=term name=term cor=type]

349+ ^- (unit (each imported @t))

350+ ?. ?=([%core *] cor) ~

351+ =/ chapters=(map term tome) q.r.q.cor

352+ =/ other=(list [term tome]) ~(tap by chapters)

353+ ?: (lien other |=(e=[term tome] &(!=(-.e %$) (chapter-unsafe +.e name)))) ~

354+ =/ chapter=(unit tome) (~(get by chapters) %$)

355+ ?~ chapter ~

356+ =/ selected=(unit hoon) (chapter-source u.chapter name)

357+ ?~ selected ~

358+ =/ cases (tagged-source-code u.selected name)

359+ ?~ cases ~

360+ :: Preserve the original budget when no nested union recovery is needed.

361+ =/ plain=? ?=(^ (safe-source-tagged-fuel-mode u.cases cor ~[name] 4.096 |))

362+ ?. |(plain (safe-source-tagged u.cases cor ~[name] 256)) ~

363+ =/ tried=(each (list type) tang)

364+ (mule |.((turn u.cases |=(c=tagged-case (~(play ut cor) [%kttr branch.c])))))

365+ ?. ?=([%& *] tried) ~

366+ :: Record the selected hold before projecting branches so an exact

367+ :: recursive revisit can retain its independently verified origin.

368+ =/ selected-type=(each type tang)

369+ (mule |.((~(play ut cor) (ream (cat 3 '*' name)))))

370+ ?. ?=([%& *] selected-type) ~

371+ =/ projected=(each (list imported) tang)

372+ (mule |.((turn p.tried |=(t=type (walk module t catalog ~[[p.selected-type [~ name]]] `cor)))))

373+ ?. ?=([%& *] projected) ~

374+ ?^ (first-bads p.projected) ~

375+ ?. (all-disjoint p.projected) ~

376+ =/ xs=(list tagged-case) u.cases

377+ =/ ys=(list imported) p.projected

378+ |-

379+ ?~ xs

380+ ?^ ys ~

381+ `[%& [%fork (sort p.projected |=(pair=[imported imported] (dor -.pair +.pair)))]]

382+ ?~ ys ~

383+ ?. ?=([%cell [%atom %tas [~ @]] *] i.ys) ~

384+ ?. =(tag.i.xs u.value.head.i.ys) ~

385+ $(xs t.xs, ys t.ys)

386+

387+::

388+:: Unlike the disjoint-reader fallback, source overlap may have repeated

389+:: tags. Bound both raw case traversal and the number of pair attempts.

390+++ overlap-source-cases

391+ |= [cases=(list spec) fuel=@ud left=@ud]

392+ ^- (unit (list tagged-case))

393+ ?~ cases `~

394+ ?: =(left 0) ~

395+ =/ remaining=(unit @ud) (bounded-no-spec-unions i.cases fuel)

396+ ?~ remaining ~

397+ =/ tag=(unit @) (tagged-head i.cases)

398+ ?~ tag ~

399+ =/ rest $(cases t.cases, fuel u.remaining, left (dec left))

400+ ?~ rest ~

401+ `[[u.tag i.cases] u.rest]

402+++ overlap-repeated-tag

403+ |= cases=(list tagged-case)

404+ ^- ?

405+ ?~ cases |

406+ ?: (lien t.cases |=(c=tagged-case =(tag.c tag.i.cases))) &

407+ $(cases t.cases)

408+++ overlap-projections-match

409+ |= [xs=(list tagged-case) ys=(list imported)]

410+ ^- ?

411+ ?~ xs ?=(~ ys)

412+ ?~ ys |

413+ ?. ?=([%cell [%atom %tas [~ @]] *] i.ys) |

414+ ?. =(tag.i.xs u.value.head.i.ys) |

415+ $(xs t.xs, ys t.ys)

416+++ overlap-source-witness

417+ |= [module=term name=term cor=type]

418+ ^- ?

419+ ?. ?=([%core *] cor) |

420+ =/ selected=(unit hoon) (local-arm-source cor name)

421+ ?~ selected |

422+ =/ shape=(unit spec) (local-mold-spec u.selected name)

423+ ?~ shape |

424+ =/ body=(unit spec) (tagged-default-union u.shape 4)

425+ ?~ body |

426+ ?. ?=([%bcwt *] u.body) |

427+ =/ cases=(unit (list tagged-case)) (overlap-source-cases p.u.body 4.096 128)

428+ ?~ cases |

429+ ?. (overlap-repeated-tag u.cases) |

430+ ?. ?=(^ (safe-source-tagged-fuel-mode u.cases cor ~[name] 4.096 |)) |

431+ =/ tried=(each (list type) tang)

432+ (mule |.((turn u.cases |=(c=tagged-case (~(play ut cor) [%kttr branch.c])))))

433+ ?. ?=([%& *] tried) |

434+ =/ projected=(each (list imported) tang)

435+ (mule |.((turn p.tried |=(t=type (walk module t catalog ~ `cor)))))

436+ ?. ?=([%& *] projected) |

437+ ?^ (first-bads p.projected) |

438+ ?. (overlap-projections-match u.cases p.projected) |

439+ =/ witness=(unit overlap-proof-result) (overlap-case-pairs p.projected 4.096)

440+ ?~ witness |

441+ found.u.witness

442+::

443+:: Positive overlap evidence only: false means no proof, not disjointness.

444+:: Fuel is shared across all examined nodes and sibling alternatives.

445++$ overlap-proof-result [found=? left=@ud]

446+++ overlap-known-atom

447+ |= aura=term

448+ ^- ?

449+ (lien `(list term)`~[%t %tas %ud %f] |=(n=term =(n aura)))

450+++ overlap-inhabited-list

451+ |= [xs=(list imported) fuel=@ud]

452+ ^- (unit overlap-proof-result)

453+ ?~ xs `[| fuel]

454+ ?: =(0 fuel) ~

455+ =/ one=(unit overlap-proof-result) (overlap-inhabited i.xs (dec fuel))

456+ ?~ one ~

457+ ?: found.u.one one

458+ $(xs t.xs, fuel left.u.one)

459+++ overlap-inhabited

460+ |= [x=imported fuel=@ud]

461+ ^- (unit overlap-proof-result)

462+ ?: =(0 fuel) ~

463+ =. fuel (dec fuel)

464+ ?- x

465+ [%noun *] `[& fuel]

466+ [%void *] `[| fuel]

467+ [%atom *] `[|(?=(^ value.x) (overlap-known-atom aura.x)) fuel]

468+ [%face *] $(x body.x)

469+ [%named *] $(x body.x)

470+ [%fork *] (overlap-inhabited-list cases.x fuel)

471+ [%cell *]

472+ =/ a=(unit overlap-proof-result) $(x head.x)

473+ ?~ a ~

474+ ?. found.u.a a

475+ $(x tail.x, fuel left.u.a)

476+ * `[| fuel]

477+ ==

478+++ overlap-pair-list

479+ |= [xs=(list imported) y=imported fuel=@ud]

480+ ^- (unit overlap-proof-result)

481+ ?~ xs `[| fuel]

482+ ?: =(0 fuel) ~

483+ =/ p=(unit overlap-proof-result) (overlap-pair i.xs y (dec fuel))

484+ ?~ p ~

485+ ?: found.u.p p

486+ $(xs t.xs, fuel left.u.p)

487+++ overlap-pair

488+ |= [a=imported b=imported fuel=@ud]

489+ ^- (unit overlap-proof-result)

490+ ?: =(0 fuel) ~

491+ =. fuel (dec fuel)

492+ ?: ?=([%face *] a) $(a body.a)

493+ ?: ?=([%face *] b) $(b body.b)

494+ ?: ?=([%named *] a) $(a body.a)

495+ ?: ?=([%named *] b) $(b body.b)

496+ ?: ?=([%fork *] a) (overlap-pair-list cases.a b fuel)

497+ ?: ?=([%fork *] b) (overlap-pair-list cases.b a fuel)

498+ ?: ?=([%noun *] a) (overlap-inhabited b fuel)

499+ ?: ?=([%noun *] b) (overlap-inhabited a fuel)

500+ ?: &(?=([%cell *] a) ?=([%cell *] b))

501+ =/ p=(unit overlap-proof-result) $(a head.a, b head.b)

502+ ?~ p ~

503+ ?. found.u.p p

504+ $(a tail.a, b tail.b, fuel left.u.p)

505+ ?. &(?=([%atom *] a) ?=([%atom *] b)) `[| fuel]

506+ ?^ value.a

507+ ?^ value.b `[=(u.value.a u.value.b) fuel]

508+ `[&(=(u.value.a 0) (overlap-known-atom aura.b)) fuel]

509+ ?^ value.b `[&(=(u.value.b 0) (overlap-known-atom aura.a)) fuel]

510+ `[&((overlap-known-atom aura.a) (overlap-known-atom aura.b)) fuel]

511+++ overlap-case-pairs

512+ |= [xs=(list imported) fuel=@ud]

513+ ^- (unit overlap-proof-result)

514+ ?~ xs `[| fuel]

515+ ?: =(0 fuel) ~

516+ =/ p=(unit overlap-proof-result) (overlap-pair-list t.xs i.xs (dec fuel))

517+ ?~ p ~

518+ ?: found.u.p p

519+ $(xs t.xs, fuel left.u.p)

520+::

68:: +read-mold-in: accept the /sur core as provenance. The core must be

521:: +read-mold-in: accept the /sur core as provenance. The core must be

69:: built against zuse or validated Ford imports, and its selected arm

522:: built against zuse or validated Ford imports, and its selected arm

70:: must be this type. Unknown subject shapes fail closed.

523:: must be this type. Unknown subject shapes fail closed.

@@ -74,17 +527,83 @@

74 ?. ?=([%core *] cor) [%| 'Hoon module provenance is unavailable']

527 ?. ?=([%core *] cor) [%| 'Hoon module provenance is unavailable']

75 ?: =(cor -:!>(..zuse)) [%| 'Hoon module provenance is unavailable']

528 ?: =(cor -:!>(..zuse)) [%| 'Hoon module provenance is unavailable']

76 ?. (scope-safe cor %$) [%| 'Hoon module provenance is unavailable']

529 ?. (scope-safe cor %$) [%| 'Hoon module provenance is unavailable']

530+ =/ chapters=(map term tome) q.r.q.cor

531+ ?. (lien ~(tap by chapters) |=(entry=[term tome] =((chapter-has +.entry name) [~ &])))

532+ [%| (crip "Hoon mold `{(trip name)}` is not declared")]

77 ?. =(typ (~(play ut cor) (ream (cat 3 '*' name))))

533 ?. =(typ (~(play ut cor) (ream (cat 3 '*' name))))

78 [%| 'Hoon module provenance does not match the selected mold']

534 [%| 'Hoon module provenance does not match the selected mold']

535+ =/ overlap=(each ? tang) (mule |.((overlap-source-witness module name cor)))

536+ ?: &(?=(%& -.overlap) p.overlap) [%| 'Hoon union cases overlap']

79 =/ result (read-with module name typ [~ cor])

537 =/ result (read-with module name typ [~ cor])

80− ?. ?=([%& *] result) result

538+ ?: ?=([%& *] result) result

81− ?: &(!=(q.q.cor -:!>(..zuse)) (contains-ref p.result))

539+ =/ fallback=(each (unit (each imported @t)) tang)

82− [%| 'a recursive Hoon mold with Ford imports needs source-aware import']

540+ (mule |.((tagged-union-fallback module name cor)))

83− result

541+ ?: ?=(%| -.fallback) result

542+ ?~ p.fallback result

543+ u.p.fallback

544+::

545+:: +read-named is the source-aware entry point for callers that have

546+:: not selected a Hoon type yet. Check the core and the local arm

547+:: before invoking Hoon's type engine, which otherwise crashes when

548+:: the requested name is absent.

549+++ read-named

550+ |= [module=term name=term cor=type]

551+ ^- (each imported @t)

552+ ?. ?=([%core *] cor) [%| 'Hoon module provenance is unavailable']

553+ ?: =(cor -:!>(..zuse)) [%| 'Hoon module provenance is unavailable']

554+ ?. (scope-safe cor %$) [%| 'Hoon module provenance is unavailable']

555+ =/ chapters=(map term tome) q.r.q.cor

556+ ?. (lien ~(tap by chapters) |=(entry=[term tome] =((chapter-has +.entry name) [~ &])))

557+ [%| (crip "Hoon mold `{(trip name)}` is not declared")]

558+ =/ attempted=(each type tang)

559+ (mule |.((~(play ut cor) (ream (cat 3 '*' name)))))

560+ ?- attempted

561+ [%& *] (read-mold-in module name p.attempted cor)

562+ [%| *]

563+ =/ lines=wall (zing (turn (flop p.attempted) |=(a=tank (wash [0 80] a))))

564+ =/ rev=wall (flop lines)

565+ ?~ rev [%| (crip "Hoon mold `{(trip name)}` could not be evaluated")]

566+ [%| (crip "Hoon mold `{(trip name)}` could not be evaluated: {i.rev}")]

567+ ==

84::

568::

85:: A mark door's payload is [sample build-subject]. Its outer sample

569:: A mark door's payload is [sample build-subject]. Its outer sample

86:: face names the door sample, not the imported mark type. Collection

570:: face names the door sample, not the imported mark type. Collection

87:: lookup for the sample happened against the pre-door build subject.

571:: lookup for the sample happened against the pre-door build subject.

572+:: Fallback for a mark whose sample is exactly one arm of its only

573+:: Ford-imported /sur core. Source validation remains in read-mold-in.

574+:: Recursive results need a separate mark-origin/interface design.

575+++ mark-has-ref

576+ |= node=imported

577+ ^- ?

578+ ?- node

579+ [%ref *] &

580+ [%named *] $(node body.node)

581+ [%face *] $(node body.node)

582+ [%cell *] |($(node head.node) $(node tail.node))

583+ [%fork *] (lien cases.node |=(child=imported (mark-has-ref child)))

584+ [%apply *] (lien args.node |=(child=imported (mark-has-ref child)))

585+ * |

586+ ==

587+::

588+++ mark-union-fallback

589+ |= [raw=type context=type]

590+ ^- (unit (each imported @t))

591+ ?. ?=([%cell [%face @ [%core *]] *] context) ~

592+ ?. =(q.context -:!>(..zuse)) ~

593+ =/ alias=term p.p.context

594+ =/ core=type q.p.context

595+ ?. ?=([%hold *] raw) ~

596+ =/ name=(unit term) (hold-name q.raw)

597+ ?~ name ~

598+ =/ selected=(each type tang)

599+ (mule |.((~(play ut core) (ream (cat 3 '*' u.name)))))

600+ ?. ?=([%& *] selected) ~

601+ ?. =(p.selected raw) ~

602+ =/ result=(each imported @t) (read-mold-in alias u.name raw core)

603+ ?. ?=([%& [%fork *]] result) ~

604+ ?: (mark-has-ref p.result) ~

605+ `result

606+::

88++ read-mark

607++ read-mark

89 |= [name=term cor=type]

608 |= [name=term cor=type]

90 ^- (each imported @t)

609 ^- (each imported @t)

@@ -95,24 +614,50 @@

95 =/ sample=type p.p.cor

614 =/ sample=type p.p.cor

96 =/ raw=type ?:(?=([%face *] sample) q.sample sample)

615 =/ raw=type ?:(?=([%face *] sample) q.sample sample)

97 =/ result (read-with name name raw [~ q.p.cor])

616 =/ result (read-with name name raw [~ q.p.cor])

98− ?. ?=([%& *] result) result

617+ ?: ?=([%& *] result) result

99− ?: (contains-ref p.result)

618+ =/ fallback=(each (unit (each imported @t)) tang)

100− [%| 'a recursive Hoon mark needs source-aware import']

619+ (mule |.((mark-union-fallback raw q.p.cor)))

101− result

620+ ?: ?=(%| -.fallback) result

102−::

621+ ?~ p.fallback result

103−:: Until recursive holds retain their originating module, a Ford import

622+ u.p.fallback

104−:: could otherwise label another module's recursive reference as local.

623+::

105−++ contains-ref

624+++ read-named-diagnostic

106− |= out=imported

625+ |= [module=term name=term cor=type]

107− ^- ?

626+ ^- import-diagnostic

108− ?- out

627+ =/ result=(each imported @t) (read-named module name cor)

109− [%ref *] &

628+ ?: ?=(%& -.result) [%ok p.result]

110− [%cell *] |($(out head.out) $(out tail.out))

629+ ?. ?=([%core *] cor) [%unsupported p.result]

111− [%face *] $(out body.out)

630+ ?: =(cor -:!>(..zuse)) [%unsupported p.result]

112− [%fork *] (lien cases.out |=(item=imported (contains-ref item)))

631+ ?. (scope-safe cor %$) [%unsupported p.result]

113− [%apply *] (lien args.out |=(item=imported (contains-ref item)))

632+ =/ chapters=(map term tome) q.r.q.cor

114− * |

633+ ?. (lien ~(tap by chapters) |=(entry=[term tome] =((chapter-has +.entry name) [~ &])))

115− ==

634+ [%unsupported p.result]

635+ =/ selected=(each type tang) (mule |.((~(play ut cor) (ream (cat 3 '*' name)))))

636+ ?. ?=(%& -.selected) [%unsupported p.result]

637+ =/ overlap=(each ? tang) (mule |.((overlap-source-witness module name cor)))

638+ ?: &(?=(%& -.overlap) p.overlap) [%invalid %overlap 'Hoon union cases overlap']

639+ =/ again=(each imported tang) (mule |.((walk module p.selected catalog ~ [~ cor])))

640+ ?. ?=(%& -.again) [%unsupported p.result]

641+ =/ evidence=(unit import-diagnostic) (first-invalid p.again)

642+ ?~ evidence [%unsupported p.result]

643+ u.evidence

644+::

645+++ read-mark-diagnostic

646+ |= [name=term cor=type]

647+ ^- import-diagnostic

648+ =/ result=(each imported @t) (read-mark name cor)

649+ ?: ?=(%& -.result) [%ok p.result]

650+ ?. ?=([%core *] cor) [%unsupported p.result]

651+ ?. ?=([%cell *] p.cor) [%unsupported p.result]

652+ ?. =(p.cor q.q.cor) [%unsupported p.result]

653+ ?. (scope-safe q.p.cor %$) [%unsupported p.result]

654+ =/ sample=type p.p.cor

655+ =/ raw=type ?:(?=([%face *] sample) q.sample sample)

656+ =/ again=(each imported tang) (mule |.((walk name raw catalog ~ [~ q.p.cor])))

657+ ?. ?=(%& -.again) [%unsupported p.result]

658+ =/ evidence=(unit import-diagnostic) (first-invalid p.again)

659+ ?~ evidence [%unsupported p.result]

660+ u.evidence

116::

661::

117++ read-with

662++ read-with

118 |= [module=term name=term typ=type context=(unit type)]

663 |= [module=term name=term typ=type context=(unit type)]

@@ -362,6 +907,39 @@

362:: checked for disjointness. The tested axis follows the field path;

907:: checked for disjointness. The tested axis follows the field path;

363:: tracking that path distinguishes a nested $^ from an ordinary $@.

908:: tracking that path distinguishes a nested $^ from an ordinary $@.

364:: Other Hoon code can look the same, so some valid molds may be rejected.

909:: Other Hoon code can look the same, so some valid molds may be rejected.

910+:: Collection argument syntax retains $^ as %bckt, before Hoon

911+:: reduces the resulting type and can collapse overlapping cases. Until

912+:: argument-level disjointness is checked, reject those source forms.

913+++ has-spec-cell-union

914+ |= h=*

915+ ^- ?

916+ ?@ h |

917+ ?: ?=([%bckt ^ ^] h) &

918+ |($(h -.h) $(h +.h))

919+::

920+:: The Grammar's disjointness rule applies to imported $% and $? too;

921+:: @iko confirmed the rule for imported unions on 2026-10-30.

922+++ has-spec-general-union

923+ |= h=*

924+ ^- ?

925+ ?@ h |

926+ ?: ?=([%bcwt [^ [^ *]]] h) &

927+ ?: ?=([%bccn [^ [^ *]]] h) &

928+ |($(h -.h) $(h +.h))

929+::

930+++ has-fits-union

931+ |= h=*

932+ ^- ?

933+ ?@ h |

934+ ?: ?=([%wtcl [%fits *] * *] h) &

935+ |($(h -.h) $(h +.h))

936+::

937+++ fits-union-at

938+ |= [h=hoon axis=@ud]

939+ ^- ?

940+ ?. ?=([%fits *] h) |

941+ |(=(q.h ~[[%.y axis]]) =(q.h ~[[%.y (mul 2 axis)]]))

942+::

365++ has-cell-union

943++ has-cell-union

366 |= h=hoon

944 |= h=hoon

367 ^- ?

945 ^- ?

@@ -382,6 +960,7 @@

382 |($(h -.h, axis (mul 2 axis)) $(h +.h, axis (add 1 (mul 2 axis))))

960 |($(h -.h, axis (mul 2 axis)) $(h +.h, axis (add 1 (mul 2 axis))))

383 ?+ h (has-cell-union-any h)

961 ?+ h (has-cell-union-any h)

384 [%note *] $(h q.h)

962 [%note *] $(h q.h)

963+ [%dbug *] $(h q.h)

385 [%ktts *] $(h q.h)

964 [%ktts *] $(h q.h)

386 [%wtcl *]

965 [%wtcl *]

387 ?: =(p.h [%dtwt [%$ (mul 2 axis)]]) &

966 ?: =(p.h [%dtwt [%$ (mul 2 axis)]]) &

@@ -408,11 +987,119 @@

408 [%| *] ~

987 [%| *] ~

409 ==

988 ==

410::

989::

990+:: A static branch contains atom molds, exact tag constants and cells.

991+:: A tag shape must compare the current axis to the same atom it returns.

992+++ fixed-cell-mold

993+ |= [h=hoon axis=@ud]

994+ ^- ?

995+ ?^ -.h

996+ &($(h -.h, axis (mul 2 axis)) $(h +.h, axis (add 1 (mul 2 axis))))

997+ ?+ h |

998+ [%note *] $(h q.h)

999+ [%dbug *] $(h q.h)

1000+ [%ktts *] $(h q.h)

1001+ [%ktls *] ?=([%sand *] p.h)

1002+ [%cncl *]

1003+ ?: =(h [%cncl [%tsgr [%wing ~[[%.y 7]]] [%wing ~[%path]]] ~[[%$ axis]]]) &

1004+ (static-collection h)

1005+ [%wtcl *]

1006+ ?. (fits-union-at p.h axis) |

1007+ &($(h q.h) $(h r.h))

1008+ [%wtgr *]

1009+ ?: =(h [%wtgr [%dtts [%bust %noun] [%$ axis]] [%rock %n 0]]) &

1010+ ?. ?=([%dtts [%$ *] [%rock %$ *]] p.h) |

1011+ ?. ?=([%rock %tas *] q.h) |

1012+ ?^ q.q.h |

1013+ &(=(p.p.p.h axis) =(q.q.p.h q.q.h))

1014+ ==

1015+::

1016+:: Return two source records with a single $^ replaced by each branch.

1017+++ split-cell-record

1018+ |= [h=hoon axis=@ud]

1019+ ^- (unit [one=hoon two=hoon])

1020+ ?^ -.h

1021+ =/ left $(h -.h, axis (mul 2 axis))

1022+ =/ right $(h +.h, axis (add 1 (mul 2 axis)))

1023+ ?^ left

1024+ ?^ right ~

1025+ ?. (fixed-cell-mold +.h (add 1 (mul 2 axis))) ~

1026+ [~ [[one.u.left +.h] [two.u.left +.h]]]

1027+ ?~ right ~

1028+ ?. (fixed-cell-mold -.h (mul 2 axis)) ~

1029+ [~ [[-.h one.u.right] [-.h two.u.right]]]

1030+ ?+ h ~

1031+ [%note *]

1032+ =/ out $(h q.h)

1033+ ?~ out ~

1034+ [~ [h(q one.u.out) h(q two.u.out)]]

1035+ [%dbug *]

1036+ =/ out $(h q.h)

1037+ ?~ out ~

1038+ [~ [h(q one.u.out) h(q two.u.out)]]

1039+ [%ktts *]

1040+ =/ out $(h q.h)

1041+ ?~ out ~

1042+ [~ [h(q one.u.out) h(q two.u.out)]]

1043+ [%wtcl *]

1044+ ?. |(=(p.h [%dtwt [%$ (mul 2 axis)]]) (fits-union-at p.h axis)) ~

1045+ ?. &((fixed-cell-mold q.h axis) (fixed-cell-mold r.h axis)) ~

1046+ [~ [q.h r.h]]

1047+ ==

1048+::

1049+:: Reassemble a split source record. Non-union fields must have remained

1050+:: unchanged; the replaced field must have provably disjoint branches.

1051+++ merge-cell-record

1052+ |= [h=hoon axis=@ud a=imported b=imported]

1053+ ^- (each imported @t)

1054+ ?^ -.h

1055+ ?. &(?=([%cell *] a) ?=([%cell *] b))

1056+ [%| 'a nested Hoon $^ union needs a source-level disjointness check']

1057+ =/ left $(h -.h, axis (mul 2 axis), a head.a, b head.b)

1058+ ?. ?=([%& *] left) left

1059+ =/ right $(h +.h, axis (add 1 (mul 2 axis)), a tail.a, b tail.b)

1060+ ?. ?=([%& *] right) right

1061+ [%& [%cell p.left p.right]]

1062+ ?+ h

1063+ ?: =(a b) [%& a]

1064+ [%| 'a nested Hoon $^ union needs a source-level disjointness check']

1065+ [%note *] $(h q.h)

1066+ [%dbug *] $(h q.h)

1067+ [%ktts *]

1068+ ?. &(?=([%face *] a) ?=([%face *] b))

1069+ [%| 'a nested Hoon $^ union needs a source-level disjointness check']

1070+ ?. &(=(p.h name.a) =(p.h name.b))

1071+ [%| 'a nested Hoon $^ union needs a source-level disjointness check']

1072+ =/ child $(h q.h, a body.a, b body.b)

1073+ ?. ?=([%& *] child) child

1074+ [%& [%face name.a p.child]]

1075+ [%wtcl *]

1076+ ?. |(=(p.h [%dtwt [%$ (mul 2 axis)]]) (fits-union-at p.h axis))

1077+ [%| 'a Hoon union needs a source-level disjointness check']

1078+ ?. (disjoint a b)

1079+ ?: ?=([%fits *] p.h) [%| 'Hoon union disjointness could not be verified']

1080+ [%| 'Hoon $^ union disjointness could not be verified']

1081+ [%& [%fork (sort (weld (union-cases a) (union-cases b)) |=(pair=[imported imported] (dor -.pair +.pair)))]]

1082+ ==

1083+++ union-cases

1084+ |= a=imported

1085+ ^- (list imported)

1086+ ?. ?=([%fork *] a) ~[a]

1087+ (zing (turn cases.a |=(item=imported (union-cases item))))

1088+::

1089+++ all-disjoint

1090+ |= cases=(list imported)

1091+ ^- ?

1092+ ?~ cases &

1093+ ?. (levy t.cases |=(item=imported (disjoint i.cases item))) |

1094+ $(cases t.cases)

1095+::

411++ disjoint

1096++ disjoint

412 |= [a=imported b=imported]

1097 |= [a=imported b=imported]

413 ^- ?

1098 ^- ?

414 ?: ?=([%face *] a) $(a body.a)

1099 ?: ?=([%face *] a) $(a body.a)

415 ?: ?=([%face *] b) $(b body.b)

1100 ?: ?=([%face *] b) $(b body.b)

1101+ ?: ?=([%named *] a) $(a body.a)

1102+ ?: ?=([%named *] b) $(b body.b)

416 ?: ?=([%fork *] a)

1103 ?: ?=([%fork *] a)

417 (levy cases.a |=(item=imported (disjoint item b)))

1104 (levy cases.a |=(item=imported (disjoint item b)))

418 ?: ?=([%fork *] b)

1105 ?: ?=([%fork *] b)

@@ -467,6 +1154,32 @@

467 ?. (arm-map-valid +.chapter) ~

1154 ?. (arm-map-valid +.chapter) ~

468 [~ (arm-map-has +.chapter target)]

1155 [~ (arm-map-has +.chapter target)]

469::

1156::

1157+:: Return a unique source arm from either validated tome wrapper. Walk

1158+:: the noun map rather than relying on fields that differ on Clay.

1159+++ arm-map-sources

1160+ |= [m=* target=term]

1161+ ^- (list hoon)

1162+ ?@ m ~

1163+ =/ kv=* -.m

1164+ =/ children=* +.m

1165+ =/ found=(list hoon) ?:(=(-.kv target) ~[;;(hoon +.kv)] ~)

1166+ (weld found (weld $(m -.children) $(m +.children)))

1167+::

1168+++ chapter-source

1169+ |= [chapter=* target=term]

1170+ ^- (unit hoon)

1171+ ?: (arm-map-valid chapter) (unique-arm-source chapter target)

1172+ ?@ chapter ~

1173+ ?. (arm-map-valid +.chapter) ~

1174+ (unique-arm-source +.chapter target)

1175+::

1176+++ unique-arm-source

1177+ |= [arms=* target=term]

1178+ ^- (unit hoon)

1179+ =/ sources=(list hoon) (arm-map-sources arms target)

1180+ ?. ?=([* ~] sources) ~

1181+ `i.sources

1182+::

470++ chapter-unsafe

1183++ chapter-unsafe

471 |= [chapter=* target=term]

1184 |= [chapter=* target=term]

472 ^- ?

1185 ^- ?

@@ -509,17 +1222,46 @@

509 ?@ src |

1222 ?@ src |

510 |($(src -.src) $(src +.src))

1223 |($(src -.src) $(src +.src))

511::

1224::

1225+:: Clay can wrap each call component in source-location metadata.

1226+:: Peel only those wrappers; malformed casts are trapped by +mop-specs.

1227+++ mop-source-code

1228+ |= code=hoon

1229+ ^- hoon

1230+ =/ plain=(unit *) (source-unwrap code 4)

1231+ ?~ plain !!

1232+ ;;(hoon u.plain)

1233+::

1234+++ source-single-wing

1235+ |= raw=*

1236+ ^- (unit term)

1237+ =/ plain=(unit *) (source-unwrap raw 4)

1238+ ?~ plain ~

1239+ ?. ?=([%wing [@ ~]] u.plain) ~

1240+ `;;(term -.+.u.plain)

1241+::

512++ mop-specs-raw

1242++ mop-specs-raw

513 |= body=hoon

1243 |= body=hoon

514 ^- (unit [key=spec value=spec])

1244 ^- (unit [key=spec value=spec])

1245+ =. body (mop-source-code body)

515 ?. ?=([%cncl *] body) ~

1246 ?. ?=([%cncl *] body) ~

516 ?. ?=([%tsgr *] p.body) ~

1247 ?. ?=([%tsgr *] p.body) ~

517− =/ b=hoon q.p.body

1248+ =/ b=hoon (mop-source-code q.p.body)

518 ?. ?=([%cncl *] b) ~

1249 ?. ?=([%cncl *] b) ~

1250+ =/ call=hoon (mop-source-code p.b)

519− ?. ?=([%cncl *] p.b) ~

1251+ ?. ?=([%cncl *] call) ~

520− ?. ?=([%wing *] p.p.b) ~

1252+ =/ w=(unit term) (source-single-wing p.call)

521− ?. =(p.p.p.b ~[%mop]) ~

1253+ ?~ w ~

1254+ ?. =(u.w %mop) ~

1255+ =/ raw=* q.call

1256+ =/ wings=(unit [key=spec value=spec])

1257+ ?. ?=([* [* ~]] raw) ~

1258+ =/ a=(unit term) (source-single-wing -.raw)

1259+ =/ b=(unit term) (source-single-wing -.+.raw)

1260+ ?~ a ~

1261+ ?~ b ~

1262+ [~ [[%like ~[u.a] ~] [%like ~[u.b] ~]]]

1263+ ?^ wings wings

522− =/ specs=(list spec) ;;((list spec) q.p.b)

1264+ =/ specs=(list spec) ;;((list spec) raw)

523 ?. ?=([* [* ~]] specs) ~

1265 ?. ?=([* [* ~]] specs) ~

524 [~ [i.specs i.t.specs]]

1266 [~ [i.specs i.t.specs]]

525::

1267::

@@ -567,6 +1309,211 @@

567 ?: =(typ typ.i.seen) [~ name.i.seen]

1309 ?: =(typ typ.i.seen) [~ name.i.seen]

568 $(seen t.seen)

1310 $(seen t.seen)

569::

1311::

1312+:: Find the source module for an exact recursive hold by evaluating

1313+:: locally declared arms of each validated core in the subject. An

1314+:: unlabelled core, failed evaluation, or multiple labels is ambiguous.

1315+++ origin-candidates

1316+ |= [scope=type label=(unit term) name=term typ=type]

1317+ ^- (list (unit term))

1318+ ?: =(scope -:!>(..zuse)) ~

1319+ ?- scope

1320+ [%cell *]

1321+ ?. ?=([%face *] p.scope) ~[~]

1322+ ?^ p.p.scope ~[~]

1323+ %+ weld

1324+ $(scope q.p.scope, label [~ p.p.scope])

1325+ $(scope q.scope, label ~)

1326+ [%core *]

1327+ =/ chapters=(map term tome) q.r.q.scope

1328+ =/ present=? (lien ~(tap by chapters) |=(entry=[term tome] =((chapter-has +.entry name) [~ &])))

1329+ =/ own=(list (unit term))

1330+ ?. present ~

1331+ =/ trial=(each type tang) (mule |.((~(play ut scope) (ream (cat 3 '*' name)))))

1332+ ?- trial

1333+ [%| *] ~[~]

1334+ [%& *] ?: =(p.trial typ) ~[label]

1335+ ~

1336+ ==

1337+ (weld own $(scope p.scope, label ~))

1338+ * ~[~]

1339+ ==

1340+::

1341+++ ref-origin

1342+ |= [module=term name=term typ=type context=(unit type)]

1343+ ^- (unit term)

1344+ ?~ context ~

1345+ =/ found (origin-candidates u.context [~ module] name typ)

1346+ ?~ found ~

1347+ ?~ i.found ~

1348+ =/ choice=term u.i.found

1349+ =/ same

1350+ |= item=(unit term)

1351+ ^- ?

1352+ ?~ item |

1353+ =(u.item choice)

1354+ ?. (levy t.found same) ~

1355+ [~ choice]

1356+::

1357+::

1358+:: A collection case is independent of the subject only when its

1359+:: original spec uses literal atoms, tags and finite record structure.

1360+++ static-union-spec

1361+ |= s=spec

1362+ ^- ?

1363+ ?+ s |

1364+ [%base *] ?=([%atom *] p.s)

1365+ [%leaf *] &

1366+ [%bcts *] ?@ p.s $(s q.s)

1367+ |

1368+ [%bccl *] (static-union-specs p.s)

1369+ ==

1370+::

1371+++ static-union-specs

1372+ |= parts=(list spec)

1373+ ^- ?

1374+ ?~ parts &

1375+ &((static-union-spec i.parts) $(parts t.parts))

1376+::

1377+++ union-spec-parts

1378+ |= s=spec

1379+ ^- (unit (list spec))

1380+ ?+ s ~

1381+ [%bcwt *] [~ p.s]

1382+ [%bccn *] [~ p.s]

1383+ [%bckt *] [~ ~[p.s q.s]]

1384+ ==

1385+::

1386+:: Select one direct union argument, replacing exactly that spec with

1387+:: @t. The other arguments must be static and cannot contain unions.

1388+++ safe-union-parts

1389+ |= cases=(list spec)

1390+ ^- ?

1391+ ?~ cases |

1392+ ?~ t.cases |

1393+ =/ rest=(list spec) t.cases

1394+ &((static-union-spec i.cases) (levy rest |=(part=spec (static-union-spec part))))

1395+::

1396+++ split-union-arguments

1397+ |= [args=(list hoon) index=@ud]

1398+ ^- (unit [args=(list hoon) cases=(list spec) index=@ud])

1399+ ?~ args ~

1400+ ?. ?=([%ktcl *] i.args) ~

1401+ =/ cases (union-spec-parts p.i.args)

1402+ ?^ cases

1403+ ?. (safe-union-parts u.cases) ~

1404+ ?. (static-arguments t.args) ~

1405+ [~ [[[%ktcl [%base [%atom %t]]] t.args] u.cases index]]

1406+ ?. (static-spec p.i.args) ~

1407+ =/ rest $(args t.args, index +(index))

1408+ ?~ rest ~

1409+ [~ [[i.args args.u.rest] cases.u.rest index.u.rest]]

1410+::

1411+++ replace-union-argument

1412+ |= [args=(list imported) index=@ud union=imported]

1413+ ^- (unit (list imported))

1414+ ?~ args ~

1415+ ?: =(index 0)

1416+ ?. =([%atom %t ~] i.args) ~

1417+ [~ [union t.args]]

1418+ =/ rest $(args t.args, index (dec index))

1419+ ?~ rest ~

1420+ [~ [i.args u.rest]]

1421+::

1422+:: Accept only the compiler's direct collection call wrapper.

1423+++ direct-collection-source

1424+ |= [body=hoon original=hoon]

1425+ ^- ?

1426+ ?. ?=([%cncl [%tsgr * [%cncl *]] *] body) |

1427+ ?. =(p.p.body [%wing ~[[%.y 7]]]) |

1428+ ?. =(q.body ~[[%$ 6]]) |

1429+ ?. ?=([%tsls * *] original) |

1430+ =(q.original [%tsls [%dtts [%$ 14] [%$ 2]] [%$ 6]])

1431+::

1432+++ collection-union

1433+ |= [typ=type module=term sig=signatures seen=visiting context=(unit type)]

1434+ ^- imported

1435+ ?. ?=([%hold *] typ) [%bad 'a Hoon union needs a source-level disjointness check']

1436+ =/ is-cell=? (has-spec-cell-union q.typ)

1437+ =/ unsupported=@t

1438+ ?: is-cell 'a Hoon $^ union needs a source-level disjointness check'

1439+ 'a Hoon union needs a source-level disjointness check'

1440+ =/ original=hoon q.typ

1441+ ?. ?=([%tsls [%note * *] *] original) [%bad unsupported]

1442+ =/ body=hoon q.p.original

1443+ =/ alias (source-alias body)

1444+ ?~ alias [%bad unsupported]

1445+ ?. (alias-safe context u.alias) [%bad 'Hoon collection provenance is unavailable or shadowed']

1446+ =/ names=(list term) ~[%map %set %qeu %list %unit %jar %jug]

1447+ ?: (lien names |=(n=term &((source-uses body n) !(alias-safe context n))))

1448+ [%bad 'Hoon collection provenance is unavailable or shadowed']

1449+ ?. (direct-collection-source body original) [%bad unsupported]

1450+ ?> ?=([%cncl [%tsgr * [%cncl *]] *] body)

1451+ =/ split (split-union-arguments q.q.p.body 0)

1452+ ?~ split [%bad unsupported]

1453+ =/ tried=(each (list type) tang)

1454+ (mule |.((turn cases.u.split |=(s=spec (~(play ut p.typ) [%kttr s])))))

1455+ ?. ?=([%& *] tried) [%bad unsupported]

1456+ =/ cases=(list imported)

1457+ (turn p.tried |=(t=type (walk module t sig seen context)))

1458+ =/ err (first-bads cases)

1459+ ?^ err [%bad u.err]

1460+ ?. (all-disjoint cases)

1461+ [%bad ?:(is-cell 'Hoon $^ union disjointness could not be verified' 'Hoon union disjointness could not be verified')]

1462+ =/ rewritten=hoon original(q.p body(q.q.p args.u.split))

1463+ =/ attempt=(each type tang) (mule |.((~(play ut p.typ) rewritten)))

1464+ ?. ?=([%& *] attempt) [%bad unsupported]

1465+ =/ out=imported (walk module p.attempt sig seen context)

1466+ ?. ?=([%apply *] out) [%bad unsupported]

1467+ ?. =(name.out u.alias) [%bad unsupported]

1468+ =/ replacement=imported

1469+ [%fork (sort cases |=(pair=[imported imported] (dor -.pair +.pair)))]

1470+ =/ args (replace-union-argument args.out index.u.split replacement)

1471+ ?~ args [%bad unsupported]

1472+ [%apply name.out u.args]

1473+::

1474+:: A nested named tagged union may be recovered only if its hold is

1475+:: exactly the selected arm of this core. Provenance and all original

1476+:: source cases are checked by the same fallback as a top-level arm.

1477+++ nested-tagged-union

1478+ |= [module=term typ=type context=(unit type)]

1479+ ^- (unit imported)

1480+ ?~ context ~

1481+ ?. ?=([%core *] u.context) ~

1482+ ?. ?=([%hold *] typ) ~

1483+ =/ n=(unit term) (hold-name q.typ)

1484+ ?~ n ~

1485+ :: The outer proof has a shared budget. Bound each nested re-proof as

1486+ :: well, so rebuilding a shared source DAG cannot grow without limit.

1487+ =/ source=(unit hoon) (local-arm-source u.context u.n)

1488+ ?~ source ~

1489+ =/ cases=(unit (list tagged-case)) (tagged-source-code u.source u.n)

1490+ ?~ cases ~

1491+ ?. (safe-source-tagged u.cases u.context ~[u.n] 256) ~

1492+ =/ selected=(each type tang)

1493+ (mule |.((~(play ut u.context) (ream (cat 3 '*' u.n)))))

1494+ ?. ?=([%& *] selected) ~

1495+ ?. =(p.selected typ) ~

1496+ =/ attempt=(each (unit (each imported @t)) tang)

1497+ (mule |.((tagged-union-fallback module u.n u.context)))

1498+ ?. ?=([%& *] attempt) ~

1499+ ?~ p.attempt ~

1500+ ?. ?=([%& [%fork *]] u.p.attempt) ~

1501+ `p.u.p.attempt

1502+::

1503+:: Keep the proven owner boundary when a nested union refers to itself.

1504+++ contains-named-ref

1505+ |= [node=imported module=term name=term]

1506+ ^- ?

1507+ ?- node

1508+ [%ref *] &(=(module module.node) =(name name.node))

1509+ [%named *] |

1510+ [%face *] $(node body.node)

1511+ [%cell *] |($(node head.node) $(node tail.node))

1512+ [%fork *] (lien cases.node |=(child=imported (contains-named-ref child module name)))

1513+ [%apply *] (lien args.node |=(child=imported (contains-named-ref child module name)))

1514+ * |

1515+ ==

1516+::

570++ walk

1517++ walk

571 |= [module=term typ=type sig=signatures seen=visiting context=(unit type)]

1518 |= [module=term typ=type sig=signatures seen=visiting context=(unit type)]

572 ^- imported

1519 ^- imported

@@ -575,19 +1522,38 @@

575 %void [%void ~]

1522 %void [%void ~]

576 [%atom *]

1523 [%atom *]

577 ?: |(=('s' (cut 3 [0 1] p.typ)) =('r' (cut 3 [0 1] p.typ)))

1524 ?: |(=('s' (cut 3 [0 1] p.typ)) =('r' (cut 3 [0 1] p.typ)))

578− [%bad 'signed and float auras cannot be imported']

1525+ [%invalid %aura 'signed and float auras cannot be imported']

579 [%atom p.typ q.typ]

1526 [%atom p.typ q.typ]

580 [%cell *] [%cell $(typ p.typ) $(typ q.typ)]

1527 [%cell *] [%cell $(typ p.typ) $(typ q.typ)]

581− [%core *] [%bad 'cores and gates cannot be imported']

1528+ [%core *] [%invalid %core 'cores and gates cannot be imported']

582 [%face *]

1529 [%face *]

583 ?@ p.typ [%face p.typ $(typ q.typ)]

1530 ?@ p.typ [%face p.typ $(typ q.typ)]

584 [%bad 'a complex Hoon face needs translation']

1531 [%bad 'a complex Hoon face needs translation']

585 [%fork *]

1532 [%fork *]

586 =/ cases=(list imported)

1533 =/ cases=(list imported)

587 (turn ~(tap in:..zuse p.typ) |=(t=type ^$(typ t)))

1534 (turn ~(tap in:..zuse p.typ) |=(t=type ^$(typ t)))

1535+ =/ err (first-bads cases)

1536+ ?^ err [%bad u.err]

1537+ ?. (all-disjoint cases) [%bad 'Hoon union disjointness could not be verified']

588 [%fork (sort cases |=(pair=[imported imported] (dor -.pair +.pair)))]

1538 [%fork (sort cases |=(pair=[imported imported] (dor -.pair +.pair)))]

589 [%hint *] $(typ q.typ)

1539 [%hint *] $(typ q.typ)

590 [%hold *]

1540 [%hold *]

1541+ =/ prior=(unit (unit term)) (find-seen typ seen)

1542+ ?^ prior

1543+ ?~ u.prior [%bad 'an anonymous recursive Hoon mold cannot be named']

1544+ =/ origin (ref-origin module u.u.prior typ context)

1545+ ?~ origin [%bad 'a recursive Hoon mold needs unambiguous source provenance']

1546+ [%ref u.origin u.u.prior]

1547+ =/ nested=(unit imported) (nested-tagged-union module typ context)

1548+ ?^ nested

1549+ ?: ?=(~ seen) u.nested

1550+ =/ name=(unit term) (hold-name q.typ)

1551+ ?~ name u.nested

1552+ ?. (contains-named-ref u.nested module u.name) u.nested

1553+ [%named module u.name u.nested]

1554+ ?: &(?=([%tsls [%note * *] *] q.typ) |((has-spec-cell-union q.typ) (has-spec-general-union q.typ)))

1555+ =/ nm (hold-name q.typ)

1556+ (collection-union typ module sig [[typ nm] seen] context)

591 =/ named=(unit term) (match-signature q.typ sig)

1557 =/ named=(unit term) (match-signature q.typ sig)

592 ?^ named

1558 ?^ named

593 =/ name u.named

1559 =/ name u.named

@@ -601,12 +1567,8 @@

601 =/ second=type (~(play ut p.typ) (ream '*value'))

1567 =/ second=type (~(play ut p.typ) (ream '*value'))

602 [%apply name ~[first-import $(typ second)]]

1568 [%apply name ~[first-import $(typ second)]]

603 [%apply name ~[first-import]]

1569 [%apply name ~[first-import]]

604− =/ prior=(unit (unit term)) (find-seen typ seen)

605− ?^ prior

606− ?~ u.prior [%bad 'an anonymous recursive Hoon mold cannot be named']

607− [%ref module u.u.prior]

608 =/ nm (hold-name q.typ)

1570 =/ nm (hold-name q.typ)

609− ?: =(nm [~ %vase]) [%bad 'vases cannot be imported']

1571+ ?: =(nm [~ %vase]) [%bad 'a Hoon type named vase needs source provenance']

610 ?: &((source-uses q.typ %jar) !(alias-safe context %jar))

1572 ?: &((source-uses q.typ %jar) !(alias-safe context %jar))

611 [%bad 'Hoon collection provenance is unavailable or shadowed']

1573 [%bad 'Hoon collection provenance is unavailable or shadowed']

612 ?: &((source-uses q.typ %jug) !(alias-safe context %jug))

1574 ?: &((source-uses q.typ %jug) !(alias-safe context %jug))

@@ -615,7 +1577,8 @@

615 [%bad 'Hoon collection provenance is unavailable or shadowed']

1577 [%bad 'Hoon collection provenance is unavailable or shadowed']

616 =/ mop (mop-arguments typ)

1578 =/ mop (mop-arguments typ)

617 ?^ mop

1579 ?^ mop

1580+ :: An exact revisit fails closed without guessing a name.

618− [%apply %mop ~[$(typ key.u.mop) $(typ value.u.mop)]]

1581+ [%apply %mop ~[$(typ key.u.mop, seen [[typ ~] seen]) $(typ value.u.mop, seen [[typ ~] seen])]]

619 ?: (source-uses q.typ %mop)

1582 ?: (source-uses q.typ %mop)

620 =/ checked-names=(list term) ~[%map %set %qeu %list %unit]

1583 =/ checked-names=(list term) ~[%map %set %qeu %list %unit]

621 ?: (lien checked-names |=(n=term &((source-uses q.typ n) !(alias-safe context n))))

1584 ?: (lien checked-names |=(n=term &((source-uses q.typ n) !(alias-safe context n))))

@@ -650,9 +1613,33 @@

650 ?^ err [%bad u.err]

1613 ?^ err [%bad u.err]

651 ?: (disjoint first second)

1614 ?: (disjoint first second)

652 [%fork (sort ~[first second] |=(pair=[imported imported] (dor -.pair +.pair)))]

1615 [%fork (sort ~[first second] |=(pair=[imported imported] (dor -.pair +.pair)))]

653− [%bad 'a Hoon $^ union has overlapping cases']

1616+ [%bad 'Hoon $^ union disjointness could not be verified']

654− ?: (has-cell-union q.typ)

1617+ ?: |((has-cell-union q.typ) (has-fits-union q.typ))

1618+ =/ cannot=@t

1619+ ?: (has-fits-union q.typ) 'a Hoon union needs a source-level disjointness check'

655− [%bad 'a Hoon $^ union needs a source-level disjointness check']

1620+ 'a Hoon $^ union needs a source-level disjointness check'

1621+ =/ checked-names=(list term) ~[%map %set %qeu %list %unit %jar %jug %path]

1622+ ?: (lien checked-names |=(n=term &((source-uses q.typ n) !(alias-safe context n))))

1623+ [%bad 'Hoon collection provenance is unavailable or shadowed']

1624+ ?. ?=([%tsls [%note * *] *] q.typ)

1625+ [%bad cannot]

1626+ =/ original=hoon q.typ

1627+ ?> ?=([%tsls [%note * *] *] original)

1628+ =/ body=hoon q.p.original

1629+ =/ split (split-cell-record body 6)

1630+ ?~ split [%bad cannot]

1631+ =/ try=(each [type type] tang)

1632+ (mule |.([(~(play ut p.typ) original(q.p one.u.split)) (~(play ut p.typ) original(q.p two.u.split))]))

1633+ ?. ?=([%& *] try) [%bad cannot]

1634+ =/ first $(typ -.p.try, seen [[typ nm] seen])

1635+ =/ second $(typ +.p.try, seen [[typ nm] seen])

1636+ =/ err (first-bads ~[first second])

1637+ ?^ err [%bad u.err]

1638+ =/ combined (merge-cell-record body 6 first second)

1639+ ?- combined

1640+ [%& *] p.combined

1641+ [%| *] [%bad p.combined]

1642+ ==

656 =/ alias (hold-alias q.typ)

1643 =/ alias (hold-alias q.typ)

657 =/ hidden (has-hidden-alias q.typ)

1644 =/ hidden (has-hidden-alias q.typ)

658 =/ body $(typ ~(repo ut typ), seen [[typ nm] seen])

1645 =/ body $(typ ~(repo ut typ), seen [[typ nm] seen])

@@ -683,7 +1670,9 @@

683 [%atom *] ~

1670 [%atom *] ~

684 [%ref *] ~

1671 [%ref *] ~

685 [%bad *] [~ reason.out]

1672 [%bad *] [~ reason.out]

1673+ [%invalid *] [~ reason.out]

686 [%face *] $(out body.out)

1674 [%face *] $(out body.out)

1675+ [%named *] $(out body.out)

687 [%cell *]

1676 [%cell *]

688 =/ err $(out head.out)

1677 =/ err $(out head.out)

689 ?~ err $(out tail.out)

1678 ?~ err $(out tail.out)

@@ -699,6 +1688,35 @@

699 =/ err (first-bad i.xs)

1688 =/ err (first-bad i.xs)

700 ?~ err $(xs t.xs)

1689 ?~ err $(xs t.xs)

701 err

1690 err

1691+::

1692+++ first-invalid

1693+ |= out=imported

1694+ ^- (unit import-diagnostic)

1695+ ?- out

1696+ [%noun *] ~

1697+ [%void *] ~

1698+ [%atom *] ~

1699+ [%ref *] ~

1700+ [%bad *] `[%unsupported reason.out]

1701+ [%invalid *] `[%invalid code.out reason.out]

1702+ [%face *] $(out body.out)

1703+ [%named *] $(out body.out)

1704+ [%cell *]

1705+ =/ first $(out head.out)

1706+ ?~ first $(out tail.out)

1707+ first

1708+ [%fork *] (first-invalids cases.out)

1709+ [%apply *] (first-invalids args.out)

1710+ ==

1711+::

1712+++ first-invalids

1713+ |= xs=(list imported)

1714+ ^- (unit import-diagnostic)

1715+ ?~ xs ~

1716+ =/ first (first-invalid i.xs)

1717+ ?~ first $(xs t.xs)

1718+ first

1719+::

702:: +fixture-test: shared golden expectations for eval and the ship.

1720:: +fixture-test: shared golden expectations for eval and the ship.

703:: A synthetic hold whose first $^ branch cannot be evaluated. It tests

1721:: A synthetic hold whose first $^ branch cannot be evaluated. It tests

704:: that a failed branch probe is reported rather than crashing the host.

1722:: that a failed branch probe is reported rather than crashing the host.

@@ -794,7 +1812,7 @@

794 [%fork ~[[%cell [%face %x [%atom %ud ~]] [%face %y [%atom %ud ~]]] [%atom %ud ~]]]

1812 [%fork ~[[%cell [%face %x [%atom %ud ~]] [%face %y [%atom %ud ~]]] [%atom %ud ~]]]

795 =/ errors ?: =((sample %valid-cell) [%& expect-valid]) errors

1813 =/ errors ?: =((sample %valid-cell) [%& expect-valid]) errors

796 ['disjoint cell union' errors]

1814 ['disjoint cell union' errors]

797− =/ errors ?: =((sample %invalid-cell) [%| 'a Hoon $^ union has overlapping cases']) errors

1815+ =/ errors ?: =((sample %invalid-cell) [%| 'Hoon $^ union disjointness could not be verified']) errors

798 ['overlapping cell union is rejected' errors]

1816 ['overlapping cell union is rejected' errors]

799 =/ errors ?: =((shad %mn) [%| 'Hoon collection provenance is unavailable or shadowed']) errors

1817 =/ errors ?: =((shad %mn) [%| 'Hoon collection provenance is unavailable or shadowed']) errors

800 ['local mop shadow in a field is rejected' errors]

1818 ['local mop shadow in a field is rejected' errors]

@@ -835,9 +1853,11 @@

835 [%cell *] "[{(show-import head.out)} {(show-import tail.out)}]"

1853 [%cell *] "[{(show-import head.out)} {(show-import tail.out)}]"

836 [%face *] "{(trip name.out)}={(show-import body.out)}"

1854 [%face *] "{(trip name.out)}={(show-import body.out)}"

837 [%fork *] "(union {(show-imports cases.out)})"

1855 [%fork *] "(union {(show-imports cases.out)})"

1856+ [%named *] "(named {(trip name.out)}.{(trip module.out)} {(show-import body.out)})"

838 [%apply *] "({(trip name.out)} {(show-imports args.out)})"

1857 [%apply *] "({(trip name.out)} {(show-imports args.out)})"

839 [%ref *] "{(trip name.out)}.{(trip module.out)}"

1858 [%ref *] "{(trip name.out)}.{(trip module.out)}"

840 [%bad *] "error: {(trip reason.out)}"

1859 [%bad *] "error: {(trip reason.out)}"

1860+ [%invalid *] "error: {(trip reason.out)}"

841 ==

1861 ==

842::

1862::

843++ show-imports

1863++ show-imports

@@ -855,8 +1875,124 @@

855 [%| *] "error: {(trip p.result)}"

1875 [%| *] "error: {(trip p.result)}"

856 ==

1876 ==

857::

1877::

1878+++ show-import-diagnostic

1879+ |= result=import-diagnostic

1880+ ^- tape

1881+ ?- result

1882+ [%ok *] (show-import value.result)

1883+ [%invalid *] "invalid/{(trip code.result)}: {(trip message.result)}"

1884+ [%unsupported *] "unsupported: {(trip message.result)}"

1885+ ==

1886+::

1887+:: Clay includes debug spans around source nodes. Reproduce that

1888+:: shape without Clay so the same regression runs under eval and -test.

1889+++ decorate-union-source

1890+ |= h=hoon

1891+ ^- hoon

1892+ =/ at=spot [/tests/importer/synthetic/hoon [[1 1] [1 2]]]

1893+ ?^ -.h [%dbug at [$(h -.h) $(h +.h)]]

1894+ ?+ h [%dbug at h]

1895+ [%note *] [%dbug at h(q $(h q.h))]

1896+ [%ktts *] [%dbug at h(q $(h q.h))]

1897+ [%wtcl *] [%dbug at h(q $(h q.h), r $(h r.h))]

1898+ ==

1899+::

1900+++ debug-union-fixture

1901+ |= [cor=type name=term]

1902+ ^- (each imported @t)

1903+ =/ typ=type (~(play ut cor) (ream (cat 3 '*' name)))

1904+ ?. ?=([%hold *] typ) [%| 'synthetic union is not a hold']

1905+ =/ original=hoon q.typ

1906+ ?. ?=([%tsls [%note * *] *] original) [%| 'synthetic union source is unavailable']

1907+ =/ source=hoon original(q.p (decorate-union-source q.p.original))

1908+ (read-mold %small name typ(q source))

1909+::

1910+:: Test debug metadata at the spec boundary without assuming that the

1911+:: eval version of Hoon's spec mold itself includes Clay's %dbug tag.

1912+++ debug-spec-fixture

1913+ ^- tape

1914+ =/ location=* [/tests/importer/synthetic/hoon [[1 1] [1 2]]]

1915+ =/ wrapped=* [%dbug location [%leaf %tas %x]]

1916+ =/ got=(unit *) (source-gist-tail wrapped)

1917+ ?~ got "debug wrapper missing"

1918+ =/ leaf=(each spec tang) (mule |.(;;(spec u.got)))

1919+ ?. ?=([%& [%leaf %tas %x]] leaf) "debug leaf not recovered"

1920+ =/ branch=spec [%bccl ~[p.leaf [%base [%atom %t]]]]

1921+ ?^ (tagged-cases ~[branch branch] ~) "duplicate tags accepted"

1922+ =/ broken=(unit *) (source-gist-tail [%dbug location 42])

1923+ ?~ broken "debug wrapper missing"

1924+ =/ invalid=(each spec tang) (mule |.(;;(spec u.broken)))

1925+ ?: ?=(%& -.invalid) "malformed spec accepted"

1926+ "valid wrapper; duplicate and malformed rejected"

1927+::

1928+:: The same named-operand call with Clay-style source-location wrappers.

1929+++ debug-mop-fixture

1930+ |= cor=type

1931+ ^- tape

1932+ =/ typ=type (~(play ut cor) (ream '*mop-wing-valid'))

1933+ ?> ?=([%hold *] typ)

1934+ =/ original=hoon q.typ

1935+ ?> ?=([%tsls [%note * *] *] original)

1936+ =/ body=hoon q.p.original

1937+ ?> ?=([%cncl *] body)

1938+ ?> ?=([%tsgr *] p.body)

1939+ =/ b=hoon q.p.body

1940+ ?> ?=([%cncl *] b)

1941+ =/ call=hoon p.b

1942+ ?> ?=([%cncl *] call)

1943+ ?> ?=([* [* ~]] q.call)

1944+ =/ at=spot [/tests/importer/synthetic/hoon [[1 1] [1 2]]]

1945+ =/ inner=hoon call(p [%dbug at p.call], q ~[[%dbug at i.q.call] [%dbug at i.t.q.call]])

1946+ =/ outer=hoon body(p p.body(q b(p [%dbug at inner])))

1947+ =/ mixed=hoon body(p p.body(q b(p inner)))

1948+ =/ multi=hoon body(p p.body(q b(p call(p [%dbug at [%wing ~[%one %two]]]))))

1949+ =/ plain=(unit [key=spec value=spec]) (mop-specs body)

1950+ ?~ plain "unwrapped mop not recognized"

1951+ ?. =((mop-specs [%dbug at outer]) plain) "wrapped mop not recognized"

1952+ ?. =((mop-specs mixed) plain) "mixed mop not recognized"

1953+ ?^ (mop-specs multi) "multi-segment callee accepted"

1954+ ?^ (mop-specs [%dbug at [%sand %ud 42]]) "malformed call accepted"

1955+ ?^ (source-single-wing [%dbug at 42]) "malformed wing accepted"

1956+ ?^ (source-single-wing [%dbug at [%wing ~[%one %two]]]) "multi-segment operand accepted"

1957+ =/ four=* [%dbug at [%dbug at [%dbug at [%dbug at [%wing ~[%mop]]]]]]

1958+ =/ five=* [%dbug at four]

1959+ ?~ (source-single-wing four) "four wrappers rejected"

1960+ ?^ (source-single-wing five) "wrapper limit exceeded"

1961+ ?~ (source-note-unwrap four 4) "four note wrappers rejected"

1962+ ?^ (source-note-unwrap five 4) "note wrapper limit exceeded"

1963+ =/ selected=(unit hoon) (local-arm-source cor %tag-valid)

1964+ ?~ selected "selected union not found"

1965+ =/ arm-four=hoon [%dbug at [%dbug at [%dbug at [%dbug at u.selected]]]]

1966+ =/ arm-five=hoon [%dbug at arm-four]

1967+ ?~ (tagged-source-code arm-four %tag-valid) "four wrapped selected arms rejected"

1968+ ?^ (tagged-source-code arm-five %tag-valid) "selected arm wrapper limit exceeded"

1969+ "wrapped and mixed calls accepted; malformed, multi-segment and excessive wrappers rejected"

1970+::

1971+:: Synthetic nodes test each part of the direct collection-call proof.

1972+++ collection-wrapper-fixture

1973+ ^- tape

1974+ =/ call=hoon [%cncl [%tsgr [%wing ~[[%.y 7]]] [%cncl [%wing ~[%list]] ~]] ~[[%$ 6]]]

1975+ =/ subject=hoon [%cncl [%tsgr [%wing ~[[%.y 8]]] [%cncl [%wing ~[%list]] ~]] ~[[%$ 6]]]

1976+ =/ sample=hoon [%cncl [%tsgr [%wing ~[[%.y 7]]] [%cncl [%wing ~[%list]] ~]] ~[[%$ 2]]]

1977+ =/ good=hoon [%tsls [%note [%made %x ~] call] [%tsls [%dtts [%$ 14] [%$ 2]] [%$ 6]]]

1978+ =/ tail=hoon [%tsls [%note [%made %x ~] call] [%$ 6]]

1979+ =/ args=(list [hoon hoon]) ~[[call good] [subject good] [sample good] [call tail]]

1980+ =/ flags=(list ?) (turn args |=(pair=[hoon hoon] (direct-collection-source -.pair +.pair)))

1981+ ?: =(flags ~[& | | |]) "valid; forged subject, sample and tail rejected"

1982+ "wrapper guard failed"

1983+::

1984+++ overlap-fork-fixture

1985+ ^- type

1986+ =/ nodes=(list type) ~[[%atom %ud ~] [%atom %t ~]]

1987+ [%fork (silt nodes)]

1988+::

1989+++ invalid-fork-fixture

1990+ ^- type

1991+ =/ nodes=(list type) ~[[%atom %ud ~] [%atom %sd ~]]

1992+ [%fork (silt nodes)]

1993+::

858++ fixture-output

1994++ fixture-output

859− |= [small=@t epic=@t presence=@t docs=@t shadow=@t shadow-static=@t ford=@t mark=@t mark-rec=@t mark-gate=@t mark-basic=@t]

1995+ |= [small=@t epic=@t presence=@t docs=@t shadow=@t shadow-static=@t ford=@t mark=@t mark-rec=@t mark-gate=@t mark-basic=@t origin-trans=@t origin-first=@t origin-other=@t]

860 ^- wain

1996 ^- wain

861 =/ sc=type -:(ride -:!>(..zuse) small)

1997 =/ sc=type -:(ride -:!>(..zuse) small)

862 =/ ec=type -:(ride -:!>(..zuse) epic)

1998 =/ ec=type -:(ride -:!>(..zuse) epic)

@@ -865,6 +2001,7 @@

865 =/ hc=type -:(ride -:!>(..zuse) shadow)

2001 =/ hc=type -:(ride -:!>(..zuse) shadow)

866 =/ xc=type -:(ride -:!>(..zuse) shadow-static)

2002 =/ xc=type -:(ride -:!>(..zuse) shadow-static)

867 =/ fp=type [%cell [%face %small sc] -:!>(..zuse)]

2003 =/ fp=type [%cell [%face %small sc] -:!>(..zuse)]

2004+ =/ other=type -:(ride -:!>(..zuse) origin-other)

868 =/ fc=type -:(ride fp ford)

2005 =/ fc=type -:(ride fp ford)

869 ?> ?=([%core *] fc)

2006 ?> ?=([%core *] fc)

870 =/ only-list=@t '|%\0a+$ lists (list @ud)\0a--\0a'

2007 =/ only-list=@t '|%\0a+$ lists (list @ud)\0a--\0a'

@@ -876,9 +2013,57 @@

876 =/ mark-rec-core=type -:(ride fp mark-rec)

2013 =/ mark-rec-core=type -:(ride fp mark-rec)

877 =/ mark-gate-core=type -:(ride -:!>(..zuse) mark-gate)

2014 =/ mark-gate-core=type -:(ride -:!>(..zuse) mark-gate)

878 =/ mark-basic-core=type -:(ride -:!>(..zuse) mark-basic)

2015 =/ mark-basic-core=type -:(ride -:!>(..zuse) mark-basic)

2016+ =/ make-mark

2017+ |= [field=@t scope=type]

2018+ ^- type

2019+ -:(ride scope (crip "|_ a={(trip field)}\0a++ grab |% ++ noun a --\0a++ grow |% ++ noun a --\0a++ grad %noun\0a--\0a"))

2020+ =/ mark-union-core=type (make-mark 'mark-flag-valid:small' fp)

2021+ =/ mark-overlap-core=type (make-mark 'mark-flag-overlap:small' fp)

2022+ =/ mark-hidden-core=type (make-mark 'mark-flag-hidden:small' fp)

2023+ =/ mark-signed-core=type (make-mark 'signed:small' fp)

2024+ =/ mark-callable-core=type (make-mark 'gate-test:small' fp)

2025+ =/ extra-subject=type [%cell [%face %other other] fp]

2026+ =/ mark-extra-core=type (make-mark 'mark-flag-valid:small' extra-subject)

2027+ =/ other-hold=type (~(play ut other) (ream '*chain'))

2028+ =/ recursive-hold=type (~(play ut sc) (ream '*chain'))

2029+ =/ fake-vase=type -:(ride -:!>(..zuse) '|%\0a+$ vase @ud\0a--\0a')

2030+ =/ spoof=(unit import-diagnostic)

2031+ (first-invalid [%bad 'signed and float auras cannot be imported'])

2032+ ?> ?=(^ spoof)

879 =/ mark-shadow-core=type -:(ride sp mark-basic)

2033 =/ mark-shadow-core=type -:(ride sp mark-basic)

880 =/ tshp=type [%cell [%face %intermediate shc] -:!>(..zuse)]

2034 =/ tshp=type [%cell [%face %intermediate shc] -:!>(..zuse)]

881 =/ tshc=type -:(ride tshp only-list)

2035 =/ tshc=type -:(ride tshp only-list)

2036+ =/ trans=type -:(ride tp origin-trans)

2037+ =/ ambiguous-parent=type [%cell [%face %first sc] [%cell [%face %second sc] -:!>(..zuse)]]

2038+ =/ ambiguous=type -:(ride ambiguous-parent origin-first)

2039+ =/ distinct-parent=type [%cell [%face %first sc] [%cell [%face %second other] -:!>(..zuse)]]

2040+ =/ distinct=type -:(ride distinct-parent origin-first)

2041+ =/ trans-amb-parent=type [%cell [%face %intermediate fc] [%cell [%face %second sc] -:!>(..zuse)]]

2042+ =/ trans-amb=type -:(ride trans-amb-parent origin-trans)

2043+ =/ tag-child=@t

2044+ '|%\0a+$ tag-invalid-cell @t\0a+$ choice $%([%ok a=tag-invalid-cell] [%err a=@ud])\0a--\0a'

2045+ =/ tag-collision=type -:(ride [%cell [%face %base sc] -:!>(..zuse)] tag-child)

2046+ =/ tag-clean=type -:(ride [%cell [%face %base other] -:!>(..zuse)] tag-child)

2047+ =/ tag-zuse=@t

2048+ '|%\0a+$ ship @t\0a+$ path @ud\0a+$ choice $%([%ok who=ship] [%err where=path])\0a--\0a'

2049+ =/ tag-zuse-core=type -:(ride -:!>(..zuse) tag-zuse)

2050+ =/ nest-parent-src=@t

2051+ '|%\0a+$ tag-nest-inner $%([%foreign @t] [%foreign @t])\0a--\0a'

2052+ =/ nest-parent=type -:(ride -:!>(..zuse) nest-parent-src)

2053+ =/ nest-child-src=@t

2054+ '|%\0a+$ tag-nest-inner $%([%left @t] [%right @ud])\0a+$ tag-nest-middle $%([%one x=tag-nest-inner] [%two ~])\0a--\0a'

2055+ =/ nest-collision=type -:(ride [%cell [%face %base nest-parent] -:!>(..zuse)] nest-child-src)

2056+ =/ self-parent=type

2057+ -:(ride -:!>(..zuse) '|%\0a+$ tag-self ?(%same %same)\0a--\0a')

2058+ =/ self-child=@t

2059+ '|%\0a+$ tag-self $%([%branch children=(list tag-self)] [%leaf value=@t])\0a--\0a'

2060+ =/ self-collision=type -:(ride [%cell [%face %tag-self self-parent] -:!>(..zuse)] self-child)

2061+ =/ self-other=type

2062+ -:(ride -:!>(..zuse) '|%\0a+$ tag-self $%([%branch children=(list tag-self)] [%leaf value=@ud])\0a--\0a')

2063+ =/ mop-ford-parent=type

2064+ -:(ride -:!>(..zuse) '|%\0a+$ value ?(%same %same)\0a--\0a')

2065+ =/ mop-ford-child=type

2066+ -:(ride [%cell [%face %value mop-ford-parent] -:!>(..zuse)] '|%\0a+$ key @ud\0a+$ value @t\0a+$ mm ((mop key value) lte)\0a--\0a')

882 =/ sample

2067 =/ sample

883 |= name=term

2068 |= name=term

884 (read-mold-in %small name (~(play ut sc) (ream (cat 3 '*' name))) sc)

2069 (read-mold-in %small name (~(play ut sc) (ream (cat 3 '*' name))) sc)

@@ -916,6 +2101,15 @@

916 (crip "nested-static-mop: {(show-result (sample %nested-static-mop))}")

2101 (crip "nested-static-mop: {(show-result (sample %nested-static-mop))}")

917 (crip "collection-siblings: {(show-result (sample %collection-siblings))}")

2102 (crip "collection-siblings: {(show-result (sample %collection-siblings))}")

918 (crip "dynamic-sibling-mop: {(show-result (sample %dynamic-sibling-mop))}")

2103 (crip "dynamic-sibling-mop: {(show-result (sample %dynamic-sibling-mop))}")

2104+ (crip "mark-flag-source: {(show-result (read-named %small %mark-flag-valid sc))}")

2105+ (crip "mark-flag-union: {(show-result (read-mark %flag-union mark-union-core))}")

2106+ (crip "mark-flag-overlap: {(show-result (read-mark %flag-overlap mark-overlap-core))}")

2107+ (crip "mark-flag-hidden: {(show-result (read-mark %flag-hidden mark-hidden-core))}")

2108+ (crip "mark-flag-signed: {(show-result (read-mark %flag-signed mark-signed-core))}")

2109+ (crip "mark-flag-callable: {(show-result (read-mark %flag-callable mark-callable-core))}")

2110+ (crip "mark-flag-extra: {(show-result (read-mark %flag-extra mark-extra-core))}")

2111+ (crip "mark-flag-other-hold: {?~((mark-union-fallback other-hold fp) "unsupported" "BAD")}")

2112+ (crip "mark-flag-recursive-fallback: {?~((mark-union-fallback recursive-hold fp) "unsupported" "BAD")}")

919 (crip "mark-record: {(show-result (read-mark %todo-item mark-core))}")

2113 (crip "mark-record: {(show-result (read-mark %todo-item mark-core))}")

920 (crip "mark-recursive: {(show-result (read-mark %recursive mark-rec-core))}")

2114 (crip "mark-recursive: {(show-result (read-mark %recursive mark-rec-core))}")

921 (crip "mark-gate: {(show-result (read-mark %bad mark-gate-core))}")

2115 (crip "mark-gate: {(show-result (read-mark %bad mark-gate-core))}")

@@ -926,6 +2120,11 @@

926 (crip "ford-imported: {(show-result (read-mold-in %ford %wrapped (~(play ut fc) (ream '*wrapped')) fc))}")

2120 (crip "ford-imported: {(show-result (read-mold-in %ford %wrapped (~(play ut fc) (ream '*wrapped')) fc))}")

927 (crip "ford-recursive: {(show-result (read-mold-in %ford %recursive (~(play ut fc) (ream '*recursive')) fc))}")

2121 (crip "ford-recursive: {(show-result (read-mold-in %ford %recursive (~(play ut fc) (ream '*recursive')) fc))}")

928 (crip "ford-local-recursive: {(show-result (read-mold-in %ford %local (~(play ut fc) (ream '*local')) fc))}")

2122 (crip "ford-local-recursive: {(show-result (read-mold-in %ford %local (~(play ut fc) (ream '*local')) fc))}")

2123+ (crip "ford-recursive-transitive: {(show-result (read-named %outer %wrapped trans))}")

2124+ (crip "ford-recursive-ambiguous: {(show-result (read-named %outer %pick-one ambiguous))}")

2125+ (crip "ford-recursive-transitive-ambiguous: {(show-result (read-named %outer %wrapped trans-amb))}")

2126+ (crip "ford-recursive-distinct-first: {(show-result (read-named %outer %pick-one distinct))}")

2127+ (crip "ford-recursive-distinct-second: {(show-result (read-named %outer %pick-two distinct))}")

929 (crip "ford-transitive: {(show-result (read-mold-in %ford %lists (~(play ut tc) (ream '*lists')) tc))}")

2128 (crip "ford-transitive: {(show-result (read-mold-in %ford %lists (~(play ut tc) (ream '*lists')) tc))}")

930 (crip "ford-shadow: {(show-result (read-mold-in %ford %lists (~(play ut shc) (ream '*lists')) shc))}")

2129 (crip "ford-shadow: {(show-result (read-mold-in %ford %lists (~(play ut shc) (ream '*lists')) shc))}")

931 (crip "ford-transitive-shadow: {(show-result (read-mold-in %ford %lists (~(play ut tshc) (ream '*lists')) tshc))}")

2130 (crip "ford-transitive-shadow: {(show-result (read-mold-in %ford %lists (~(play ut tshc) (ream '*lists')) tshc))}")

@@ -935,12 +2134,83 @@

935 (crip "shadow-list-mop: {(show-result (read-mold-in %shadow-static %bad (~(play ut xc) (ream '*bad')) xc))}")

2134 (crip "shadow-list-mop: {(show-result (read-mold-in %shadow-static %bad (~(play ut xc) (ream '*bad')) xc))}")

936 (crip "named-mop: {(show-result (sample %named-mop))}")

2135 (crip "named-mop: {(show-result (sample %named-mop))}")

937 (crip "mop-list: {(show-result (sample %mop-list))}")

2136 (crip "mop-list: {(show-result (sample %mop-list))}")

2137+ (crip "mop-wing-valid: {(show-result (sample %mop-wing-valid))}")

2138+ (crip "mop-wing-invalid-key: {(show-result (sample %mop-wing-invalid-key))}")

2139+ (crip "mop-wing-invalid-key-alias: {(show-result (sample %mop-wing-invalid-key-alias))}")

2140+ (crip "mop-wing-invalid-value: {(show-result (sample %mop-wing-invalid-value))}")

2141+ (crip "mop-wing-invalid-value-alias: {(show-result (sample %mop-wing-invalid-value-alias))}")

2142+ (crip "mop-wing-rec-key: {(show-result (sample %mop-wing-rec-key))}")

2143+ (crip "mop-wing-rec-value: {(show-result (sample %mop-wing-rec-value))}")

2144+ (crip "mop-wing-shadow: {(show-result (read-named %shadow %mmw hc))}")

2145+ (crip "mop-wing-ford-collision: {(show-result (read-named %child %mm mop-ford-child))}")

2146+ (crip "mop-wing-debug: {(debug-mop-fixture sc)}")

938 (crip "signed: {(show-result (sample %signed))}")

2147 (crip "signed: {(show-result (sample %signed))}")

939 (crip "float: {(show-result (sample %float))}")

2148 (crip "float: {(show-result (sample %float))}")

940 (crip "gate: {(show-result (sample %gate-test))}")

2149 (crip "gate: {(show-result (sample %gate-test))}")

941 (crip "vase: {(show-result vase)}")

2150 (crip "vase: {(show-result vase)}")

942 (crip "failed-branch: {(show-result (read-mold %external %bad bad-branch-fixture))}")

2151 (crip "failed-branch: {(show-result (read-mold %external %bad bad-branch-fixture))}")

2152+ (crip "debug-spec: {debug-spec-fixture}")

2153+ (crip "debug-union: {(show-result (debug-union-fixture sc %action))}")

2154+ (crip "debug-union-overlap: {(show-result (debug-union-fixture sc %explicit-wut-overlap))}")

2155+ (crip "debug-nested-cell: {(show-result (debug-union-fixture sc %nested-valid-cell))}")

2156+ (crip "debug-nested-cell-overlap: {(show-result (debug-union-fixture sc %nested-invalid-cell))}")

2157+ (crip "explicit-graph: {(show-result (read-mold %raw %raw overlap-fork-fixture))}")

2158+ (crip "explicit-graph-unsupported: {(show-result (read-mold %raw %raw invalid-fork-fixture))}")

2159+ (crip "explicit-wut-safe: {(show-result (sample %explicit-wut-safe))}")

2160+ (crip "explicit-percent-overlap: {(show-result (sample %explicit-percent-overlap))}")

2161+ (crip "explicit-wut-overlap: {(show-result (sample %explicit-wut-overlap))}")

2162+ (crip "explicit-collapsed: {(show-result (sample %explicit-collapsed))}")

2163+ (crip "explicit-subsumed: {(show-result (sample %explicit-subsumed))}")

2164+ (crip "explicit-three: {(show-result (sample %explicit-three))}")

2165+ (crip "explicit-unknown: {(show-result (sample %explicit-unknown))}")

2166+ (crip "explicit-nested: {(show-result (sample %explicit-nested))}")

2167+ (crip "collection-union-wrapper: {collection-wrapper-fixture}")

2168+ (crip "collection-union-list: {(show-result (sample %collection-union-list))}")

2169+ (crip "collection-union-set: {(show-result (sample %collection-union-set))}")

2170+ (crip "collection-union-map-key: {(show-result (sample %collection-union-map-key))}")

2171+ (crip "collection-union-map-value: {(show-result (sample %collection-union-map-value))}")

2172+ (crip "collection-union-unit: {(show-result (sample %collection-union-unit))}")

2173+ (crip "collection-union-collapsed: {(show-result (sample %collection-union-collapsed))}")

2174+ (crip "collection-union-multiple: {(show-result (sample %collection-union-multiple))}")

2175+ (crip "collection-union-nested: {(show-result (sample %collection-union-nested))}")

2176+ (crip "collection-union-dependent: {(show-result (sample %collection-union-dependent))}")

2177+ (crip "collection-union-shadow: {(show-result (read-named %shadow %collection-union-shadow xc))}")

2178+ (crip "explicit-list: {(show-result (sample %explicit-list))}")

2179+ (crip "explicit-set: {(show-result (sample %explicit-set))}")

2180+ (crip "explicit-faces: {(show-result (sample %explicit-faces))}")

2181+ (crip "explicit-alias: {(show-result (sample %explicit-alias))}")

2182+ (crip "explicit-ford: {(show-result (read-named %outer %bad-union trans))}")

2183+ (crip "explicit-shadow-path: {(show-result (read-named %shadow %path-shadow xc))}")

2184+ (crip "list-bckt-field: {(show-result (sample %list-bckt-field))}")

2185+ (crip "list-noun-overlap: {(show-result (sample %list-noun-overlap))}")

2186+ (crip "list-null-overlap: {(show-result (sample %list-null-overlap))}")

2187+ (crip "list-nested-atom-cell: {(show-result (sample %list-nested-atom-cell))}")

2188+ (crip "list-nested-valid-cell: {(show-result (sample %list-nested-valid-cell))}")

2189+ (crip "list-nested-invalid-cell: {(show-result (sample %list-nested-invalid-cell))}")

2190+ (crip "map-nested-invalid-cell: {(show-result (sample %map-nested-invalid-cell))}")

2191+ (crip "set-direct-invalid-cell: {(show-result (sample %set-direct-invalid-cell))}")

2192+ (crip "map-key-invalid-cell: {(show-result (sample %map-key-invalid-cell))}")

943 (crip "nested-atom-cell: {(show-result (sample %nested-atom-cell))}")

2193 (crip "nested-atom-cell: {(show-result (sample %nested-atom-cell))}")

2194+ (crip "nested-tags: {(show-result (sample %nested-tags))}")

2195+ (crip "nested-tags-overlap: {(show-result (sample %nested-tags-overlap))}")

2196+ (crip "nested-tagged: {(show-result (sample %nested-tagged))}")

2197+ (crip "nested-tagged-bckt: {(show-result (sample %nested-tagged-bckt))}")

2198+ (crip "nested-tagged-overlap: {(show-result (sample %nested-tagged-overlap))}")

2199+ (crip "nested-tagged-alias: {(show-result (sample %nested-tagged-alias))}")

2200+ (crip "nested-tagged-ford: {(show-result (read-named %outer %tagged trans))}")

2201+ (crip "tag-static-valid: {?:((fixed-cell-mold [%wtgr [%dtts [%$ 13] [%rock %$ %foo]] [%rock %tas %foo]] 13) "yes" "no")}")

2202+ (crip "tag-static-wrong-axis: {?:((fixed-cell-mold [%wtgr [%dtts [%$ 12] [%rock %$ %foo]] [%rock %tas %foo]] 13) "wrong" "no")}")

2203+ (crip "tag-static-nonconstant: {?:((fixed-cell-mold [%wtgr [%dtts [%$ 13] [%rock %$ %foo]] [%$ 13]] 13) "wrong" "no")}")

2204+ (crip "tag-static-wrong-value: {?:((fixed-cell-mold [%wtgr [%dtts [%$ 13] [%rock %$ %foo]] [%rock %tas %bar]] 13) "wrong" "no")}")

2205+ (crip "nested-first-cell: {(show-result (sample %nested-first-cell))}")

2206+ (crip "nested-alias-cell: {(show-result (sample %nested-alias-cell))}")

2207+ (crip "nested-multiple-cell: {(show-result (sample %nested-multiple-cell))}")

2208+ (crip "nested-named-sibling: {(show-result (sample %nested-named-sibling))}")

2209+ (crip "nested-list-sibling: {(show-result (sample %nested-list-sibling))}")

2210+ (crip "nested-validated-sibling: {(show-result (sample %nested-validated-sibling))}")

2211+ (crip "nested-validated-branch: {(show-result (sample %nested-validated-branch))}")

2212+ (crip "nested-named-branch: {(show-result (sample %nested-named-branch))}")

2213+ (crip "nested-ford-cell: {(show-result (read-named %outer %nested trans))}")

944 (crip "nested-valid-cell: {(show-result (sample %nested-valid-cell))}")

2214 (crip "nested-valid-cell: {(show-result (sample %nested-valid-cell))}")

945 (crip "nested-invalid-cell: {(show-result (sample %nested-invalid-cell))}")

2215 (crip "nested-invalid-cell: {(show-result (sample %nested-invalid-cell))}")

946 (crip "valid-cell: {(show-result (sample %valid-cell))}")

2216 (crip "valid-cell: {(show-result (sample %valid-cell))}")

@@ -955,9 +2225,77 @@

955 (crip "shadow-mop: {(show-result (shad %mm))}")

2225 (crip "shadow-mop: {(show-result (shad %mm))}")

956 (crip "shadow-jar: {(show-result (shad %aa))}")

2226 (crip "shadow-jar: {(show-result (shad %aa))}")

957 (crip "shadow-jug: {(show-result (shad %bb))}")

2227 (crip "shadow-jug: {(show-result (shad %bb))}")

2228+ (crip "no-provenance-atom: {(show-result (read-mold %small %word (~(play ut sc) (ream '*word'))))}")

2229+ (crip "no-provenance-recursive: {(show-result (read-mold %wrong %alias (~(play ut sc) (ream '*chain'))))}")

958 (crip "no-provenance: {(show-result (read-mold %small %jar-test (~(play ut sc) (ream '*jar-test'))))}")

2230 (crip "no-provenance: {(show-result (read-mold %small %jar-test (~(play ut sc) (ream '*jar-test'))))}")

2231+ (crip "named-not-mold: {(show-result (read-named %small %not-mold sc))}")

2232+ (crip "named-present: {(show-result (read-named %small %items sc))}")

2233+ (crip "named-missing: {(show-result (read-named %small %missing sc))}")

2234+ (crip "named-invalid-core: {(show-result (read-named %small %items [%atom %ud ~]))}")

2235+ (crip "named-ford-recursive: {(show-result (read-named %ford %recursive fc))}")

2236+ (crip "diagnostic-items: {(show-import-diagnostic (read-named-diagnostic %small %items sc))}")

2237+ (crip "diagnostic-signed: {(show-import-diagnostic (read-named-diagnostic %small %signed sc))}")

2238+ (crip "diagnostic-float: {(show-import-diagnostic (read-named-diagnostic %small %float sc))}")

2239+ (crip "diagnostic-overlap: {(show-import-diagnostic (read-named-diagnostic %small %explicit-percent-overlap sc))}")

2240+ (crip "diagnostic-unproved: {(show-import-diagnostic (read-named-diagnostic %small %list-nested-invalid-cell sc))}")

2241+ (crip "diagnostic-mark-gate: {(show-import-diagnostic (read-mark-diagnostic %bad mark-gate-core))}")

2242+ (crip "diagnostic-shadow-vase: {(show-import-diagnostic (read-named-diagnostic %fake %vase fake-vase))}")

2243+ (crip "diagnostic-spoof: {(show-import-diagnostic u.spoof)}")

2244+ (crip "missing-arm: {(show-result (read-mold-in %small %missing [%atom %ud ~] sc))}")

959 (crip "wrong-provenance: {(show-result (read-mold-in %small %action (~(play ut sc) (ream '*items')) sc))}")

2245 (crip "wrong-provenance: {(show-result (read-mold-in %small %action (~(play ut sc) (ream '*items')) sc))}")

960 (crip "unverified-subject: {(show-result (read-mold-in %std %jar (~(play ut -:!>(..zuse)) (ream '*(jar @ud @t)')) -:!>(..zuse)))}")

2246 (crip "unverified-subject: {(show-result (read-mold-in %std %jar (~(play ut -:!>(..zuse)) (ream '*(jar @ud @t)')) -:!>(..zuse)))}")

2247+ (crip "tag-ford-collision: {(show-result (read-named %child %choice tag-collision))}")

2248+ (crip "tag-ford-clean: {(show-result (read-named %child %choice tag-clean))}")

2249+ (crip "tag-zuse-local: {(show-result (read-named %child %choice tag-zuse-core))}")

2250+ (crip "tag-nest-inner: {(show-result (sample %tag-nest-inner))}")

2251+ (crip "tag-nest-middle: {(show-result (sample %tag-nest-middle))}")

2252+ (crip "tag-nest-diamond: {(show-result (sample %tag-nest-diamond))}")

2253+ (crip "tag-nest-deep: {(show-result (sample %tag-nest-deep))}")

2254+ (crip "tag-nest-hidden: {(show-result (sample %tag-nest-hidden))}")

2255+ (crip "tag-nest-overlap: {(show-result (sample %tag-nest-overlap))}")

2256+ (crip "tag-nest-recursive: {(show-result (sample %tag-nest-recursive-outer))}")

2257+ (crip "tag-nest-rec-list: {(show-result (sample %tag-nest-rec-list-outer))}")

2258+ (crip "tag-nest-rec-repeat: {(show-result (sample %tag-nest-rec-repeat))}")

2259+ (crip "tag-nest-rec-duplicate: {(show-result (sample %tag-nest-rec-bad-outer))}")

2260+ (crip "tag-nest-rec-hidden: {(show-result (sample %tag-nest-rec-hidden-outer))}")

2261+ (crip "tag-nest-rec-mutual: {(show-result (sample %tag-nest-rec-mutual-outer))}")

2262+ (crip "tag-nest-rec-outer-overlap: {(show-result (sample %tag-nest-rec-outer-overlap))}")

2263+ (crip "tag-nest-rec-owner: {?:(&((contains-named-ref [%ref %small %tag-self] %small %tag-self) !(contains-named-ref [%named %small %other [%ref %small %tag-self]] %small %tag-self)) "yes" "wrong")}")

2264+ (crip "tag-nest-many: {(show-result (sample %tag-nest-many))}")

2265+ (crip "tag-nest-shadow: {(show-result (read-named %shadow-static %tag-nest-shadow xc))}")

2266+ (crip "tag-nest-wrong-hold: {?~((nested-tagged-union %small (~(play ut other) (ream '*chain')) `sc) "unsupported" "BAD")}")

2267+ (crip "tag-nest-ford-collision: {(show-result (read-named %outer %tag-nest-middle nest-collision))}")

2268+ (crip "tag-self: {(show-result (sample %tag-self))}")

2269+ (crip "tag-self-tail: {(show-result (sample %tag-self-tail))}")

2270+ (crip "tag-self-duplicate: {(show-result (sample %tag-self-duplicate))}")

2271+ (crip "tag-self-hidden: {(show-result (sample %tag-self-hidden))}")

2272+ (crip "tag-self-indirect: {(show-result (sample %tag-self-indirect))}")

2273+ (crip "tag-mutual-a: {(show-result (sample %tag-mutual-a))}")

2274+ (crip "tag-mutual-b: {(show-result (sample %tag-mutual-b))}")

2275+ (crip "tag-self-pair: {(show-result (sample %tag-self-pair))}")

2276+ (crip "tag-self-ford-collision: {(show-result (read-named %child %tag-self self-collision))}")

2277+ (crip "tag-self-wrong-core: {(show-result (read-mold-in %other %tag-self (~(play ut sc) (ream '*tag-self')) self-other))}")

2278+ (crip "tag-flat-large: {?:(&(?=(~ (safe-source-name-mode %tag-fuel-7 sc ~ 256 |)) ?=(^ (safe-source-name-mode %tag-fuel-7 sc ~ 4.096 |)) ?=([%& *] (sample %tag-flat-large))) "supported above 256" "BAD")}")

2279+ (crip "tag-null-good: {(show-result (sample %tag-null-good))}")

2280+ (crip "tag-null-duplicate: {(show-result (sample %tag-null-duplicate))}")

2281+ (crip "tag-null-hidden: {(show-result (sample %tag-null-hidden))}")

2282+ (crip "tag-valid: {(show-result (sample %tag-valid))}")

2283+ (crip "tag-duplicate: {(show-result (sample %tag-duplicate))}")

2284+ (crip "tag-collapsed: {(show-result (sample %tag-collapsed))}")

2285+ (crip "tag-invalid-direct: {(show-result (sample %tag-invalid-direct))}")

2286+ (crip "tag-invalid-alias: {(show-result (sample %tag-invalid-alias))}")

2287+ (crip "tag-invalid-list: {(show-result (sample %tag-invalid-list))}")

2288+ (crip "tag-enum-good: {(show-result (sample %tag-enum-good))}")

2289+ (crip "tag-enum-bad: {(show-result (sample %tag-enum-bad))}")

2290+ (crip "tag-nested-good: {(show-result (sample %tag-nested-good))}")

2291+ (crip "tag-shadow-jar: {(show-result (read-named %shadow-static %tag-shadow-jar xc))}")

2292+ (crip "tag-shadow-jug: {(show-result (read-named %shadow-static %tag-shadow-jug xc))}")

2293+ (crip "tag-fuel-small: {?:(?=(^ (safe-source-name %tag-fuel-2 sc ~ 64)) "yes" "no")}")

2294+ (crip "tag-fuel-large: {?:(?=(~ (safe-source-name %tag-fuel-11 sc ~ 64)) "rejected" "wrong")}")

2295+ (crip "presence-action-1: {(show-result (present %action-1))}")

2296+ (crip "presence-command-1: {(show-result (present %command-1))}")

2297+ (crip "presence-update-1: {(show-result (present %update-1))}")

2298+ (crip "presence-response-1: {(show-result (present %response-1))}")

961 (crip "presence-topic: {(show-result (present %topic))}")

2299 (crip "presence-topic: {(show-result (present %topic))}")

962 (crip "presence-timing: {(show-result (present %timing))}")

2300 (crip "presence-timing: {(show-result (present %timing))}")

963 (crip "presence-places: {(show-result (present %places))}")

2301 (crip "presence-places: {(show-result (present %places))}")

jibb-dev/lib/jibb.hoon+8250−147

@@ -874,7 +874,7 @@

874 %'~[' %'|=(' %'$-(' :: openers

875 %'%/' %'/' :: paths

876 %'+' %'`' %'=' :: pair, unit, face

877− %'*' %'?' :: noun, loobean mold

877+ %'*' %'?' %'_' :: noun, loobean, type hole

878 %'++' %'+$' %'|=' %'|$' :: runes

879 %'^-' %'~&' %'?-' %'!!' :: runes

880 %'/-' %'/%' %'/=' :: imports

@@ -1016,6 +1016,7 @@

1016 [%const at=span =lit] :: ~ %add %.y

1017 [%ref at=span names=(list term)] :: state item.todo

1018 [%tvar at=span name=@t] :: M

1019+ [%hole at=span ~] :: _

1019 [%path at=span segs=(list pseg)] :: / /todos /todo/[id=@ud]

1020 [%path at=span segs=(list pseg)] :: / /todos /todo/[id=@ud]

1020 [%apply at=span ref=(list term) args=(list shape)] :: (list @t)

1021 [%apply at=span ref=(list term) args=(list shape)] :: (list @t)

1021 [%cell at=span fields=(list field)] :: [text=@t done=?]

1022 [%cell at=span fields=(list field)] :: [text=@t done=?]

@@ -1024,9 +1025,9 @@

1024 [%generic at=span vars=(list @t) body=shape] :: +$ name |$ [M] …

1025 [%generic at=span vars=(list @t) body=shape] :: +$ name |$ [M] …

1025 ==

1026 ==

1026::

1027::

1027−:: +pseg: a path mold's segment, a knot or [name=aura]

1028+:: +pseg: a path mold's segment, a knot, [name=aura], or [name=_]

1028::

1029::

1029−+$ pseg $%([%knot p=@ta] [%typed at=span name=term aura=@ta])

1030++$ pseg $%([%knot p=@ta] [%typed at=span name=term aura=@ta] [%inferred at=span name=term hole-at=span])

1030::

1031::

1031+| %api

1032+| %api

1032::

1033::

@@ -1295,6 +1296,7 @@

1295 (emit 1 %'=')

1296 (emit 1 %'=')

1296 ?: =('`' a) (emit 1 %'`')

1297 ?: =('`' a) (emit 1 %'`')

1297 ?: =('*' a) (emit 1 %'*')

1298 ?: =('*' a) (emit 1 %'*')

1299+ ?: =('_' a) (emit 1 %'_')

1298 ?: =('~' a)

1300 ?: =('~' a)

1299 ?: =('[' b) (emit 2 %'~[')

1301 ?: =('[' b) (emit 2 %'~[')

1300 ?: =('&' b) (emit 2 %'~&')

1302 ?: =('&' b) (emit 2 %'~&')

@@ -1670,14 +1672,14 @@

1670:: What may begin each place the parser reads (section 3, Errors):

1672:: What may begin each place the parser reads (section 3, Errors):

1671:: an expression a-z 0-9 " ( [ ~ % / ` | ^ ? !

1673:: an expression a-z 0-9 " ( [ ~ % / ` | ^ ? !

1672:: an operand a-z 0-9 " ( [ ~ % / ` | !

1674:: an operand a-z 0-9 " ( [ ~ % / ` | !

1673−:: a mold a-z A-Z @ * ! ? ~ % / ( [ $

1675+:: a mold a-z A-Z @ * ! ? ~ % / ( [ $ _

1674:: a pattern a-z 0-9 " ~ % * [

1676:: a pattern a-z 0-9 " ~ % * [

1675:: and what may go tight after an operand: . ( + = after a name, a

1677:: and what may go tight after an operand: . ( + = after a name, a

1676:: closer ) ] }, or the : of a comment

1678:: closer ) ] }, or the : of a comment

1677::

1679::

1678++ expr-mask 0x57ff.ffff.4800.0000.83ff.8126.0000.0000

1680++ expr-mask 0x57ff.ffff.4800.0000.83ff.8126.0000.0000

1679++ operand-mask 0x57ff.ffff.0800.0000.03ff.8126.0000.0000

1681++ operand-mask 0x57ff.ffff.0800.0000.03ff.8126.0000.0000

1680−++ mold-mask 0x47ff.fffe.0fff.ffff.8000.8532.0000.0000

1682+++ mold-mask 0x47ff.fffe.8fff.ffff.8000.8532.0000.0000

1681++ bar-mask 0x1000.0000.0000.0000.0000.0000.0000.0000

1683++ bar-mask 0x1000.0000.0000.0000.0000.0000.0000.0000

1682++ pattern-mask 0x47ff.fffe.0800.0000.03ff.0424.0000.0000

1684++ pattern-mask 0x47ff.fffe.0800.0000.03ff.0424.0000.0000

1683++ after-mask 0x2000.0000.2000.0000.2400.4b00.0000.0000

1685++ after-mask 0x2000.0000.2000.0000.2400.4b00.0000.0000

@@ -2107,6 +2109,7 @@

2107 ?- -.s

2109 ?- -.s

2108 %knot (weld "/" (trip p.s))

2110 %knot (weld "/" (trip p.s))

2109 %typed "/[{(trip name.s)}=@{(trip aura.s)}]"

2111 %typed "/[{(trip name.s)}=@{(trip aura.s)}]"

2112+ %inferred "/[{(trip name.s)}=_]"

2110 ==

2113 ==

2111::

2114::

2112++ show-tvars

2115++ show-tvars

@@ -2318,6 +2321,7 @@

2318 %const (nod "const" at.s (show-lit lit.s) ~)

2321 %const (nod "const" at.s (show-lit lit.s) ~)

2319 %ref (nod "ref" at.s (show-names names.s) ~)

2322 %ref (nod "ref" at.s (show-names names.s) ~)

2320 %tvar (nod "tvar" at.s (trip name.s) ~)

2323 %tvar (nod "tvar" at.s (trip name.s) ~)

2324+ %hole (nod "hole" at.s "" ~)

2321 %path (nod "path" at.s (show-psegs segs.s) ~)

2325 %path (nod "path" at.s (show-psegs segs.s) ~)

2322 %apply (nod "apply" at.s (show-names ref.s) (turn args.s sexp-shape))

2326 %apply (nod "apply" at.s (show-names ref.s) (turn args.s sexp-shape))

2323 %cell (nod "cell" at.s "" (turn fields.s sexp-field))

2327 %cell (nod "cell" at.s "" (turn fields.s sexp-field))

@@ -3842,6 +3846,7 @@

3842 %'*' [%& [%noun at.t ~] t.ts]

3846 %'*' [%& [%noun at.t ~] t.ts]

3843 %'!!' [%& [%void at.t ~] t.ts]

3847 %'!!' [%& [%void at.t ~] t.ts]

3844 %'?' [%& [%flag at.t ~] t.ts]

3848 %'?' [%& [%flag at.t ~] t.ts]

3849+ %'_' [%& [%hole at.t ~] t.ts]

3845 [%name *] [%& [%ref at.t ~[p.lex.t]] t.ts]

3850 [%name *] [%& [%ref at.t ~[p.lex.t]] t.ts]

3846 [%wing *] [%& [%ref at.t p.lex.t] t.ts]

3851 [%wing *] [%& [%ref at.t p.lex.t] t.ts]

3847 [%tvar *] [%& [%tvar at.t p.lex.t] t.ts]

3852 [%tvar *] [%& [%tvar at.t p.lex.t] t.ts]

@@ -4058,7 +4063,7 @@

4058 ?: &(?=(^ nex) tight.i.nex) (bad nex "a path segment")

4063 ?: &(?=(^ nex) tight.i.nex) (bad nex "a path segment")

4059 (bad-space i.after nex "a path segment")

4064 (bad-space i.after nex "a path segment")

4060 ::

4065 ::

4061− :: +read-pseg: a path mold's segment, a knot or [name=aura] with no

4066+ :: +read-pseg: a path mold's knot, [name=aura], or [name=_] with no

4062 :: spaces, and where it ends

4067 :: spaces, and where it ends

4063 ::

4068 ::

4064 ++ read-pseg

4069 ++ read-pseg

@@ -4075,13 +4080,16 @@

4075 ?: |(?=(~ r2) !tight.i.r2) (bad-space i.r1 r2 "`=`")

4080 ?: |(?=(~ r2) !tight.i.r2) (bad-space i.r1 r2 "`=`")

4076 ?. ?=([[* * %'='] *] r2) (bad-in r2 "`=`" tis-mask)

4081 ?. ?=([[* * %'='] *] r2) (bad-in r2 "`=`" tis-mask)

4077 =/ r3=(list token) t.r2

4082 =/ r3=(list token) t.r2

4078− ?: |(?=(~ r3) !tight.i.r3) (bad-space i.r2 r3 "an aura")

4083+ ?: |(?=(~ r3) !tight.i.r3) (bad-space i.r2 r3 "an aura or type hole")

4079− ?. ?=([[* * [%aura *]] *] r3) (bad-in r3 "an aura" pat-mask)

4084+ ?. ?=([[* * ?([%aura *] %'_')] *] r3) (bad-in r3 "an aura or type hole" (con pat-mask (bex 95)))

4080 =/ r4=(list token) t.r3

4085 =/ r4=(list token) t.r3

4081 ?: |(?=(~ r4) !tight.i.r4) (bad-space i.r3 r4 "`]`")

4086 ?: |(?=(~ r4) !tight.i.r4) (bad-space i.r3 r4 "`]`")

4082 ?. ?=([[* * %']'] *] r4) (bad-in r4 "`]`" ser-mask)

4087 ?. ?=([[* * %']'] *] r4) (bad-in r4 "`]`" ser-mask)

4083 =/ at=span [beg.at.op end.at.i.r4]

4088 =/ at=span [beg.at.op end.at.i.r4]

4089+ =/ seg=pseg

4090+ ?: ?=(%'_' lex.i.r3) [%inferred at p.lex.i.r1 at.i.r3]

4084− [%& [[%typed at p.lex.i.r1 p.lex.i.r3] end.at.i.r4] t.r4]

4091+ [%typed at p.lex.i.r1 p.lex.i.r3]

4092+ [%& [seg end.at.i.r4] t.r4]

4085 --

4093 --

4086::

4094::

4087+| %span-check

4095+| %span-check

@@ -4465,6 +4473,7 @@

4465 %const [%const at.s ~[%lit] %one ~]

4473 %const [%const at.s ~[%lit] %one ~]

4466 %ref [%ref at.s ~[%name %wing] %one ~]

4474 %ref [%ref at.s ~[%name %wing] %one ~]

4467 %tvar [%tvar at.s ~[%tvar] %one ~]

4475 %tvar [%tvar at.s ~[%tvar] %one ~]

4476+ %hole [%hole at.s ~[%'_'] %one ~]

4468 %apply [%apply at.s ~[%'('] %shut (turn args.s outline-shape)]

4477 %apply [%apply at.s ~[%'('] %shut (turn args.s outline-shape)]

4469 %cell [%cell at.s ~[%'['] %shut (turn fields.s outline-sample)]

4478 %cell [%cell at.s ~[%'['] %shut (turn fields.s outline-sample)]

4470 ::

4479 ::

@@ -4473,8 +4482,11 @@

4473 %+ murn segs.s

4482 %+ murn segs.s

4474 |= g=pseg

4483 |= g=pseg

4475 ^- (unit outline)

4484 ^- (unit outline)

4485+ ?- -.g

4486+ %knot ~

4476− ?. ?=(%typed -.g) ~

4487+ %typed `[%typed at.g ~[%'['] %shut ~]

4477− `[%typed at.g ~[%'['] %shut ~]

4488+ %inferred `[%typed at.g ~[%'['] %shut ~[[%hole hole-at.g ~[%'_'] %one ~]]]

4489+ ==

4478 [%path at.s ~[%'/'] %run ks]

4490 [%path at.s ~[%'/'] %run ks]

4479 ::

4491 ::

4480 %union

4492 %union

@@ -4534,6 +4546,8 @@

4534 [%path [1 9] [1 9] [1 21]]

4546 [%path [1 9] [1 9] [1 21]]

4535 [%face [1 7] [1 7] [1 21]]

4547 [%face [1 7] [1 7] [1 21]]

4536 ==

4548 ==

4549+ :: an inferred path aura's hole spanning its = as well

4550+ ['+$ x /a/[id=_]' ~[[%hole [1 13] [1 12] [1 14]]]]

4537 :: an import's path cut short

4551 :: an import's path cut short

4538 ['/= c /ui/c' ~[[%jibb [1 1] [1 1] [1 11]]]]

4552 ['/= c /ui/c' ~[[%jibb [1 1] [1 1] [1 11]]]]

4539 :: brackets that close with the deeper lines, cut at their line's

4553 :: brackets that close with the deeper lines, cut at their line's

@@ -4593,24 +4607,81 @@

4593:: Atom constraints tied to an explicit capital or an inferred sample

4607:: Atom constraints tied to an explicit capital or an inferred sample

4594:: are generalized and printed. Other aura variables remain unsupported until

4608:: are generalized and printed. Other aura variables remain unsupported until

4595:: their defaulting and inferred generalization are implemented.

4609:: their defaulting and inferred generalization are implemented.

4610+:: Restricted-number promotion considers written capitals only; if there

4611+:: are none, it skips the otherwise unnecessary environment traversal.

4596:: Bare @ is a separate unrestricted atom type. A directional fit check

4612:: Bare @ is a separate unrestricted atom type. A directional fit check

4597:: permits concrete atoms to widen to it, never the reverse. A fit that

4613:: permits concrete atoms to widen to it, never the reverse. A fit that

4598−:: needs a not-yet-implemented constraint remains unsupported. Only

4614+:: needs a not-yet-implemented constraint remains unsupported. Named unions

4599−:: unfaced cells are represented here.

4615+:: retain origin and ordered arguments, including phantom arguments, apart

4616+:: from their display name. Generic cases must be disjoint for all arguments.

4617+:: Unnamed union printing is informational; it is not Jibb syntax.

4618+::

4619+:: `proj` is a reserved, type-directed operation, not an ordinary gate.

4620+:: The supported fragment selects uniquely faced fields from a known record

4621+:: in source order (reordering is a doc question). It records the original

4622+:: call, source and target types, and source axes with its definition;

4623+:: A single selected field keeps its face and uses one source axis.

4624+:: Checked module interfaces retain that evidence and their source, including

4625+:: the private prelude dependency. A later lowerer must replace the call by

4626+:: an inline gate applied to the operand once; no lowering is implemented yet.

4627+:: Ordinary fits never insert a projection. Unknown or variable-origin record

4628+:: spines, nested projected fields and projections in

4629+:: recursive groups remain unsupported. Directional fits bound faced-spine

4630+:: proofs to fewer than 1,024 cells; the projection planner has a separate

4631+:: 4,096-step bound. These are inference limits, not language limits.

4632+::

4633+:: Supported API imports derive request-gate types atomically for multiple

4634+:: paths, including one typed segment or one diff fold per case. Their checked

4635+:: ordinary definitions, mark molds and supported poke constructor are also

4636+:: exported. A selected /sur mold is checked through its trusted reader result;

4637+:: unused cores and other bindings are not independently validated. APIs

4638+:: with /= imports, separate scry paths, multiple parameters or diffs, or a

4639+:: parameter together with a fold remain unsupported. The unchanged todo API

4640+:: fits this fragment, including named closed fold gates.

4641+::

4642+:: Each case's source-derived schema and canonical API identity travel in a

4643+:: dependency closure bound to the exact supplied bundle, prelude, scope and

4644+:: trusted reader results. Unknown cached entries are rebuilt. Request-bearing

4645+:: closures are limited to 256 source paths and requests. This is type

4646+:: inference only: no request lowering, runtime schema validator or proof that

4647+:: an arbitrary ask value is watchable is supplied.

4648+::

4649+:: A closed gate sample may omit one outer face from a known input slot when

4650+:: its product is identical. Distinct written names, nested value faces,

4651+:: ambiguous cell tails and raw-variable-origin fits retain their prior rules.

4652+::

4653+:: In one synthetic eval of a 48-module deep and 48-module wide request-free

4654+:: graph, baseline versus certificate inference took 21.53 s versus 23.10 s

4655+:: elapsed (21.10 s versus 22.34 s CPU), including startup. The deep cache's

4656+:: jam grew from 2,402 to 4,209 bytes (+1,807 bytes). These single-run figures

4657+:: are not production memory or performance benchmarks.

4600::

4658::

4601+$ itype

4659+$ itype

4602 $~ [%var 0]

4660 $~ [%var 0]

4603 $% [%var id=@ud]

4661 $% [%var id=@ud]

4604 [%avar id=@ud]

4662 [%avar id=@ud]

4663+ [%rvar id=@ud]

4605 [%nvar id=@ud]

4664 [%nvar id=@ud]

4665+ [%rnvar id=@ud]

4606 [%atom aura=@ta]

4666 [%atom aura=@ta]

4607 [%any-atom ~]

4667 [%any-atom ~]

4608 [%flag ~]

4668 [%flag ~]

4669+ [%noun ~]

4670+ [%empty ~]

4671+ [%tag id=@ud literal=lit constructor=?]

4672+ [%const literal=lit]

4673+ [%collection name=term args=(list itype)]

4674+ [%recursive module=term name=term label=(unit @t)]

4675+ [%jrec at=path name=term label=(unit @t) head=term aura=@ta tail=term]

4676+ [%grec at=path name=term label=(unit @t) proof=shape args=(list itype)]

4677+ [%union cases=(list itype) origin=(unit [at=path name=term]) label=(unit @t) args=(list itype)]

4678+ [%face name=term body=itype]

4609 [%fn sample=itype product=itype]

4679 [%fn sample=itype product=itype]

4610 [%cell hed=itype tal=itype]

4680 [%cell hed=itype tal=itype]

4611 ==

4681 ==

4612+$ ibinding [id=@ud val=itype]

4682+$ ibinding [id=@ud val=itype]

4613+$ isub (list ibinding)

4683+$ isub (list ibinding)

4684++$ ipending [id=@ud literal=lit]

4614::

4685::

4615++ itype-lookup

4686++ itype-lookup

4616 |= [n=@ud sub=isub]

4687 |= [n=@ud sub=isub]

@@ -4626,16 +4697,116 @@

4626 %var

4697 %var

4627 =/ found=(unit itype) (itype-lookup id.t sub)

4698 =/ found=(unit itype) (itype-lookup id.t sub)

4628 ?~ found t

4699 ?~ found t

4700+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

4629 $(t u.found)

4701 $(t u.found)

4630 %avar

4702 %avar

4631 =/ found=(unit itype) (itype-lookup id.t sub)

4703 =/ found=(unit itype) (itype-lookup id.t sub)

4632 ?~ found t

4704 ?~ found t

4705+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

4706+ $(t u.found)

4707+ %rvar

4708+ =/ found=(unit itype) (itype-lookup id.t sub)

4709+ ?~ found t

4710+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

4633 $(t u.found)

4711 $(t u.found)

4634 %nvar

4712 %nvar

4635 =/ found=(unit itype) (itype-lookup id.t sub)

4713 =/ found=(unit itype) (itype-lookup id.t sub)

4636 ?~ found t

4714 ?~ found t

4715+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

4716+ $(t u.found)

4717+ %rnvar

4718+ =/ found=(unit itype) (itype-lookup id.t sub)

4719+ ?~ found t

4720+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

4637 $(t u.found)

4721 $(t u.found)

4722+ %tag

4723+ =/ found=(unit itype) (itype-lookup id.t sub)

4724+ ?~ found t

4725+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

4726+ $(t u.found)

4727+ ==

4728+::

4729+:: Prove only emptiness; unknown types are never treated as empty.

4730+:: A shared node budget bounds each proof attempt.

4731+++ itype-empty-cases

4732+ |= [xs=(list itype) sub=isub fuel=@ud]

4733+ ^- (unit [empty=? left=@ud])

4734+ ?~ xs `[& fuel]

4735+ =/ first=(unit [empty=? left=@ud]) (itype-empty-proof i.xs sub fuel)

4736+ ?~ first ~

4737+ ?. empty.u.first `[| left.u.first]

4738+ $(xs t.xs, fuel left.u.first)

4739+++ itype-empty-proof

4740+ |= [typ=itype sub=isub fuel=@ud]

4741+ ^- (unit [empty=? left=@ud])

4742+ ?: =(0 fuel) ~

4743+ =. fuel (dec fuel)

4744+ =. typ (itype-walk typ sub)

4745+ ?- -.typ

4746+ %empty `[& fuel]

4747+ %face $(typ body.typ)

4748+ %cell

4749+ =/ left=(unit [empty=? left=@ud]) $(typ hed.typ)

4750+ ?~ left ~

4751+ ?: empty.u.left `[& left.u.left]

4752+ $(typ tal.typ, fuel left.u.left)

4753+ %union (itype-empty-cases cases.typ sub fuel)

4754+ * `[| fuel]

4638 ==

4755 ==

4756+:: Prove reachability separately from emptiness. An unresolved fixed

4757+:: recursive type is not presumed inhabited. A written, still-unconstrained

4758+:: capital is existentially inhabited for pattern reachability; the normal

4759+:: definition-boundary checks reject subsequently constrained capitals.

4760+++ itype-inhabited-cases

4761+ |= [xs=(list itype) sub=isub caps=icaps fuel=@ud pending=?]

4762+ ^- (unit [result=?(%yes %no %unknown) left=@ud])

4763+ ?~ xs `[?:(pending %unknown %no) fuel]

4764+ =/ first=(unit [result=?(%yes %no %unknown) left=@ud])

4765+ (itype-inhabited-proof i.xs sub caps fuel)

4766+ ?~ first ~

4767+ ?: =(%yes result.u.first) first

4768+ $(xs t.xs, fuel left.u.first, pending |(pending =(%unknown result.u.first)))

4769+++ itype-inhabited-proof

4770+ |= [typ=itype sub=isub caps=icaps fuel=@ud]

4771+ ^- (unit [result=?(%yes %no %unknown) left=@ud])

4772+ ?: =(0 fuel) ~

4773+ =. fuel (dec fuel)

4774+ =. typ (itype-walk typ sub)

4775+ ?- -.typ

4776+ %empty `[%no fuel]

4777+ ?(%atom %any-atom %flag %const %noun %avar %rvar %nvar %rnvar %fn %jrec) `[%yes fuel]

4778+ %var

4779+ ?: (lien caps |=(c=icap (hole-same-variable typ (itype-walk [%var id.c] sub)))) `[%yes fuel]

4780+ `[%unknown fuel]

4781+ %face $(typ body.typ)

4782+ %cell

4783+ =/ head=(unit [result=?(%yes %no %unknown) left=@ud]) $(typ hed.typ)

4784+ ?~ head ~

4785+ ?: =(%no result.u.head) head

4786+ =/ tail=(unit [result=?(%yes %no %unknown) left=@ud]) $(typ tal.typ, fuel left.u.head)

4787+ ?~ tail ~

4788+ ?: =(%no result.u.tail) tail

4789+ ?: |(=(%unknown result.u.head) =(%unknown result.u.tail)) `[%unknown left.u.tail]

4790+ `[%yes left.u.tail]

4791+ %union (itype-inhabited-cases cases.typ sub caps fuel |)

4792+ %collection

4793+ ?. &(|(=(%list name.typ) =(%unit name.typ)) ?=([* ~] args.typ)) `[%unknown fuel]

4794+ `[%yes fuel]

4795+ %grec ?:((grec-tree-proof name.typ proof.typ) `[%yes fuel] `[%unknown fuel])

4796+ * `[%unknown fuel]

4797+ ==

4798+++ itype-live-cases

4799+ |= [xs=(list itype) sub=isub caps=icaps fuel=@ud]

4800+ ^- (unit (list itype))

4801+ ?~ xs `~

4802+ =/ first=(unit [result=?(%yes %no %unknown) left=@ud])

4803+ (itype-inhabited-proof i.xs sub caps fuel)

4804+ ?~ first ~

4805+ ?: =(%unknown result.u.first) ~

4806+ =/ rest=(unit (list itype)) $(xs t.xs, fuel left.u.first)

4807+ ?~ rest ~

4808+ ?: =(%no result.u.first) rest

4809+ `[i.xs u.rest]

4639::

4810::

4640++ itype-occurs

4811++ itype-occurs

4641 |= [n=@ud t=itype sub=isub]

4812 |= [n=@ud t=itype sub=isub]

@@ -4644,10 +4815,22 @@

4644 ?- -.t

4815 ?- -.t

4645 %var =(n id.t)

4816 %var =(n id.t)

4646 %avar =(n id.t)

4817 %avar =(n id.t)

4818+ %rvar =(n id.t)

4647 %nvar =(n id.t)

4819 %nvar =(n id.t)

4820+ %rnvar =(n id.t)

4648 %atom |

4821 %atom |

4649 %any-atom |

4822 %any-atom |

4650 %flag |

4823 %flag |

4824+ %noun |

4825+ %empty |

4826+ %tag =(n id.t)

4827+ %const |

4828+ %union |((lien cases.t |=(c=itype (itype-occurs n c sub))) (lien args.t |=(c=itype (itype-occurs n c sub))))

4829+ %recursive |

4830+ %jrec |

4831+ %grec (lien args.t |=(c=itype (itype-occurs n c sub)))

4832+ %collection (lien args.t |=(c=itype (itype-occurs n c sub)))

4833+ %face $(t body.t)

4651 %fn |($(t sample.t) $(t product.t))

4834 %fn |($(t sample.t) $(t product.t))

4652 %cell |($(t hed.t) $(t tal.t))

4835 %cell |($(t hed.t) $(t tal.t))

4653 ==

4836 ==

@@ -4664,12 +4847,53 @@

4664 =. a (itype-walk a sub)

4847 =. a (itype-walk a sub)

4665 =. b (itype-walk b sub)

4848 =. b (itype-walk b sub)

4666 ?: =(a b) `sub

4849 ?: =(a b) `sub

4850+ ?: &(?=(%grec -.a) ?=(%grec -.b))

4851+ ?. &(=(at.a at.b) =(name.a name.b)) ~

4852+ (itype-unify-args args.a args.b sub)

4853+ ?: &(?=(%jrec -.a) ?=(%jrec -.b))

4854+ ?:(&(=(at.a at.b) =(name.a name.b) =(head.a head.b) =(aura.a aura.b) =(tail.a tail.b)) `sub ~)

4855+ ?: &(?=(%recursive -.a) ?=(%recursive -.b))

4856+ ?:(&(=(module.a module.b) =(name.a name.b)) `sub ~)

4857+ ?: &(?=(%union -.a) ?=(%union -.b))

4858+ ?. =(origin.a origin.b) ~

4859+ ?: &(?=(~ args.a) ?=(~ args.b)) ?:(=(cases.a cases.b) `sub ~)

4860+ ?~ origin.a ~

4861+ (itype-unify-args args.a args.b sub)

4862+ ?: &(?=(%collection -.a) ?=(%collection -.b))

4863+ ?. =(name.a name.b) ~

4864+ (itype-unify-args args.a args.b sub)

4667 ?: ?=(%var -.a)

4865 ?: ?=(%var -.a)

4668 ?: (itype-occurs id.a b sub) ~

4866 ?: (itype-occurs id.a b sub) ~

4669 `[[id.a b] sub]

4867 `[[id.a b] sub]

4670 ?: ?=(%var -.b)

4868 ?: ?=(%var -.b)

4671 ?: (itype-occurs id.b a sub) ~

4869 ?: (itype-occurs id.b a sub) ~

4672 `[[id.b a] sub]

4870 `[[id.b a] sub]

4871+ :: Arithmetic's aura variable excludes loobeans; decimal literals

4872+ :: remain defaultable until a later constraint makes them concrete.

4873+ ?: &(?=(%nvar -.a) ?=(%rvar -.b))

4874+ `[[id.b [%rnvar id.a]] [id.a [%rnvar id.a]] sub]

4875+ ?: &(?=(%rvar -.a) ?=(%nvar -.b))

4876+ `[[id.a [%rnvar id.b]] [id.b [%rnvar id.b]] sub]

4877+ ?: &(?=(%rnvar -.a) ?=(%rvar -.b)) `[[id.b a] sub]

4878+ ?: &(?=(%rvar -.a) ?=(%rnvar -.b)) `[[id.a b] sub]

4879+ ?: &(?=(%rnvar -.a) ?=(%nvar -.b)) `[[id.b a] sub]

4880+ ?: &(?=(%nvar -.a) ?=(%rnvar -.b)) `[[id.a b] sub]

4881+ ?: &(?=(%rnvar -.a) ?=(%avar -.b)) `[[id.b a] sub]

4882+ ?: &(?=(%avar -.a) ?=(%rnvar -.b)) `[[id.a b] sub]

4883+ ?: ?=(%rnvar -.a)

4884+ ?. |(?=(%rnvar -.b) ?=(%atom -.b)) ~

4885+ `[[id.a b] sub]

4886+ ?: ?=(%rnvar -.b)

4887+ ?. ?=(%atom -.a) ~

4888+ `[[id.b a] sub]

4889+ ?: &(?=(%avar -.a) ?=(%rvar -.b)) `[[id.a b] sub]

4890+ ?: &(?=(%rvar -.a) ?=(%avar -.b)) `[[id.b a] sub]

4891+ ?: ?=(%rvar -.a)

4892+ ?. |(?=(%rvar -.b) ?=(%atom -.b)) ~

4893+ `[[id.a b] sub]

4894+ ?: ?=(%rvar -.b)

4895+ ?. ?=(%atom -.a) ~

4896+ `[[id.b a] sub]

4673 :: The narrower decimal constraint survives a match with an atom

4897 :: The narrower decimal constraint survives a match with an atom

4674 :: variable; decimal syntax alone does not make it a loobean.

4898 :: variable; decimal syntax alone does not make it a loobean.

4675 ?: &(?=(%nvar -.a) ?=(%avar -.b)) `[[id.b a] sub]

4899 ?: &(?=(%nvar -.a) ?=(%avar -.b)) `[[id.b a] sub]

@@ -4686,7 +4910,12 @@

4686 ?: ?=(%avar -.b)

4910 ?: ?=(%avar -.b)

4687 ?. |(?=(%atom -.a) ?=(%any-atom -.a) ?=(%flag -.a)) ~

4911 ?. |(?=(%atom -.a) ?=(%any-atom -.a) ?=(%flag -.a)) ~

4688 `[[id.b a] sub]

4912 `[[id.b a] sub]

4913+ ?: &(?=(%const -.a) ?=(%const -.b))

4914+ ?:(=(val.literal.a val.literal.b) `sub ~)

4689 ?: &(?=(%atom -.a) ?=(%atom -.b)) ~

4915 ?: &(?=(%atom -.a) ?=(%atom -.b)) ~

4916+ ?: &(?=(%face -.a) ?=(%face -.b))

4917+ ?. =(name.a name.b) ~

4918+ $(a body.a, b body.b)

4690 ?: &(?=(%fn -.a) ?=(%fn -.b))

4919 ?: &(?=(%fn -.a) ?=(%fn -.b))

4691 =/ first=(unit isub) $(a sample.a, b sample.b)

4920 =/ first=(unit isub) $(a sample.a, b sample.b)

4692 ?~ first ~

4921 ?~ first ~

@@ -4697,6 +4926,15 @@

4697 $(a tal.a, b tal.b, sub u.first)

4926 $(a tal.a, b tal.b, sub u.first)

4698 ~

4927 ~

4699::

4928::

4929+++ itype-unify-args

4930+ |= [as=(list itype) bs=(list itype) sub=isub]

4931+ ^- (unit isub)

4932+ ?~ as ?~(bs `sub ~)

4933+ ?~ bs ~

4934+ =/ next=(unit isub) (itype-unify i.as i.bs sub)

4935+ ?~ next ~

4936+ $(as t.as, bs t.bs, sub u.next)

4937+::

4700:: +itype-fit: one-way widening from an actual type to an expected type

4938:: +itype-fit: one-way widening from an actual type to an expected type

4701::

4939::

4702:: An unknown variable used where @ is expected gains a fresh atom

4940:: An unknown variable used where @ is expected gains a fresh atom

@@ -4710,10 +4948,22 @@

4710 ?- -.t

4948 ?- -.t

4711 %var |

4949 %var |

4712 %avar |

4950 %avar |

4951+ %rvar |

4713 %nvar |

4952 %nvar |

4953+ %rnvar |

4714 %atom |

4954 %atom |

4715 %any-atom &

4955 %any-atom &

4716 %flag |

4956 %flag |

4957+ %noun |

4958+ %empty |

4959+ %tag |

4960+ %const |

4961+ %union |((lien cases.t |=(c=itype (itype-has-any-atom c sub))) (lien args.t |=(c=itype (itype-has-any-atom c sub))))

4962+ %recursive |

4963+ %jrec |

4964+ %grec (lien args.t |=(c=itype (itype-has-any-atom c sub)))

4965+ %collection (lien args.t |=(c=itype (itype-has-any-atom c sub)))

4966+ %face $(t body.t)

4717 %fn |($(t sample.t) $(t product.t))

4967 %fn |($(t sample.t) $(t product.t))

4718 %cell |($(t hed.t) $(t tal.t))

4968 %cell |($(t hed.t) $(t tal.t))

4719 ==

4969 ==

@@ -4736,6 +4986,14 @@

4736:: Related auras in a structural unification need a common-type rule;

4986:: Related auras in a structural unification need a common-type rule;

4737:: until that rule is implemented, report an unknown rather than error.

4987:: until that rule is implemented, report an unknown rather than error.

4738::

4988::

4989+++ itype-family-related-collection-args

4990+ |= [as=(list itype) bs=(list itype) sub=isub]

4991+ ^- ?

4992+ ?~ as |

4993+ ?~ bs |

4994+ ?: (itype-family-related i.as i.bs sub) &

4995+ $(as t.as, bs t.bs)

4996+::

4739++ itype-family-related

4997++ itype-family-related

4740 |= [a=itype b=itype sub=isub]

4998 |= [a=itype b=itype sub=isub]

4741 ^- ?

4999 ^- ?

@@ -4744,6 +5002,12 @@

4744 ?: &(?=(%atom -.a) ?=(%atom -.b))

5002 ?: &(?=(%atom -.a) ?=(%atom -.b))

4745 ?. !=(aura.a aura.b) |

5003 ?. !=(aura.a aura.b) |

4746 |((aura-prefix aura.a aura.b) (aura-prefix aura.b aura.a))

5004 |((aura-prefix aura.a aura.b) (aura-prefix aura.b aura.a))

5005+ ?: &(?=(%collection -.a) ?=(%collection -.b))

5006+ ?. =(name.a name.b) |

5007+ (itype-family-related-collection-args args.a args.b sub)

5008+ ?: &(?=(%face -.a) ?=(%face -.b))

5009+ ?. =(name.a name.b) |

5010+ $(a body.a, b body.b)

4747 ?: &(?=(%cell -.a) ?=(%cell -.b))

5011 ?: &(?=(%cell -.a) ?=(%cell -.b))

4748 |($(a hed.a, b hed.b) $(a tal.a, b tal.b))

5012 |($(a hed.a, b hed.b) $(a tal.a, b tal.b))

4749 ?: &(?=(%fn -.a) ?=(%fn -.b))

5013 ?: &(?=(%fn -.a) ?=(%fn -.b))

@@ -4760,10 +5024,22 @@

4760 ?- -.typ

5024 ?- -.typ

4761 %var |

5025 %var |

4762 %avar |

5026 %avar |

5027+ %rvar |

4763 %nvar |

5028 %nvar |

5029+ %rnvar |

4764 %atom &

5030 %atom &

4765 %any-atom &

5031 %any-atom &

4766 %flag &

5032 %flag &

5033+ %noun |

5034+ %empty |

5035+ %tag &

5036+ %const &

5037+ %union |((lien cases.typ |=(c=itype (itype-has-fixed-atom c))) (lien args.typ |=(c=itype (itype-has-fixed-atom c))))

5038+ %recursive |

5039+ %jrec |

5040+ %grec (lien args.typ |=(c=itype (itype-has-fixed-atom c)))

5041+ %collection (lien args.typ |=(c=itype (itype-has-fixed-atom c)))

5042+ %face $(typ body.typ)

4767 %fn |($(typ sample.typ) $(typ product.typ))

5043 %fn |($(typ sample.typ) $(typ product.typ))

4768 %cell |($(typ hed.typ) $(typ tal.typ))

5044 %cell |($(typ hed.typ) $(typ tal.typ))

4769 ==

5045 ==

@@ -4781,16 +5057,445 @@

4781 ?: &(?=(%any-atom -.b) |(?=(%atom -.a) ?=(%flag -.a))) `b

5057 ?: &(?=(%any-atom -.b) |(?=(%atom -.a) ?=(%flag -.a))) `b

4782 ~

5058 ~

4783::

5059::

5060+:: Unifying an already-bound tuple with a faced position would need to

5061+:: update the bound type. Until substitutions can retain that information,

5062+:: variable-dependent face merges stay unresolved.

5063+::

5064+++ itype-has-face

5065+ |= [t=itype sub=isub]

5066+ ^- ?

5067+ =. t (itype-walk t sub)

5068+ ?- -.t

5069+ %grec (lien args.t |=(c=itype (itype-has-face c sub)))

5070+ %collection (lien args.t |=(c=itype (itype-has-face c sub)))

5071+ %face &

5072+ %cell |($(t hed.t) $(t tal.t))

5073+ %fn |($(t sample.t) $(t product.t))

5074+ * |

5075+ ==

5076+::

5077+:: Closed function samples may omit a slot face, but a known name must

5078+:: match another known name. Keep nested value faces and require exact

5079+:: invariant compatibility; a faced tail against a cell is ambiguous.

5080+++ itype-closed-slot-match

5081+ |= [a=itype b=itype]

5082+ ^- ?

5083+ ?: &(?=(%face -.a) ?=(%face -.b))

5084+ ?. =(name.a name.b) |

5085+ ?=(^ (itype-unify body.a body.b ~))

5086+ ?: ?=(%face -.a) ?=(^ (itype-unify body.a b ~))

5087+ ?: ?=(%face -.b) ?=(^ (itype-unify a body.b ~))

5088+ ?=(^ (itype-unify a b ~))

5089+++ itype-closed-sample-match

5090+ |= [a=itype b=itype fuel=@ud]

5091+ ^- ?

5092+ ?: =(0 fuel) |

5093+ ?. &(?=(%cell -.a) ?=(%cell -.b)) |

5094+ ?. (itype-closed-slot-match hed.a hed.b) |

5095+ =/ x=itype tal.a

5096+ =/ y=itype tal.b

5097+ ?: &(?=(%cell -.x) ?=(%cell -.y))

5098+ ?=(^ (itype-unify x y ~))

5099+ ?: |(&(?=(%face -.x) ?=(%cell -.y)) &(?=(%cell -.x) ?=(%face -.y))) |

5100+ (itype-closed-slot-match x y)

5101+++ itype-closed-gates-match

5102+ |= [a=itype b=itype]

5103+ ^- ?

5104+ ?. &(?=(%fn -.a) ?=(%fn -.b)) |

5105+ ?. &(?=(%cell -.sample.a) ?=(%cell -.sample.b)) |

5106+ ?. =(product.a product.b) |

5107+ ?^ (itype-vars a) |

5108+ ?^ (itype-vars b) |

5109+ ?: |((itype-has-tag a) (itype-has-tag b)) |

5110+ ?. (itype-closed-sample-match sample.a sample.b 1.024) |

5111+ ?=(^ (itype-unify product.a product.b ~))

5112+::

5113+++ itype-face-asym-collection-args

5114+ |= [as=(list itype) bs=(list itype) sub=isub]

5115+ ^- ?

5116+ ?~ as |

5117+ ?~ bs |

5118+ ?: (itype-face-asym i.as i.bs sub) &

5119+ $(as t.as, bs t.bs)

5120+::

5121+++ itype-face-asym

5122+ |= [a=itype b=itype sub=isub]

5123+ ^- ?

5124+ =. a (itype-walk a sub)

5125+ =. b (itype-walk b sub)

5126+ ?: &(?=(%grec -.a) ?=(%grec -.b))

5127+ ?. &(=(at.a at.b) =(name.a name.b)) |

5128+ (itype-face-asym-collection-args args.a args.b sub)

5129+ ?: &(?=(%collection -.a) ?=(%collection -.b))

5130+ ?. =(name.a name.b) |

5131+ (itype-face-asym-collection-args args.a args.b sub)

5132+ ?: &(?=(%face -.a) ?=(%face -.b)) $(a body.a, b body.b)

5133+ ?: ?=(%face -.a) !|(?=(%var -.b) ?=(%avar -.b) ?=(%rvar -.b) |(?=(%nvar -.b) ?=(%rnvar -.b)))

5134+ ?: ?=(%face -.b) !|(?=(%var -.a) ?=(%avar -.a) ?=(%rvar -.a) |(?=(%nvar -.a) ?=(%rnvar -.a)))

5135+ ?: &(?=(%cell -.a) ?=(%cell -.b)) |($(a hed.a, b hed.b) $(a tal.a, b tal.b))

5136+ ?: &(?=(%fn -.a) ?=(%fn -.b)) |($(a sample.a, b sample.b) $(a product.a, b product.b))

5137+ |

5138+::

5139+:: A successful cast keeps any explicit faces from either side while

5140+:: retaining the target's aura choices. Both faces have already matched.

5141+::

5142+++ itype-merge-faces

5143+ |= [actual=itype expected=itype sub=isub]

5144+ ^- itype

5145+ =. actual (itype-walk actual sub)

5146+ =. expected (itype-walk expected sub)

5147+ ?: &(?=(%face -.actual) ?=(%face -.expected))

5148+ [%face name.expected $(actual body.actual, expected body.expected)]

5149+ ?: ?=(%face -.actual)

5150+ [%face name.actual $(actual body.actual)]

5151+ ?: ?=(%face -.expected)

5152+ [%face name.expected $(expected body.expected)]

5153+ ?: &(?=(%cell -.actual) ?=(%cell -.expected))

5154+ [%cell $(actual hed.actual, expected hed.expected) $(actual tal.actual, expected tal.expected)]

5155+ expected

5156+::

5157+:: Positional call arguments do not write the sample's enclosing field

5158+:: labels. Ignore one raw sample-slot face per written argument while

5159+:: checking value faces as usual. An unknown or variable-bound cell spine

5160+:: cannot justify this distinction, so keep the existing conservative guard.

5161+++ itype-positional-slot-face-asym

5162+ |= [actual=itype expected=itype sub=isub]

5163+ ^- ?

5164+ ?: &(?=(%fn -.actual) ?=(%fn -.expected) (itype-closed-gates-match actual expected)) |

5165+ (itype-face-asym actual expected sub)

5166+::

5167+++ itype-positional-face-asym

5168+ |= [args=(list expr) actual=itype expected=itype sub=isub]

5169+ ^- ?

5170+ ?~ args &

5171+ ?~ t.args

5172+ =/ slot=itype expected

5173+ =? slot ?=(%face -.slot) body.slot

5174+ (itype-positional-slot-face-asym actual slot sub)

5175+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) &

5176+ =/ slot=itype hed.expected

5177+ =? slot ?=(%face -.slot) body.slot

5178+ ?: (itype-positional-slot-face-asym hed.actual slot sub) &

5179+ $(args t.args, actual tal.actual, expected tal.expected)

5180+::

5181+++ itype-output-may-be-cell

5182+ |= [t=itype sub=isub]

5183+ ^- ?

5184+ =. t (itype-walk t sub)

5185+ ?- -.t

5186+ %var &

5187+ %cell &

5188+ %union &

5189+ %recursive &

5190+ %jrec &

5191+ %grec &

5192+ %noun &

5193+ %collection &

5194+ %face $(t body.t)

5195+ %fn |($(t sample.t) $(t product.t))

5196+ * |

5197+ ==

5198+::

5199+++ pending-tags

5200+ |= [tags=(list ipending) sub=isub]

5201+ ^- ?

5202+ ?~ tags |

5203+ ?~ (itype-lookup id.i.tags sub) &

5204+ $(tags t.tags)

5205+::

5206+++ pending-null

5207+ |= [tags=(list ipending) sub=isub]

5208+ ^- ?

5209+ ?~ tags |

5210+ ?: &(?=(%null form.literal.i.tags) ?=(~ (itype-lookup id.i.tags sub))) &

5211+ $(tags t.tags)

5212+::

5213+:: Tags remain constrained until a mold selects a case or permitted atom

5214+:: type. Never generalize an unresolved tag through aliases or cells.

5215+::

5216+++ itype-has-tag

5217+ |= t=itype

5218+ ^- ?

5219+ ?- -.t

5220+ %tag &

5221+ %grec (lien args.t |=(c=itype (itype-has-tag c)))

5222+ %collection (lien args.t |=(c=itype (itype-has-tag c)))

5223+ %face $(t body.t)

5224+ %fn |($(t sample.t) $(t product.t))

5225+ %cell |($(t hed.t) $(t tal.t))

5226+ %union |((lien cases.t |=(c=itype (itype-has-tag c))) (lien args.t |=(c=itype (itype-has-tag c))))

5227+ * |

5228+ ==

5229+::

5230+++ itype-has-union

5231+ |= t=itype

5232+ ^- ?

5233+ ?- -.t

5234+ %union &

5235+ %grec (lien args.t |=(c=itype (itype-has-union c)))

5236+ %collection (lien args.t |=(c=itype (itype-has-union c)))

5237+ %face $(t body.t)

5238+ %fn |($(t sample.t) $(t product.t))

5239+ %cell |($(t hed.t) $(t tal.t))

5240+ * |

5241+ ==

5242+::

5243+:: Until a visible generic alias can be selected, expanding a named

5244+:: generic union would hide phantom arguments and its origin. This is a

5245+:: limitation of partial inference, not the unnamed-union print notation.

5246+::

5247+++ itype-has-hidden-generic

5248+ |= t=itype

5249+ ^- ?

5250+ ?- -.t

5251+ %union

5252+ ?: &(?=(~ label.t) ?=(^ args.t)) &

5253+ (lien (weld args.t cases.t) |=(c=itype (itype-has-hidden-generic c)))

5254+ %grec |(?=(~ label.t) (lien args.t |=(c=itype (itype-has-hidden-generic c))))

5255+ %collection (lien args.t |=(c=itype (itype-has-hidden-generic c)))

5256+ %face $(t body.t)

5257+ %fn |($(t sample.t) $(t product.t))

5258+ %cell |($(t hed.t) $(t tal.t))

5259+ * |

5260+ ==

5261+::

5262+++ itype-has-recursive

5263+ |= t=itype

5264+ ^- ?

5265+ ?- -.t

5266+ %recursive &

5267+ %jrec &

5268+ %grec &

5269+ %collection (lien args.t |=(c=itype (itype-has-recursive c)))

5270+ %union (lien (weld args.t cases.t) |=(c=itype (itype-has-recursive c)))

5271+ %face $(t body.t)

5272+ %cell |($(t hed.t) $(t tal.t))

5273+ %fn |($(t sample.t) $(t product.t))

5274+ * |

5275+ ==

5276+::

5277+++ itype-has-hidden-recursive

5278+ |= t=itype

5279+ ^- ?

5280+ ?- -.t

5281+ %recursive ?=(~ label.t)

5282+ %jrec ?=(~ label.t)

5283+ %grec |(?=(~ label.t) (lien args.t |=(c=itype (itype-has-hidden-recursive c))))

5284+ %collection (lien args.t |=(c=itype (itype-has-hidden-recursive c)))

5285+ %union (lien (weld args.t cases.t) |=(c=itype (itype-has-hidden-recursive c)))

5286+ %face $(t body.t)

5287+ %cell |($(t hed.t) $(t tal.t))

5288+ %fn |($(t sample.t) $(t product.t))

5289+ * |

5290+ ==

5291+::

5292+++ itype-fit-cases

5293+ |= [actual=itype cases=(list itype) sub=isub next=@ud]

5294+ ^- ifit

5295+ =/ good=(unit ifit) ~

5296+ =/ pending=? |

5297+ |-

5298+ ?~ cases

5299+ ?: pending [%unknown ~]

5300+ ?~ good [%bad ~]

5301+ u.good

5302+ =/ trial=ifit (itype-fit actual i.cases sub next)

5303+ ?- -.trial

5304+ %unknown $(cases t.cases, pending &)

5305+ %bad $(cases t.cases)

5306+ %ok

5307+ ?^ good [%unknown ~]

5308+ $(cases t.cases, good `trial)

5309+ ==

5310+::

5311+:: A constructor needs a case whose head has the same literal noun as its

5312+:: tag. An unresolved or opaque case may reveal one later, so it cannot

5313+:: prove a mismatch or a unique match. A broad atom mold is not a case.

5314+::

5315+++ itype-fit-ctor-cases

5316+ |= [tag=lit sample=itype cases=(list itype) sub=isub next=@ud]

5317+ ^- ifit

5318+ =/ found=(unit ifit) ~

5319+ =/ pending=? |

5320+ |-

5321+ ?~ cases

5322+ ?: pending [%unknown ~]

5323+ ?~ found [%bad ~]

5324+ u.found

5325+ =/ raw=itype i.cases

5326+ ?: ?=(%var -.raw)

5327+ $(cases t.cases, pending &)

5328+ =/ c=itype (itype-walk raw sub)

5329+ ?: ?=(?(%var %tag %recursive %jrec %grec %union %face) -.c)

5330+ $(cases t.cases, pending &)

5331+ ?. ?=(%cell -.c) $(cases t.cases)

5332+ =/ raw-head=itype hed.c

5333+ ?: ?=(%var -.raw-head)

5334+ $(cases t.cases, pending &)

5335+ =/ head=itype (itype-walk raw-head sub)

5336+ :: A single faced, explicitly atom-only head cannot be the tag case.

5337+ :: Do not follow variables or peel nested faces for this negative proof.

5338+ ?: ?=(%face -.head)

5339+ ?: ?=(?(%atom %any-atom %flag %avar %rvar %nvar %rnvar) -.body.head)

5340+ $(cases t.cases)

5341+ $(cases t.cases, pending &)

5342+ ?: ?=(?(%var %tag %recursive %jrec %grec %union) -.head)

5343+ $(cases t.cases, pending &)

5344+ ?. ?=(%const -.head) $(cases t.cases)

5345+ ?. =(val.literal.head val.tag) $(cases t.cases)

5346+ :: Equal heads can have disjoint payloads. Test each from the original

5347+ :: substitution; a unique success is usable only with no unknown rival.

5348+ =/ trial=ifit (itype-fit sample tal.c sub next)

5349+ ?- -.trial

5350+ %bad $(cases t.cases)

5351+ %unknown $(cases t.cases, pending &)

5352+ %ok

5353+ ?^ found [%unknown ~]

5354+ $(cases t.cases, found `trial)

5355+ ==

5356+::

4784++ itype-fit

5357++ itype-fit

4785 |= [actual=itype expected=itype sub=isub next=@ud]

5358 |= [actual=itype expected=itype sub=isub next=@ud]

4786 ^- ifit

5359 ^- ifit

5360+ =/ result=ifit (itype-fit-inner actual expected sub next | |)

5361+ ?: ?=(%ok -.result) result

5362+ =/ source=itype (itype-walk actual sub)

5363+ ?. ?=(?(%empty %face %cell %union) -.source) result

5364+ =/ empty=(unit [empty=? left=@ud]) (itype-empty-proof actual sub 256)

5365+ ?~ empty [%unknown ~]

5366+ ?: empty.u.empty [%ok sub next]

5367+ result

5368+++ itype-fit-inner

5369+ |= [actual=itype expected=itype sub=isub next=@ud skip-width=? spine-proof=?]

5370+ ^- ifit

5371+ ?: &(!skip-width ?=(%cell -.actual) ?=(%cell -.expected) |((width-spine-exhausted actual 1.024) (width-spine-exhausted expected 1.024)))

5372+ [%unknown ~]

5373+ =/ known=(unit [source=iwfields target=iwfields])

5374+ ?: skip-width ~

5375+ (width-known-shape actual expected sub)

5376+ =/ too-wide=? ?~(known | (gth (lent order.source.u.known) (lent order.target.u.known)))

5377+ ?: too-wide [%unknown ~]

5378+ =/ spine-checked=? |(spine-proof ?=(^ known))

4787 =/ uncertain=?

5379 =/ uncertain=?

4788− |(?=(%var -.actual) ?=(%avar -.actual) ?=(%nvar -.actual) ?=(%var -.expected) ?=(%avar -.expected) ?=(%nvar -.expected))

5380+ |(?=(%var -.actual) ?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)) ?=(%var -.expected) ?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected)))

5381+ =/ actual-open=?

5382+ |(?=(%var -.actual) ?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)))

4789 =. actual (itype-walk actual sub)

5383 =. actual (itype-walk actual sub)

4790 =. expected (itype-walk expected sub)

5384 =. expected (itype-walk expected sub)

4791 ?: =(actual expected) [%ok sub next]

5385 ?: =(actual expected) [%ok sub next]

5386+ ?: &(?=(%empty -.expected) |(?=(%cell -.actual) ?=(%face -.actual) ?=(%union -.actual) ?=(%grec -.actual) ?=(%recursive -.actual))) [%unknown ~]

5387+ :: The relation of the source loobean mold to explicit @f is not yet

5388+ :: established. Keep it unsupported rather than asserting a mismatch.

5389+ ?: &(?=(%flag -.actual) ?=(%atom -.expected) =(%f aura.expected)) [%unknown ~]

5390+ :: Any value can be used where a noun is expected. An unresolved

5391+ :: bare tag is fixed as a constant; a constructor still needs a gate.

5392+ ?: ?=(%noun -.expected)

5393+ ?: ?=(%tag -.actual)

5394+ ?: constructor.actual [%unknown ~]

5395+ [%ok [[id.actual expected] sub] next]

5396+ [%ok sub next]

5397+ :: An arbitrary noun is not known to fit a narrower type.

5398+ ?: &(?=(%noun -.actual) !?=(%var -.expected)) [%unknown ~]

5399+ ?: &(!uncertain ?=(%grec -.actual) ?=(%face -.expected)) $(expected body.expected)

5400+ ?: &(!uncertain ?=(%face -.actual) ?=(%grec -.expected)) $(actual body.actual)

5401+ ?: &(?=(%grec -.actual) ?=(%grec -.expected))

5402+ ?. &(=(at.actual at.expected) =(name.actual name.expected)) [%unknown ~]

5403+ =/ matched=(unit isub) (itype-unify-args args.actual args.expected sub)

5404+ ?~ matched [%unknown ~]

5405+ [%ok u.matched next]

5406+ ?: &(|(?=(%grec -.actual) ?=(%grec -.expected)) !|(?=(%var -.actual) ?=(%var -.expected))) [%unknown ~]

5407+ ?: &(!uncertain ?=(%jrec -.actual) ?=(%face -.expected)) $(expected body.expected)

5408+ ?: &(!uncertain ?=(%face -.actual) ?=(%jrec -.expected)) $(actual body.actual)

5409+ ?: &(?=(%jrec -.actual) ?=(%jrec -.expected))

5410+ ?:(&(=(at.actual at.expected) =(name.actual name.expected) =(head.actual head.expected) =(aura.actual aura.expected) =(tail.actual tail.expected)) [%ok sub next] [%bad ~])

5411+ ?: &(|(?=(%jrec -.actual) ?=(%jrec -.expected)) !|(?=(%var -.actual) ?=(%var -.expected))) [%unknown ~]

5412+ ?: &(?=(%recursive -.actual) ?=(%recursive -.expected))

5413+ ?:(&(=(module.actual module.expected) =(name.actual name.expected)) [%ok sub next] [%bad ~])

5414+ ?: &(|(?=(%recursive -.actual) ?=(%recursive -.expected)) !|(?=(%var -.actual) ?=(%var -.expected))) [%unknown ~]

5415+ ?: &(?=(%union -.actual) ?=(%union -.expected))

5416+ ?. =(origin.actual origin.expected) [%unknown ~]

5417+ ?: &(?=(~ args.actual) ?=(~ args.expected))

5418+ ?:(=(cases.actual cases.expected) [%ok sub next] [%unknown ~])

5419+ ?~ origin.actual [%unknown ~]

5420+ =/ unified=(unit isub) (itype-unify-args args.actual args.expected sub)

5421+ ?^ unified [%ok u.unified next]

5422+ [%unknown ~]

5423+ :: A known union can instantiate an unconstrained sample directly;

5424+ :: preserve unknown results for variable-bound union origins.

5425+ ?: &(!actual-open ?=(%union -.actual) ?=(%var -.expected))

5426+ ?~ origin.actual [%unknown ~]

5427+ =/ normalized=itype (itype-normalize actual sub)

5428+ ?: |((itype-has-tag normalized) (itype-has-recursive normalized) (itype-has-any-atom actual sub)) [%unknown ~]

5429+ =/ unified=(unit isub) (itype-unify actual expected sub)

5430+ ?~ unified [%unknown ~]

5431+ [%ok u.unified next]

5432+ :: A concrete union value in a tuple may acquire the expected field's

5433+ :: face. A variable-bound union still needs face propagation support.

5434+ ?: &(!uncertain ?=(%union -.actual) ?=(%face -.expected))

5435+ $(expected body.expected)

5436+ ?: ?=(%union -.actual) [%unknown ~]

5437+ ?: &(?=(%union -.expected) |(?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)))) [%unknown ~]

5438+ ?: &(?=(%union -.expected) !?=(%var -.actual))

5439+ (itype-fit-cases actual cases.expected sub next)

5440+ ?: ?=(%tag -.actual)

5441+ ?: ?=(%var -.expected)

5442+ =/ u=(unit isub) (itype-unify actual expected sub)

5443+ ?~ u [%bad ~]

5444+ [%ok u.u next]

5445+ ?: |(?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected))) [%unknown ~]

5446+ ?: ?=(%face -.expected) $(expected body.expected)

5447+ ?: constructor.actual

5448+ ?. ?=(%fn -.expected) [%bad ~]

5449+ =/ product=itype (itype-walk product.expected sub)

5450+ =/ cases=(list itype) ?:(?=(%union -.product) cases.product ~[product])

5451+ =/ trial=ifit (itype-fit-ctor-cases literal.actual sample.expected cases sub next)

5452+ ?. ?=(%ok -.trial) trial

5453+ [%ok [[id.actual expected] sub.trial] next.trial]

5454+ :: Zero may be the empty list. A nested cell fit lacks the context

5455+ :: needed to resolve it here, so do not report a definite mismatch.

5456+ ?: &(?=(%collection -.expected) =(%list name.expected) =(0 val.literal.actual))

5457+ [%unknown ~]

5458+ ?: ?=(%const -.expected)

5459+ ?:(=(val.literal.actual val.literal.expected) [%ok [[id.actual expected] sub] next] [%bad ~])

5460+ ?: ?=(%atom -.expected)

5461+ ?: |(=(%tas aura.expected) =(%ta aura.expected))

5462+ [%ok [[id.actual expected] sub] next]

5463+ [%bad ~]

5464+ ?: ?=(%flag -.expected)

5465+ ?:(|(=(0 val.literal.actual) =(1 val.literal.actual)) [%ok [[id.actual expected] sub] next] [%bad ~])

5466+ ?: ?=(%any-atom -.expected) [%ok [[id.actual expected] sub] next]

5467+ [%bad ~]

5468+ ?: ?=(%const -.actual)

5469+ ?: ?=(%var -.expected)

5470+ =/ u=(unit isub) (itype-unify actual expected sub)

5471+ ?~ u [%bad ~]

5472+ [%ok u.u next]

5473+ ?: |(?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected))) [%unknown ~]

5474+ ?: ?=(%face -.expected) $(expected body.expected)

5475+ ?: &(?=(%collection -.expected) =(%list name.expected) =(0 val.literal.actual))

5476+ [%unknown ~]

5477+ ?: ?=(%const -.expected)

5478+ ?:(=(val.literal.actual val.literal.expected) [%ok sub next] [%bad ~])

5479+ ?: ?=(%atom -.expected)

5480+ :: A loobean singleton must not silently widen into another aura.

5481+ ?: =(%loobean form.literal.actual)

5482+ ?: =(%f aura.expected) [%unknown ~]

5483+ [%bad ~]

5484+ ?: |(=(%tas aura.expected) =(%ta aura.expected)) [%ok sub next]

5485+ [%bad ~]

5486+ ?: ?=(%flag -.expected)

5487+ ?:(|(=(0 val.literal.actual) =(1 val.literal.actual)) [%ok sub next] [%bad ~])

5488+ ?: ?=(%any-atom -.expected) [%ok sub next]

5489+ [%bad ~]

5490+ ?: &(uncertain (itype-face-asym actual expected sub)) [%unknown ~]

5491+ :: A known face labels the same noun. Peel it before applying the

5492+ :: directional unrestricted-atom rule, preserving raw-variable guards.

5493+ ?: &(!uncertain ?=(%any-atom -.actual) ?=(%face -.expected))

5494+ $(expected body.expected, skip-width |, spine-proof |)

5495+ ?: &(!uncertain ?=(%any-atom -.expected) ?=(%face -.actual))

5496+ $(actual body.actual, skip-width |, spine-proof |)

4792 ?: ?=(%any-atom -.expected)

5497 ?: ?=(%any-atom -.expected)

4793− ?: |(?=(%atom -.actual) ?=(%avar -.actual) ?=(%nvar -.actual) ?=(%flag -.actual)) [%ok sub next]

5498+ ?: |(?=(%atom -.actual) ?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)) ?=(%flag -.actual)) [%ok sub next]

4794 ?: ?=(%var -.actual)

5499 ?: ?=(%var -.actual)

4795 =/ unified=(unit isub) (itype-unify actual [%avar next] sub)

5500 =/ unified=(unit isub) (itype-unify actual [%avar next] sub)

4796 ?~ unified [%bad ~]

5501 ?~ unified [%bad ~]

@@ -4801,28 +5506,48 @@

4801 =/ unified=(unit isub) (itype-unify actual expected sub)

5506 =/ unified=(unit isub) (itype-unify actual expected sub)

4802 ?~ unified [%bad ~]

5507 ?~ unified [%bad ~]

4803 [%ok u.unified next]

5508 [%ok u.unified next]

4804− ?: |(?=(%avar -.expected) ?=(%nvar -.expected)) [%unknown ~]

5509+ ?: |(?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected))) [%unknown ~]

4805 [%bad ~]

5510 [%bad ~]

4806 ?: &(?=(%atom -.actual) ?=(%atom -.expected))

5511 ?: &(?=(%atom -.actual) ?=(%atom -.expected))

4807 ?: (aura-prefix aura.expected aura.actual) [%ok sub next]

5512 ?: (aura-prefix aura.expected aura.actual) [%ok sub next]

4808 ?: &((aura-prefix aura.actual aura.expected) uncertain) [%unknown ~]

5513 ?: &((aura-prefix aura.actual aura.expected) uncertain) [%unknown ~]

4809 [%bad ~]

5514 [%bad ~]

4810 ?: &(?=(%cell -.actual) ?=(%cell -.expected))

5515 ?: &(?=(%cell -.actual) ?=(%cell -.expected))

4811− =/ first=ifit $(actual hed.actual, expected hed.expected)

5516+ =/ first=ifit $(actual hed.actual, expected hed.expected, skip-width |, spine-proof |)

4812 ?. ?=(%ok -.first) first

5517 ?. ?=(%ok -.first) first

4813− $(actual tal.actual, expected tal.expected, sub sub.first, next next.first)

5518+ $(actual tal.actual, expected tal.expected, sub sub.first, next next.first, skip-width spine-checked, spine-proof spine-checked)

5519+ :: A field may add a face to an occurrence of the very same type

5520+ :: variable. Binding that variable to a face around itself would fail

5521+ :: the occurs check, but its underlying type has already matched.

5522+ ?: &(?=(%var -.actual) ?=(%face -.expected) =(actual (itype-walk body.expected sub)))

5523+ [%ok sub next]

5524+ :: Differing variables and faces need propagation that is not yet

5525+ :: represented. Binding one to the face can create a false mismatch.

5526+ ?: &(?=(%var -.actual) ?=(%face -.expected)) [%unknown ~]

5527+ ?: &(?=(%face -.actual) ?=(%var -.expected)) [%unknown ~]

4814 ?: &(?=(%var -.actual) (itype-has-any-atom expected sub))

5528 ?: &(?=(%var -.actual) (itype-has-any-atom expected sub))

4815 [%unknown ~]

5529 [%unknown ~]

4816 ?: |(?=(%var -.actual) ?=(%var -.expected))

5530 ?: |(?=(%var -.actual) ?=(%var -.expected))

4817 =/ unified=(unit isub) (itype-unify actual expected sub)

5531 =/ unified=(unit isub) (itype-unify actual expected sub)

4818 ?~ unified

5532 ?~ unified

5533+ ?: |(?=(%face -.actual) ?=(%face -.expected)) [%unknown ~]

5534+ ?: |((itype-has-recursive (itype-normalize actual sub)) (itype-has-recursive (itype-normalize expected sub))) [%unknown ~]

4819 ?: (itype-family-related actual expected sub) [%unknown ~]

5535 ?: (itype-family-related actual expected sub) [%unknown ~]

4820 [%bad ~]

5536 [%bad ~]

4821 [%ok u.unified next]

5537 [%ok u.unified next]

5538+ ?: &(?=(%face -.actual) ?=(%face -.expected))

5539+ ?. =(name.actual name.expected) [%bad ~]

5540+ $(actual body.actual, expected body.expected, skip-width |, spine-proof |)

5541+ ?: ?=(%face -.actual) $(actual body.actual, skip-width |, spine-proof |)

5542+ ?: ?=(%face -.expected) $(expected body.expected, skip-width |, spine-proof |)

5543+ ?: &(!uncertain (itype-closed-gates-match actual expected)) [%ok sub next]

5544+ ?: (itype-face-asym actual expected sub) [%unknown ~]

4822 ?: |((itype-has-any-atom actual sub) (itype-has-any-atom expected sub))

5545 ?: |((itype-has-any-atom actual sub) (itype-has-any-atom expected sub))

4823 [%unknown ~]

5546 [%unknown ~]

4824 =/ unified=(unit isub) (itype-unify actual expected sub)

5547 =/ unified=(unit isub) (itype-unify actual expected sub)

4825 ?~ unified

5548 ?~ unified

5549+ ?: |((itype-has-union (itype-normalize actual sub)) (itype-has-union (itype-normalize expected sub))) [%unknown ~]

5550+ ?: |((itype-has-recursive (itype-normalize actual sub)) (itype-has-recursive (itype-normalize expected sub))) [%unknown ~]

4826 ?: (itype-family-related actual expected sub) [%unknown ~]

5551 ?: (itype-family-related actual expected sub) [%unknown ~]

4827 [%bad ~]

5552 [%bad ~]

4828 [%ok u.unified next]

5553 [%ok u.unified next]

@@ -4851,21 +5576,231 @@

4851 ["a shared type variable should reject incompatible arguments" problems]

5576 ["a shared type variable should reject incompatible arguments" problems]

4852 =? problems ?=(~ (itype-unify same fine ~))

5577 =? problems ?=(~ (itype-unify same fine ~))

4853 ["a shared type variable should accept equal arguments" problems]

5578 ["a shared type variable should accept equal arguments" problems]

5579+ =/ list-a=itype [%collection %list ~[a]]

5580+ =/ list-t=itype [%collection %list ~[txt]]

5581+ =/ list-n=itype [%collection %list ~[num]]

5582+ =? problems ?=(^ (itype-unify a list-a ~))

5583+ ["occurs check should look through collection arguments" problems]

5584+ =? problems !=((itype-vars list-a) ~[0])

5585+ ["generalization should see collection argument variables" problems]

5586+ =? problems !=((itype-rename list-a ~[[0 num]]) list-n)

5587+ ["instantiation should rename collection argument variables" problems]

5588+ =? problems ?=(^ (itype-unify list-t list-n ~))

5589+ ["collection arguments with different auras should conflict" problems]

5590+ =? problems ?=(^ (itype-unify list-t [%collection %unit ~[txt]] ~))

5591+ ["different collection names should conflict" problems]

5592+ =? problems !(itype-family-related list-t [%collection %list ~[[%atom 'tD']]] ~)

5593+ ["collection arguments should preserve aura-family uncertainty" problems]

5594+ =? problems !(itype-face-asym [%collection %list ~[[%face %x txt]]] list-t ~)

5595+ ["collection arguments should preserve face uncertainty" problems]

5596+ =/ recursive=itype [%recursive %fixture %chain `'chain.fixture']

5597+ =/ same-recursive=itype [%recursive %fixture %chain ~]

5598+ =/ other-recursive=itype [%recursive %other %chain `'chain.other']

5599+ =? problems ?=(~ (itype-unify recursive same-recursive ~))

5600+ ["recursive identity should not depend on its visible name" problems]

5601+ =? problems ?=(^ (itype-unify recursive other-recursive ~))

5602+ ["recursive identity should include the source module" problems]

5603+ =/ recursive-fit=ifit (itype-fit recursive txt ~ 0)

5604+ =? problems !?=(%unknown -.recursive-fit)

5605+ ["opaque recursive types should not be unfolded by a fit" problems]

5606+ =/ nested-fit=ifit

5607+ (itype-fit [%collection %list ~[a]] list-t ~[[0 recursive]] 1)

5608+ =? problems !?=(%unknown -.nested-fit)

5609+ ["recursive types behind substitutions should remain uncertain" problems]

4854 problems

5610 problems

4855::

5611::

4856:: The expression inference below is deliberately a fragment: bindings,

5612:: The expression inference below is deliberately a fragment: bindings,

4857−:: simple gates, unary calls, fixed-aura literals, and plain strings. The

5613+:: simple gates, calls, fixed-aura literals, and some interpolated strings. The

4858:: result for unsupported syntax is a diagnostic, never a checked module.

5614:: result for unsupported syntax is a diagnostic, never a checked module.

4859::

5615::

4860+$ ischeme [typ=itype vars=(list @ud)]

5616+$ ischeme [typ=itype vars=(list @ud)]

4861+$ ienv (list [name=term scheme=ischeme])

5617+$ ienv (list [name=term scheme=ischeme])

5618++$ imold-types (list [name=term template=ischeme])

5619++$ iderived [name=term agent=term mark=term]

5620++$ iwidth-definition [name=term original=expr typ=itype sub=isub projections=(list iwprojection)]

5621++$ iwidth-dependency [at=path source=(unit @t) definitions=(list iwidth-definition)]

5622+:: Nonrecursive request evidence is compiler-owned metadata, not a property

5623+:: of an arbitrary ask value. Reader graphs and source inputs are trusted.

5624++$ irequest-evidence

5625+ [api-at=path name=term path=iapi-path-typed api-source=@t public-source=@t internal-source=@t prelude-values=(list term) prelude-molds=(list term) externals=iexternals marks=imark-externals]

5626+:: A unit distinguishes a verified empty closure from a detached legacy file.

5627+:: The opaque prelude is an exact trusted input, not a recursive interface mold.

5628++$ irequest-graph

5629+ [paths=(set path) requests=(list irequest-evidence) bundle-input=* prelude-input=* prelude-values=(list term) prelude-molds=(list term) externals=iexternals marks=imark-externals]

5630++$ ifile [values=ienv molds=imold-types at=path derived=(list iderived) elaborations=(list iwidth-definition) dependencies=(list iwidth-dependency) source=(unit @t) graph=(unit irequest-graph)]

5631++$ ijimports (list [face=term interface=ifile])

4862−+$ icaps (list [name=@t id=@ud])

5632++$ icap [name=@t id=@ud at=span]

5633++$ icaps (list icap)

5634++$ iparams (list [name=@t typ=itype])

4863+$ imolds (list [name=term body=shape])

5635+$ imolds (list [name=term body=shape])

4864:: A caller supplies the exact noun returned by +read-mold:jibb-import.

5636:: A caller supplies the exact noun returned by +read-mold:jibb-import.

4865:: This core has no Ford dependencies; unrecognized payloads fail closed.

5637:: This core has no Ford dependencies; unrecognized payloads fail closed.

4866+$ iexternals (list [module=term name=term result=*])

5638+$ iexternals (list [module=term name=term result=*])

4867+$ imark-externals (list [mark=term result=*])

5639+$ imark-externals (list [mark=term result=*])

5640+:: Hole obligations survive discarded expressions until their owning

5641+:: definition has inferred; their source spans support unresolved reports.

5642++$ ihole [id=@ud at=span]

5643+:: Recursive-mold unfolding spends fuel in the threaded inference state.

5644+:: Retries can restart from an earlier state, so this bounds an attempt,

5645+:: not all parsing or module-checking work.

5646+:: Experimental: only closed, uniquely faced records have known axes.

5647++$ iwfield [name=term axis=@ud typ=itype]

5648++$ iwfields [order=(list iwfield) index=(map term iwfield)]

5649++$ iwstep [name=term axis=@ud]

5650++$ iwidth-result [steps=(list iwstep) sub=isub next=@ud]

5651++$ iwprojection [at=span original=expr source=itype target=itype steps=(list iwstep)]

5652+++ width-scan

5653+ |= [typ=itype sub=isub axis=@ud fuel=@ud]

5654+ ^- (unit iwfields)

5655+ =/ order=(list iwfield) ~

5656+ =/ index=(map term iwfield) *(map term iwfield)

5657+ |-

5658+ ?: =(0 fuel) ~

5659+ ?: |(?=(%var -.typ) ?=(%avar -.typ) ?=(%rvar -.typ) ?=(%nvar -.typ) ?=(%rnvar -.typ)) ~

5660+ ?: ?=(%face -.typ)

5661+ =/ entry=iwfield [name.typ axis body.typ]

5662+ ?: ?=(^ (~(get by index) name.entry)) ~

5663+ `[(flop [entry order]) (~(put by index) name.entry entry)]

5664+ ?. ?=(%cell -.typ) ~

5665+ =/ head=itype hed.typ

5666+ ?: |(?=(%var -.head) ?=(%avar -.head) ?=(%rvar -.head) ?=(%nvar -.head) ?=(%rnvar -.head)) ~

5667+ ?. ?=(%face -.head) ~

5668+ =/ entry=iwfield [name.head (mul 2 axis) body.head]

5669+ ?: ?=(^ (~(get by index) name.entry)) ~

5670+ $(typ tal.typ, axis +((mul 2 axis)), fuel (dec fuel), order [entry order], index (~(put by index) name.entry entry))

5671+++ width-in-order

5672+ |= [source=(list iwfield) target=(list iwfield)]

5673+ ^- ?

5674+ ?~ target &

5675+ ?~ source |

5676+ ?: =(name.i.source name.i.target) $(source t.source, target t.target)

5677+ $(source t.source)

5678+++ width-fit-fields

5679+ |= [source=(map term iwfield) target=(list iwfield) sub=isub next=@ud]

5680+ ^- (unit iwidth-result)

5681+ ?~ target `[~ sub next]

5682+ =/ found=(unit iwfield) (~(get by source) name.i.target)

5683+ ?~ found ~

5684+ =/ fit=ifit (itype-fit typ.u.found typ.i.target sub next)

5685+ ?. ?=(%ok -.fit) ~

5686+ =/ rest=(unit iwidth-result) $(target t.target, sub sub.fit, next next.fit)

5687+ ?~ rest ~

5688+ `[[[name.i.target axis.u.found] steps.u.rest] sub.u.rest next.u.rest]

5689+++ width-spine-exhausted

5690+ |= [t=itype fuel=@ud]

5691+ ^- ?

5692+ ?: =(0 fuel) &

5693+ ?. ?=(%cell -.t) |

5694+ ?. ?=(%face -.hed.t) |

5695+ $(t tal.t, fuel (dec fuel))

5696+++ width-known-shape

5697+ |= [actual=itype expected=itype sub=isub]

5698+ ^- (unit [source=iwfields target=iwfields])

5699+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

5700+ =/ source=(unit iwfields) (width-scan actual sub 1 1.024)

5701+ =/ target=(unit iwfields) (width-scan expected sub 1 1.024)

5702+ ?~ source ~

5703+ ?~ target ~

5704+ `[u.source u.target]

5705+::

5706+++ width-shape

5707+ |= [actual=itype expected=itype sub=isub]

5708+ ^- (unit [source=iwfields target=iwfields])

5709+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

5710+ =/ source=(unit iwfields) (width-scan actual sub 1 4.096)

5711+ =/ target=(unit iwfields) (width-scan expected sub 1 4.096)

5712+ ?~ source ~

5713+ ?~ target ~

5714+ ?. (gth (lent order.u.source) (lent order.u.target)) ~

5715+ `[u.source u.target]

5716+++ width-proj-shape

5717+ |= [actual=itype expected=itype sub=isub]

5718+ ^- (unit [source=iwfields target=iwfields])

5719+ ?. &(|(?=(%cell -.actual) ?=(%face -.actual)) |(?=(%cell -.expected) ?=(%face -.expected))) ~

5720+ =/ source=(unit iwfields) (width-scan actual sub 1 4.096)

5721+ =/ target=(unit iwfields) (width-scan expected sub 1 4.096)

5722+ ?~ source ~

5723+ ?~ target ~

5724+ ?: (lth (lent order.u.source) (lent order.u.target)) ~

5725+ `[u.source u.target]

5726+::

5727+++ width-project

5728+ |= [shape=[source=iwfields target=iwfields] sub=isub next=@ud]

5729+ ^- (unit iwidth-result)

5730+ ?. (width-in-order order.source.shape order.target.shape) ~

5731+ (width-fit-fields index.source.shape order.target.shape sub next)

5732+::

5733+:: Provisional, globally budgeted gate-free proof. %no includes a

5734+:: gate-bearing witness; an uninhabited sibling could invalidate it.

5735+:: Input types must be resolved and normalized under valid substitutions,

5736+:: from trusted source-backed interfaces and reader results. Collection

5737+:: list/unit names rely on their existing identity invariant; this arm

5738+:: does not validate fabricated internal types.

5739++$ igf-segment

5740+ $% [%field name=term]

5741+ [%head ~]

5742+ [%tail ~]

5743+ [%item ~]

5744+ [%case index=@ud]

5745+ ==

5746++$ igate-free [verdict=?(%yes %no %unknown) inhabited=? left=@ud path=(unit (list igf-segment))]

5747+++ gate-free-types

5748+ |= [types=(list itype) fuel=@ud path=(list igf-segment) index=@ud]

5749+ ^- igate-free

5750+ ?~ types [%yes | fuel ~]

5751+ ?: =(0 fuel) [%unknown | 0 ~]

5752+ =/ first=igate-free (gate-free-type i.types fuel [[%case index] path])

5753+ ?: =(%no verdict.first) first

5754+ =/ rest=igate-free $(types t.types, fuel left.first, index +(index))

5755+ ?: =(%no verdict.rest) rest

5756+ =/ inhabited=? |(inhabited.first inhabited.rest)

5757+ ?: |(=(%unknown verdict.first) =(%unknown verdict.rest)) [%unknown inhabited left.rest ~]

5758+ [%yes inhabited left.rest ~]

5759+++ gate-free-type

5760+ |= [typ=itype fuel=@ud path=(list igf-segment)]

5761+ ^- igate-free

5762+ ?: =(0 fuel) [%unknown | 0 ~]

5763+ =. fuel (dec fuel)

5764+ ?- -.typ

5765+ %fn [%no & fuel `(flop path)]

5766+ %atom [%yes & fuel ~]

5767+ %any-atom [%yes & fuel ~]

5768+ %flag [%yes & fuel ~]

5769+ %const [%yes & fuel ~]

5770+ %face $(typ body.typ, path [[%field name.typ] path])

5771+ %cell

5772+ =/ head=igate-free $(typ hed.typ, path [[%head ~] path])

5773+ =/ tail=igate-free $(typ tal.typ, fuel left.head, path [[%tail ~] path])

5774+ =/ inhabited=? &(inhabited.head inhabited.tail)

5775+ ?: |(&(=(%yes verdict.head) !inhabited.head) &(=(%yes verdict.tail) !inhabited.tail)) [%yes | left.tail ~]

5776+ ?: &(=(%no verdict.head) inhabited.tail) head(left left.tail)

5777+ ?: &(=(%no verdict.tail) inhabited.head) tail

5778+ ?: |(!=(%yes verdict.head) !=(%yes verdict.tail)) [%unknown inhabited left.tail ~]

5779+ [%yes inhabited left.tail ~]

5780+ %collection

5781+ ?. |(=(%list name.typ) =(%unit name.typ)) [%unknown | fuel ~]

5782+ ?. ?=([* ~] args.typ) [%unknown | fuel ~]

5783+ =/ item=igate-free $(typ i.args.typ, path [[%item ~] path])

5784+ item(inhabited &)

5785+ %union

5786+ ?~ cases.typ [%unknown | fuel ~]

5787+ (gate-free-types cases.typ fuel path 0)

5788+ %noun [%unknown & fuel ~]

5789+ %empty [%yes | fuel ~]

5790+ %var [%unknown | fuel ~]

5791+ %avar [%yes & fuel ~]

5792+ %rvar [%yes & fuel ~]

5793+ %nvar [%yes & fuel ~]

5794+ %rnvar [%yes & fuel ~]

5795+ %tag [%unknown | fuel ~]

5796+ %recursive [%unknown | fuel ~]

5797+ %jrec [%yes & fuel ~]

5798+ %grec [%unknown | fuel ~]

5799+ ==

5800+::

5801++$ igate-prelude-evidence [iface=ifile gates=(map term def)]

5802++$ dgo [left=itype right=itype at=span context=span]

4868−+$ istate [next=@ud sub=isub caps=icaps binders=(list @ud) molds=imolds globals=(list term) externals=iexternals surs=(list term) mark-externals=imark-externals marks=(list term) active=(list term) in-mold=?]

5803++$ istate [next=@ud sub=isub caps=icaps binders=(list @ud) molds=imolds globals=(list term) externals=iexternals surs=(list term) mark-externals=imark-externals marks=(list term) jimports=ijimports reserved-molds=(list term) params=iparams active=(list term) tags=(list ipending) in-mold=? at=path top-molds=(list term) prelude=(unit ifile) holes=(list ihole) jrec-fuel=@ud projections=(list iwprojection) gate-defs=(map term def) head-evidence=(unit igate-prelude-evidence) grec-index=(unit [at=path source=@t prelude=ifile shapes=(map term shape)]) defer=(unit ~) obligations=(list dgo)]

4869+$ idiag [msg=tape sites=(list [at=span note=tape])]

5804+$ idiag [msg=tape sites=(list [at=span note=tape])]

4870+$ iresult (each [typ=itype state=istate] idiag)

5805+$ iresult (each [typ=itype state=istate] idiag)

4871+$ isample-result (each [typ=itype env=ienv state=istate] tape)

5806+$ isample-result (each [typ=itype env=ienv state=istate] tape)

@@ -4885,22 +5820,189 @@

4885 |= [t=itype sub=isub]

5820 |= [t=itype sub=isub]

4886 ^- itype

5821 ^- itype

4887 =. t (itype-walk t sub)

5822 =. t (itype-walk t sub)

5823+ ?: ?=(%grec -.t) t(args (turn args.t |=(c=itype (itype-normalize c sub))))

5824+ ?: ?=(%collection -.t) [%collection name.t (turn args.t |=(c=itype (itype-normalize c sub)))]

5825+ ?: ?=(%union -.t)

5826+ [%union (turn cases.t |=(c=itype (itype-normalize c sub))) origin.t label.t (turn args.t |=(c=itype (itype-normalize c sub)))]

5827+ ?: ?=(%face -.t)

5828+ [%face name.t $(t body.t)]

4888 ?: ?=(%fn -.t)

5829 ?: ?=(%fn -.t)

4889 [%fn $(t sample.t) $(t product.t)]

5830 [%fn $(t sample.t) $(t product.t)]

4890 ?: ?=(%cell -.t)

5831 ?: ?=(%cell -.t)

4891 [%cell $(t hed.t) $(t tal.t)]

5832 [%cell $(t hed.t) $(t tal.t)]

4892 t

5833 t

4893::

5834::

5835+::

5836+:: Default decimal variables only in types with no gates. A gate can

5837+:: generalize an aura from its sample, which requires constraint analysis

5838+:: beyond this fragment; leave those cases unresolved.

5839+::

5840+:: This helper only controls decimal defaulting in visible types. A noun

5841+:: may contain gates and is not proof of a gate-free value.

5842+++ itype-has-gate

5843+ |= t=itype

5844+ ^- ?

5845+ ?- -.t

5846+ %fn &

5847+ %cell |($(t hed.t) $(t tal.t))

5848+ %recursive |

5849+ %jrec |

5850+ %grec &

5851+ %collection (lien args.t |=(c=itype (itype-has-gate c)))

5852+ %face $(t body.t)

5853+ %union (lien cases.t |=(c=itype (itype-has-gate c)))

5854+ %tag |

5855+ %const |

5856+ %var |

5857+ %avar |

5858+ %rvar |

5859+ %nvar |

5860+ %rnvar |

5861+ %atom |

5862+ %any-atom |

5863+ %flag |

5864+ %noun |

5865+ %empty |

5866+ ==

5867+::

5868+++ default-decimals

5869+ |= t=itype

5870+ ^- itype

5871+ ?: (itype-has-gate t) t

5872+ ?- -.t

5873+ %nvar [%atom %ud]

5874+ %rnvar [%atom %ud]

5875+ %grec t(args (turn args.t |=(c=itype (default-decimals c))))

5876+ %collection [%collection name.t (turn args.t |=(c=itype (default-decimals c)))]

5877+ %face [%face name.t $(t body.t)]

5878+ %cell [%cell $(t hed.t) $(t tal.t)]

5879+ * t

5880+ ==

5881+::

5882+:: A hole is solved only by a fully determined type or a written

5883+:: in-scope type variable. Ordinary fresh variables are not evidence.

5884+:: Compare representatives after substitution, since unification can

5885+:: orient a written capital toward the hole rather than the reverse.

5886+++ hole-variable-id

5887+ |= t=itype

5888+ ^- (unit @ud)

5889+ ?- -.t

5890+ %var `id.t

5891+ %avar `id.t

5892+ %rvar `id.t

5893+ %nvar `id.t

5894+ %rnvar `id.t

5895+ %tag `id.t

5896+ * ~

5897+ ==

5898+++ hole-same-variable

5899+ |= [a=itype b=itype]

5900+ ^- ?

5901+ =/ x=(unit @ud) (hole-variable-id a)

5902+ ?~ x |

5903+ =/ y=(unit @ud) (hole-variable-id b)

5904+ ?~ y |

5905+ =(u.x u.y)

5906+++ hole-known

5907+ |= [t=itype state=istate]

5908+ ^- ?

5909+ =. t (itype-walk t sub.state)

5910+ ?- -.t

5911+ ?(%var %avar %rvar %nvar %rnvar)

5912+ ?: (lien caps.state |=(c=icap (hole-same-variable t (itype-walk [%var id.c] sub.state)))) &

5913+ (lien params.state |=(p=[name=@t typ=itype] (hole-same-variable t (itype-walk typ.p sub.state))))

5914+ %tag |

5915+ %any-atom &

5916+ %union &((levy cases.t |=(c=itype (hole-known c state))) (levy args.t |=(c=itype (hole-known c state))))

5917+ %grec (levy args.t |=(c=itype (hole-known c state)))

5918+ %collection (levy args.t |=(c=itype (hole-known c state)))

5919+ %face $(t body.t)

5920+ %fn &($(t sample.t) $(t product.t))

5921+ %cell &($(t hed.t) $(t tal.t))

5922+ * &

5923+ ==

5924+++ promote-restricted-numbers

5925+ |= [state=istate env=ienv]

5926+ ^- istate

5927+ :: With no written capitals, there is nothing to promote.

5928+ ?~ caps.state state

5929+ =/ ids=(list @ud) (turn caps.state |=(c=icap id.c))

5930+ =/ free=(list @ud) (free-env-vars env sub.state)

5931+ |-

5932+ ?~ ids state

5933+ =/ t=itype (itype-walk [%var i.ids] sub.state)

5934+ ?: &(?=(%rnvar -.t) !(lien free |=(n=@ud =(n +.t))))

5935+ $(ids t.ids, state state(sub [[+.t [%rvar +.t]] sub.state]))

5936+ $(ids t.ids)

5937+::

5938+++ default-hole-numbers

5939+ |= [all=(list ihole) prior=(list ihole) state=istate env=ienv permit=?]

5940+ ^- istate

5941+ :: Do not default a named capital or a variable captured from env.

5942+ ?. permit state

5943+ ?: =(all prior) state

5944+ ?~ all state

5945+ =/ t=itype (itype-walk [%var id.i.all] sub.state)

5946+ =/ free=(list @ud) (free-env-vars env sub.state)

5947+ =? state &(?=(?(%nvar %rnvar) -.t) !(hole-known t state) !(lien free |=(id=@ud =(id id.t))))

5948+ state(sub [[id.t [%atom %ud]] sub.state])

5949+ $(all t.all)

5950+::

5951+:: Only obligations created inside this definition belong to it.

5952+++ holes-created

5953+ |= [all=(list ihole) prior=(list ihole)]

5954+ ^- (list ihole)

5955+ ?: =(all prior) ~

5956+ ?~ all ~

5957+ [i.all $(all t.all)]

5958+++ hole-uncertain

5959+ |= [t=itype state=istate]

5960+ ^- ?

5961+ =. t (itype-walk t sub.state)

5962+ ?- -.t

5963+ ?(%tag %nvar %rnvar %avar %rvar) !(hole-known t state)

5964+ %union |((lien cases.t |=(c=itype (hole-uncertain c state))) (lien args.t |=(c=itype (hole-uncertain c state))))

5965+ %grec (lien args.t |=(c=itype (hole-uncertain c state)))

5966+ %collection (lien args.t |=(c=itype (hole-uncertain c state)))

5967+ %face $(t body.t)

5968+ %fn |($(t sample.t) $(t product.t))

5969+ %cell |($(t hed.t) $(t tal.t))

5970+ * |

5971+ ==

5972+::

5973+++ unresolved-hole

5974+ |= [all=(list ihole) prior=(list ihole) state=istate]

5975+ ^- (unit idiag)

5976+ =/ work=(list ihole) (flop (holes-created all prior))

5977+ |-

5978+ ?~ work ~

5979+ ?: (hole-known [%var id.i.work] state) $(work t.work)

5980+ ?: (hole-uncertain [%var id.i.work] state)

5981+ `["type hole needs unsupported inference" ~[[at.i.work "type hole"]]]

5982+ `["type hole needs a determined type" ~[[at.i.work "unresolved type hole"]]]

5983+::

4894++ itype-vars

5984++ itype-vars

4895 |= t=itype

5985 |= t=itype

4896 ^- (list @ud)

5986 ^- (list @ud)

4897 ?- -.t

5987 ?- -.t

4898 %var ~[id.t]

5988 %var ~[id.t]

4899 %avar ~[id.t]

5989 %avar ~[id.t]

5990+ %rvar ~[id.t]

4900 %nvar ~[id.t]

5991 %nvar ~[id.t]

5992+ %rnvar ~[id.t]

4901 %atom ~

5993 %atom ~

4902 %any-atom ~

5994 %any-atom ~

4903 %flag ~

5995 %flag ~

5996+ %noun ~

5997+ %empty ~

5998+ %tag ~

5999+ %const ~

6000+ %union (zing (turn (weld args.t cases.t) |=(c=itype (itype-vars c))))

6001+ %recursive ~

6002+ %jrec ~

6003+ %grec (zing (turn args.t |=(c=itype (itype-vars c))))

6004+ %collection (zing (turn args.t |=(c=itype (itype-vars c))))

6005+ %face $(t body.t)

4904 %fn (weld $(t sample.t) $(t product.t))

6006 %fn (weld $(t sample.t) $(t product.t))

4905 %cell (weld $(t hed.t) $(t tal.t))

6007 %cell (weld $(t hed.t) $(t tal.t))

4906 ==

6008 ==

@@ -4926,13 +6028,31 @@

4926 =/ found=(unit itype) (itype-lookup id.t ren)

6028 =/ found=(unit itype) (itype-lookup id.t ren)

4927 ?~ found t

6029 ?~ found t

4928 u.found

6030 u.found

6031+ %rvar

6032+ =/ found=(unit itype) (itype-lookup id.t ren)

6033+ ?~ found t

6034+ u.found

4929 %nvar

6035 %nvar

4930 =/ found=(unit itype) (itype-lookup id.t ren)

6036 =/ found=(unit itype) (itype-lookup id.t ren)

4931 ?~ found t

6037 ?~ found t

4932 u.found

6038 u.found

6039+ %rnvar

6040+ =/ found=(unit itype) (itype-lookup id.t ren)

6041+ ?~ found t

6042+ u.found

4933 %atom t

6043 %atom t

4934 %any-atom t

6044 %any-atom t

4935 %flag t

6045 %flag t

6046+ %noun t

6047+ %empty t

6048+ %tag t

6049+ %const t

6050+ %union [%union (turn cases.t |=(c=itype (itype-rename c ren))) origin.t label.t (turn args.t |=(c=itype (itype-rename c ren)))]

6051+ %recursive t

6052+ %jrec t

6053+ %grec t(args (turn args.t |=(c=itype (itype-rename c ren))))

6054+ %collection [%collection name.t (turn args.t |=(c=itype (itype-rename c ren)))]

6055+ %face [%face name.t $(t body.t)]

4936 %fn [%fn $(t sample.t) $(t product.t)]

6056 %fn [%fn $(t sample.t) $(t product.t)]

4937 %cell [%cell $(t hed.t) $(t tal.t)]

6057 %cell [%cell $(t hed.t) $(t tal.t)]

4938 ==

6058 ==

@@ -4946,10 +6066,47 @@

4946 ?- -.t

6066 ?- -.t

4947 %var |

6067 %var |

4948 %avar =(n id.t)

6068 %avar =(n id.t)

6069+ %rvar =(n id.t)

4949 %nvar =(n id.t)

6070 %nvar =(n id.t)

6071+ %rnvar =(n id.t)

6072+ %atom |

6073+ %any-atom |

6074+ %flag |

6075+ %noun |

6076+ %empty |

6077+ %tag |

6078+ %const |

6079+ %union |((lien cases.t |=(c=itype (itype-var-is-atom n c))) (lien args.t |=(c=itype (itype-var-is-atom n c))))

6080+ %recursive |

6081+ %jrec |

6082+ %grec (lien args.t |=(c=itype (itype-var-is-atom n c)))

6083+ %collection (lien args.t |=(c=itype (itype-var-is-atom n c)))

6084+ %face $(t body.t)

6085+ %fn |($(t sample.t) $(t product.t))

6086+ %cell |($(t hed.t) $(t tal.t))

6087+ ==

6088+++ itype-var-is-restricted

6089+ |= [n=@ud t=itype]

6090+ ^- ?

6091+ ?- -.t

6092+ %var |

6093+ %avar |

6094+ %rvar =(n id.t)

6095+ %nvar |

6096+ %rnvar |

4950 %atom |

6097 %atom |

4951 %any-atom |

6098 %any-atom |

4952 %flag |

6099 %flag |

6100+ %noun |

6101+ %empty |

6102+ %tag |

6103+ %const |

6104+ %union |((lien cases.t |=(c=itype (itype-var-is-restricted n c))) (lien args.t |=(c=itype (itype-var-is-restricted n c))))

6105+ %recursive |

6106+ %jrec |

6107+ %grec (lien args.t |=(c=itype (itype-var-is-restricted n c)))

6108+ %collection (lien args.t |=(c=itype (itype-var-is-restricted n c)))

6109+ %face $(t body.t)

4953 %fn |($(t sample.t) $(t product.t))

6110 %fn |($(t sample.t) $(t product.t))

4954 %cell |($(t hed.t) $(t tal.t))

6111 %cell |($(t hed.t) $(t tal.t))

4955 ==

6112 ==

@@ -4964,7 +6121,7 @@

4964 =/ n=@ud 0

6121 =/ n=@ud 0

4965 |-

6122 |-

4966 ?~ vars (itype-rename t ren)

6123 ?~ vars (itype-rename t ren)

4967− =/ replacement=itype ?:((itype-var-is-atom i.vars t) [%avar n] [%var n])

6124+ =/ replacement=itype ?:((itype-var-is-restricted i.vars t) [%rvar n] ?:((itype-var-is-atom i.vars t) [%avar n] [%var n]))

4968 $(vars t.vars, ren [[i.vars replacement] ren], n +(n))

6125 $(vars t.vars, ren [[i.vars replacement] ren], n +(n))

4969::

6126::

4970++ instantiate-scheme

6127++ instantiate-scheme

@@ -4975,11 +6132,11 @@

4975 |-

6132 |-

4976 ?~ vars [(itype-rename typ.scheme ren) state]

6133 ?~ vars [(itype-rename typ.scheme ren) state]

4977 =/ replacement=itype

6134 =/ replacement=itype

4978− ?:((itype-var-is-atom i.vars typ.scheme) [%avar next.state] [%var next.state])

6135+ ?:((itype-var-is-restricted i.vars typ.scheme) [%rvar next.state] ?:((itype-var-is-atom i.vars typ.scheme) [%avar next.state] [%var next.state]))

4979 :: A generalized atom variable is a valid origin for re-generalizing

6136 :: A generalized atom variable is a valid origin for re-generalizing

4980 :: an alias, just as a sample binder is.

6137 :: an alias, just as a sample binder is.

4981 =/ st=istate state(next +(next.state))

6138 =/ st=istate state(next +(next.state))

4982− =? binders.st ?=(%avar -.replacement) [next.state binders.state]

6139+ =? binders.st |(?=(%avar -.replacement) ?=(%rvar -.replacement)) [next.state binders.state]

4983 $(vars t.vars, ren [[i.vars replacement] ren], state st)

6140 $(vars t.vars, ren [[i.vars replacement] ren], state st)

4984::

6141::

4985++ icap-lookup

6142++ icap-lookup

@@ -5010,20 +6167,202 @@

5010 $(ds t.ds)

6167 $(ds t.ds)

5011::

6168::

5012::

6169::

5013−:: The importer owns its algebra. Only successful %atom and %cell nouns

6170+:: The caller supplies unchanged results from the source-aware importer.

5014−:: in the supported subset are decoded here. In particular a singleton,

6171+:: That boundary is trusted for source provenance: a fork alone cannot

5015−:: face, union, collection or recursive reference must not be widened.

6172+:: reveal cases Hoon collapsed before it was constructed. Validate the

6173+:: supplied graph independently, including pairwise disjointness. Fixed

6174+:: atoms, term singletons, cells, faces and proven forks are decoded;

6175+:: unsupported singletons, collections and recursive references fail.

6176+::

6177+++ jibb-face-name

6178+ |= name=@

6179+ ^- ?

6180+ =/ chars=tape (trip (@t name))

6181+ ?~ chars |

6182+ ?. (is-lower i.chars) |

6183+ (levy t.chars |=(c=@tD (in c name-mask)))

6184+::

6185+:: A source-aware reader result is trusted for origin. Validate every

6186+:: supplied branch and keep the recursive mold opaque: unfolding its

6187+:: root while naming only its tail would change its type identity.

6188++$ irec-pattern [pat=upat has=?]

6189+++ rec-pattern

6190+ |= [node=* module=term name=term]

6191+ ^- (unit irec-pattern)

6192+ ?@ node ~

6193+ ?+ -.node ~

6194+ %atom

6195+ ?: ?=([%atom %n [~ @]] node)

6196+ ?. =(0 +>+.node) ~

6197+ `[[%atom `0] |]

6198+ ?: ?=([%atom %tas [~ @]] node)

6199+ =/ value=@ +>+.node

6200+ ?. |(=(value 0) (jibb-face-name value)) ~

6201+ `[[%atom `value] |]

6202+ ?. ?=([%atom @ ~] node) ~

6203+ =/ aura=@ta (@ta +<.node)

6204+ ?. |(?=(?(%u %ud %ux %uv %t %ta %tas %p %da %dr) aura) =('tD' aura)) ~

6205+ `[[%atom ~] |]

6206+ %ref

6207+ ?. ?=([%ref @ @] node) ~

6208+ ?. &(=(module +<.node) =(name +>.node)) ~

6209+ `[[%unknown ~] &]

6210+ %apply

6211+ ?. ?=([%apply %list [* ~]] node) ~

6212+ =/ item $(node -.+>.node)

6213+ ?~ item ~

6214+ `[[%or ~[[%atom `0] [%cell pat.u.item [%unknown ~]]]] has.u.item]

6215+ %face

6216+ ?. ?=([%face @ *] node) ~

6217+ ?. (jibb-face-name +<.node) ~

6218+ $(node +>.node)

6219+ %cell

6220+ ?. ?=([%cell * *] node) ~

6221+ =/ left $(node +<.node)

6222+ ?~ left ~

6223+ =/ right $(node +>.node)

6224+ ?~ right ~

6225+ `[[%cell pat.u.left pat.u.right] |(has.u.left has.u.right)]

6226+ %fork

6227+ =/ cases (rec-patterns +.node module name)

6228+ ?~ cases ~

6229+ ?~ pats.u.cases ~

6230+ ?~ t.pats.u.cases ~

6231+ ?. (rec-patterns-disjoint pats.u.cases) ~

6232+ `[[%or pats.u.cases] has.u.cases]

6233+ ==

6234+::

6235+++ rec-patterns

6236+ |= [nodes=* module=term name=term]

6237+ ^- (unit [pats=(list upat) has=?])

6238+ ?@ nodes ?:(=(nodes 0) `[~ |] ~)

6239+ =/ first (rec-pattern -.nodes module name)

6240+ ?~ first ~

6241+ =/ rest $(nodes +.nodes)

6242+ ?~ rest ~

6243+ `[[pat.u.first pats.u.rest] |(has.u.first has.u.rest)]

6244+::

6245+++ rec-patterns-disjoint

6246+ |= pats=(list upat)

6247+ ^- ?

6248+ ?~ pats &

6249+ ?. (levy t.pats |=(p=upat =(%disjoint (union-relate i.pats p)))) |

6250+ $(pats t.pats)

6251+::

6252+::

6253+::

6254+:: Repeated faces along an imported record spine fail closed. Hoon's type

6255+:: graph can erase unfaced nested-cell boundaries, so that alone does not

6256+:: prove the original source repeated a name within one record. A faced

6257+:: body and each union alternative have separate scopes. Check recursive

6258+:: roots before making them opaque; unused molds are never inspected.

6259+::

6260+++ imported-faces-valid

6261+ |= node=*

6262+ ^- ?

6263+ ?@ node &

6264+ ?+ -.node &

6265+ %face ?:(?=([%face @ *] node) $(node +>.node) |)

6266+ %cell ?:(?=([%cell * *] node) (imported-record-faces-valid node ~) |)

6267+ %fork (imported-faces-valid-list +.node)

6268+ %apply ?:(?=([%apply @ *] node) (imported-faces-valid-list +>.node) |)

6269+ %named

6270+ ?. ?=([%named @ @ *] node) |

6271+ =/ n=[%named module=@ name=@ body=*] ;;([%named module=@ name=@ body=*] node)

6272+ (imported-faces-valid body.n)

6273+ ==

6274+::

6275+++ imported-faces-valid-list

6276+ |= nodes=*

6277+ ^- ?

6278+ ?@ nodes =(nodes 0)

6279+ ?. (imported-faces-valid -.nodes) |

6280+ $(nodes +.nodes)

6281+::

6282+++ imported-record-faces-valid

6283+ |= [node=* names=(list @)]

6284+ ^- ?

6285+ ?: ?=([%cell * *] node)

6286+ =/ head=* +<.node

6287+ =/ rest=* +>.node

6288+ ?: ?=([%face @ *] head)

6289+ ?: (lien names |=(n=@ =(n +<.head))) |

6290+ ?. (imported-faces-valid +>.head) |

6291+ $(node rest, names [+<.head names])

6292+ ?. (imported-faces-valid head) |

6293+ $(node rest)

6294+ ?: ?=([%face @ *] node)

6295+ ?: (lien names |=(n=@ =(n +<.node))) |

6296+ (imported-faces-valid +>.node)

6297+ (imported-faces-valid node)

5016::

6298::

5017++ import-to-itype

6299++ import-to-itype

5018 |= node=*

6300 |= node=*

5019 ^- (unit itype)

6301 ^- (unit itype)

5020 ?@ node ~

6302 ?@ node ~

5021 ?+ -.node ~

6303 ?+ -.node ~

6304+ %noun ?:(=(node [%noun ~]) `[%noun ~] ~)

5022 %atom

6305 %atom

6306+ :: A Hoon loobean singleton is one of the two Jibb loobeans.

6307+ ?: ?=([%atom %f [~ @]] node)

6308+ =/ value=@ +>+.node

6309+ ?. |(=(value 0) =(value 1)) ~

6310+ =/ printed=@t ?:(=(value 0) '%.y' '%.n')

6311+ `[%const [%loobean %f value printed]]

6312+ :: Hoon's null singleton is the same noun as Jibb's `~` mold.

6313+ :: Other non-term singleton atoms remain unsupported here.

6314+ ?: ?=([%atom %n [~ @]] node)

6315+ ?. =(0 +>+.node) ~

6316+ `[%const [%null %n 0 '~']]

6317+ ?: ?=([%atom %tas [~ @]] node)

6318+ =/ value=@ +>+.node

6319+ ?. |(=(value 0) (jibb-face-name value)) ~

6320+ =/ printed=@t ?:(=(value 0) '%$' (cat 3 '%' value))

6321+ `[%const [%term %tas value printed]]

5023 ?. ?=([%atom @ ~] node) ~

6322 ?. ?=([%atom @ ~] node) ~

5024 =/ aura=@ta (@ta +<.node)

6323 =/ aura=@ta (@ta +<.node)

5025 ?. |(?=(?(%u %ud %ux %uv %t %ta %tas %p %da %dr) aura) =('tD' aura)) ~

6324 ?. |(?=(?(%u %ud %ux %uv %t %ta %tas %p %da %dr) aura) =('tD' aura)) ~

5026 `[%atom aura]

6325 `[%atom aura]

6326+ %named

6327+ ?. ?=([%named @ @ *] node) ~

6328+ =/ n=[%named module=@ name=@ body=*] ;;([%named module=@ name=@ body=*] node)

6329+ ?. &((jibb-face-name module.n) (jibb-face-name name.n)) ~

6330+ ?. ?=([%fork *] body.n) ~

6331+ =/ proof=(unit irec-pattern) (rec-pattern body.n (@tas module.n) (@tas name.n))

6332+ ?~ proof ~

6333+ ?. has.u.proof ~

6334+ `[%recursive (@tas module.n) (@tas name.n) `(crip "{(trip name.n)}.{(trip module.n)}")]

6335+ %apply

6336+ ?. ?=([%apply @ *] node) ~

6337+ =/ name=term (@tas +<.node)

6338+ =/ arity=@ud

6339+ ?: |(=(%list name) =(%unit name) =(%set name) =(%qeu name)) 1

6340+ ?: |(=(%map name) =(%mop name) =(%jar name) =(%jug name)) 2

6341+ 0

6342+ ?: =(arity 0) ~

6343+ =/ args=(unit (list itype)) (import-to-itypes +>.node)

6344+ ?~ args ~

6345+ ?. =(arity (lent u.args)) ~

6346+ `[%collection name u.args]

6347+ %fork

6348+ :: Hoon's ordinary ? mold is the fork of its two %f singletons.

6349+ =/ raw=* +.node

6350+ ?: |(=(raw ~[[%atom %f `0] [%atom %f `1]]) =(raw ~[[%atom %f `1] [%atom %f `0]]))

6351+ `[%flag ~]

6352+ =/ cases=(unit (list itype)) (import-to-itypes raw)

6353+ ?~ cases ~

6354+ ?~ u.cases ~

6355+ ?~ t.u.cases ~

6356+ ?: (import-has-loobean-singleton u.cases) ~

6357+ ?. (import-cases-disjoint u.cases) ~

6358+ `[%union u.cases ~ ~ ~]

6359+ %face

6360+ ?. ?=([%face @ *] node) ~

6361+ =/ name=@ +<.node

6362+ ?. (jibb-face-name name) ~

6363+ =/ body=(unit itype) $(node +>.node)

6364+ ?~ body ~

6365+ `[%face (@tas name) u.body]

5027 %cell

6366 %cell

5028 ?. ?=([%cell * *] node) ~

6367 ?. ?=([%cell * *] node) ~

5029 =/ left=(unit itype) $(node +<.node)

6368 =/ left=(unit itype) $(node +<.node)

@@ -5033,6 +6372,53 @@

5033 `[%cell u.left u.right]

6372 `[%cell u.left u.right]

5034 ==

6373 ==

5035::

6374::

6375+++ import-direct-loobean

6376+ |= t=itype

6377+ ^- ?

6378+ ?: ?=(%face -.t) $(t body.t)

6379+ ?: ?=(%union -.t) (import-has-loobean-singleton cases.t)

6380+ ?=([%const [%loobean *]] t)

6381+::

6382+++ import-has-loobean-singleton

6383+ |= cases=(list itype)

6384+ ^- ?

6385+ ?~ cases |

6386+ ?: (import-direct-loobean i.cases) &

6387+ $(cases t.cases)

6388+::

6389+++ import-to-itypes

6390+ |= nodes=*

6391+ ^- (unit (list itype))

6392+ ?@ nodes ?:(=(nodes 0) `~ ~)

6393+ =/ first (import-to-itype -.nodes)

6394+ ?~ first ~

6395+ =/ rest $(nodes +.nodes)

6396+ ?~ rest ~

6397+ `[u.first u.rest]

6398+::

6399+++ import-type-pattern

6400+ |= typ=itype

6401+ ^- upat

6402+ ?- -.typ

6403+ %noun [%all ~]

6404+ %empty [%empty ~]

6405+ %atom [%atom ~]

6406+ %flag [%or ~[[%atom `0] [%atom `1]]]

6407+ %const [%atom `val.literal.typ]

6408+ %face $(typ body.typ)

6409+ %cell [%cell $(typ hed.typ) $(typ tal.typ)]

6410+ %union [%or (turn cases.typ |=(t=itype (import-type-pattern t)))]

6411+ * [%unknown ~]

6412+ ==

6413+::

6414+++ import-cases-disjoint

6415+ |= cases=(list itype)

6416+ ^- ?

6417+ ?~ cases &

6418+ =/ first=upat (import-type-pattern i.cases)

6419+ ?. (levy t.cases |=(t=itype =(%disjoint (union-relate first (import-type-pattern t))))) |

6420+ $(cases t.cases)

6421+::

5036++ find-imported-mold

6422++ find-imported-mold

5037 |= [module=term name=term externals=iexternals surs=(list term)]

6423 |= [module=term name=term externals=iexternals surs=(list term)]

5038 ^- (unit itype)

6424 ^- (unit itype)

@@ -5044,7 +6430,15 @@

5044 =/ result=* result.i.found

6430 =/ result=* result.i.found

5045 ?@ result ~

6431 ?@ result ~

5046 ?. ?=(%& -.result) ~

6432 ?. ?=(%& -.result) ~

5047− (import-to-itype +.result)

6433+ =/ node=* +.result

6434+ ?. (imported-faces-valid node) ~

6435+ ?@ node (import-to-itype node)

6436+ ?: ?=(%ref -.node) (import-to-itype node)

6437+ =/ pattern=(unit irec-pattern) (rec-pattern node module name)

6438+ ?~ pattern (import-to-itype node)

6439+ ?. has.u.pattern (import-to-itype node)

6440+ `[%recursive module name `(crip "{(trip name)}.{(trip module)}")]

6441+

5048::

6442::

5049++ collect-sur-imports

6443++ collect-sur-imports

5050 |= imports=(list import)

6444 |= imports=(list import)

@@ -5073,29 +6467,410 @@

5073 =/ result=* result.i.found

6467 =/ result=* result.i.found

5074 ?@ result ~

6468 ?@ result ~

5075 ?. ?=(%& -.result) ~

6469 ?. ?=(%& -.result) ~

6470+ ?. (imported-faces-valid +.result) ~

5076 (import-to-itype +.result)

6471 (import-to-itype +.result)

5077::

6472::

5078−++ infer-simple-shape

6473+++ find-jibb-interface

5079− |= [sh=shape state=istate]

6474+ |= [face=term imports=ijimports]

5080− ^- (unit [typ=itype state=istate])

6475+ ^- (unit ifile)

5081− ?- -.sh

6476+ ?~ imports ~

5082− %aura

6477+ ?: =(face face.i.imports) `interface.i.imports

5083− ?: =(0 aura.sh) `[[%any-atom ~] state]

6478+ $(imports t.imports)

5084− `[[%atom aura.sh] state]

6479+::

5085− %flag `[[%flag ~] state]

6480+++ find-jibb-mold

5086− %cell (infer-simple-fields fields.sh state)

6481+ |= [name=term iface=ifile]

5087− %fn

6482+ ^- (unit ischeme)

5088− =/ arg=(unit [typ=itype state=istate]) $(sh sample.sh)

6483+ =/ ms=imold-types molds.iface

5089− ?~ arg ~

6484+ |-

5090− =/ out=(unit [typ=itype state=istate]) $(sh product.sh, state state.u.arg)

6485+ ?~ ms ~

5091− ?~ out ~

6486+ ?: =(name name.i.ms) `template.i.ms

5092− `[[%fn typ.u.arg typ.u.out] state.u.out]

6487+ $(ms t.ms)

5093− %ref

6488+::

5094− ?~ names.sh ~

6489+:: An exported alias may name a union from another module. Only a

5095− =/ n=term i.names.sh

6490+:: nongeneric alias of the same origin is usable through this import face.

5096− ?^ t.names.sh

6491+::

5097− ?^ t.t.names.sh ~

6492+++ imported-union-alias

5098− =/ found=(unit itype)

6493+ |= [origin=[at=path name=term] molds=imold-types]

6494+ ^- (unit term)

6495+ ?~ molds ~

6496+ =/ template=ischeme template.i.molds

6497+ ?: &(?=(~ vars.template) ?=(%union -.typ.template))

6498+ ?:(=(`origin origin.typ.template) `name.i.molds $(molds t.molds))

6499+ $(molds t.molds)

6500+::

6501+:: A prelude union alias is a display name, not a new union identity. An

6502+:: identity-generic alias can carry the origin's arguments only when the

6503+:: origin, arity and ordered parameters match. Swapped, repeated, fixed

6504+:: or phantom parameters cannot be printed that way and remain unsupported

6505+:: when their only available name is private. A nongeneric alias of a

6506+:: generic instantiation cannot be printed with the origin's arguments.

6507+++ identity-union-parameters

6508+ |= [vars=(list @ud) args=(list itype)]

6509+ ^- ?

6510+ ?~ vars ?=(~ args)

6511+ ?~ args |

6512+ ?. =([%var i.vars] i.args) |

6513+ $(vars t.vars, args t.args)

6514+++ prelude-union-alias

6515+ |= [origin=[at=path name=term] args=(list itype) molds=imold-types]

6516+ ^- (unit term)

6517+ ?~ molds ~

6518+ =/ template=ischeme template.i.molds

6519+ ?. ?=(%union -.typ.template) $(molds t.molds)

6520+ ?. =(`origin origin.typ.template) $(molds t.molds)

6521+ ?~ vars.template

6522+ ?^ args $(molds t.molds)

6523+ ?:(=(args args.typ.template) `name.i.molds $(molds t.molds))

6524+ ?: &((identity-union-parameters vars.template args.typ.template) =((lent vars.template) (lent args)))

6525+ `name.i.molds

6526+ $(molds t.molds)

6527+::

6528+:: Names exported by the directly imported module are visible through its

6529+:: face; a matching prelude alias is also visible without a qualifier.

6530+::

6531+++ jrec-alias

6532+ |= [origin=path name=term molds=imold-types]

6533+ ^- (unit term)

6534+ ?~ molds ~

6535+ =/ template=ischeme template.i.molds

6536+ ?: &(?=(~ vars.template) ?=(%jrec -.typ.template) =(at.typ.template origin) =(name.typ.template name)) `name.i.molds

6537+ $(molds t.molds)

6538+::

6539+++ grec-visible-alias

6540+ |= [origin=path name=term proof=shape args=(list itype) molds=imold-types]

6541+ ^- (unit term)

6542+ ?~ molds ~

6543+ =/ template=ischeme template.i.molds

6544+ ?. ?=(%grec -.typ.template) $(molds t.molds)

6545+ ?. &(=(at.typ.template origin) =(name.typ.template name) =(proof.typ.template proof)) $(molds t.molds)

6546+ ?. &((identity-union-parameters vars.template args.typ.template) =((lent vars.template) (lent args))) $(molds t.molds)

6547+ `name.i.molds

6548+::

6549+++ itype-in-import

6550+ |= [t=itype iface=ifile face=term prelude=(unit ifile)]

6551+ ^- itype

6552+ ?- -.t

6553+ %union

6554+ =/ label=(unit @t)

6555+ ?~ origin.t ~

6556+ ?: =(at.u.origin.t /lib/jibb/prelude/jibb) `name.u.origin.t

6557+ =/ public=(unit term)

6558+ ?~ prelude ~

6559+ (prelude-union-alias u.origin.t args.t molds.u.prelude)

6560+ ?^ public `u.public

6561+ =/ alias=(unit term) ~

6562+ =? alias &(=(at.u.origin.t at.iface) ?=(^ (find-jibb-mold name.u.origin.t iface))) `name.u.origin.t

6563+ =? alias ?=(~ alias) (imported-union-alias u.origin.t molds.iface)

6564+ ?~ alias ~

6565+ `(crip "{(trip u.alias)}.{(trip face)}")

6566+ [%union (turn cases.t |=(c=itype (itype-in-import c iface face prelude))) origin.t label (turn args.t |=(c=itype (itype-in-import c iface face prelude)))]

6567+ %recursive [%recursive module.t name.t ~]

6568+ %grec

6569+ =/ public=(unit term) ?~(prelude ~ (grec-visible-alias at.t name.t proof.t args.t molds.u.prelude))

6570+ =/ alias=(unit term) ?~(public (grec-visible-alias at.t name.t proof.t args.t molds.iface) public)

6571+ =/ label=(unit @t) ?~(alias ~ ?~(public `(crip "{(trip u.alias)}.{(trip face)}") `u.alias))

6572+ t(label label, args (turn args.t |=(c=itype (itype-in-import c iface face prelude))))

6573+ %jrec

6574+ =/ public=(unit term) ?~(prelude ~ (jrec-alias at.t name.t molds.u.prelude))

6575+ ?^ public t(label `u.public)

6576+ =/ alias=(unit term) (jrec-alias at.t name.t molds.iface)

6577+ ?~ alias t(label ~)

6578+ t(label `(crip "{(trip u.alias)}.{(trip face)}"))

6579+ %collection [%collection name.t (turn args.t |=(c=itype (itype-in-import c iface face prelude)))]

6580+ %face [%face name.t $(t body.t)]

6581+ %fn [%fn $(t sample.t) $(t product.t)]

6582+ %cell [%cell $(t hed.t) $(t tal.t)]

6583+ * t

6584+ ==

6585+::

6586+++ label-direct-union

6587+ |= [typ=itype body=shape name=term state=istate]

6588+ ^- itype

6589+ ?. ?=(%union -.typ) typ

6590+ =/ direct=? ?=(%union -.body)

6591+ =? direct ?=(%generic -.body) ?=(%union -.body.body)

6592+ ?. direct typ

6593+ ?. (lien top-molds.state |=(n=term =(n name))) typ

6594+ [%union cases.typ `[at.state name] `name args.typ]

6595+::

6596+:: Generic mold parameters are lexical and distinct from the enclosing

6597+:: value's capital variables. Arguments are substituted only once, so

6598+:: an argument's variable ID cannot be captured by a template ID.

6599+:: A generic alias of a named union keeps the underlying union's origin

6600+:: and substituted argument order; an originless union stays unsupported.

6601+::

6602+++ iparam-lookup

6603+ |= [name=@t params=iparams]

6604+ ^- (unit itype)

6605+ ?~ params ~

6606+ ?: =(name name.i.params) `typ.i.params

6607+ $(params t.params)

6608+::

6609+++ distinct-params

6610+ |= names=(list @t)

6611+ ^- ?

6612+ ?~ names &

6613+ ?: (lien t.names |=(n=@t =(n i.names))) |

6614+ $(names t.names)

6615+::

6616+++ bind-params

6617+ |= [names=(list @t) args=(list itype)]

6618+ ^- (unit iparams)

6619+ ?~ names ?~(args `~ ~)

6620+ ?~ args ~

6621+ =/ rest=(unit iparams) $(names t.names, args t.args)

6622+ ?~ rest ~

6623+ `[[i.names i.args] u.rest]

6624+::

6625+++ template-apply

6626+ |= [template=ischeme args=(list itype)]

6627+ ^- (unit itype)

6628+ =/ vars=(list @ud) vars.template

6629+ =/ ren=isub ~

6630+ |-

6631+ ?~ vars ?~(args `(itype-rename typ.template ren) ~)

6632+ ?~ args ~

6633+ $(vars t.vars, args t.args, ren [[i.vars i.args] ren])

6634+::

6635+++ infer-shape-args

6636+ |= [args=(list shape) state=istate]

6637+ ^- (unit [types=(list itype) state=istate])

6638+ ?~ args `[~ state]

6639+ =/ head=(unit [typ=itype state=istate]) (infer-simple-shape i.args state)

6640+ ?~ head ~

6641+ =/ tail=(unit [types=(list itype) state=istate]) $(args t.args, state state.u.head)

6642+ ?~ tail ~

6643+ `[[typ.u.head types.u.tail] state.u.tail]

6644+::

6645+++ fresh-mold-params

6646+ |= [names=(list @t) next=@ud]

6647+ ^- [params=iparams vars=(list @ud) next=@ud]

6648+ ?~ names [~ ~ next]

6649+ =/ rest=[params=iparams vars=(list @ud) next=@ud] $(names t.names, next +(next))

6650+ [[[i.names [%var next]] params.rest] [next vars.rest] next.rest]

6651+::

6652+:: Recognize a unique top-level source mold with exactly a null case and a

6653+:: faced atom-headed cell whose faced tail names that same mold. Its Jibb

6654+:: path and name provide nominal identity. Other recursive shapes fail closed;

6655+:: construction and matching expose the proven shape one layer at a time.

6656+++ simple-source-recursive

6657+ |= [name=term sh=shape state=istate]

6658+ ^- (unit itype)

6659+ ?. (lien top-molds.state |=(n=term =(n name))) ~

6660+ =/ original=(unit shape) (find-simple-mold name molds.state)

6661+ ?~ original ~

6662+ ?. =(u.original sh) ~

6663+ ?. ?=(%union -.sh) ~

6664+ =/ cs=(list shape) cases.sh

6665+ ?~ cs ~

6666+ ?~ t.cs ~

6667+ ?^ t.t.cs ~

6668+ ?. ?=(%const -.i.cs) ~

6669+ ?. =(%null form.lit.i.cs) ~

6670+ ?. ?=(%cell -.i.t.cs) ~

6671+ =/ fs=(list field) fields.i.t.cs

6672+ ?~ fs ~

6673+ ?~ t.fs ~

6674+ ?^ t.t.fs ~

6675+ ?. ?=(%face -.i.fs) ~

6676+ ?. ?=(%aura -.shape.i.fs) ~

6677+ ?. !=(0 aura.shape.i.fs) ~

6678+ ?. ?=(%face -.i.t.fs) ~

6679+ ?. !=(name.i.fs name.i.t.fs) ~

6680+ =/ tail=shape shape.i.t.fs

6681+ ?. ?=(%ref -.tail) ~

6682+ ?. =(names.tail ~[name]) ~

6683+ `[%jrec at.state name `name name.i.fs aura.shape.i.fs name.i.t.fs]

6684+::

6685+++ simple-source-generic-recursive

6686+ |= [name=term sh=shape args=(list itype) state=istate]

6687+ ^- (unit itype)

6688+ ?. ?=(%generic -.sh) ~

6689+ ?. ?=([@ ~] vars.sh) ~

6690+ ?. ?=([* ~] args) ~

6691+ ?~ grec-index.state ~

6692+ ?. =(at.u.grec-index.state at.state) ~

6693+ ?~ prelude.state ~

6694+ ?. =(prelude.u.grec-index.state u.prelude.state) ~

6695+ =/ proof=(unit shape) (~(get by shapes.u.grec-index.state) name)

6696+ ?~ proof ~

6697+ ?. =(u.proof sh) ~

6698+ `[%grec at.state name `name sh args]

6699+::

6700+

6701+++ infer-mold-template

6702+ |= [sh=shape state=istate]

6703+ ^- (unit [template=ischeme state=istate])

6704+ =/ generic=(unit itype)

6705+ ?. ?=([@ ~] active.state) ~

6706+ (simple-source-generic-recursive i.active.state sh ~[[%var next.state]] state)

6707+ ?^ generic `[[u.generic ~[next.state]] state(next +(next.state))]

6708+ =/ direct=(unit itype)

6709+ ?. ?=([@ ~] active.state) ~

6710+ (simple-source-recursive i.active.state sh state)

6711+ ?^ direct `[[u.direct ~] state]

6712+ ?: ?=(%generic -.sh)

6713+ ?~ vars.sh ~

6714+ ?. (distinct-params vars.sh) ~

6715+ =/ fresh=[params=iparams vars=(list @ud) next=@ud] (fresh-mold-params vars.sh next.state)

6716+ =/ out=(unit [typ=itype state=istate])

6717+ (infer-simple-shape body.sh state(next next.fresh, params params.fresh, in-mold &))

6718+ ?~ out ~

6719+ ?^ (unresolved-hole holes.state.u.out holes.state state.u.out) ~

6720+ ?: &(?=(%union -.typ.u.out) !?=(%union -.body.sh) ?=(~ origin.typ.u.out)) ~

6721+ =? typ.u.out &(?=(%union -.typ.u.out) ?=(%union -.body.sh))

6722+ typ.u.out(args (turn vars.fresh |=(n=@ud `itype`[%var n])))

6723+ =/ used=(list @ud) (itype-vars typ.u.out)

6724+ ?. (levy used |=(n=@ud (lien vars.fresh |=(p=@ud =(p n))))) ~

6725+ `[[typ.u.out vars.fresh] state.u.out(params params.state, in-mold in-mold.state, holes holes.state)]

6726+ =/ out=(unit [typ=itype state=istate])

6727+ (infer-simple-shape sh state(params ~, in-mold &))

6728+ ?~ out ~

6729+ ?^ (unresolved-hole holes.state.u.out holes.state state.u.out) ~

6730+ ?: ?=(^ (itype-vars typ.u.out)) ~

6731+ `[[typ.u.out ~] state.u.out(params params.state, in-mold in-mold.state, holes holes.state)]

6732+::

6733+:: A direct imported reference may carry definite reader evidence. Only

6734+:: uniquely supplied, declared inputs are used; unsupported data stay generic.

6735+++ direct-import-invalid

6736+ |= [sh=shape state=istate]

6737+ ^- (unit idiag)

6738+ ?. ?=(%ref -.sh) ~

6739+ ?~ names.sh ~

6740+ =/ n=term i.names.sh

6741+ =/ raw=*

6742+ ?~ t.names.sh

6743+ ?. (unique-value-name n marks.state) ~

6744+ ?: (lien surs.state |=(x=term =(x n))) ~

6745+ ?: ?=(^ (find-jibb-interface n jimports.state)) ~

6746+ ?: (lien globals.state |=(x=term =(x n))) ~

6747+ ?: (lien reserved-molds.state |=(x=term =(x n))) ~

6748+ ?: (lien molds.state |=(m=[name=term body=shape] =(n name.m))) ~

6749+ =/ found=imark-externals (skim mark-externals.state |=(e=[mark=term result=*] =(mark.e n)))

6750+ ?~ found ~

6751+ ?^ t.found ~

6752+ result.i.found

6753+ ?^ t.t.names.sh ~

6754+ =/ mod=term i.t.names.sh

6755+ ?: ?=(^ (find-jibb-interface mod jimports.state)) ~

6756+ ?. (unique-value-name mod surs.state) ~

6757+ ?: (lien marks.state |=(x=term =(x mod))) ~

6758+ ?: (lien globals.state |=(x=term =(x mod))) ~

6759+ ?: (lien reserved-molds.state |=(x=term =(x mod))) ~

6760+ ?: (lien molds.state |=(m=[name=term body=shape] =(mod name.m))) ~

6761+ =/ found=iexternals (skim externals.state |=(e=[module=term name=term result=*] &(=(module.e mod) =(name.e n))))

6762+ ?~ found ~

6763+ ?^ t.found ~

6764+ result.i.found

6765+ ?. ?=([%invalid ?(%aura %core %overlap) @] raw) ~

6766+ `["{(trip +>.raw)}" ~[[at.sh "invalid imported mold"]]]

6767+::

6768+:: Replay only the shape branches whose evaluation order we can prove.

6769+:: Successful prefixes must be checked before descending to a failure.

6770+++ nested-import-invalid

6771+ |= [sh=shape state=istate]

6772+ ^- (unit idiag)

6773+ ?: ?=(^ (infer-simple-shape sh state)) ~

6774+ ?- -.sh

6775+ %ref

6776+ =/ direct=(unit idiag) (direct-import-invalid sh state)

6777+ ?^ direct direct

6778+ ?~ names.sh ~

6779+ ?^ t.names.sh ~

6780+ =/ n=term i.names.sh

6781+ ?: (lien marks.state |=(x=term =(x n))) ~

6782+ ?: (lien active.state |=(x=term =(x n))) ~

6783+ =/ found=(unit shape) (find-simple-mold n molds.state)

6784+ ?~ found ~

6785+ $(sh u.found, state state(active [n active.state], in-mold &, params ~))

6786+ %fn

6787+ =/ first=(unit [typ=itype state=istate]) (infer-simple-shape sample.sh state)

6788+ ?~ first $(sh sample.sh)

6789+ $(sh product.sh, state state.u.first)

6790+ %cell (nested-field-invalid fields.sh state)

6791+ * ~

6792+ ==

6793+::

6794+++ nested-field-invalid

6795+ |= [fields=(list field) state=istate]

6796+ ^- (unit idiag)

6797+ ?~ fields ~

6798+ =/ sh=shape

6799+ ?- -.i.fields

6800+ %bare shape.i.fields

6801+ %face shape.i.fields

6802+ %pun [%ref at.i.fields ~[name.i.fields]]

6803+ ==

6804+ =/ out=(unit [typ=itype state=istate]) (infer-simple-shape sh state)

6805+ ?~ out (nested-import-invalid sh state)

6806+ $(fields t.fields, state state.u.out)

6807+::

6808+++ sample-import-invalid

6809+ |= [s=sample env=ienv state=istate]

6810+ ^- (unit idiag)

6811+ =/ result=isample-result (infer-sample s env state)

6812+ ?: ?=(%& -.result) ~

6813+ ?. =(p.result "sample mold is not supported by partial inference") ~

6814+ ?- s

6815+ [%face *] (nested-import-invalid shape.s state)

6816+ [%bare *] (nested-import-invalid shape.s state)

6817+ [%pun *] (nested-import-invalid [%ref at.s ~[name.s]] state)

6818+ [%cell *] (nested-samples-invalid items.s env state)

6819+ * ~

6820+ ==

6821+::

6822+++ nested-samples-invalid

6823+ |= [items=(list sample) env=ienv state=istate]

6824+ ^- (unit idiag)

6825+ ?~ items ~

6826+ =/ head=isample-result (infer-sample i.items env state)

6827+ ?: ?=(%| -.head) (sample-import-invalid i.items env state)

6828+ $(items t.items, env env.p.head, state state.p.head)

6829+::

6830+++ infer-simple-shape

6831+ |= [sh=shape state=istate]

6832+ ^- (unit [typ=itype state=istate])

6833+ ?- -.sh

6834+ %hole `[[%var next.state] state(next +(next.state), holes [[next.state at.sh] holes.state])]

6835+ %aura

6836+ ?: =(0 aura.sh) `[[%any-atom ~] state]

6837+ `[[%atom aura.sh] state]

6838+ %flag `[[%flag ~] state]

6839+ %noun `[[%noun ~] state]

6840+ %void `[[%empty ~] state]

6841+ %const

6842+ ?. |(=(%term form.lit.sh) =(%null form.lit.sh) =(%loobean form.lit.sh)) ~

6843+ ?: &(=(%loobean form.lit.sh) !|(=(0 val.lit.sh) =(1 val.lit.sh))) ~

6844+ `[[%const lit.sh] state]

6845+ %union

6846+ =/ pairs=(list upair) (union-pairs cases.sh molds.state)

6847+ ?: (lien pairs |=(p=upair =(%overlap relation.p))) ~

6848+ =/ source-proof=?

6849+ ?: (levy pairs |=(p=upair =(%disjoint relation.p))) &

6850+ &((union-source-state-safe state 256) (union-source-distinct-tags cases.sh molds.state 256))

6851+ ?. source-proof ~

6852+ =/ cs=(unit [types=(list itype) state=istate]) (infer-shape-args cases.sh state)

6853+ ?~ cs ~

6854+ `[[%union types.u.cs ~ ~ ~] state.u.cs]

6855+ %cell (infer-simple-fields fields.sh state)

6856+ %fn

6857+ =/ arg=(unit [typ=itype state=istate]) $(sh sample.sh)

6858+ ?~ arg ~

6859+ =/ out=(unit [typ=itype state=istate]) $(sh product.sh, state state.u.arg)

6860+ ?~ out ~

6861+ `[[%fn typ.u.arg typ.u.out] state.u.out]

6862+ %ref

6863+ ?~ names.sh ~

6864+ =/ n=term i.names.sh

6865+ ?^ t.names.sh

6866+ ?^ t.t.names.sh ~

6867+ =/ iface=(unit ifile) (find-jibb-interface i.t.names.sh jimports.state)

6868+ ?^ iface

6869+ =/ found=(unit ischeme) (find-jibb-mold n u.iface)

6870+ ?~ found ~

6871+ ?^ vars.u.found ~

6872+ `[(itype-in-import typ.u.found u.iface i.t.names.sh prelude.state) state]

6873+ =/ found=(unit itype)

5099 (find-imported-mold i.t.names.sh n externals.state surs.state)

6874 (find-imported-mold i.t.names.sh n externals.state surs.state)

5100 ?~ found ~

6875 ?~ found ~

5101 `[u.found state]

6876 `[u.found state]

@@ -5106,16 +6881,68 @@

5106 `[u.imported state]

6881 `[u.imported state]

5107 ?: (lien active.state |=(x=term =(x n))) ~

6882 ?: (lien active.state |=(x=term =(x n))) ~

5108 =/ found=(unit shape) (find-simple-mold n molds.state)

6883 =/ found=(unit shape) (find-simple-mold n molds.state)

5109− ?~ found ~

6884+ ?~ found

6885+ ?: (lien molds.state |=(m=[name=term body=shape] =(name.m n))) ~

6886+ ?~ prelude.state ~

6887+ =/ prelude-entry=(unit ischeme) (find-jibb-mold n u.prelude.state)

6888+ ?~ prelude-entry ~

6889+ ?^ vars.u.prelude-entry ~

6890+ `[typ.u.prelude-entry state]

6891+ =/ direct=(unit itype) (simple-source-recursive n u.found state)

6892+ ?^ direct `[u.direct state]

5110 =/ out=(unit [typ=itype state=istate])

6893 =/ out=(unit [typ=itype state=istate])

5111− $(sh u.found, state state(active [n active.state], in-mold &))

6894+ $(sh u.found, state state(active [n active.state], in-mold &, params ~))

5112 ?~ out ~

6895 ?~ out ~

6896+ ?^ (unresolved-hole holes.state.u.out holes.state state.u.out) ~

5113− `[typ.u.out state.u.out(active active.state, in-mold in-mold.state)]

6897+ `[(label-direct-union typ.u.out u.found n state) state.u.out(active active.state, in-mold in-mold.state, params params.state, holes holes.state)]

6898+ %apply

6899+ ?~ ref.sh ~

6900+ =/ args=(unit [types=(list itype) state=istate]) (infer-shape-args args.sh state)

6901+ ?~ args ~

6902+ =/ n=term i.ref.sh

6903+ ?^ t.ref.sh

6904+ ?^ t.t.ref.sh ~

6905+ =/ iface=(unit ifile) (find-jibb-interface i.t.ref.sh jimports.state.u.args)

6906+ ?~ iface ~

6907+ =/ template=(unit ischeme) (find-jibb-mold n u.iface)

6908+ ?~ template ~

6909+ ?~ vars.u.template ~

6910+ =/ applied=(unit itype) (template-apply u.template types.u.args)

6911+ ?~ applied ~

6912+ `[(itype-in-import u.applied u.iface i.t.ref.sh prelude.state.u.args) state.u.args]

6913+ ?: (lien active.state.u.args |=(x=term =(x n))) ~

6914+ =/ found=(unit shape) (find-simple-mold n molds.state.u.args)

6915+ ?~ found

6916+ ?: (lien molds.state.u.args |=(m=[name=term body=shape] =(name.m n))) ~

6917+ ?~ prelude.state.u.args ~

6918+ =/ prelude-entry=(unit ischeme) (find-jibb-mold n u.prelude.state.u.args)

6919+ ?~ prelude-entry ~

6920+ ?~ vars.u.prelude-entry ~

6921+ =/ applied=(unit itype) (template-apply u.prelude-entry types.u.args)

6922+ ?~ applied ~

6923+ `[u.applied state.u.args]

6924+ ?. ?=(%generic -.u.found) ~

6925+ =/ grec=(unit itype) (simple-source-generic-recursive n u.found types.u.args state.u.args)

6926+ ?^ grec `[u.grec state.u.args]

6927+ ?. (distinct-params vars.u.found) ~

6928+ =/ params=(unit iparams) (bind-params vars.u.found types.u.args)

6929+ ?~ params ~

6930+ =/ out=(unit [typ=itype state=istate])

6931+ $(sh body.u.found, state state.u.args(active [n active.state.u.args], in-mold &, params u.params))

6932+ ?~ out ~

6933+ ?^ (unresolved-hole holes.state.u.out holes.state.u.args state.u.out) ~

6934+ ?: &(?=(%union -.typ.u.out) !?=(%union -.body.u.found) ?=(~ origin.typ.u.out)) ~

6935+ ?: &(?=(%union -.typ.u.out) ?=(%union -.body.u.found) !(lien top-molds.state.u.args |=(x=term =(x n)))) ~

6936+ =? typ.u.out &(?=(%union -.typ.u.out) ?=(%union -.body.u.found))

6937+ (label-direct-union typ.u.out(args types.u.args) u.found n state.u.args)

6938+ `[typ.u.out state.u.out(active active.state.u.args, in-mold in-mold.state.u.args, params params.state.u.args, holes holes.state.u.args)]

5114 %tvar

6939 %tvar

6940+ =/ param=(unit itype) (iparam-lookup name.sh params.state)

6941+ ?^ param `[u.param state]

5115 ?: in-mold.state ~

6942 ?: in-mold.state ~

5116 =/ n=(unit @ud) (icap-lookup name.sh caps.state)

6943 =/ n=(unit @ud) (icap-lookup name.sh caps.state)

5117 ?^ n `[[%var u.n] state]

6944 ?^ n `[[%var u.n] state]

5118− `[[%var next.state] state(next +(next.state), caps [[name.sh next.state] caps.state])]

6945+ `[[%var next.state] state(next +(next.state), caps [[name.sh next.state at.sh] caps.state])]

5119 * ~

6946 * ~

5120 ==

6947 ==

5121::

6948::

@@ -5123,25 +6950,37 @@

5123 |= [fields=(list field) state=istate]

6950 |= [fields=(list field) state=istate]

5124 ^- (unit [typ=itype state=istate])

6951 ^- (unit [typ=itype state=istate])

5125 ?~ fields ~

6952 ?~ fields ~

6953+ =/ field-shape=shape

6954+ ?- -.i.fields

5126− ?. ?=(%bare -.i.fields) ~

6955+ %bare shape.i.fields

6956+ %face shape.i.fields

6957+ %pun [%ref at.i.fields ~[name.i.fields]]

6958+ ==

5127− =/ head=(unit [typ=itype state=istate]) (infer-simple-shape shape.i.fields state)

6959+ =/ head=(unit [typ=itype state=istate]) (infer-simple-shape field-shape state)

5128 ?~ head ~

6960 ?~ head ~

6961+ =/ t=itype typ.u.head

6962+ =. t

6963+ ?- -.i.fields

6964+ %bare t

6965+ %face [%face name.i.fields t]

6966+ %pun [%face name.i.fields t]

6967+ ==

5129− ?~ t.fields head

6968+ ?~ t.fields `[t state.u.head]

5130 =/ tail=(unit [typ=itype state=istate]) $(fields t.fields, state state.u.head)

6969 =/ tail=(unit [typ=itype state=istate]) $(fields t.fields, state state.u.head)

5131 ?~ tail ~

6970 ?~ tail ~

5132− `[[%cell typ.u.head typ.u.tail] state.u.tail]

6971+ `[[%cell t typ.u.tail] state.u.tail]

5133::

6972::

5134++ infer-sample

6973++ infer-sample

5135 |= [s=sample env=ienv state=istate]

6974 |= [s=sample env=ienv state=istate]

5136 ^- isample-result

6975 ^- isample-result

5137 ?- -.s

6976 ?- -.s

5138 %bind

6977 %bind

5139− ?: |(?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

6978+ ?: |(=(name.s %proj) ?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

5140 [%| "sample shadows a name"]

6979 [%| "sample shadows a name"]

5141 =/ t=itype [%var next.state]

6980 =/ t=itype [%var next.state]

5142 [%& t [[name.s [t ~]] env] state(next +(next.state), binders [next.state binders.state])]

6981 [%& t [[name.s [t ~]] env] state(next +(next.state), binders [next.state binders.state])]

5143 %face

6982 %face

5144− ?: |(?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

6983+ ?: |(=(name.s %proj) ?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

5145 [%| "sample shadows a name"]

6984 [%| "sample shadows a name"]

5146 =/ t=(unit [typ=itype state=istate]) (infer-simple-shape shape.s state)

6985 =/ t=(unit [typ=itype state=istate]) (infer-simple-shape shape.s state)

5147 ?~ t [%| "sample mold is not supported by partial inference"]

6986 ?~ t [%| "sample mold is not supported by partial inference"]

@@ -5150,13 +6989,1369 @@

5150 =/ t=(unit [typ=itype state=istate]) (infer-simple-shape shape.s state)

6989 =/ t=(unit [typ=itype state=istate]) (infer-simple-shape shape.s state)

5151 ?~ t [%| "sample mold is not supported by partial inference"]

6990 ?~ t [%| "sample mold is not supported by partial inference"]

5152 [%& typ.u.t env state.u.t]

6991 [%& typ.u.t env state.u.t]

5153− * [%| "sample is not supported by partial inference"]

6992+ %pun

6993+ $(s [%face at.s name.s [%ref at.s ~[name.s]]])

6994+ %cell

6995+ (infer-sample-items items.s env state)

6996+ ==

6997+::

6998+:: Cell-sample binders are faces on their positions; at the top of a

6999+:: sample a binder only supplies a name for the whole sample.

7000+::

7001+++ infer-sample-items

7002+ |= [items=(list sample) env=ienv state=istate]

7003+ ^- isample-result

7004+ ?~ items [%| "empty sample is not supported by partial inference"]

7005+ =/ head=isample-result (infer-sample i.items env state)

7006+ ?: ?=(%| -.head) head

7007+ =/ ht=itype typ.p.head

7008+ =. ht

7009+ ?- -.i.items

7010+ %bind [%face name.i.items ht]

7011+ %face [%face name.i.items ht]

7012+ %pun [%face name.i.items ht]

7013+ * ht

7014+ ==

7015+ ?~ t.items [%& ht env.p.head state.p.head]

7016+ =/ tail=isample-result $(items t.items, env env.p.head, state state.p.head)

7017+ ?: ?=(%| -.tail) tail

7018+ [%& [%cell ht typ.p.tail] env.p.tail state.p.tail]

7019+::

7020+:: Local definitions generalize only variables outside their enclosing

7021+:: environment and explicit-capital scope. Recursive gate groups use

7022+:: monomorphic placeholders while their bodies are checked.

7023+::

7024++$ ilocal-result (each [env=ienv state=istate] idiag)

7025+++ free-env-vars

7026+ |= [env=ienv sub=isub]

7027+ ^- (list @ud)

7028+ ?~ env ~

7029+ =/ sc=ischeme scheme.i.env

7030+ =/ ids=(list @ud) (unique-type-vars (itype-vars typ.sc))

7031+ =/ free=(list @ud) ~

7032+ |-

7033+ ?~ ids (weld free (free-env-vars t.env sub))

7034+ ?: (lien vars.sc |=(n=@ud =(n i.ids))) $(ids t.ids)

7035+ =/ resolved=itype (itype-normalize [%var i.ids] sub)

7036+ $(ids t.ids, free (weld (itype-vars resolved) free))

7037+::

7038+++ free-cap-vars

7039+ |= [caps=icaps sub=isub]

7040+ ^- (list @ud)

7041+ ?~ caps ~

7042+ (weld (itype-vars (itype-normalize [%var id.i.caps] sub)) $(caps t.caps))

7043+::

7044+++ local-names-valid

7045+ |= [ds=(list def) env=ienv state=istate]

7046+ ^- ?

7047+ =/ names=(list term) (global-value-names ds)

7048+ |-

7049+ ?~ ds &

7050+ ?: ?=(%mold -.i.ds) $(ds t.ds)

7051+ ?: =(name.i.ds %proj) |

7052+ ?. (unique-value-name name.i.ds names) |

7053+ ?: ?=(^ (ienv-lookup name.i.ds env)) |

7054+ ?: (lien globals.state |=(n=term =(n name.i.ds))) |

7055+ $(ds t.ds)

7056+::

7057+:: The supported local molds are nonrecursive simple aliases. Validate

7058+:: all of them, including unused ones, before checking any local values.

7059+:: The enclosing gate sample was checked before this scope was entered.

7060+::

7061+++ local-value-defs

7062+ |= ds=(list def)

7063+ ^- (list def)

7064+ ?~ ds ~

7065+ ?: ?=(%mold -.i.ds) $(ds t.ds)

7066+ [i.ds $(ds t.ds)]

7067+::

7068+++ local-mold-names-valid

7069+ |= [locals=imolds state=istate]

7070+ ^- ?

7071+ =/ names=(list term) (turn locals |=(m=[name=term body=shape] name.m))

7072+ |-

7073+ ?~ locals &

7074+ =/ n=term name.i.locals

7075+ ?: =(n %proj) |

7076+ ?. (unique-value-name n names) |

7077+ ?: (lien molds.state |=(m=[name=term body=shape] =(n name.m))) |

7078+ ?: (lien marks.state |=(m=term =(n m))) |

7079+ ?: (lien reserved-molds.state |=(m=term =(n m))) |

7080+ ?: (lien surs.state |=(m=term =(n m))) |

7081+ $(locals t.locals)

7082+::

7083+++ local-molds-supported

7084+ |= [locals=imolds state=istate]

7085+ ^- ?

7086+ ?~ locals &

7087+ =/ m=[name=term body=shape] i.locals

7088+ =/ inferred=(unit [template=ischeme state=istate])

7089+ (infer-mold-template body.m state(active [name.m active.state], in-mold &))

7090+ ?~ inferred |

7091+ $(locals t.locals)

7092+::

7093+:: Gather written capitals belonging to one ++. Nested local definitions

7094+:: establish their own scopes; inline gates remain in the enclosing scope.

7095++$ icap-site [name=@t at=span]

7096+++ scope-shape

7097+ |= s=shape

7098+ ^- (list icap-site)

7099+ ?- -.s

7100+ %tvar ~[[name.s at.s]]

7101+ %apply (zing (turn args.s scope-shape))

7102+ %cell (zing (turn fields.s scope-field))

7103+ %union (zing (turn cases.s scope-shape))

7104+ %fn (weld (scope-shape sample.s) (scope-shape product.s))

7105+ %generic

7106+ =/ inside=(list icap-site) (scope-shape body.s)

7107+ (skim inside |=(site=icap-site !(lien vars.s |=(v=@t =(v name.site)))))

7108+ * ~

7109+ ==

7110+::

7111+++ scope-field

7112+ |= f=field

7113+ ^- (list icap-site)

7114+ ?- -.f

7115+ %face (scope-shape shape.f)

7116+ %bare (scope-shape shape.f)

7117+ %pun ~

7118+ ==

7119+::

7120+++ scope-sample

7121+ |= s=sample

7122+ ^- (list icap-site)

7123+ ?- -.s

7124+ %face (scope-shape shape.s)

7125+ %bare (scope-shape shape.s)

7126+ %cell (zing (turn items.s scope-sample))

7127+ * ~

7128+ ==

7129+::

7130+++ scope-pieces

7131+ |= ps=(list piece)

7132+ ^- (list icap-site)

7133+ ?~ ps ~

7134+ =/ first=(list icap-site)

7135+ ?- -.i.ps

7136+ %expr (scope-expr p.i.ps)

7137+ %text ~

7138+ ==

7139+ (weld first $(ps t.ps))

7140+::

7141+++ scope-qsegs

7142+ |= ps=(list qseg)

7143+ ^- (list icap-site)

7144+ ?~ ps ~

7145+ =/ first=(list icap-site)

7146+ ?- -.i.ps

7147+ %expr (scope-expr p.i.ps)

7148+ %knot ~

7149+ ==

7150+ (weld first $(ps t.ps))

7151+::

7152+++ scope-edits

7153+ |= xs=(list edit)

7154+ ^- (list icap-site)

7155+ ?~ xs ~

7156+ =/ first=(list icap-site) (scope-expr val.i.xs)

7157+ (weld first $(xs t.xs))

7158+::

7159+++ scope-items

7160+ |= xs=(list item)

7161+ ^- (list icap-site)

7162+ ?~ xs ~

7163+ =/ first=(list icap-site) (scope-expr val.i.xs)

7164+ (weld first $(xs t.xs))

7165+::

7166+++ scope-arms

7167+ |= xs=(list arm)

7168+ ^- (list icap-site)

7169+ ?~ xs ~

7170+ =/ first=(list icap-site) (scope-expr val.i.xs)

7171+ (weld first $(xs t.xs))

7172+::

7173+++ scope-exprs

7174+ |= xs=(list expr)

7175+ ^- (list icap-site)

7176+ ?~ xs ~

7177+ =/ first=(list icap-site) (scope-expr i.xs)

7178+ (weld first $(xs t.xs))

7179+::

7180+++ scope-expr

7181+ |= e=expr

7182+ ^- (list icap-site)

7183+ ?- -.e

7184+ %str (scope-pieces pieces.e)

7185+ %qath (scope-qsegs segs.e)

7186+ %change (scope-edits edits.e)

7187+ %pair (scope-expr val.e)

7188+ %unit (scope-expr val.e)

7189+ %group (scope-expr inner.e)

7190+ %list (scope-exprs items.e)

7191+ %tuple (scope-items items.e)

7192+ %gate

7193+ =/ first=(list icap-site) (scope-sample sample.e)

7194+ =/ last=(list icap-site) (scope-expr body.e)

7195+ (weld first last)

7196+ %gate-wide

7197+ =/ first=(list icap-site) (scope-sample sample.e)

7198+ =/ last=(list icap-site) (scope-expr body.e)

7199+ (weld first last)

7200+ %call

7201+ =/ first=(list icap-site) (scope-expr head.e)

7202+ =/ last=(list icap-site) (scope-exprs args.e)

7203+ (weld first last)

7204+ %cast

7205+ =/ first=(list icap-site) (scope-shape shape.e)

7206+ =/ last=(list icap-site) (scope-expr val.e)

7207+ (weld first last)

7208+ %trace

7209+ =/ first=(list icap-site) (scope-expr val.e)

7210+ =/ last=(list icap-site) (scope-expr then.e)

7211+ (weld first last)

7212+ %branch

7213+ =/ first=(list icap-site) (scope-expr subject.e)

7214+ =/ last=(list icap-site) (scope-arms arms.e)

7215+ (weld first last)

7216+ %body (scope-expr final.e)

7217+ * ~

7218+ ==

7219+::

7220+++ reserve-cap-sites

7221+ |= [sites=(list icap-site) state=istate]

7222+ ^- istate

7223+ ?~ sites state

7224+ ?: ?=(^ (icap-lookup name.i.sites caps.state)) $(sites t.sites)

7225+ $(sites t.sites, state state(next +(next.state), caps [[name.i.sites next.state at.i.sites] caps.state]))

7226+::

7227+++ reserve-def-caps

7228+ |= [e=expr state=istate]

7229+ ^- istate

7230+ (reserve-cap-sites (scope-expr e) state)

7231+::

7232+++ infer-local-defs

7233+ |= [ds=(list def) env=ienv state=istate]

7234+ ^- ilocal-result

7235+ =/ remaining=(list def) ~

7236+ =/ progressed=? |

7237+ |-

7238+ ?~ ds

7239+ ?~ remaining [%& env state]

7240+ ?. progressed

7241+ =/ pending=(list def) (flop remaining)

7242+ =/ groups=icomponents (graph-components pending (global-value-names pending))

7243+ =/ grouped=(unit [rest=(list def) env=ienv state=istate])

7244+ (try-local-group pending groups env state)

7245+ ?~ grouped [%| ["local definitions need unsupported inference" ~]]

7246+ $(ds rest.u.grouped, remaining ~, env env.u.grouped, state state.u.grouped, progressed |)

7247+ $(ds (flop remaining), remaining ~, progressed |)

7248+ =/ d=def i.ds

7249+ ?> ?=(%value -.d)

7250+ =/ local-state=istate (reserve-def-caps val.d state)

7251+ =/ inferred=iresult (infer-fragment val.d env local-state)

7252+ =/ retried=? ?=(%| -.inferred)

7253+ =? inferred retried (infer-recursive-gate d env local-state)

7254+ ?: ?=(%| -.inferred) $(ds t.ds, remaining [d remaining])

7255+ ?: !=(obligations.state.p.inferred obligations.state) [%| ["deferred local definition needs unsupported inference" ~]]

7256+ =. state.p.inferred (promote-restricted-numbers state.p.inferred env)

7257+ =. state.p.inferred (default-hole-numbers holes.state.p.inferred holes.state state.p.inferred env !(itype-has-gate (itype-normalize typ.p.inferred sub.state.p.inferred)))

7258+ =/ hole=(unit idiag) (unresolved-hole holes.state.p.inferred holes.state state.p.inferred)

7259+ ?^ hole [%| u.hole]

7260+ =/ merged=(unit [first=icap second=icap])

7261+ (merged-capitals caps.state.p.inferred sub.state.p.inferred)

7262+ ?^ merged

7263+ [%| ["distinct type variables `{(trip name.first.u.merged)}` and `{(trip name.second.u.merged)}` must not be forced equal; use the same capital for a shared type" ~[[at.first.u.merged "first type variable"] [at.second.u.merged "second type variable"]]]]

7264+ ?: (constrained-capitals caps.state.p.inferred sub.state.p.inferred)

7265+ [%| ["explicit capital constraints are not supported by partial inference" ~]]

7266+ =/ typ=itype (itype-normalize typ.p.inferred sub.state.p.inferred)

7267+ ?: |((pending-tags tags.state.p.inferred sub.state.p.inferred) (itype-has-tag typ))

7268+ $(ds t.ds, remaining [d remaining])

7269+ ?: (unsupported-atom-vars typ caps.state.p.inferred binders.state.p.inferred sub.state.p.inferred)

7270+ $(ds t.ds, remaining [d remaining])

7271+ =/ free=(list @ud)

7272+ (weld (free-env-vars env sub.state.p.inferred) (free-cap-vars caps.state sub.state.p.inferred))

7273+ =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

7274+ =. vars (skim vars |=(n=@ud !(lien free |=(f=@ud =(f n)))))

7275+ $(ds t.ds, env [[name.d [typ vars]] env], state state.p.inferred(caps caps.state, holes holes.state), progressed &)

7276+::

7277+:: Try complete cyclic local groups after individual definitions stall.

7278+:: Components with non-gates or unresolved constraints stay unavailable.

7279+::

7280+++ try-local-group

7281+ |= [ds=(list def) groups=icomponents env=ienv state=istate]

7282+ ^- (unit [rest=(list def) env=ienv state=istate])

7283+ ?~ groups ~

7284+ =/ names=(list term) i.groups

7285+ ?. (gth (lent names) 1) $(groups t.groups)

7286+ =/ members=(list def)

7287+ (skim ds |=(d=def &(?=(%value -.d) (lien names |=(n=term =(n name.d))))))

7288+ ?. =((lent members) (lent names)) $(groups t.groups)

7289+ =/ result=ilocal-result (infer-gate-group members env state)

7290+ ?: ?=(%| -.result) $(groups t.groups)

7291+ =/ rest=(list def)

7292+ (skim ds |=(d=def !(lien names |=(n=term =(n name.d)))))

7293+ =/ more=(unit [rest=(list def) env=ienv state=istate])

7294+ $(ds rest, groups t.groups, env env.p.result, state state.p.result)

7295+ ?^ more more

7296+ `[rest env.p.result state.p.result]

7297+::

7298+:: Read only fields of a known record. Unresolved field constraints and

7299+:: ambiguous repeated faces are outside this fragment. Imported record

7300+:: spines with repeated names are unavailable when used.

7301+::

7302+++ record-fields-named

7303+ |= [name=term t=itype sub=isub]

7304+ ^- (list itype)

7305+ =. t (itype-walk t sub)

7306+ ?: ?=(%face -.t)

7307+ ?:(=(name name.t) ~[body.t] ~)

7308+ ?. ?=(%cell -.t) ~

7309+ =/ first=(list itype) ~

7310+ =/ head=itype (itype-walk hed.t sub)

7311+ =? first ?=(%face -.head) ?:(=(name name.head) ~[body.head] ~)

7312+ (weld first $(t tal.t))

7313+::

7314+++ infer-field-wing

7315+ |= [names=(list term) env=ienv state=istate]

7316+ ^- iresult

7317+ =/ reverse=(list term) (flop names)

7318+ ?~ reverse [%| ["empty wing" ~]]

7319+ =/ iface=(unit ifile) (find-jibb-interface i.reverse jimports.state)

7320+ =/ fields=(list term) t.reverse

7321+ ?~ fields [%| ["field access is not supported by partial inference" ~]]

7322+ =/ scheme=(unit ischeme)

7323+ ?~ iface

7324+ (ienv-lookup i.reverse env)

7325+ (ienv-lookup i.fields values.u.iface)

7326+ ?~ scheme

7327+ ?^ iface [%| ["module member is not available to partial inference" ~]]

7328+ [%| ["field access is not supported by partial inference" ~]]

7329+ =/ inst=[typ=itype state=istate]

7330+ ?~ iface (instantiate-scheme u.scheme state)

7331+ =/ imported=ischeme u.scheme

7332+ =. typ.imported (itype-in-import typ.imported u.iface i.reverse prelude.state)

7333+ (instantiate-scheme imported state)

7334+ =/ remaining=(list term) ?~(iface fields t.fields)

7335+ =/ typ=itype typ.inst

7336+ |-

7337+ ?~ remaining [%& typ state.inst]

7338+ =/ found=(list itype) (record-fields-named i.remaining typ sub.state.inst)

7339+ ?~ found [%| ["field is not available to partial inference" ~]]

7340+ ?^ t.found [%| ["field name is ambiguous in partial inference" ~]]

7341+ $(remaining t.remaining, typ i.found)

7342+::

7343+:: Propagate a known union or list through supported loobean, unit and list

7344+:: branches. Empty bodies and groups are transparent; bodies with definitions

7345+:: keep their normal scoping and wait for general bidirectional inference.

7346+::

7347+++ context-union-branch

7348+ |= e=expr

7349+ ^- ?

7350+ ?- -.e

7351+ %branch &

7352+ %group $(e inner.e)

7353+ %body ?~(defs.e $(e final.e) |)

7354+ * |

7355+ ==

7356+::

7357+++ infer-union-context

7358+ |= [e=expr expected=itype env=ienv state=istate context=span]

7359+ ^- iresult

7360+ ?: ?=(%group -.e) $(e inner.e)

7361+ ?: &(?=(%body -.e) ?=(~ defs.e)) $(e final.e)

7362+ ?: &(?=(%collection -.expected) =(%list name.expected) (context-list-expression e))

7363+ (infer-list-context e expected env state context)

7364+ ?: ?=(%branch -.e)

7365+ =/ empty-list=(unit iresult) (empty-list-null-branch e env state `[expected context])

7366+ ?^ empty-list u.empty-list

7367+ ?~ arms.e [%| ["branch is not supported by partial inference" ~]]

7368+ ?~ t.arms.e [%| ["branch pattern is not supported by partial inference" ~]]

7369+ ?^ t.t.arms.e [%| ["branch is not supported by partial inference" ~]]

7370+ =/ x=arm i.arms.e

7371+ =/ y=arm i.t.arms.e

7372+ ?: |((unit-empty-pattern pat.x) (unit-empty-pattern pat.y))

7373+ (infer-unit-branch e env state `[expected context])

7374+ ?. &(?=(%lit -.pat.x) ?=(%lit -.pat.y))

7375+ [%| ["branch pattern is not supported by partial inference" ~]]

7376+ ?. &(=(%loobean form.lit.pat.x) =(%loobean form.lit.pat.y))

7377+ [%| ["branch pattern is not supported by partial inference" ~]]

7378+ ?: =(val.lit.pat.x val.lit.pat.y)

7379+ [%| ["branch does not cover both loobeans" ~]]

7380+ =/ subject=iresult (infer-fragment subject.e env state)

7381+ ?: ?=(%| -.subject) subject

7382+ =/ subject-type=itype (itype-normalize typ.p.subject sub.state.p.subject)

7383+ ?: ?=(%union -.subject-type)

7384+ [%| ["contextual union-pattern branch is not supported by partial inference" ~]]

7385+ =/ su=(unit isub) (itype-unify typ.p.subject [%flag ~] sub.state.p.subject)

7386+ ?~ su [%| ["loobean branch subject does not unify with ?" ~]]

7387+ =/ left=iresult $(e val.x, state state.p.subject(sub u.su))

7388+ ?: ?=(%| -.left) left

7389+ =/ right=iresult $(e val.y, state state.p.left)

7390+ ?: ?=(%| -.right) right

7391+ [%& expected state.p.right]

7392+ =/ value=iresult (infer-fragment e env state)

7393+ ?: ?=(%| -.value) value

7394+ =/ fit=ifit (itype-fit typ.p.value expected sub.state.p.value next.state.p.value)

7395+ ?: ?=(%unknown -.fit)

7396+ ?: &(?=(%collection -.expected) =(%list name.expected))

7397+ [%| ["branch list constraint is not supported by partial inference" ~]]

7398+ ?: ?=(%flag -.expected) [%| ["branch loobean constraint is not supported by partial inference" ~]]

7399+ [%| ["branch union constraint is not supported by partial inference" ~]]

7400+ ?: ?=(%bad -.fit)

7401+ =/ missing=(unit idiag) (missing-union-tag e expected sub.state.p.value context)

7402+ ?^ missing [%| u.missing]

7403+ =/ nested=(unit idiag) (nested-missing-tag e typ.p.value expected sub.state.p.value next.state.p.value context)

7404+ ?^ nested [%| u.nested]

7405+ ?: &(?=(%collection -.expected) =(%list name.expected))

7406+ [%| ["branch arm does not fit its expected list" ~[[context "expected list"] [(span-of e) "branch arm"]]]]

7407+ ?: ?=(%flag -.expected)

7408+ [%| ["branch arm does not fit its expected loobean" ~[[context "expected loobean"] [(span-of e) "branch arm"]]]]

7409+ [%| ["branch arm does not fit its expected union" ~[[context "expected union"] [(span-of e) "branch arm"]]]]

7410+ [%& expected state.p.value(sub sub.fit, next next.fit)]

7411+::

7412+:: A list expression needs a known list target and the validated prelude list.

7413+:: Literal items and unfaced two-item cons cells receive that target one by

7414+:: one; pending constraints elsewhere stay in the threaded state.

7415+::

7416+++ context-list-expression

7417+ |= e=expr

7418+ ^- ?

7419+ ?- -.e

7420+ %list &

7421+ %tuple &

7422+ %lit |(=(%null form.lit.e) &(=(%term form.lit.e) =(0 val.lit.e)))

7423+ %group $(e inner.e)

7424+ %body ?~(defs.e $(e final.e) |)

7425+ * |

7426+ ==

7427+::

7428+++ infer-list-context

7429+ |= [e=expr expected=itype env=ienv state=istate context=span]

7430+ ^- iresult

7431+ ?: ?=(%group -.e) $(e inner.e)

7432+ ?: &(?=(%body -.e) ?=(~ defs.e)) $(e final.e)

7433+ ?~ prelude.state [%| ["list literal needs the standard prelude in partial inference" ~]]

7434+ ?. =(at.u.prelude.state /lib/jibb/prelude/jibb)

7435+ [%| ["list literal needs the standard prelude in partial inference" ~]]

7436+ =/ standard=(unit ischeme) (find-jibb-mold %list u.prelude.state)

7437+ ?~ standard [%| ["list literal needs the standard prelude in partial inference" ~]]

7438+ ?. =(u.standard [[%collection %list ~[[%var 0]]] ~[0]])

7439+ [%| ["list literal needs the standard prelude in partial inference" ~]]

7440+ =/ target=itype (itype-walk expected sub.state)

7441+ ?. ?=(%collection -.target) [%| ["list context is not supported by partial inference" ~]]

7442+ ?. =(%list name.target) [%| ["list context is not supported by partial inference" ~]]

7443+ ?~ args.target [%| ["list context is not supported by partial inference" ~]]

7444+ ?^ t.args.target [%| ["list context is not supported by partial inference" ~]]

7445+ ?: ?=(%lit -.e)

7446+ ?. |(=(%null form.lit.e) &(=(%term form.lit.e) =(0 val.lit.e)))

7447+ [%| ["list expression is not supported by partial inference" ~]]

7448+ [%& target state]

7449+ ?: ?=(%list -.e)

7450+ =/ result=iresult (infer-list-items items.e i.args.target env state context)

7451+ ?: ?=(%| -.result) result

7452+ [%& target state.p.result]

7453+ ?. ?=(%tuple -.e) [%| ["list expression is not supported by partial inference" ~]]

7454+ ?~ items.e [%| ["cons shape is not supported by partial inference" ~]]

7455+ ?~ t.items.e [%| ["cons shape is not supported by partial inference" ~]]

7456+ ?^ t.t.items.e [%| ["cons shape is not supported by partial inference" ~]]

7457+ ?^ face.i.items.e [%| ["faced cons is not supported by partial inference" ~]]

7458+ ?^ face.i.t.items.e [%| ["faced cons is not supported by partial inference" ~]]

7459+ =/ head=iresult (infer-list-items ~[val.i.items.e] i.args.target env state context)

7460+ ?: ?=(%| -.head) head

7461+ =/ target=itype (itype-walk target sub.state.p.head)

7462+ =/ tail=iresult

7463+ ?: (context-list-expression val.i.t.items.e)

7464+ (infer-list-context val.i.t.items.e target env state.p.head context)

7465+ (infer-fragment val.i.t.items.e env state.p.head)

7466+ ?: ?=(%| -.tail) tail

7467+ =/ fit=ifit (itype-fit typ.p.tail target sub.state.p.tail next.state.p.tail)

7468+ ?: ?=(%unknown -.fit) [%| ["list tail constraint is not supported by partial inference" ~]]

7469+ ?: ?=(%bad -.fit)

7470+ [%| ["list tail does not fit its expected type" ~[[context (site-type-note "expected list" target sub.state.p.tail)] [(span-of val.i.t.items.e) (site-type-note "list tail" typ.p.tail sub.state.p.tail)]]]]

7471+ [%& target state.p.tail(sub sub.fit, next next.fit)]

7472+::

7473+++ infer-open-list-items

7474+ |= [items=(list expr) expected=itype env=ienv state=istate context=span]

7475+ ^- iresult

7476+ ?~ items [%& expected state]

7477+ =/ target=itype (itype-walk expected sub.state)

7478+ =/ value=iresult (infer-call-context-arg i.items target env state context)

7479+ ?: ?=(%| -.value) value

7480+ =/ fit=ifit (itype-fit typ.p.value target sub.state.p.value next.state.p.value)

7481+ ?: ?=(%unknown -.fit) [%| ["list item constraint is not supported by partial inference" ~]]

7482+ ?: ?=(%bad -.fit)

7483+ ?: |((itype-family-related typ.p.value target sub.state.p.value) (itype-has-any-atom typ.p.value sub.state.p.value) (itype-has-any-atom target sub.state.p.value))

7484+ [%| ["list item widening is not supported by partial inference" ~]]

7485+ [%| ["list items do not have compatible types" ~[[context (site-type-note "expected item" target sub.state.p.value)] [(span-of i.items) (site-type-note "list item" typ.p.value sub.state.p.value)]]]]

7486+ ?: (itype-has-tag (itype-normalize expected sub.fit))

7487+ [%| ["list item needs context in partial inference" ~]]

7488+ $(items t.items, state state.p.value(sub sub.fit, next next.fit))

7489+::

7490+++ infer-list-items

7491+ |= [items=(list expr) expected=itype env=ienv state=istate context=span]

7492+ ^- iresult

7493+ ?~ items [%& expected state]

7494+ =/ target=itype (itype-walk expected sub.state)

7495+ =/ value=iresult (infer-call-context-arg i.items target env state context)

7496+ ?: ?=(%| -.value) value

7497+ =/ fit=ifit (itype-fit typ.p.value target sub.state.p.value next.state.p.value)

7498+ ?: ?=(%unknown -.fit) [%| ["list item constraint is not supported by partial inference" ~]]

7499+ ?: ?=(%bad -.fit)

7500+ =/ missing=(unit idiag) (missing-union-tag i.items target sub.state.p.value context)

7501+ ?^ missing [%| u.missing]

7502+ =/ nested=(unit idiag) (nested-missing-tag i.items typ.p.value target sub.state.p.value next.state.p.value context)

7503+ ?^ nested [%| u.nested]

7504+ [%| ["list item does not fit its expected type" ~[[context (site-type-note "expected item" target sub.state.p.value)] [(span-of i.items) (site-type-note "list item" typ.p.value sub.state.p.value)]]]]

7505+ $(items t.items, state state.p.value(sub sub.fit, next next.fit))

7506+::

7507+:: The supported unit pattern covers exactly an atom zero and a cell

7508+:: headed by zero, with a single binder for its payload. Unresolved

7509+:: subjects and all other pattern matrices stay outside this fragment.

7510+::

7511+++ unit-empty-pattern

7512+ |= p=pattern

7513+ ^- ?

7514+ ?. ?=(%lit -.p) |

7515+ =(%null form.lit.p)

7516+::

7517+++ unit-payload-pattern

7518+ |= p=pattern

7519+ ^- (unit term)

7520+ ?. ?=(%cell -.p) ~

7521+ ?~ items.p ~

7522+ ?~ t.items.p ~

7523+ ?^ t.t.items.p ~

7524+ ?. (unit-empty-pattern i.items.p) ~

7525+ ?. ?=(%bind -.i.t.items.p) ~

7526+ `name.i.t.items.p

7527+::

7528+++ unit-empty-case

7529+ |= t=itype

7530+ ^- ?

7531+ ?. ?=(%const -.t) |

7532+ =(0 val.literal.t)

7533+::

7534+++ unit-payload-case

7535+ |= t=itype

7536+ ^- (unit itype)

7537+ ?. ?=(%cell -.t) ~

7538+ ?. (unit-empty-case hed.t) ~

7539+ =/ payload=itype tal.t

7540+ =? payload ?=(%face -.payload) body.payload

7541+ `payload

7542+::

7543+++ unit-union-payload

7544+ |= t=itype

7545+ ^- (unit itype)

7546+ ?. ?=(%union -.t) ~

7547+ ?~ cases.t ~

7548+ ?~ t.cases.t ~

7549+ ?^ t.t.cases.t ~

7550+ ?: (unit-empty-case i.cases.t) (unit-payload-case i.t.cases.t)

7551+ ?: (unit-empty-case i.t.cases.t) (unit-payload-case i.cases.t)

7552+ ~

7553+::

7554+:: List matching currently covers exactly null and a cell of two binders.

7555+:: The head has the element type and the tail has the whole list type.

7556+:: Other patterns and lists whose element mold is empty remain unsupported.

7557+::

7558+++ list-payload-pattern

7559+ |= p=pattern

7560+ ^- (unit [head=term tail=term])

7561+ ?. ?=(%cell -.p) ~

7562+ ?~ items.p ~

7563+ ?~ t.items.p ~

7564+ ?^ t.t.items.p ~

7565+ ?. ?=(%bind -.i.items.p) ~

7566+ ?. ?=(%bind -.i.t.items.p) ~

7567+ `[name.i.items.p name.i.t.items.p]

7568+::

7569+++ infer-list-branch

7570+ |= [e=expr env=ienv state=istate expected=(unit [typ=itype context=span]) typ=itype]

7571+ ^- iresult

7572+ ?> ?=(%branch -.e)

7573+ ?> ?=(%collection -.typ)

7574+ ?. =(%list name.typ) [%| ["list pattern is not supported by partial inference" ~]]

7575+ ?~ prelude.state [%| ["list pattern needs the standard prelude in partial inference" ~]]

7576+ ?. =(at.u.prelude.state /lib/jibb/prelude/jibb)

7577+ [%| ["list pattern needs the standard prelude in partial inference" ~]]

7578+ =/ standard=(unit ischeme) (find-jibb-mold %list u.prelude.state)

7579+ ?~ standard [%| ["list pattern needs the standard prelude in partial inference" ~]]

7580+ ?. =(u.standard [[%collection %list ~[[%var 0]]] ~[0]])

7581+ [%| ["list pattern needs the standard prelude in partial inference" ~]]

7582+ ?~ args.typ [%| ["list pattern is not supported by partial inference" ~]]

7583+ ?^ t.args.typ [%| ["list pattern is not supported by partial inference" ~]]

7584+ =/ item-live=(unit [result=?(%yes %no %unknown) left=@ud])

7585+ (itype-inhabited-proof i.args.typ sub.state caps.state 256)

7586+ ?~ item-live [%| ["list element reachability needs unsupported inference" ~]]

7587+ ?: =(%unknown result.u.item-live) [%| ["list element reachability needs unsupported inference" ~]]

7588+ ?: =(%no result.u.item-live) [%| ["list nonempty pattern is unreachable" ~]]

7589+ ?~ arms.e [%| ["list branch is not supported by partial inference" ~]]

7590+ ?~ t.arms.e [%| ["list branch is not supported by partial inference" ~]]

7591+ ?^ t.t.arms.e [%| ["list branch is not supported by partial inference" ~]]

7592+ =/ x=arm i.arms.e

7593+ =/ y=arm i.t.arms.e

7594+ =/ first-empty=? (unit-empty-pattern pat.x)

7595+ =/ first-name=(unit [head=term tail=term]) (list-payload-pattern pat.x)

7596+ =/ second-name=(unit [head=term tail=term]) (list-payload-pattern pat.y)

7597+ ?. |(&(first-empty ?=(^ second-name)) &((unit-empty-pattern pat.y) ?=(^ first-name)))

7598+ [%| ["list branch pattern is not supported by partial inference" ~]]

7599+ =/ binder=(unit [head=term tail=term]) ?:(first-empty second-name first-name)

7600+ ?~ binder [%| ["list branch pattern is not supported by partial inference" ~]]

7601+ ?: |(=(head.u.binder %proj) =(tail.u.binder %proj) =(head.u.binder tail.u.binder) ?=(^ (ienv-lookup head.u.binder env)) ?=(^ (ienv-lookup tail.u.binder env)) (lien globals.state |=(n=term |(=(n head.u.binder) =(n tail.u.binder)))))

7602+ [%| ["pattern binder shadows a name" ~]]

7603+ =/ extended=ienv [[head.u.binder [i.args.typ ~]] [tail.u.binder [typ ~]] env]

7604+ =/ left=iresult

7605+ ?~ expected (infer-fragment val.x ?:(first-empty env extended) state)

7606+ (infer-union-context val.x typ.u.expected ?:(first-empty env extended) state context.u.expected)

7607+ ?: ?=(%| -.left) left

7608+ =/ right=iresult

7609+ ?~ expected (infer-fragment val.y ?:(first-empty extended env) state.p.left)

7610+ (infer-union-context val.y typ.u.expected ?:(first-empty extended env) state.p.left context.u.expected)

7611+ ?: ?=(%| -.right) right

7612+ ?^ expected [%& typ.u.expected state.p.right]

7613+ =/ joined=(unit isub) (itype-unify typ.p.left typ.p.right sub.state.p.right)

7614+ ?~ joined [%| ["list branch results need unsupported inference" ~]]

7615+ [%& typ.p.left state.p.right(sub u.joined)]

7616+::

7617+++ infer-unit-branch

7618+ |= [e=expr env=ienv state=istate expected=(unit [typ=itype context=span])]

7619+ ^- iresult

7620+ ?> ?=(%branch -.e)

7621+ ?~ arms.e [%| ["unit branch is not supported by partial inference" ~]]

7622+ ?~ t.arms.e [%| ["unit branch is not supported by partial inference" ~]]

7623+ ?^ t.t.arms.e [%| ["unit branch is not supported by partial inference" ~]]

7624+ =/ subject=iresult (infer-fragment subject.e env state)

7625+ ?: ?=(%| -.subject) subject

7626+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

7627+ ?: &(?=(%collection -.typ) =(%list name.typ))

7628+ (infer-list-branch e env state.p.subject expected typ)

7629+ =/ x=arm i.arms.e

7630+ =/ y=arm i.t.arms.e

7631+ =/ first-empty=? (unit-empty-pattern pat.x)

7632+ =/ first-name=(unit term) (unit-payload-pattern pat.x)

7633+ =/ second-name=(unit term) (unit-payload-pattern pat.y)

7634+ ?. |(&(first-empty ?=(^ second-name)) &((unit-empty-pattern pat.y) ?=(^ first-name)))

7635+ [%| ["unit branch pattern is not supported by partial inference" ~]]

7636+ =/ binder=(unit term) ?:(first-empty second-name first-name)

7637+ ?~ binder [%| ["unit branch pattern is not supported by partial inference" ~]]

7638+ ?: |(=(u.binder %proj) ?=(^ (ienv-lookup u.binder env)) (lien globals.state |=(n=term =(n u.binder))))

7639+ [%| ["pattern binder shadows a name" ~]]

7640+ =/ payload=(unit itype) (unit-union-payload typ)

7641+ ?~ payload [%| ["unit branch subject is not supported by partial inference" ~]]

7642+ =/ payload-live=(unit [result=?(%yes %no %unknown) left=@ud])

7643+ (itype-inhabited-proof u.payload sub.state.p.subject caps.state.p.subject 256)

7644+ ?~ payload-live [%| ["unit payload reachability needs unsupported inference" ~]]

7645+ ?: =(%unknown result.u.payload-live) [%| ["unit payload reachability needs unsupported inference" ~]]

7646+ ?: =(%no result.u.payload-live) [%| ["unit present pattern is unreachable" ~]]

7647+ =/ extended=ienv [[u.binder [u.payload ~]] env]

7648+ =/ left=iresult

7649+ ?~ expected (infer-fragment val.x ?:(first-empty env extended) state.p.subject)

7650+ (infer-union-context val.x typ.u.expected ?:(first-empty env extended) state.p.subject context.u.expected)

7651+ ?: ?=(%| -.left) left

7652+ =/ right=iresult

7653+ ?~ expected (infer-fragment val.y ?:(first-empty extended env) state.p.left)

7654+ (infer-union-context val.y typ.u.expected ?:(first-empty extended env) state.p.left context.u.expected)

7655+ ?: ?=(%| -.right) right

7656+ ?^ expected [%& typ.u.expected state.p.right]

7657+ =/ joined=(unit isub) (itype-unify typ.p.left typ.p.right sub.state.p.right)

7658+ ?~ joined [%| ["unit branch results need unsupported inference" ~]]

7659+ [%& typ.p.left state.p.right(sub u.joined)]

7660+::

7661+:: Infer pieces in order, retaining their substitutions and pending tags.

7662+:: A bare decimal literal has no outside type constraint, so it takes its

7663+:: normal @ud default here. Other open numeric and aura variables wait for

7664+:: deferred constraints, which this fragment does not implement yet.

7665+++ infer-string-pieces

7666+ |= [ps=(list piece) env=ienv state=istate]

7667+ ^- iresult

7668+ ?~ ps [%& [%atom %t] state]

7669+ ?: ?=(%text -.i.ps) $(ps t.ps)

7670+ =/ item=iresult (infer-fragment p.i.ps env state)

7671+ ?: ?=(%| -.item) item

7672+ =/ t=itype (itype-normalize typ.p.item sub.state.p.item)

7673+ ?: |(?=(%atom -.t) ?=(%any-atom -.t))

7674+ $(ps t.ps, state state.p.item)

7675+ ?: &(|(?=(%nvar -.t) ?=(%rnvar -.t)) ?=(%lit -.p.i.ps) =(%number form.lit.p.i.ps))

7676+ $(ps t.ps, state state.p.item)

7677+ ?: &(?=(%collection -.t) =(%list name.t) =(~[[%atom 'tD']] args.t))

7678+ $(ps t.ps, state state.p.item)

7679+ ?: &(?=(%avar -.t) (atom-var-from-cap id.t caps.state.p.item sub.state.p.item))

7680+ [%| ["a generic atom in interpolation needs an aura" ~[[(span-of p.i.ps) "atom with a generic aura"]]]]

7681+ ?: &(?=(%rvar -.t) (atom-var-from-cap id.t caps.state.p.item sub.state.p.item))

7682+ [%| ["a generic atom in interpolation needs an aura" ~[[(span-of p.i.ps) "atom with a generic aura"]]]]

7683+ ?: ?=(%cell -.t)

7684+ [%| ["a cell in interpolation needs a printer" ~[[(span-of p.i.ps) "cell without a printer"]]]]

7685+ [%| ["interpolation type needs unsupported inference" ~]]

7686+::

7687+:: Whole-case coverage for a known union. When a pattern may cover only

7688+:: part of a case, finite loobean refinements are tried below; other

7689+:: partial coverage stays unsupported until the general pattern matrix.

7690++$ imatch ?(%full %none %unknown)

7691+++ union-pattern-items

7692+ |= [ps=(list pattern) t=itype]

7693+ ^- imatch

7694+ ?~ ps %unknown

7695+ ?~ t.ps (union-pattern i.ps t)

7696+ =. t ?:(?=(%face -.t) body.t t)

7697+ ?. ?=(%cell -.t)

7698+ ?: |(?=(%atom -.t) ?=(%any-atom -.t) ?=(%flag -.t) ?=(%const -.t)) %none

7699+ %unknown

7700+ =/ a=imatch (union-pattern i.ps hed.t)

7701+ =/ b=imatch $(ps t.ps, t tal.t)

7702+ ?: |(=(%none a) =(%none b)) %none

7703+ ?:(&(=(%full a) =(%full b)) %full %unknown)

7704+::

7705+++ union-pattern

7706+ |= [p=pattern t=itype]

7707+ ^- imatch

7708+ =. t ?:(?=(%face -.t) body.t t)

7709+ ?- -.p

7710+ %any %full

7711+ %bind %full

7712+ %lit

7713+ ?: ?=(%const -.t) ?:(=(val.literal.t val.lit.p) %full %none)

7714+ ?: ?=(%cell -.t) %none

7715+ ?: ?=(%flag -.t)

7716+ ?:(|(=(0 val.lit.p) =(1 val.lit.p)) %unknown %none)

7717+ %unknown

7718+ %str ?:(?=(%cell -.t) %none %unknown)

7719+ %cell (union-pattern-items items.p t)

7720+ ==

7721+::

7722+++ union-pattern-has-bind

7723+ |= p=pattern

7724+ ^- ?

7725+ ?: ?=(%bind -.p) &

7726+ ?. ?=(%cell -.p) |

7727+ (lien items.p union-pattern-has-bind)

7728+::

7729+++ union-pattern-bind-items

7730+ |= [ps=(list pattern) t=itype env=ienv globals=(list term)]

7731+ ^- (unit ienv)

7732+ ?~ ps ~

7733+ ?~ t.ps (union-pattern-bind i.ps t env globals)

7734+ =. t ?:(?=(%face -.t) body.t t)

7735+ ?. ?=(%cell -.t) ~

7736+ =/ first=(unit ienv) (union-pattern-bind i.ps hed.t env globals)

7737+ ?~ first ~

7738+ $(ps t.ps, t tal.t, env u.first)

7739+::

7740+++ union-pattern-bind

7741+ |= [p=pattern t=itype env=ienv globals=(list term)]

7742+ ^- (unit ienv)

7743+ =. t ?:(?=(%face -.t) body.t t)

7744+ ?: ?=(%bind -.p)

7745+ ?: |(=(name.p %proj) ?=(^ (ienv-lookup name.p env)) (lien globals |=(n=term =(n name.p)))) ~

7746+ `[[name.p [t ~]] env]

7747+ ?: ?=(%cell -.p) (union-pattern-bind-items items.p t env globals)

7748+ `env

7749+::

7750+:: Split loobean fields into finite refinements for partial patterns.

7751+:: Keep original cases for binder types and preserve whole-case matching

7752+:: before trying refinements. Cap products at 64; unknown, empty or opaque

7753+:: shapes stay unsupported rather than implying complete pattern checking.

7754++$ ifinite [origin=@ud base=itype part=itype]

7755+++ finite-product

7756+ |= [hs=(list itype) ts=(list itype) out=(list itype)]

7757+ ^- (list itype)

7758+ ?~ hs out

7759+ =/ rows=(list itype) (turn ts |=(t=itype [%cell i.hs t]))

7760+ $(hs t.hs, out (weld rows out))

7761+::

7762+++ finite-type

7763+ |= t=itype

7764+ ^- (unit (list itype))

7765+ ?- -.t

7766+ %flag

7767+ `~[[%const [%loobean %f 0 '%.y']] [%const [%loobean %f 1 '%.n']]]

7768+ %face

7769+ =/ body=(unit (list itype)) $(t body.t)

7770+ ?~ body ~

7771+ `(turn u.body |=(x=itype [%face name.t x]))

7772+ %cell

7773+ =/ hed=(unit (list itype)) $(t hed.t)

7774+ ?~ hed ~

7775+ =/ tal=(unit (list itype)) $(t tal.t)

7776+ ?~ tal ~

7777+ ?: (gth (mul (lent u.hed) (lent u.tal)) 64) ~

7778+ `(finite-product u.hed u.tal ~)

7779+ * `~[t]

7780+ ==

7781+::

7782+++ finite-cases

7783+ |= [xs=(list itype) out=(list ifinite) origin=@ud]

7784+ ^- (unit (list ifinite))

7785+ ?~ xs `out

7786+ =/ parts=(unit (list itype)) (finite-type i.xs)

7787+ ?~ parts ~

7788+ ?: (gth (add (lent out) (lent u.parts)) 64) ~

7789+ =/ rows=(list ifinite) (turn u.parts |=(t=itype [origin i.xs t]))

7790+ $(xs t.xs, out (weld out rows), origin +(origin))

7791+::

7792+++ infer-known-union-whole

7793+ |= [e=expr env=ienv subject=iresult]

7794+ ^- (unit iresult)

7795+ ?> ?=(%branch -.e)

7796+ ?: ?=(%| -.subject) `subject

7797+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

7798+ ?. ?=(%union -.typ) `[%| ["branch is not supported by partial inference" ~]]

7799+ =/ live=(unit (list itype)) (itype-live-cases cases.typ sub.state.p.subject caps.state.p.subject 4.096)

7800+ ?~ live ~

7801+ =/ cases=(list itype) u.live

7802+ =/ remaining=(list itype) cases

7803+ =/ arms=(list arm) arms.e

7804+ =/ st=istate state.p.subject

7805+ =/ answer=(unit itype) ~

7806+ |-

7807+ ?~ arms

7808+ ?^ remaining

7809+ `[%| ["missing union case {(show-itype i.remaining sub.st)}" ~]]

7810+ ?~ answer `[%| ["empty union branch is not supported by partial inference" ~]]

7811+ `[%& u.answer st]

7812+ =/ a=arm i.arms

7813+ ?: (lien remaining |=(c=itype =(%unknown (union-pattern pat.a c))))

7814+ ~

7815+ =/ matching=(list itype) (skim remaining |=(c=itype =(%full (union-pattern pat.a c))))

7816+ ?~ matching

7817+ ?: (lien cases |=(c=itype =(%full (union-pattern pat.a c))))

7818+ `[%| ["branch arm is covered by earlier arms" ~[[at.pat.a "covered arm"]]]]

7819+ `[%| ["union pattern is not supported by partial inference" ~]]

7820+ ?: &(?=(^ t.matching) (union-pattern-has-bind pat.a))

7821+ `[%| ["a union pattern binding several cases is not supported by partial inference" ~]]

7822+ =/ bound=(unit ienv) (union-pattern-bind pat.a i.matching env globals.st)

7823+ ?~ bound `[%| ["pattern binder shadows a name" ~]]

7824+ =/ body=iresult (infer-fragment val.a u.bound st)

7825+ ?: ?=(%| -.body) `body

7826+ =/ result=itype (itype-normalize typ.p.body sub.state.p.body)

7827+ =/ mismatch=? ?~(answer | !=((itype-normalize u.answer sub.state.p.body) result))

7828+ ?: mismatch `[%| ["union branch result matching needs unsupported inference" ~]]

7829+ $(arms t.arms, remaining (skim remaining |=(c=itype !=(%full (union-pattern pat.a c)))), st state.p.body, answer `result)

7830+::

7831+++ infer-known-union-context-whole

7832+ |= [e=expr expected=itype env=ienv subject=iresult context=span]

7833+ ^- (unit iresult)

7834+ ?> ?=(%branch -.e)

7835+ ?: ?=(%| -.subject) `subject

7836+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

7837+ ?. ?=(%union -.typ) `[%| ["branch is not supported by partial inference" ~]]

7838+ =/ live=(unit (list itype)) (itype-live-cases cases.typ sub.state.p.subject caps.state.p.subject 4.096)

7839+ ?~ live ~

7840+ =/ cases=(list itype) u.live

7841+ =/ remaining=(list itype) cases

7842+ =/ arms=(list arm) arms.e

7843+ =/ st=istate state.p.subject

7844+ =/ answer=(unit itype) ~

7845+ |-

7846+ ?~ arms

7847+ ?^ remaining

7848+ `[%| ["missing union case {(show-itype i.remaining sub.st)}" ~]]

7849+ ?~ answer `[%| ["empty union branch is not supported by partial inference" ~]]

7850+ `[%& expected st]

7851+ =/ a=arm i.arms

7852+ ?: (lien remaining |=(c=itype =(%unknown (union-pattern pat.a c))))

7853+ ~

7854+ =/ matching=(list itype) (skim remaining |=(c=itype =(%full (union-pattern pat.a c))))

7855+ ?~ matching

7856+ ?: (lien cases |=(c=itype =(%full (union-pattern pat.a c))))

7857+ `[%| ["branch arm is covered by earlier arms" ~[[at.pat.a "covered arm"]]]]

7858+ `[%| ["union pattern is not supported by partial inference" ~]]

7859+ ?: &(?=(^ t.matching) (union-pattern-has-bind pat.a))

7860+ `[%| ["a union pattern binding several cases is not supported by partial inference" ~]]

7861+ =/ bound=(unit ienv) (union-pattern-bind pat.a i.matching env globals.st)

7862+ ?~ bound `[%| ["pattern binder shadows a name" ~]]

7863+ =/ body=iresult (infer-call-context-arg val.a expected u.bound st context)

7864+ ?: ?=(%| -.body) `body

7865+ =/ fit=ifit (itype-fit typ.p.body expected sub.state.p.body next.state.p.body)

7866+ ?: ?=(%unknown -.fit) `[%| ["union branch result constraint is not supported by partial inference" ~]]

7867+ ?: ?=(%bad -.fit)

7868+ =/ missing=(unit idiag) (missing-union-tag val.a expected sub.state.p.body context)

7869+ ?^ missing `[%| u.missing]

7870+ =/ nested=(unit idiag) (nested-missing-tag val.a typ.p.body expected sub.state.p.body next.state.p.body context)

7871+ ?^ nested `[%| u.nested]

7872+ `[%| ["union branch arm does not fit its expected type" ~[[context "expected type"] [(span-of val.a) "branch arm"]]]]

7873+ ?: (itype-has-tag (itype-normalize expected sub.fit))

7874+ `[%| ["union branch result needs context in partial inference" ~]]

7875+ $(arms t.arms, remaining (skim remaining |=(c=itype !=(%full (union-pattern pat.a c)))), st state.p.body(sub sub.fit, next next.fit), answer `expected)

7876+::

7877+++ infer-known-union-finite

7878+ |= [e=expr env=ienv subject=iresult expected=(unit [typ=itype context=span])]

7879+ ^- iresult

7880+ ?> ?=(%branch -.e)

7881+ ?: ?=(%| -.subject) subject

7882+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

7883+ ?. ?=(%union -.typ) [%| ["branch is not supported by partial inference" ~]]

7884+ =/ live=(unit (list itype)) (itype-live-cases cases.typ sub.state.p.subject caps.state.p.subject 4.096)

7885+ ?~ live [%| ["union emptiness needs unsupported inference" ~]]

7886+ =/ expanded=(unit (list ifinite)) (finite-cases u.live ~ 0)

7887+ ?~ expanded [%| ["union pattern expansion needs unsupported inference" ~]]

7888+ =/ cases=(list ifinite) u.expanded

7889+ =/ remaining=(list ifinite) cases

7890+ =/ arms=(list arm) arms.e

7891+ =/ st=istate state.p.subject

7892+ =/ answer=(unit itype) ~

7893+ |-

7894+ ?~ arms

7895+ ?^ remaining

7896+ [%| ["missing union case {(show-itype part.i.remaining sub.st)}" ~]]

7897+ ?~ answer [%| ["empty union branch is not supported by partial inference" ~]]

7898+ ?~ expected [%& u.answer st]

7899+ [%& typ.u.expected st]

7900+ =/ a=arm i.arms

7901+ ?: (lien remaining |=(c=ifinite =(%unknown (union-pattern pat.a part.c))))

7902+ [%| ["partial union pattern is not supported by partial inference" ~]]

7903+ =/ matching=(list ifinite) (skim remaining |=(c=ifinite =(%full (union-pattern pat.a part.c))))

7904+ ?~ matching

7905+ ?: (lien cases |=(c=ifinite =(%full (union-pattern pat.a part.c))))

7906+ [%| ["branch arm is covered by earlier arms" ~[[at.pat.a "covered arm"]]]]

7907+ [%| ["union pattern is not supported by partial inference" ~]]

7908+ ?: &((union-pattern-has-bind pat.a) (lien t.matching |=(c=ifinite !=(origin.c origin.i.matching))))

7909+ [%| ["a union pattern binding several cases is not supported by partial inference" ~]]

7910+ =/ bound=(unit ienv) (union-pattern-bind pat.a base.i.matching env globals.st)

7911+ ?~ bound [%| ["pattern binder shadows a name" ~]]

7912+ =/ body=iresult

7913+ ?~ expected (infer-fragment val.a u.bound st)

7914+ (infer-call-context-arg val.a typ.u.expected u.bound st context.u.expected)

7915+ ?: ?=(%| -.body) body

7916+ ?^ expected

7917+ =/ fit=ifit (itype-fit typ.p.body typ.u.expected sub.state.p.body next.state.p.body)

7918+ ?: ?=(%unknown -.fit) [%| ["union branch result constraint is not supported by partial inference" ~]]

7919+ ?: ?=(%bad -.fit)

7920+ =/ missing=(unit idiag) (missing-union-tag val.a typ.u.expected sub.state.p.body context.u.expected)

7921+ ?^ missing [%| u.missing]

7922+ =/ nested=(unit idiag) (nested-missing-tag val.a typ.p.body typ.u.expected sub.state.p.body next.state.p.body context.u.expected)

7923+ ?^ nested [%| u.nested]

7924+ [%| ["union branch arm does not fit its expected type" ~[[context.u.expected "expected type"] [(span-of val.a) "branch arm"]]]]

7925+ ?: (itype-has-tag (itype-normalize typ.u.expected sub.fit))

7926+ [%| ["union branch result needs context in partial inference" ~]]

7927+ $(arms t.arms, remaining (skim remaining |=(c=ifinite !=(%full (union-pattern pat.a part.c)))), st state.p.body(sub sub.fit, next next.fit), answer `typ.u.expected)

7928+ =/ result=itype (itype-normalize typ.p.body sub.state.p.body)

7929+ =/ mismatch=? ?~(answer | !=((itype-normalize u.answer sub.state.p.body) result))

7930+ ?: mismatch [%| ["union branch result matching needs unsupported inference" ~]]

7931+ $(arms t.arms, remaining (skim remaining |=(c=ifinite !=(%full (union-pattern pat.a part.c)))), st state.p.body, answer `result)

7932+::

7933+:: Prove a one-arm record pattern covers a known, non-union subject.

7934+:: Variable or partial matches stay unsupported; binding uses the same

7935+:: scope and original payload types as the existing union matcher.

7936+++ single-structured-pattern

7937+ |= e=expr

7938+ ^- ?

7939+ ?. ?=(%branch -.e) |

7940+ ?~ arms.e |

7941+ ?^ t.arms.e |

7942+ =/ p=pattern pat.i.arms.e

7943+ ?. ?=(%cell -.p) |

7944+ !(levy items.p |=(x=pattern ?=(%bind -.x)))

7945+::

7946+++ infer-single-case-branch

7947+ |= [e=expr env=ienv state=istate expected=(unit [typ=itype context=span])]

7948+ ^- iresult

7949+ ?> (single-structured-pattern e)

7950+ ?> ?=(%branch -.e)

7951+ ?> ?=(^ arms.e)

7952+ =/ a=arm i.arms.e

7953+ =/ subject=iresult (infer-fragment subject.e env state)

7954+ ?: ?=(%| -.subject) subject

7955+ =/ st=istate state.p.subject

7956+ =/ typ=itype (itype-normalize typ.p.subject sub.st)

7957+ ?: ?=(%union -.typ) [%| ["single-case pattern needs unsupported inference" ~]]

7958+ ?. =(%full (union-pattern pat.a typ))

7959+ [%| ["single-case pattern needs unsupported inference" ~]]

7960+ =/ bound=(unit ienv) (union-pattern-bind pat.a typ env globals.st)

7961+ ?~ bound [%| ["pattern binder shadows a name" ~]]

7962+ ?~ expected (infer-fragment val.a u.bound st)

7963+ =/ body=iresult (infer-call-context-arg val.a typ.u.expected u.bound st context.u.expected)

7964+ ?: ?=(%| -.body) body

7965+ =/ fit=ifit (itype-fit typ.p.body typ.u.expected sub.state.p.body next.state.p.body)

7966+ ?: ?=(%unknown -.fit) [%| ["single-case branch result constraint is not supported by partial inference" ~]]

7967+ ?: ?=(%bad -.fit)

7968+ =/ missing=(unit idiag) (missing-union-tag val.a typ.u.expected sub.state.p.body context.u.expected)

7969+ ?^ missing [%| u.missing]

7970+ =/ nested=(unit idiag) (nested-missing-tag val.a typ.p.body typ.u.expected sub.state.p.body next.state.p.body context.u.expected)

7971+ ?^ nested [%| u.nested]

7972+ [%| ["single-case branch arm does not fit its expected type" ~[[context.u.expected "expected type"] [(span-of val.a) "branch arm"]]]]

7973+ ?: (itype-has-tag (itype-normalize typ.u.expected sub.fit))

7974+ [%| ["single-case branch result needs context in partial inference" ~]]

7975+ [%& typ.u.expected state.p.body(sub sub.fit, next next.fit)]

7976+::

7977+:: This view is used only by pattern analysis, never exported or bound as

7978+:: the subject. Only null plus a two-binder/wildcard cell is supported; its

7979+:: tail keeps the original recursive type. Other patterns fail closed.

7980+++ jrec-match-view

7981+ |= [e=expr subject=iresult]

7982+ ^- iresult

7983+ ?: ?=(%| -.subject) subject

7984+ ?. ?=(%branch -.e) subject

7985+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

7986+ ?. ?=(%jrec -.typ) subject

7987+ ?~ arms.e subject

7988+ ?~ t.arms.e subject

7989+ ?^ t.t.arms.e subject

7990+ =/ x=pattern pat.i.arms.e

7991+ =/ y=pattern pat.i.t.arms.e

7992+ =/ empty=? &(?=(%lit -.x) =(%null form.lit.x))

7993+ =/ full=pattern ?:(empty y x)

7994+ ?. |(empty &(?=(%lit -.y) =(%null form.lit.y))) subject

7995+ ?. ?=(%cell -.full) subject

7996+ ?~ items.full subject

7997+ ?~ t.items.full subject

7998+ ?^ t.t.items.full subject

7999+ ?. |(?=(%bind -.i.items.full) ?=(%any -.i.items.full)) subject

8000+ ?. |(?=(%bind -.i.t.items.full) ?=(%any -.i.t.items.full)) subject

8001+ ?: =(0 jrec-fuel.state.p.subject)

8002+ [%| ["recursive mold unfolding needs unsupported inference" ~]]

8003+ =/ nil=itype [%const [%null %n 0 '~']]

8004+ =/ cell=itype [%cell [%face head.typ [%atom aura.typ]] [%face tail.typ typ]]

8005+ [%& [%union ~[nil cell] ~ ~ ~] state.p.subject(jrec-fuel (dec jrec-fuel.state.p.subject))]

8006+::

8007+:: A bounded source-proven tree match permits flat tag patterns and

8008+:: nonbinding catch-alls. Whole-case binders cannot consume the temporary

8009+:: structural view. Pattern count and field arity are checked first.

8010+++ grec-simple-pattern

8011+ |= [pat=pattern view=itype]

8012+ ^- ?

8013+ ?. ?=(%cell -.pat) |

8014+ ?~ items.pat |

8015+ =/ first=pattern i.items.pat

8016+ ?. ?=(%lit -.first) |

8017+ ?. =(%term form.lit.first) |

8018+ =/ chosen=(unit itype) (contextual-tagged-case view val.lit.first ~)

8019+ ?~ chosen |

8020+ ?> ?=(%cell -.u.chosen)

8021+ =/ rest=(list pattern) t.items.pat

8022+ =/ arity=? ?:(?=(%cell -.tal.u.chosen) ?=([* [* ~]] rest) ?=([* ~] rest))

8023+ ?. arity |

8024+ (levy rest |=(p=pattern |(?=(%bind -.p) ?=(%any -.p))))

8025+::

8026+:: A catch-all with no binder is safe even when it covers both cases.

8027+:: A bound whole case still declines to avoid exporting the analysis view.

8028+++ grec-patterns-eligible

8029+ |= [arms=(list arm) view=itype left=@ud]

8030+ ^- ?

8031+ ?~ arms &

8032+ ?: =(0 left) |

8033+ =/ pat=pattern pat.i.arms

8034+ ?. |(?=(%any -.pat) (grec-simple-pattern pat view)) |

8035+ $(arms t.arms, left (dec left))

8036+++ grec-match-view

8037+ |= [e=expr subject=iresult]

8038+ ^- iresult

8039+ ?: ?=(%| -.subject) subject

8040+ ?. ?=(%branch -.e) subject

8041+ ?. (grec-direct-context typ.p.subject sub.state.p.subject) subject

8042+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

8043+ ?. ?=(%grec -.typ) subject

8044+ ?~ arms.e subject

8045+ =/ view=(unit [view=itype left=@ud]) (grec-unfold-view typ jrec-fuel.state.p.subject)

8046+ ?~ view [%| ["recursive mold unfolding needs unsupported inference" ~]]

8047+ ?. (grec-patterns-eligible arms.e view.u.view 128) subject

8048+ [%& view.u.view state.p.subject(jrec-fuel left.u.view)]

8049+::

8050+:: A single-arm diagnostic only probes a direct, source-typed in-scope wing;

8051+:: other subjects retain the prior single-pattern inference path.

8052+++ grec-single-wing-subject

8053+ |= [e=expr env=ienv state=istate]

8054+ ^- (unit iresult)

8055+ ?. ?=(%wing -.e) ~

8056+ ?. ?=([@ ~] names.e) ~

8057+ =/ scheme=(unit ischeme) (ienv-lookup i.names.e env)

8058+ ?~ scheme ~

8059+ ?. (grec-direct-context typ.u.scheme sub.state) ~

8060+ `(infer-fragment e env state)

8061+::

8062+++ infer-known-union-branch-subject

8063+ |= [e=expr env=ienv subject=iresult]

8064+ ^- iresult

8065+ =. subject (grec-match-view e subject)

8066+ =. subject (jrec-match-view e subject)

8067+ =/ whole=(unit iresult) (infer-known-union-whole e env subject)

8068+ ?~ whole (infer-known-union-finite e env subject ~)

8069+ u.whole

8070+::

8071+++ infer-known-union-branch

8072+ |= [e=expr env=ienv state=istate]

8073+ ^- iresult

8074+ ?> ?=(%branch -.e)

8075+ (infer-known-union-branch-subject e env (infer-fragment subject.e env state))

8076+::

8077+++ infer-known-union-context-subject

8078+ |= [e=expr expected=itype env=ienv subject=iresult context=span]

8079+ ^- iresult

8080+ =. subject (grec-match-view e subject)

8081+ =. subject (jrec-match-view e subject)

8082+ =/ whole=(unit iresult) (infer-known-union-context-whole e expected env subject context)

8083+ ?~ whole (infer-known-union-finite e env subject `[expected context])

8084+ u.whole

8085+::

8086+:: Limit speculative subject inference to wings and shallow calls;

8087+:: grouping is peeled linearly and cannot introduce a nested branch.

8088+++ simple-union-subject-arg

8089+ |= e=expr

8090+ ^- ?

8091+ ?- -.e

8092+ %wing &

8093+ %lit &

8094+ %str !(lien pieces.e |=(p=piece ?=(%expr -.p)))

8095+ * |

8096+ ==

8097+::

8098+++ safe-union-subject

8099+ |= e=expr

8100+ ^- ?

8101+ ?: ?=(%group -.e) $(e inner.e)

8102+ ?: ?=(%wing -.e) &

8103+ ?. ?=(%call -.e) |

8104+ ?. ?=(%wing -.head.e) |

8105+ (levy args.e simple-union-subject-arg)

8106+::

8107+++ duplicate-loobean-arms

8108+ |= e=expr

8109+ ^- ?

8110+ ?. ?=(%branch -.e) |

8111+ ?~ arms.e |

8112+ ?~ t.arms.e |

8113+ ?^ t.t.arms.e |

8114+ =/ x=pattern pat.i.arms.e

8115+ =/ y=pattern pat.i.t.arms.e

8116+ ?. &(?=(%lit -.x) ?=(%lit -.y)) |

8117+ ?. &(=(%loobean form.lit.x) =(%loobean form.lit.y)) |

8118+ =(val.lit.x val.lit.y)

8119+::

8120+++ union-subject-call

8121+ |= e=expr

8122+ ^- ?

8123+ ?: ?=(%group -.e) $(e inner.e)

8124+ ?=(%call -.e)

8125+::

8126+++ known-union-subject

8127+ |= [e=expr env=ienv state=istate]

8128+ ^- (unit iresult)

8129+ ?. (safe-union-subject e) ~

8130+ =/ subject=iresult (infer-fragment e env state)

8131+ ?: ?=(%| -.subject) ?:((union-subject-call e) `subject ~)

8132+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

8133+ ?. |(?=(%union -.typ) ?=(%jrec -.typ) &(?=(%grec -.typ) (grec-direct-context typ.p.subject sub.state.p.subject))) ~

8134+ `subject

8135+::

8136+:: A direct wing with an already-known union may skip genuinely empty cases

8137+:: when checking a one-arm match. Other subjects keep their existing path.

8138+:: A directly known canonical list of an empty element contains only null.

8139+:: This helper never refines an opaque or variable-bound subject.

8140+++ empty-list-null-branch

8141+ |= [e=expr env=ienv state=istate expected=(unit [typ=itype context=span])]

8142+ ^- (unit iresult)

8143+ ?. ?=(%branch -.e) ~

8144+ ?~ arms.e ~

8145+ ?^ t.arms.e ~

8146+ ?. (unit-empty-pattern pat.i.arms.e) ~

8147+ ?. ?=(%wing -.subject.e) ~

8148+ ?. ?=([@ ~] names.subject.e) ~

8149+ =/ scheme=(unit ischeme) (ienv-lookup i.names.subject.e env)

8150+ ?~ scheme ~

8151+ ?. ?=(%collection -.typ.u.scheme) ~

8152+ ?. =(%list name.typ.u.scheme) ~

8153+ ?~ prelude.state ~

8154+ ?. =(at.u.prelude.state /lib/jibb/prelude/jibb) ~

8155+ =/ standard=(unit ischeme) (find-jibb-mold %list u.prelude.state)

8156+ ?~ standard ~

8157+ ?. =(u.standard [[%collection %list ~[[%var 0]]] ~[0]]) ~

8158+ =/ subject=iresult (infer-fragment subject.e env state)

8159+ ?: ?=(%| -.subject) ~

8160+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

8161+ ?. ?=(%collection -.typ) ~

8162+ ?. =(%list name.typ) ~

8163+ ?~ args.typ ~

8164+ ?^ t.args.typ ~

8165+ =/ proof=(unit [empty=? left=@ud]) (itype-empty-proof i.args.typ sub.state.p.subject 256)

8166+ ?~ proof ~

8167+ ?. empty.u.proof ~

8168+ ?~ expected `(infer-fragment val.i.arms.e env state.p.subject)

8169+ =/ body=iresult (infer-call-context-arg val.i.arms.e typ.u.expected env state.p.subject context.u.expected)

8170+ ?: ?=(%| -.body) `body

8171+ =/ fit=ifit (itype-fit typ.p.body typ.u.expected sub.state.p.body next.state.p.body)

8172+ ?: ?=(%unknown -.fit) `[%| ["single-case branch result constraint is not supported by partial inference" ~]]

8173+ ?: ?=(%bad -.fit) `[%| ["single-case branch arm does not fit its expected type" ~[[context.u.expected "expected type"] [(span-of val.i.arms.e) "branch arm"]]]]

8174+ ?: (itype-has-tag (itype-normalize typ.u.expected sub.fit))

8175+ `[%| ["single-case branch result needs context in partial inference" ~]]

8176+ `[%& typ.p.body state.p.body(sub sub.fit, next next.fit)]

8177+::

8178+++ known-empty-union-wing

8179+ |= [e=expr env=ienv state=istate]

8180+ ^- (unit iresult)

8181+ ?. ?=(%wing -.e) ~

8182+ ?. ?=([@ ~] names.e) ~

8183+ =/ scheme=(unit ischeme) (ienv-lookup i.names.e env)

8184+ ?~ scheme ~

8185+ ?. (contextual-direct-union typ.u.scheme) ~

8186+ =/ subject=iresult (infer-fragment e env state)

8187+ ?: ?=(%| -.subject) ~

8188+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

8189+ ?. ?=(%union -.typ) ~

8190+ =/ live=(unit (list itype)) (itype-live-cases cases.typ sub.state.p.subject caps.state.p.subject 4.096)

8191+ ?~ live ~

8192+ ?: =(u.live cases.typ) ~

8193+ `subject

8194+::

8195+:: Infer changes only against a fully known record spine. Retain the

8196+:: target type; unknown spines and repeated edits remain unsupported.

8197+++ change-spine-known

8198+ |= [t=itype sub=isub]

8199+ ^- ?

8200+ =. t (itype-walk t sub)

8201+ ?: ?=(%face -.t) &

8202+ ?. ?=(%cell -.t) |

8203+ =/ first=itype (itype-walk hed.t sub)

8204+ ?. ?=(%face -.first) |

8205+ $(t tal.t)

8206+::

8207+++ infer-change-edits

8208+ |= [edits=(list edit) target=itype env=ienv state=istate seen=(list term)]

8209+ ^- iresult

8210+ ?~ edits [%& target state]

8211+ =/ entry=edit i.edits

8212+ ?: (lien seen |=(name=term =(name name.entry)))

8213+ [%| ["repeated change fields are not supported by partial inference" ~]]

8214+ ?. (change-spine-known target sub.state)

8215+ [%| ["change target needs a known record in partial inference" ~]]

8216+ =/ found=(list itype) (record-fields-named name.entry target sub.state)

8217+ ?~ found

8218+ [%| ["record has no field `{(trip name.entry)}`" ~[[at.entry "unknown field"]]]]

8219+ ?^ t.found [%| ["change field is ambiguous in partial inference" ~]]

8220+ =/ expected=itype i.found

8221+ =/ value=iresult (infer-call-context-arg val.entry expected env state at.entry)

8222+ ?: ?=(%| -.value) value

8223+ =/ fit=ifit (itype-fit typ.p.value expected sub.state.p.value next.state.p.value)

8224+ ?: ?=(%unknown -.fit) [%| ["change field constraint is not supported by partial inference" ~]]

8225+ ?: ?=(%bad -.fit)

8226+ [%| ["change field and replacement do not unify" ~[[at.entry (site-type-note "expected replacement" expected sub.state.p.value)] [(span-of val.entry) (site-type-note "replacement" typ.p.value sub.state.p.value)]]]]

8227+ $(edits t.edits, state state.p.value(sub sub.fit, next next.fit), seen [name.entry seen])

8228+::

8229+:: Backtick constructs the canonical prelude unit, after checking its

8230+:: prepared template has the standard null and [~ u=A] cases.

8231+++ standard-unit-template

8232+ |= [template=ischeme at=path]

8233+ ^- ?

8234+ ?. =(at /lib/jibb/prelude/jibb) |

8235+ ?~ vars.template |

8236+ ?^ t.vars.template |

8237+ =/ v=@ud i.vars.template

8238+ =/ nil=itype [%const [%null %n 0 '~']]

8239+ =/ expected=itype

8240+ [%union ~[nil [%cell nil [%face %u [%var v]]]] `[at %unit] `%unit ~[[%var v]]]

8241+ =(typ.template expected)

8242+::

8243+:: A named missing-case diagnostic needs more than a failed fit: a case

8244+:: with that tag but the wrong payload is not a missing case. Unknown

8245+:: shapes and atom types that accept terms keep the proof conservative.

8246++$ itag-presence ?(%yes %no %maybe)

8247+++ tag-presence-cases

8248+ |= [cases=(list itype) value=@ sub=isub]

8249+ ^- itag-presence

8250+ ?~ cases %no

8251+ =/ first=itag-presence (tag-presence i.cases value sub)

8252+ ?: =(%yes first) %yes

8253+ =/ rest=itag-presence $(cases t.cases)

8254+ ?: =(%yes rest) %yes

8255+ ?: |(=(%maybe first) =(%maybe rest)) %maybe

8256+ %no

8257+::

8258+++ tag-presence

8259+ |= [t=itype value=@ sub=isub]

8260+ ^- itag-presence

8261+ =. t (itype-walk t sub)

8262+ ?- -.t

8263+ %const ?:(=(value val.literal.t) %yes %no)

8264+ %flag ?:(|(=(value 0) =(value 1)) %yes %no)

8265+ %atom ?:(|(=(%tas aura.t) =(%ta aura.t)) %maybe %no)

8266+ %face $(t body.t)

8267+ %cell

8268+ =/ first=itag-presence $(t hed.t)

8269+ ?: =(%yes first) %yes

8270+ =/ rest=itag-presence $(t tal.t)

8271+ ?: =(%yes rest) %yes

8272+ ?: |(=(%maybe first) =(%maybe rest)) %maybe

8273+ %no

8274+ %union (tag-presence-cases cases.t value sub)

8275+ * %maybe

5154 ==

8276 ==

5155::

8277::

8278+++ missing-union-tag

8279+ |= [e=expr expected=itype sub=isub context=span]

8280+ ^- (unit idiag)

8281+ ?. ?=(%lit -.e) ~

8282+ ?. =(%term form.lit.e) ~

8283+ =. expected (itype-walk expected sub)

8284+ |-

8285+ ?: ?=(%face -.expected) $(expected (itype-walk body.expected sub))

8286+ ?. ?=(%union -.expected) ~

8287+ ?. =(%no (tag-presence-cases cases.expected val.lit.e sub)) ~

8288+ =/ label=tape

8289+ ?~ label.expected "union {(show-itype expected sub)}"

8290+ (show-itype expected sub)

8291+ `["{label} has no case `{(trip txt.lit.e)}`" ~[[context "expected union"] [(span-of e) "tag"]]]

8292+::

8293+:: Locate a missing tag inside a syntactic tuple only by replaying the

8294+:: directional fit in source order. Uncertain or earlier failures stop

8295+:: the walk, preserving the generic diagnostic rather than guessing.

8296+++ nested-missing-tag

8297+ |= [e=expr actual=itype expected=itype sub=isub next=@ud context=span]

8298+ ^- (unit idiag)

8299+ =/ original=[left=itype right=itype] [actual expected]

8300+ ?: |(?=(%var -.left.original) ?=(%avar -.left.original) ?=(%rvar -.left.original) |(?=(%nvar -.left.original) ?=(%rnvar -.left.original)) ?=(%var -.right.original) ?=(%avar -.right.original) ?=(%rvar -.right.original) |(?=(%nvar -.right.original) ?=(%rnvar -.right.original))) ~

8301+ =/ fit=ifit (itype-fit actual expected sub next)

8302+ ?. ?=(%bad -.fit) ~

8303+ =. actual (itype-walk actual sub)

8304+ =. expected (itype-walk expected sub)

8305+ ?: &(?=(%face -.actual) ?=(%face -.expected))

8306+ ?. =(name.actual name.expected) ~

8307+ $(actual body.actual, expected body.expected)

8308+ ?: ?=(%face -.actual) $(actual body.actual)

8309+ ?: ?=(%face -.expected) $(expected body.expected)

8310+ =/ direct=(unit idiag) (missing-union-tag e expected sub context)

8311+ ?^ direct direct

8312+ ?. ?=(%tuple -.e) ~

8313+ (nested-missing-items items.e actual expected sub next context)

8314+::

8315+++ nested-missing-items

8316+ |= [items=(list item) actual=itype expected=itype sub=isub next=@ud context=span]

8317+ ^- (unit idiag)

8318+ ?~ items ~

8319+ ?~ t.items (nested-missing-tag val.i.items actual expected sub next context)

8320+ =/ original=[left=itype right=itype] [actual expected]

8321+ ?: |(?=(%var -.left.original) ?=(%avar -.left.original) ?=(%rvar -.left.original) |(?=(%nvar -.left.original) ?=(%rnvar -.left.original)) ?=(%var -.right.original) ?=(%avar -.right.original) ?=(%rvar -.right.original) |(?=(%nvar -.right.original) ?=(%rnvar -.right.original))) ~

8322+ =. actual (itype-walk actual sub)

8323+ =. expected (itype-walk expected sub)

8324+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

8325+ =/ first=ifit (itype-fit hed.actual hed.expected sub next)

8326+ ?: ?=(%bad -.first)

8327+ (nested-missing-tag val.i.items hed.actual hed.expected sub next context)

8328+ ?. ?=(%ok -.first) ~

8329+ $(items t.items, actual tal.actual, expected tal.expected, sub sub.first, next next.first)

8330+::

8331+:: A term-headed pair is the same noun as a two-item cell. Preserve the

8332+:: whole pair span for the synthetic head and the value's own span for

8333+:: the payload; unresolved term constraints follow ordinary cell inference.

8334+++ pair-as-cell

8335+ |= e=expr

8336+ ^- expr

8337+ ?> ?=(%pair -.e)

8338+ =/ head=expr [%lit at.e [%term %tas tag.e (crip ['%' (trip tag.e)])]]

8339+ [%tuple at.e ~[[at.e ~ head] [(span-of val.e) ~ val.e]]]

8340+::

8341+:: A segment costs one shared step; dynamic segments are not handled yet.

8342+++ qath-static-fuel

8343+ |= [segs=(list qseg) fuel=@ud]

8344+ ^- (unit @ud)

8345+ ?~ segs `fuel

8346+ ?: =(0 fuel) ~

8347+ ?. ?=(%knot -.i.segs) ~

8348+ $(segs t.segs, fuel (dec fuel))

8349+::

5156++ infer-fragment

8350++ infer-fragment

5157 |= [e=expr env=ienv state=istate]

8351 |= [e=expr env=ienv state=istate]

5158 ^- iresult

8352 ^- iresult

5159 ?- -.e

8353 ?- -.e

8354+ %pair $(e (pair-as-cell e))

5160 %lit

8355 %lit

5161 ?- form.lit.e

8356 ?- form.lit.e

5162 %number ?: =(%ud aura.lit.e)

8357 %number ?: =(%ud aura.lit.e)

@@ -5167,42 +8362,137 @@

5167 %duration [%& [%atom %dr] state]

8362 %duration [%& [%atom %dr] state]

5168 %knot [%& [%atom %ta] state]

8363 %knot [%& [%atom %ta] state]

5169 %loobean [%& [%flag ~] state]

8364 %loobean [%& [%flag ~] state]

5170− * [%| ["literal needs contextual inference" ~]]

8365+ %term [%& [%tag next.state lit.e |] state(next +(next.state), tags [[next.state lit.e] tags.state])]

8366+ %null [%& [%tag next.state lit.e |] state(next +(next.state), tags [[next.state lit.e] tags.state])]

5171 ==

8367 ==

5172− %str

8368+ %unit

5173− =/ interpolated=? (lien pieces.e |=(p=piece ?=(%expr -.p)))

8369+ ?~ prelude.state [%| ["unit construction needs the standard prelude in partial inference" ~]]

8370+ =/ standard=(unit ischeme) (find-jibb-mold %unit u.prelude.state)

8371+ ?~ standard [%| ["unit construction needs the standard prelude in partial inference" ~]]

8372+ ?. (standard-unit-template u.standard at.u.prelude.state)

8373+ [%| ["unit construction needs the standard prelude in partial inference" ~]]

8374+ =/ value=iresult $(e val.e)

8375+ ?: ?=(%| -.value) value

8376+ =/ result=(unit itype) (template-apply u.standard ~[typ.p.value])

5174− ?: interpolated [%| ["interpolation is not supported by partial inference" ~]]

8377+ ?~ result [%| ["unit construction is not supported by partial inference" ~]]

5175− [%& [%atom %t] state]

8378+ [%& u.result state.p.value]

8379+ %list

8380+ ?~ prelude.state [%| ["list literal needs the standard prelude in partial inference" ~]]

8381+ ?. =(at.u.prelude.state /lib/jibb/prelude/jibb)

8382+ [%| ["list literal needs the standard prelude in partial inference" ~]]

8383+ =/ standard=(unit ischeme) (find-jibb-mold %list u.prelude.state)

8384+ ?~ standard [%| ["list literal needs the standard prelude in partial inference" ~]]

8385+ ?. =(u.standard [[%collection %list ~[[%var 0]]] ~[0]])

8386+ [%| ["list literal needs the standard prelude in partial inference" ~]]

8387+ =/ element=itype [%var next.state]

8388+ =/ result=iresult (infer-open-list-items items.e element env state(next +(next.state)) at.e)

8389+ ?: ?=(%| -.result) result

8390+ [%& [%collection %list ~[element]] state.p.result]

8391+ %str (infer-string-pieces pieces.e env state)

8392+ %qath

8393+ ?~ prelude.state [%| ["application path needs the standard prelude in partial inference" ~]]

8394+ ?. =(at.u.prelude.state /lib/jibb/prelude/jibb)

8395+ [%| ["application path needs the standard prelude in partial inference" ~]]

8396+ =/ standard=(unit ischeme) (find-jibb-mold %qath u.prelude.state)

8397+ ?~ standard [%| ["application path needs the standard prelude in partial inference" ~]]

8398+ ?. ?=(~ vars.u.standard) [%| ["application path mold needs unsupported inference" ~]]

8399+ =/ typ=itype typ.u.standard

8400+ ?. ?=(%jrec -.typ) [%| ["application path mold needs unsupported inference" ~]]

8401+ ?. &(=(at.typ /lib/jibb/internal/jibb) =(%qath name.typ) =(%i head.typ) =(%ta aura.typ) =(%t tail.typ))

8402+ [%| ["application path mold needs unsupported inference" ~]]

8403+ ?: =(0 jrec-fuel.state) [%| ["recursive mold unfolding needs unsupported inference" ~]]

8404+ =/ remain=(unit @ud) (qath-static-fuel segs.e (dec jrec-fuel.state))

8405+ ?~ remain [%| ["application path segments need unsupported inference" ~]]

8406+ [%& typ state(jrec-fuel u.remain)]

5176 %wing

8407 %wing

5177 ?~ names.e [%| ["empty wing" ~]]

8408 ?~ names.e [%| ["empty wing" ~]]

8409+ ?^ t.names.e

8410+ ?^ t.t.names.e (infer-field-wing names.e env state)

8411+ =/ iface=(unit ifile) (find-jibb-interface i.t.names.e jimports.state)

8412+ ?~ iface (infer-field-wing names.e env state)

8413+ =/ member=(unit ischeme) (ienv-lookup i.names.e values.u.iface)

5178− ?^ t.names.e [%| ["field access is not supported by partial inference" ~]]

8414+ ?~ member [%| ["module member is not available to partial inference" ~]]

8415+ =. typ.u.member (itype-in-import typ.u.member u.iface i.t.names.e prelude.state)

8416+ =/ instance=[typ=itype state=istate] (instantiate-scheme u.member state)

8417+ [%& typ.instance state.instance]

5179 =/ scheme=(unit ischeme) (ienv-lookup i.names.e env)

8418 =/ scheme=(unit ischeme) (ienv-lookup i.names.e env)

8419+ ?~ scheme

5180− ?~ scheme [%| ["name is not available to partial inference" ~]]

8420+ ?~ prelude.state [%| ["name is not available to partial inference" ~]]

8421+ =/ prelude-entry=(unit ischeme) (ienv-lookup i.names.e values.u.prelude.state)

8422+ ?~ prelude-entry [%| ["name is not available to partial inference" ~]]

8423+ =/ inst=[typ=itype state=istate] (instantiate-scheme u.prelude-entry state)

8424+ [%& typ.inst state.inst]

5181 =/ instance=[typ=itype state=istate] (instantiate-scheme u.scheme state)

8425 =/ instance=[typ=itype state=istate] (instantiate-scheme u.scheme state)

5182 [%& typ.instance state.instance]

8426 [%& typ.instance state.instance]

5183 %group $(e inner.e)

8427 %group $(e inner.e)

8428+ %change

8429+ ?~ edits.e [%| ["a change takes at least one field" ~[[at.e "empty change"]]]]

8430+ =/ target=iresult $(e [%wing at.e target.e])

8431+ ?: ?=(%| -.target) target

8432+ (infer-change-edits edits.e typ.p.target env state.p.target ~)

8433+ %ctor [%& [%tag next.state tag.e &] state(next +(next.state), tags [[next.state tag.e] tags.state])]

5184 %trace

8434 %trace

5185 =/ traced=iresult $(e val.e)

8435 =/ traced=iresult $(e val.e)

5186 ?: ?=(%| -.traced) traced

8436 ?: ?=(%| -.traced) traced

5187 $(e then.e, state state.p.traced)

8437 $(e then.e, state state.p.traced)

8438+ %tuple

8439+ ?: &(?=(^ defer.state) ?=(^ prelude.state))

8440+ (dg-infer-tuple-items items.e env state)

5188− %tuple (infer-simple-items items.e env state)

8441+ (infer-simple-items items.e env state)

5189 %body

8442 %body

5190− ?^ defs.e [%| ["local definitions are not supported by partial inference" ~]]

8443+ ?~ defs.e $(e final.e)

5191− $(e final.e)

8444+ =/ local-names=(list term) (global-value-names defs.e)

8445+ ?. (local-names-valid defs.e env state)

8446+ [%| ["local definitions shadow a name" ~]]

8447+ =/ local-molds=imolds (collect-simple-molds defs.e)

8448+ ?. (local-mold-names-valid local-molds state)

8449+ [%| ["local molds shadow a name" ~]]

8450+ =/ local-state=istate

8451+ state(globals (weld local-names globals.state), molds (weld local-molds molds.state))

8452+ =/ mold-hole=(unit span) (simple-local-mold-hole defs.e)

8453+ ?^ mold-hole

8454+ [%| ["type hole needs a determined type" ~[[u.mold-hole "unresolved type hole"]]]]

8455+ ?. (local-molds-supported local-molds local-state)

8456+ [%| ["local molds need unsupported inference" ~]]

8457+ =/ values=(list def) (local-value-defs defs.e)

8458+ =/ locals=ilocal-result (infer-local-defs values env local-state)

8459+ ?: ?=(%| -.locals) locals

8460+ =/ result=iresult $(e final.e, env env.p.locals, state state.p.locals)

8461+ ?: ?=(%| -.result) result

8462+ [%& typ.p.result state.p.result(globals globals.state, molds molds.state)]

5192 %branch

8463 %branch

8464+ ?^ defer.state (dg-boolean-branch e env state)

5193 ?~ arms.e [%| ["branch is not supported by partial inference" ~]]

8465 ?~ arms.e [%| ["branch is not supported by partial inference" ~]]

8466+ ?~ t.arms.e

8467+ =/ empty-list=(unit iresult) (empty-list-null-branch e env state ~)

8468+ ?^ empty-list u.empty-list

8469+ =/ empty-union=(unit iresult) (known-empty-union-wing subject.e env state)

8470+ ?^ empty-union (infer-known-union-branch-subject e env u.empty-union)

8471+ =/ single=(unit iresult) (grec-single-wing-subject subject.e env state)

8472+ ?^ single (infer-known-union-branch-subject e env u.single)

8473+ ?: (single-structured-pattern e) (infer-single-case-branch e env state ~)

5194− ?~ t.arms.e (infer-cell-branch e env state)

8474+ (infer-cell-branch e env state ~)

5195− ?^ t.t.arms.e [%| ["branch is not supported by partial inference" ~]]

8475+ ?^ t.t.arms.e (infer-known-union-branch e env state)

8476+ =/ known=(unit iresult) (known-union-subject subject.e env state)

8477+ ?: &(?=(^ known) ?=(%| -.u.known) !(duplicate-loobean-arms e)) u.known

8478+ ?: &(?=(^ known) ?=(%& -.u.known) ?=(~ (unit-union-payload (itype-normalize typ.p.u.known sub.state.p.u.known))))

8479+ (infer-known-union-branch-subject e env u.known)

5196 =/ x=arm i.arms.e

8480 =/ x=arm i.arms.e

5197 =/ y=arm i.t.arms.e

8481 =/ y=arm i.t.arms.e

5198− ?. ?=(%lit -.pat.x) [%| ["branch pattern is not supported by partial inference" ~]]

8482+ ?: |((unit-empty-pattern pat.x) (unit-empty-pattern pat.y))

5199− ?. ?=(%lit -.pat.y) [%| ["branch pattern is not supported by partial inference" ~]]

8483+ (infer-unit-branch e env state ~)

8484+ ?. ?=(%lit -.pat.x) (infer-known-union-branch e env state)

8485+ ?. ?=(%lit -.pat.y) (infer-known-union-branch e env state)

5200 ?. &(=(%loobean form.lit.pat.x) =(%loobean form.lit.pat.y))

8486 ?. &(=(%loobean form.lit.pat.x) =(%loobean form.lit.pat.y))

5201− [%| ["branch pattern is not supported by partial inference" ~]]

8487+ (infer-known-union-branch e env state)

8488+ ?: &(?=(^ known) ?=(%& -.u.known)) (infer-known-union-branch-subject e env u.known)

5202 ?: =(val.lit.pat.x val.lit.pat.y)

8489 ?: =(val.lit.pat.x val.lit.pat.y)

5203 [%| ["branch does not cover both loobeans" ~]]

8490 [%| ["branch does not cover both loobeans" ~]]

5204 =/ subject=iresult $(e subject.e)

8491 =/ subject=iresult $(e subject.e)

5205 ?: ?=(%| -.subject) subject

8492 ?: ?=(%| -.subject) subject

8493+ =/ subject-type=itype (itype-normalize typ.p.subject sub.state.p.subject)

8494+ ?: ?=(%union -.subject-type)

8495+ [%| ["union-pattern branch subject is not supported by partial inference" ~]]

5206 =/ su=(unit isub) (itype-unify typ.p.subject [%flag ~] sub.state.p.subject)

8496 =/ su=(unit isub) (itype-unify typ.p.subject [%flag ~] sub.state.p.subject)

5207 ?~ su [%| ["loobean branch subject does not unify with ?" ~]]

8497 ?~ su [%| ["loobean branch subject does not unify with ?" ~]]

5208 =/ left=iresult $(e val.x, state state.p.subject(sub u.su))

8498 =/ left=iresult $(e val.x, state state.p.subject(sub u.su))

@@ -5215,78 +8505,973 @@

5215 [%| ["branch widening is not supported by partial inference" ~]]

8505 [%| ["branch widening is not supported by partial inference" ~]]

5216 =/ joined=(unit isub) (itype-unify typ.p.left typ.p.right sub.state.p.right)

8506 =/ joined=(unit isub) (itype-unify typ.p.left typ.p.right sub.state.p.right)

5217 ?~ joined

8507 ?~ joined

8508+ ?: |((itype-has-recursive ltype) (itype-has-recursive rtype))

8509+ [%| ["recursive branch matching is not supported by partial inference" ~]]

8510+ ?: |((itype-has-tag ltype) (itype-has-tag rtype) (itype-has-union ltype) (itype-has-union rtype))

8511+ [%| ["branch tag or union context is not supported by partial inference" ~]]

5218 =/ common=(unit itype) (itype-concrete-join typ.p.left typ.p.right sub.state.p.right)

8512 =/ common=(unit itype) (itype-concrete-join typ.p.left typ.p.right sub.state.p.right)

5219 ?^ common [%& u.common state.p.right]

8513 ?^ common [%& u.common state.p.right]

8514+ ?: |((itype-has-face typ.p.left sub.state.p.right) (itype-has-face typ.p.right sub.state.p.right))

8515+ [%| ["record branch matching is not supported by partial inference" ~]]

5220 ?: |((itype-has-any-atom typ.p.left sub.state.p.right) (itype-has-any-atom typ.p.right sub.state.p.right) (itype-family-related typ.p.left typ.p.right sub.state.p.right))

8516 ?: |((itype-has-any-atom typ.p.left sub.state.p.right) (itype-has-any-atom typ.p.right sub.state.p.right) (itype-family-related typ.p.left typ.p.right sub.state.p.right))

5221 [%| ["branch widening is not supported by partial inference" ~]]

8517 [%| ["branch widening is not supported by partial inference" ~]]

5222 [%| ["branch arms have incompatible types" ~[[(span-of val.x) (site-type-note "first arm" typ.p.left sub.state.p.right)] [(span-of val.y) (site-type-note "second arm" typ.p.right sub.state.p.right)]]]]

8518 [%| ["branch arms have incompatible types" ~[[(span-of val.x) (site-type-note "first arm" typ.p.left sub.state.p.right)] [(span-of val.y) (site-type-note "second arm" typ.p.right sub.state.p.right)]]]]

5223 [%& typ.p.left state.p.right(sub u.joined)]

8519 [%& typ.p.left state.p.right(sub u.joined)]

5224 %cast

8520 %cast

5225 =/ target=(unit [typ=itype state=istate]) (infer-simple-shape shape.e state)

8521 =/ target=(unit [typ=itype state=istate]) (infer-simple-shape shape.e state)

8522+ ?~ target

8523+ =/ diag=(unit idiag) (nested-import-invalid shape.e state)

8524+ ?^ diag [%| u.diag]

5226− ?~ target [%| ["cast mold is not supported by partial inference" ~]]

8525+ [%| ["cast mold is not supported by partial inference" ~]]

5227− =/ value=iresult $(e val.e, state state.u.target)

8526+ =/ value=iresult

8527+ (infer-call-context-arg val.e typ.u.target env state.u.target at.shape.e)

5228 ?: ?=(%| -.value) value

8528 ?: ?=(%| -.value) value

8529+ =/ shape=(unit [source=iwfields target=iwfields])

8530+ (width-shape typ.p.value typ.u.target sub.state.p.value)

8531+ ?^ shape [%| ["record width constraint needs unsupported inference" ~]]

5229 =/ fit=ifit (itype-fit typ.p.value typ.u.target sub.state.p.value next.state.p.value)

8532 =/ fit=ifit (itype-fit typ.p.value typ.u.target sub.state.p.value next.state.p.value)

5230 ?: ?=(%unknown -.fit) [%| ["cast constraint is not supported by partial inference" ~]]

8533 ?: ?=(%unknown -.fit) [%| ["cast constraint is not supported by partial inference" ~]]

5231 ?: ?=(%bad -.fit)

8534 ?: ?=(%bad -.fit)

8535+ =/ missing=(unit idiag) (missing-union-tag val.e typ.u.target sub.state.p.value at.shape.e)

8536+ ?^ missing [%| u.missing]

8537+ =/ nested=(unit idiag) (nested-missing-tag val.e typ.p.value typ.u.target sub.state.p.value next.state.p.value at.shape.e)

8538+ ?^ nested [%| u.nested]

5232 [%| ["cast mold and expression type do not unify" ~[[at.shape.e (site-type-note "cast mold" typ.u.target sub.state.p.value)] [(span-of val.e) (site-type-note "expression" typ.p.value sub.state.p.value)]]]]

8539 [%| ["cast mold and expression type do not unify" ~[[at.shape.e (site-type-note "cast mold" typ.u.target sub.state.p.value)] [(span-of val.e) (site-type-note "expression" typ.p.value sub.state.p.value)]]]]

8540+ ?: &(?=(^ defer.state.p.value) !(dg-stable-fit typ.p.value typ.u.target sub.fit))

8541+ [%| ["deferred cast fit needs stable inference" ~]]

8542+ =/ merged=itype (itype-merge-faces typ.p.value typ.u.target sub.fit)

5233− [%& typ.u.target state.p.value(sub sub.fit, next next.fit)]

8543+ [%& merged state.p.value(sub sub.fit, next next.fit)]

5234 %crash [%& [%var next.state] state(next +(next.state))]

8544 %crash [%& [%var next.state] state(next +(next.state))]

5235 %gate

8545 %gate

5236 =/ sam=isample-result (infer-sample sample.e env state)

8546 =/ sam=isample-result (infer-sample sample.e env state)

8547+ ?: ?=(%| -.sam)

8548+ =/ diag=(unit idiag) (sample-import-invalid sample.e env state)

8549+ ?: &(=(p.sam "sample mold is not supported by partial inference") ?=(^ diag)) [%| u.diag]

5237− ?: ?=(%| -.sam) [%| [p.sam ~]]

8550+ [%| [p.sam ~]]

5238 =/ body=iresult $(e body.e, env env.p.sam, state state.p.sam)

8551 =/ body=iresult $(e body.e, env env.p.sam, state state.p.sam)

5239 ?: ?=(%| -.body) body

8552 ?: ?=(%| -.body) body

5240 [%& [%fn typ.p.sam typ.p.body] state.p.body]

8553 [%& [%fn typ.p.sam typ.p.body] state.p.body]

5241 %gate-wide

8554 %gate-wide

5242 =/ sam=isample-result (infer-sample sample.e env state)

8555 =/ sam=isample-result (infer-sample sample.e env state)

8556+ ?: ?=(%| -.sam)

8557+ =/ diag=(unit idiag) (sample-import-invalid sample.e env state)

8558+ ?: &(=(p.sam "sample mold is not supported by partial inference") ?=(^ diag)) [%| u.diag]

5243− ?: ?=(%| -.sam) [%| [p.sam ~]]

8559+ [%| [p.sam ~]]

5244 =/ body=iresult $(e body.e, env env.p.sam, state state.p.sam)

8560 =/ body=iresult $(e body.e, env env.p.sam, state state.p.sam)

5245 ?: ?=(%| -.body) body

8561 ?: ?=(%| -.body) body

5246 [%& [%fn typ.p.sam typ.p.body] state.p.body]

8562 [%& [%fn typ.p.sam typ.p.body] state.p.body]

5247 %call

8563 %call

5248 ?~ args.e [%| ["call has no argument" ~]]

8564 ?~ args.e [%| ["call has no argument" ~]]

5249− ?^ t.args.e [%| ["multiple arguments are not supported by partial inference" ~]]

8565+ ?: (explicit-proj-call e env state)

5250− =/ head=iresult $(e head.e)

8566+ [%| ["proj needs an expected record type" ~]]

5251− ?: ?=(%| -.head) head

8567+ (infer-call-with-head e env state (infer-fragment head.e env state))

5252− =/ arg=iresult $(e i.args.e, state state.p.head)

5253− ?: ?=(%| -.arg) arg

5254− =/ st=istate state.p.arg

5255− =/ ht=itype (itype-walk typ.p.head sub.st)

5256− ?: ?=(%fn -.ht)

5257− =/ fit=ifit (itype-fit typ.p.arg sample.ht sub.st next.st)

5258− ?: ?=(%unknown -.fit) [%| ["call constraint is not supported by partial inference" ~]]

5259− ?: ?=(%bad -.fit)

5260− [%| ["call's sample and argument types do not unify" ~[[(span-of head.e) (site-type-note "called gate" ht sub.st)] [(span-of i.args.e) (site-type-note "argument" typ.p.arg sub.st)]]]]

5261− [%& product.ht st(sub sub.fit, next next.fit)]

5262− =/ result=itype [%var next.st]

5263− =/ uni=(unit isub) (itype-unify ht [%fn typ.p.arg result] sub.st)

5264− ?~ uni

5265− [%| ["call's sample and argument types do not unify" ~[[(span-of head.e) (site-type-note "called gate" ht sub.st)] [(span-of i.args.e) (site-type-note "argument" typ.p.arg sub.st)]]]]

5266− [%& result st(next +(next.st), sub u.uni)]

5267 * [%| ["expression is not supported by partial inference" ~]]

8568 * [%| ["expression is not supported by partial inference" ~]]

5268 ==

8569 ==

5269::

8570::

5270−:: Unfaced tuple expressions are the one supported cell construction.

8571+:: Locate a definite failing argument after the complete sample fit has

5271−:: Faced cells wait for the representation to preserve record faces.

8572+:: failed. If an intermediate fit is uncertain, retain the whole argument

8573+:: span rather than assigning blame to a particular argument.

8574+::

8575+:: Check a call using the head already inferred in this state. Keeping

8576+:: this shared avoids evaluating or instantiating a contextual head twice.

8577+++ width-has-projections

8578+ |= ps=(list iwprojection)

8579+ ^- ?

8580+ ?~ ps |

8581+ &

8582+::

8583++$ iwidth-elaboration [original=expr typ=itype sub=isub projections=(list iwprojection)]

8584+++ infer-width-elaboration

8585+ |= [e=expr env=ienv state=istate]

8586+ ^- (each iwidth-elaboration idiag)

8587+ =/ out=iresult (infer-fragment e env state)

8588+ ?: ?=(%| -.out) [%| p.out]

8589+ [%& [e typ.p.out sub.state.p.out (flop projections.state.p.out)]]

8590+::

8591+:: Source-bound gate-layout evidence, confined to checked root gate

8592+:: definitions and direct unshadowed prelude calls. The prepared prelude

8593+:: interface and its retained source are trusted as a matching artifact.

8594+:: Layouts identify sample binder faces; they do not change call arity or

8595+:: authorize stripping nested value faces. Unknown origins use ordinary fit.

8596+++ direct-written-gates

8597+ |= [ds=(list def) out=ivisited]

8598+ ^- ivisited

8599+ ?~ ds out

8600+ ?: ?=(%mold -.i.ds) $(ds t.ds)

8601+ ?. |(?=(%gate -.val.i.ds) ?=(%gate-wide -.val.i.ds)) $(ds t.ds)

8602+ $(ds t.ds, out (~(put by out) name.i.ds &))

8603+++ direct-may-use-prelude

8604+ |= [ds=(list def) root=ivisited heads=ivisited]

8605+ ^- ?

8606+ ?~ ds |

8607+ ?: ?=(%mold -.i.ds) $(ds t.ds)

8608+ =/ refs=(list term) (dependency-expr val.i.ds)

8609+ =/ has-root=? (lien refs |=(n=term ?=(^ (~(get by root) n))))

8610+ =/ has-head=? (lien refs |=(n=term ?=(^ (~(get by heads) n))))

8611+ ?: &(has-root has-head) &

8612+ $(ds t.ds)

8613+++ direct-unique-names

8614+ |= [names=(list term) seen=ivisited]

8615+ ^- ?

8616+ ?~ names &

8617+ ?: ?=(^ (~(get by seen) i.names)) |

8618+ $(names t.names, seen (~(put by seen) i.names &))

8619+++ direct-prelude-evidence

8620+ |= [ds=(list def) prelude=(unit ifile)]

8621+ ^- (unit igate-prelude-evidence)

8622+ ?~ prelude ~

8623+ ?~ source.u.prelude ~

8624+ =/ root=ivisited (direct-written-gates ds ~)

8625+ =/ names=(list term) (turn values.u.prelude |=(e=[name=term scheme=ischeme] name.e))

8626+ =/ heads=ivisited (graph-nameset names ~)

8627+ ?. (direct-may-use-prelude ds root heads) ~

8628+ =/ parsed (parse at.u.prelude u.source.u.prelude)

8629+ ?: ?=(%| -.parsed) ~

8630+ ?^ (duplicate-defs defs.p.parsed) ~

8631+ ?. (direct-unique-names (global-value-names defs.p.parsed) ~) ~

8632+ =/ gates=(map term def) (direct-checked-gates defs.p.parsed values.u.prelude)

8633+ `[u.prelude gates]

8634+++ direct-checked-gates

8635+ |= [ds=(list def) env=ienv]

8636+ ^- (map term def)

8637+ =/ names=(list term) (turn env |=(e=[name=term scheme=ischeme] name.e))

8638+ =/ known=ivisited (graph-nameset names ~)

8639+ =/ out=(map term def) ~

8640+ |-

8641+ ?~ ds out

8642+ =/ d=def i.ds

8643+ ?: ?=(%mold -.d) $(ds t.ds)

8644+ ?. ?=(^ (~(get by known) name.d)) $(ds t.ds)

8645+ ?. |(?=(%gate -.val.d) ?=(%gate-wide -.val.d)) $(ds t.ds)

8646+ $(ds t.ds, out (~(put by out) name.d d))

8647+++ direct-find-gate

8648+ |= [n=term ds=(list def)]

8649+ ^- (unit def)

8650+ ?~ ds ~

8651+ ?: &(?=(%value -.i.ds) =(n name.i.ds)) `i.ds

8652+ $(ds t.ds)

8653+++ direct-gate-sample

8654+ |= d=def

8655+ ^- (unit sample)

8656+ ?. ?=(%value -.d) ~

8657+ ?- -.val.d

8658+ %gate `sample.val.d

8659+ %gate-wide `sample.val.d

8660+ * ~

8661+ ==

8662+++ direct-sample-name

8663+ |= sam=sample

8664+ ^- (unit term)

8665+ ?- -.sam

8666+ %bind `name.sam

8667+ %face `name.sam

8668+ %pun `name.sam

8669+ * ~

8670+ ==

8671+++ direct-field-name

8672+ |= f=field

8673+ ^- (unit term)

8674+ ?- -.f

8675+ %face `name.f

8676+ %pun `name.f

8677+ * ~

8678+ ==

8679+++ direct-slot-body

8680+ |= [typ=itype name=(unit term)]

8681+ ^- (unit itype)

8682+ ?~ name `typ

8683+ ?. ?=(%face -.typ) ~

8684+ ?. =(name.typ u.name) ~

8685+ `body.typ

8686+++ direct-invariant

8687+ |= [a=itype b=itype sub=isub next=@ud]

8688+ ^- ifit

8689+ ?: (itype-face-asym a b sub) [%unknown ~]

8690+ =/ forward=ifit (itype-fit a b sub next)

8691+ ?. ?=(%ok -.forward) [%unknown ~]

8692+ ?: (itype-face-asym a b sub.forward) [%unknown ~]

8693+ =/ reverse=ifit (itype-fit b a sub.forward next.forward)

8694+ ?. ?=(%ok -.reverse) [%unknown ~]

8695+ reverse

8696+++ direct-function-fit

8697+ |= [a=itype b=itype sam=sample sh=shape sub=isub next=@ud]

8698+ ^- ifit

8699+ ?. &(?=(%fn -.a) ?=(%fn -.b) ?=(%cell -.sam) ?=(%fn -.sh)) [%unknown ~]

8700+ ?. ?=(%cell -.sample.sh) [%unknown ~]

8701+ =/ as=(list sample) items.sam

8702+ =/ bs=(list field) fields.sample.sh

8703+ ?~ as [%unknown ~]

8704+ ?~ t.as [%unknown ~]

8705+ ?^ t.t.as [%unknown ~]

8706+ ?~ bs [%unknown ~]

8707+ ?~ t.bs [%unknown ~]

8708+ ?^ t.t.bs [%unknown ~]

8709+ ?. &(?=(%cell -.sample.a) ?=(%cell -.sample.b)) [%unknown ~]

8710+ =/ an=(unit term) (direct-sample-name i.as)

8711+ =/ bn=(unit term) (direct-field-name i.bs)

8712+ ?: &(?=(^ an) ?=(^ bn) !=(u.an u.bn)) [%unknown ~]

8713+ =/ x=(unit itype) (direct-slot-body hed.sample.a an)

8714+ =/ y=(unit itype) (direct-slot-body hed.sample.b bn)

8715+ ?~ x [%unknown ~]

8716+ ?~ y [%unknown ~]

8717+ =/ first=ifit (direct-invariant u.x u.y sub next)

8718+ ?. ?=(%ok -.first) [%unknown ~]

8719+ =. an (direct-sample-name i.t.as)

8720+ =. bn (direct-field-name i.t.bs)

8721+ ?: &(?=(^ an) ?=(^ bn) !=(u.an u.bn)) [%unknown ~]

8722+ =/ x2=(unit itype) (direct-slot-body tal.sample.a an)

8723+ =/ y2=(unit itype) (direct-slot-body tal.sample.b bn)

8724+ ?~ x2 [%unknown ~]

8725+ ?~ y2 [%unknown ~]

8726+ =/ second=ifit (direct-invariant u.x2 u.y2 sub.first next.first)

8727+ ?. ?=(%ok -.second) [%unknown ~]

8728+ (direct-invariant product.a product.b sub.second next.second)

8729+:: This is a tentative proof: its caller must require closed call samples

8730+:: and repeat every positional check under the stable final substitution.

8731+++ direct-positional-fit

8732+ |= [args=(list expr) slots=(list sample) actual=itype expected=itype env=ienv state=istate sub=isub next=@ud]

8733+ ^- ifit

8734+ ?~ args [%unknown ~]

8735+ ?~ slots [%unknown ~]

8736+ =/ last=? ?=(~ t.args)

8737+ ?: !=(last ?=(~ t.slots)) [%unknown ~]

8738+ =/ split=(unit [left=itype right=itype])

8739+ ?: last `[actual expected]

8740+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

8741+ `[hed.actual hed.expected]

8742+ ?~ split [%unknown ~]

8743+ =/ x=itype left.u.split

8744+ =/ y=itype right.u.split

8745+ =/ expected-name=(unit term) (direct-sample-name i.slots)

8746+ =/ expected-body=(unit itype) (direct-slot-body y expected-name)

8747+ ?~ expected-body [%unknown ~]

8748+ =. y u.expected-body

8749+ =/ fit=ifit (itype-fit x y sub next)

8750+ =/ accepted=? &(?=(%ok -.fit) !(itype-positional-slot-face-asym x y sub.fit))

8751+ =/ result=(unit ifit)

8752+ ?: accepted `fit

8753+ ?. &(?=(%face -.i.slots) ?=(%fn -.shape.i.slots)) ~

8754+ ?. ?=(%wing -.i.args) ~

8755+ ?. ?=([@ ~] names.i.args) ~

8756+ ?. (unique-value-name i.names.i.args globals.state) ~

8757+ =/ source=(unit def) (~(get by gate-defs.state) i.names.i.args)

8758+ ?~ source ~

8759+ =/ sample=(unit sample) (direct-gate-sample u.source)

8760+ ?~ sample ~

8761+ =/ trial=ifit (direct-function-fit x y u.sample shape.i.slots sub next)

8762+ ?. ?=(%ok -.trial) ~

8763+ `trial

8764+ ?~ result [%unknown ~]

8765+ =. fit u.result

8766+ ?: last fit

8767+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) [%unknown ~]

8768+ ?. ?=(%ok -.fit) [%unknown ~]

8769+ $(args t.args, slots t.slots, actual tal.actual, expected tal.expected, sub sub.fit, next next.fit)

8770+++ direct-any-gate-arg

8771+ |= [args=(list expr) defs=(map term def)]

8772+ ^- ?

8773+ ?~ args |

8774+ =/ found=?

8775+ ?. ?=(%wing -.i.args) |

8776+ ?. ?=([@ ~] names.i.args) |

8777+ ?=(^ (~(get by defs) i.names.i.args))

8778+ ?: found &

8779+ $(args t.args)

8780+++ direct-gate-call-fit

8781+ |= [e=expr actual=itype expected=itype env=ienv state=istate]

8782+ ^- (unit ifit)

8783+ ?. ?=(%call -.e) ~

8784+ ?~ args.e ~

8785+ ?~ t.args.e ~

8786+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

8787+ ?. ?=(%wing -.head.e) ~

8788+ ?. ?=([@ ~] names.head.e) ~

8789+ ?. ?=(~ (ienv-lookup i.names.head.e env)) ~

8790+ ?. (unique-value-name i.names.head.e globals.state) ~

8791+ ?. (direct-any-gate-arg args.e gate-defs.state) ~

8792+ ?~ prelude.state ~

8793+ ?~ source.u.prelude.state ~

8794+ ?~ head-evidence.state ~

8795+ ?. =(u.prelude.state iface.u.head-evidence.state) ~

8796+ ?. ?=(^ (ienv-lookup i.names.head.e values.u.prelude.state)) ~

8797+ =/ head=(unit def) (~(get by gates.u.head-evidence.state) i.names.head.e)

8798+ ?~ head ~

8799+ =/ sam=(unit sample) (direct-gate-sample u.head)

8800+ ?~ sam ~

8801+ ?. ?=(%cell -.u.sam) ~

8802+ =/ fit=ifit (direct-positional-fit args.e items.u.sam actual expected env state sub.state next.state)

8803+ ?. ?=(%ok -.fit) ~

8804+ :: Enclosing inference may add constraints after this call. Only a

8805+ :: closed call-sample proof can remain stable under those later bindings.

8806+ =/ actual-final=itype (itype-normalize actual sub.fit)

8807+ =/ expected-final=itype (itype-normalize expected sub.fit)

8808+ ?^ (itype-vars actual-final) ~

8809+ ?^ (itype-vars expected-final) ~

8810+ ?: |((itype-has-tag actual-final) (itype-has-tag expected-final)) ~

8811+ :: A later argument may resolve a variable used by an earlier slot.

8812+ :: Recheck every fit and face against the completed substitution; no

8813+ :: additional binding or fresh variable is permitted in the second pass.

8814+ =/ verified=ifit (direct-positional-fit args.e items.u.sam actual expected env state sub.fit next.fit)

8815+ ?. ?=(%ok -.verified) ~

8816+ ?. &(=(sub.fit sub.verified) =(next.fit next.verified)) ~

8817+ `fit

8818+::

8819+++ infer-call-with-head

8820+ |= [e=expr env=ienv state=istate head=iresult]

8821+ ^- iresult

8822+ ?> ?=(%call -.e)

8823+ ?~ args.e [%| ["call has no argument" ~]]

8824+ ?: ?=(%| -.head) head

8825+ =/ head-type=itype (itype-walk typ.p.head sub.state.p.head)

8826+ =/ arg=iresult

8827+ ?^ t.args.e

8828+ ?: ?=(%fn -.head-type)

8829+ (infer-call-context-args args.e sample.head-type env state.p.head (span-of head.e))

8830+ (infer-simple-items (turn args.e |=(a=expr [(span-of a) ~ a])) env state.p.head)

8831+ ?: ?=(%fn -.head-type)

8832+ (infer-call-context-arg i.args.e sample.head-type env state.p.head (span-of head.e))

8833+ (infer-fragment i.args.e env state.p.head)

8834+ ?: ?=(%| -.arg) arg

8835+ =/ st=istate state.p.arg

8836+ =/ ht=itype (itype-walk typ.p.head sub.st)

8837+ ?: ?=(%fn -.ht)

8838+ =/ shape=(unit [source=iwfields target=iwfields])

8839+ ?^ t.args.e ~

8840+ (width-shape typ.p.arg sample.ht sub.st)

8841+ ?^ shape [%| ["record width constraint needs unsupported inference" ~]]

8842+ =/ fit=ifit

8843+ ?^ t.args.e (itype-fit-inner typ.p.arg sample.ht sub.st next.st & |)

8844+ (itype-fit typ.p.arg sample.ht sub.st next.st)

8845+ =/ direct=(unit ifit)

8846+ ?: ?=(%ok -.fit) ~

8847+ (direct-gate-call-fit e typ.p.arg sample.ht env st)

8848+ =. fit ?~(direct fit u.direct)

8849+ ?: ?=(%unknown -.fit)

8850+ ?~ defer.st [%| ["call constraint is not supported by partial inference" ~]]

8851+ =/ edge=(unit dgo) (dg-eligible-ctor e typ.p.head typ.p.arg sample.ht st)

8852+ ?~ edge [%| ["call constraint is not supported by partial inference" ~]]

8853+ ?: (gth (lent obligations.st) 63) [%| ["call constraint is not supported by partial inference" ~]]

8854+ [%& product.ht st(obligations [u.edge obligations.st])]

8855+

8856+ ?: ?=(%bad -.fit)

8857+ ?~ t.args.e

8858+ =/ missing=(unit idiag) (missing-union-tag i.args.e sample.ht sub.st (span-of head.e))

8859+ ?^ missing [%| u.missing]

8860+ =/ nested=(unit idiag) (nested-missing-tag i.args.e typ.p.arg sample.ht sub.st next.st (span-of head.e))

8861+ ?^ nested [%| u.nested]

8862+ [%| ["call's sample and argument types do not unify" ~[[(span-of head.e) (site-type-note "called gate" ht sub.st)] [(span-of i.args.e) (site-type-note "argument" typ.p.arg sub.st)]]]]

8863+ =/ bad=(unit [at=span typ=itype])

8864+ (call-error-site args.e typ.p.arg sample.ht sub.st next.st)

8865+ =/ whole-args=span

8866+ [beg:(span-of i.args.e) end:(span-of (rear args.e))]

8867+ =/ arg-at=span ?~(bad whole-args at.u.bad)

8868+ =/ arg-type=itype ?~(bad typ.p.arg typ.u.bad)

8869+ [%| ["call's sample and argument types do not unify" ~[[(span-of head.e) (site-type-note "called gate" ht sub.st)] [arg-at (site-type-note "argument" arg-type sub.st)]]]]

8870+ ?: &(?=(^ defer.st) !(dg-stable-call-fit typ.p.arg sample.ht product.ht sub.fit ?=(^ t.args.e)))

8871+ [%| ["deferred call fit needs stable inference" ~]]

8872+ =/ face-asym=?

8873+ ?^ direct |

8874+ ?^ t.args.e (itype-positional-face-asym args.e typ.p.arg sample.ht sub.fit)

8875+ (itype-face-asym typ.p.arg sample.ht sub.fit)

8876+ ?: &((itype-has-face typ.p.arg sub.fit) face-asym (itype-output-may-be-cell product.ht sub.fit))

8877+ [%| ["call result face propagation is not supported by partial inference" ~]]

8878+ [%& product.ht st(sub sub.fit, next next.fit)]

8879+ =/ result=itype [%var next.st]

8880+ =/ uni=(unit isub) (itype-unify ht [%fn typ.p.arg result] sub.st)

8881+ ?~ uni

8882+ [%| ["call's sample and argument types do not unify" ~[[(span-of head.e) (site-type-note "called gate" ht sub.st)] [(span-of i.args.e) (site-type-note "argument" typ.p.arg sub.st)]]]]

8883+ [%& result st(next +(next.st), sub u.uni)]

8884+::

8885+++ call-error-site

8886+ |= [args=(list expr) actual=itype expected=itype sub=isub next=@ud]

8887+ ^- (unit [at=span typ=itype])

8888+ ?~ args ~

8889+ =/ original=[left=itype right=itype] [actual expected]

8890+ ?: |(?=(%var -.left.original) ?=(%avar -.left.original) ?=(%rvar -.left.original) |(?=(%nvar -.left.original) ?=(%rnvar -.left.original)) ?=(%var -.right.original) ?=(%avar -.right.original) ?=(%rvar -.right.original) |(?=(%nvar -.right.original) ?=(%rnvar -.right.original))) ~

8891+ =. actual (itype-walk actual sub)

8892+ =. expected (itype-walk expected sub)

8893+ ?: &(?=(%face -.expected) !?=(%face -.actual))

8894+ $(expected body.expected)

8895+ ?~ t.args

8896+ =/ fit=ifit (itype-fit actual expected sub next)

8897+ ?. ?=(%bad -.fit) ~

8898+ `[(span-of i.args) (itype-normalize actual sub)]

8899+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

8900+ =/ first=ifit (itype-fit hed.actual hed.expected sub next)

8901+ ?: ?=(%bad -.first) `[(span-of i.args) (itype-normalize hed.actual sub)]

8902+ ?: ?=(%unknown -.first) ~

8903+ $(args t.args, actual tal.actual, expected tal.expected, sub sub.first, next next.first)

8904+::

8905+:: Context can help a call argument or cast value while the final fit

8906+:: checks the complete right-nested type, including any written faces.

8907+::

8908+:: Context can resolve the payload of a canonical prelude unit, but an

8909+:: unrelated union with a similar noun shape is not the same mold.

8910+++ infer-unit-context

8911+ |= [e=expr expected=itype env=ienv state=istate context=span]

8912+ ^- iresult

8913+ ?> ?=(%unit -.e)

8914+ ?> ?=(%union -.expected)

8915+ ?~ prelude.state (infer-fragment e env state)

8916+ =/ standard=(unit ischeme) (find-jibb-mold %unit u.prelude.state)

8917+ ?~ standard (infer-fragment e env state)

8918+ ?. (standard-unit-template u.standard at.u.prelude.state) (infer-fragment e env state)

8919+ ?. =(origin.expected `[at.u.prelude.state %unit]) (infer-fragment e env state)

8920+ ?~ args.expected (infer-fragment e env state)

8921+ ?^ t.args.expected (infer-fragment e env state)

8922+ =/ payload=itype i.args.expected

8923+ =/ canonical=(unit itype) (template-apply u.standard ~[payload])

8924+ ?~ canonical (infer-fragment e env state)

8925+ ?> ?=(%union -.u.canonical)

8926+ ?. =((itype-normalize expected(label ~) sub.state) (itype-normalize u.canonical(label ~) sub.state))

8927+ (infer-fragment e env state)

8928+ =/ value=iresult (infer-call-context-arg val.e payload env state context)

8929+ ?: ?=(%| -.value) value

8930+ =/ fit=ifit (itype-fit typ.p.value payload sub.state.p.value next.state.p.value)

8931+ ?: ?=(%unknown -.fit) [%| ["unit payload constraint is not supported by partial inference" ~]]

8932+ ?: ?=(%bad -.fit)

8933+ =/ missing=(unit idiag) (missing-union-tag val.e payload sub.state.p.value context)

8934+ ?^ missing [%| u.missing]

8935+ =/ nested=(unit idiag) (nested-missing-tag val.e typ.p.value payload sub.state.p.value next.state.p.value context)

8936+ ?^ nested [%| u.nested]

8937+ [%| ["unit payload does not fit its expected type" ~[[context (site-type-note "expected unit payload" payload sub.state.p.value)] [(span-of val.e) (site-type-note "payload" typ.p.value sub.state.p.value)]]]]

8938+ [%& expected state.p.value(sub sub.fit, next next.fit)]

8939+::

8940+:: A known gate may receive an enclosing target before its argument is

8941+:: inferred when its result is open or a direct, matching named generic

8942+:: union. Opaque, recursive, tag-constrained and variable-bound union

8943+:: results keep the existing directional path.

8944+++ infer-contextual-call

8945+ |= [e=expr expected=itype env=ienv state=istate]

8946+ ^- iresult

8947+ ?> ?=(%call -.e)

8948+ ?~ args.e [%| ["call has no argument" ~]]

8949+ =/ head=iresult (infer-fragment head.e env state)

8950+ ?: ?=(%| -.head) head

8951+ =/ ht=itype (itype-walk typ.p.head sub.state.p.head)

8952+ ?. ?=(%fn -.ht) (infer-call-with-head e env state head)

8953+ =/ result=itype (itype-walk product.ht sub.state.p.head)

8954+ =/ eligible=?

8955+ ?: ?=(%var -.result) &

8956+ :: A direct known generic union may receive the same nominal result

8957+ :: context before its arguments are checked. Variable-bound origins,

8958+ :: pending tags, recursive identities and unknown atoms stay open.

8959+ ?. &(?=(%union -.product.ht) ?=(%union -.result) ?=(%union -.expected)) |

8960+ ?~ origin.result |

8961+ ?. =(origin.result origin.expected) |

8962+ ?~ args.result |

8963+ ?. =((lent args.result) (lent args.expected)) |

8964+ ?: |((itype-has-tag (itype-normalize result sub.state.p.head)) (itype-has-tag (itype-normalize expected sub.state.p.head))) |

8965+ ?: |((itype-has-recursive (itype-normalize result sub.state.p.head)) (itype-has-recursive (itype-normalize expected sub.state.p.head))) |

8966+ ?: |((itype-has-any-atom result sub.state.p.head) (itype-has-any-atom expected sub.state.p.head)) |

8967+ &

8968+ ?. eligible (infer-call-with-head e env state head)

8969+ ?: |(?=(%var -.expected) ?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected)) (itype-has-tag (itype-normalize expected sub.state.p.head)))

8970+ (infer-call-with-head e env state head)

8971+ =/ sub=(unit isub) (itype-unify result expected sub.state.p.head)

8972+ ?~ sub (infer-call-with-head e env state head)

8973+ (infer-call-with-head e env state [%& typ.p.head state.p.head(sub u.sub)])

8974+::

8975+:: An eligible fully faced literal receives context by name, in source order.

8976+++ width-literal-fields

8977+ |= [items=(list item) axis=@ud fuel=@ud]

8978+ ^- (unit iwfields)

8979+ =/ order=(list iwfield) ~

8980+ =/ index=(map term iwfield) *(map term iwfield)

8981+ |-

8982+ ?~ items ~

8983+ ?: =(0 fuel) ~

8984+ ?~ face.i.items ~

8985+ =/ at-axis=@ud ?~(t.items axis (mul 2 axis))

8986+ =/ entry=iwfield [u.face.i.items at-axis [%noun ~]]

8987+ ?: ?=(^ (~(get by index) name.entry)) ~

8988+ =. index (~(put by index) name.entry entry)

8989+ =. order [entry order]

8990+ ?~ t.items `[(flop order) index]

8991+ $(items t.items, axis +((mul 2 axis)), fuel (dec fuel))

8992+++ width-infer-items

8993+ |= [items=(list item) expected=(map term iwfield) env=ienv state=istate context=span]

8994+ ^- iresult

8995+ ?~ items [%| ["empty record is not supported" ~]]

8996+ ?~ face.i.items [%| ["record face needs unsupported inference" ~]]

8997+ =/ field=(unit iwfield) (~(get by expected) u.face.i.items)

8998+ =/ head=iresult

8999+ ?~ field (infer-fragment val.i.items env state)

9000+ (infer-call-context-arg val.i.items typ.u.field env state context)

9001+ ?: ?=(%| -.head) head

9002+ =/ typ=itype [%face u.face.i.items typ.p.head]

9003+ ?~ t.items [%& typ state.p.head]

9004+ =/ tail=iresult $(items t.items, state state.p.head)

9005+ ?: ?=(%| -.tail) tail

9006+ [%& [%cell typ typ.p.tail] state.p.tail]

9007+++ width-infer-literal

9008+ |= [e=expr expected=itype env=ienv state=istate context=span]

9009+ ^- (unit iresult)

9010+ ?. ?=(%tuple -.e) ~

9011+ ?. |(?=(%cell -.expected) ?=(%face -.expected)) ~

9012+ =/ source=(unit iwfields) (width-literal-fields items.e 1 4.096)

9013+ =/ target=(unit iwfields) (width-scan expected sub.state 1 4.096)

9014+ ?~ source ~

9015+ ?~ target ~

9016+ ?: (lth (lent order.u.source) (lent order.u.target)) ~

9017+ ?. (width-in-order order.u.source order.u.target)

9018+ `(infer-simple-items items.e env state)

9019+ `(width-infer-items items.e index.u.target env state context)

9020+::

9021+:: Experimental intrinsic recognition; real bindings retain normal calls.

9022+++ explicit-proj-call

9023+ |= [e=expr env=ienv state=istate]

9024+ ^- ?

9025+ ?. ?=(%call -.e) |

9026+ ?. ?=([* ~] args.e) |

9027+ ?. ?=(%wing -.head.e) |

9028+ ?. =(names.head.e ~[%proj]) |

9029+ ?: ?=(^ (ienv-lookup %proj env)) |

9030+ ?: (lien globals.state |=(n=term =(n %proj))) |

9031+ ?~ prelude.state &

9032+ ?:(?=(^ (ienv-lookup %proj values.u.prelude.state)) | &)

9033+++ infer-proj-source

9034+ |= [e=expr expected=itype env=ienv state=istate context=span]

9035+ ^- iresult

9036+ ?: ?=(%group -.e) $(e inner.e)

9037+ =/ literal=(unit iresult) (width-infer-literal e expected env state context)

9038+ ?^ literal u.literal

9039+ (infer-fragment e env state)

9040+++ infer-proj-context

9041+ |= [e=expr expected=itype env=ienv state=istate context=span]

9042+ ^- iresult

9043+ ?> ?=(%call -.e)

9044+ ?~ args.e [%| ["proj needs one record" ~]]

9045+ ?. |(?=(%cell -.expected) ?=(%face -.expected)) [%| ["proj needs an expected record type" ~]]

9046+ =/ value=iresult (infer-proj-source i.args.e expected env state context)

9047+ ?: ?=(%| -.value) value

9048+ =/ shape=(unit [source=iwfields target=iwfields])

9049+ (width-proj-shape typ.p.value expected sub.state.p.value)

9050+ ?~ shape [%| ["proj needs a known record containing its expected fields" ~]]

9051+ =/ project=(unit iwidth-result) (width-project u.shape sub.state.p.value next.state.p.value)

9052+ ?~ project [%| ["proj constraint needs unsupported inference" ~]]

9053+ =/ st=istate state.p.value(sub sub.u.project, next next.u.project)

9054+ [%& expected st(projections [[at.e e typ.p.value expected steps.u.project] projections.st])]

9055+::

9056+:: A known literal singleton in a direct union can contextualize a

9057+:: loobean literal of the same noun. Only explicit singleton and cell

9058+:: competitors are considered; opaque or variable cases stay unknown.

9059+++ explicit-singleton-in-union

9060+ |= [t=itype noun=@]

9061+ ^- ?

9062+ ?. ?=(%union -.t) |

9063+ =/ cases=(list itype) cases.t

9064+ =/ found=? |

9065+ |-

9066+ ?~ cases found

9067+ =/ c=itype i.cases

9068+ ?: ?=(%cell -.c) $(cases t.cases)

9069+ ?. ?=(%const -.c) |

9070+ ?: =(noun val.literal.c)

9071+ ?: found |

9072+ $(cases t.cases, found &)

9073+ $(cases t.cases)

9074+::

9075+:: Select a written literal-headed case only when every competing case is

9076+:: also an explicit singleton-headed cell and exactly one matches. Opaque,

9077+:: variable-bound and differently shaped cases keep inference unchanged.

9078+:: This first slice supplies context to a directly called payload. Plain

9079+:: literal data and other expressions retain their existing inference path.

9080+++ contextual-atomic-arguments

9081+ |= args=(list expr)

9082+ ^- ?

9083+ ?~ args &

9084+ ?. ?=(?(%lit %wing %ctor) -.i.args) |

9085+ $(args t.args)

9086+++ contextual-direct-payload-call

9087+ |= e=expr

9088+ ^- ?

9089+ ?: ?=(%group -.e) $(e inner.e)

9090+ ?. ?=(%call -.e) |

9091+ ?. ?=(%wing -.head.e) |

9092+ ?~ args.e |

9093+ (contextual-atomic-arguments args.e)

9094+::

9095+:: A walked variable may have concealed a union inside a substituted

9096+:: structure before this arm was called. Decline in that case rather than

9097+:: deriving provenance from the already-walked type.

9098+++ contextual-simple-sub

9099+ |= sub=isub

9100+ ^- ?

9101+ ?~ sub &

9102+ ?: ?=(?(%cell %face %fn %union %collection) -.val.i.sub) |

9103+ $(sub t.sub)

9104+::

9105+:: Check the syntactic root before scanning; scan substitutions once.

9106+++ grec-direct-context

9107+ |= [expected=itype sub=isub]

9108+ ^- ?

9109+ =/ left=@ud 4.096

9110+ |-

9111+ ?: ?=(%face -.expected)

9112+ ?: =(0 left) |

9113+ $(expected body.expected, left (dec left))

9114+ ?. ?=(%grec -.expected) |

9115+ ?~ sub &

9116+ ?: =(0 left) |

9117+ ?: ?=(?(%cell %face %fn %union %collection %grec) -.val.i.sub) |

9118+ $(sub t.sub, left (dec left))

9119+++ contextual-direct-union

9120+ |= target=itype

9121+ ^- ?

9122+ ?: ?=(%face -.target) $(target body.target)

9123+ ?=(%union -.target)

9124+++ contextual-tagged-case

9125+ |= [target=itype tag=@ sub=isub]

9126+ ^- (unit itype)

9127+ ?. ?=(%union -.target) ~

9128+ =/ remaining=(list itype) cases.target

9129+ =/ found=(unit itype) ~

9130+ =/ seen=(set @) *(set @)

9131+ |-

9132+ ?~ remaining found

9133+ =/ c=itype i.remaining

9134+ ?. ?=(%cell -.c) ~

9135+ =/ head=itype hed.c

9136+ ?. ?=(%const -.head) ~

9137+ ?: (~(has in:..zuse seen) val.literal.head) ~

9138+ =. seen (~(put in:..zuse seen) val.literal.head)

9139+ ?: =(tag val.literal.head)

9140+ $(remaining t.remaining, found `c)

9141+ $(remaining t.remaining)

9142+::

9143+:: A bounded syntactic screen: no nested branch, cast, gate or local body

9144+:: can re-enter cell-branch retry during either inference attempt.

9145+++ closed-cell-retry-safe

9146+ |= [todo=(list expr) fuel=@ud]

9147+ ^- ?

9148+ ?~ todo &

9149+ ?: =(0 fuel) |

9150+ =/ e=expr i.todo

9151+ =. fuel (dec fuel)

9152+ ?+ -.e |

9153+ %lit $(todo t.todo)

9154+ %wing $(todo t.todo)

9155+ %ctor $(todo t.todo)

9156+ %path $(todo t.todo)

9157+ %crash $(todo t.todo)

9158+ %str

9159+ ?. (levy pieces.e |=(p=piece ?=(%text -.p))) |

9160+ $(todo t.todo)

9161+ %group $(todo [inner.e t.todo])

9162+ %pair $(todo [val.e t.todo])

9163+ %unit $(todo [val.e t.todo])

9164+ %list $(todo (weld items.e t.todo))

9165+ %tuple $(todo (weld (turn items.e |=(i=item val.i)) t.todo))

9166+ %change $(todo (weld (turn edits.e |=(ed=edit val.ed)) t.todo))

9167+ %call $(todo [head.e (weld args.e t.todo)])

9168+ %trace $(todo [val.e then.e t.todo])

9169+ ==

9170+::

9171+++ closed-cell-sub-safe

9172+ |= [sub=isub fuel=@ud]

9173+ ^- ?

9174+ ?~ sub &

9175+ ?: =(0 fuel) |

9176+ ?: ?=(?(%cell %face %fn %union %collection %grec %jrec %recursive) -.val.i.sub) |

9177+ $(sub t.sub, fuel (dec fuel))

9178+::

9179+++ closed-cell-branch-eligible

9180+ |= [e=expr expected=itype sub=isub]

9181+ ^- ?

9182+ ?. &(?=(%branch -.e) ?=(%cell -.expected) (closed-cell-sub-safe sub 512)) |

9183+ ?~ arms.e |

9184+ ?~ t.arms.e |

9185+ ?^ t.t.arms.e |

9186+ =/ x=arm i.arms.e

9187+ =/ y=arm i.t.arms.e

9188+ ?. &(?=(%lit -.pat.x) ?=(%lit -.pat.y)) |

9189+ ?. &(=(%loobean form.lit.pat.x) =(%loobean form.lit.pat.y)) |

9190+ ?: =(val.lit.pat.x val.lit.pat.y) |

9191+ (closed-cell-retry-safe ~[subject.e val.x val.y] 512)

9192+::

9193+:: Attempt ordinary inference first; retry from the same state only for

9194+:: the bounded non-reentrant syntax above. Preserve original value faces.

9195+++ infer-closed-cell-branch

9196+ |= [e=expr expected=itype env=ienv state=istate context=span]

9197+ ^- iresult

9198+ ?> (closed-cell-branch-eligible e expected sub.state)

9199+ ?> ?=(%branch -.e)

9200+ ?> ?=(^ arms.e)

9201+ ?> ?=(^ t.arms.e)

9202+ =/ ordinary=iresult (infer-fragment e env state)

9203+ =/ ordinary-good=?

9204+ ?: ?=(%| -.ordinary) |

9205+ =/ fit=ifit (itype-fit typ.p.ordinary expected sub.state.p.ordinary next.state.p.ordinary)

9206+ ?=(%ok -.fit)

9207+ ?: ordinary-good ordinary

9208+ =/ attempt=(unit iresult)

9209+ =/ x=arm i.arms.e

9210+ =/ y=arm i.t.arms.e

9211+ =/ subject=iresult (infer-fragment subject.e env state)

9212+ ?: ?=(%| -.subject) ~

9213+ =/ subject-type=itype (itype-normalize typ.p.subject sub.state.p.subject)

9214+ ?: ?=(%union -.subject-type) ~

9215+ =/ su=(unit isub) (itype-unify typ.p.subject [%flag ~] sub.state.p.subject)

9216+ ?~ su ~

9217+ =/ left=iresult (infer-call-context-arg val.x expected env state.p.subject(sub u.su) context)

9218+ ?: ?=(%| -.left) ~

9219+ =/ lf=ifit (itype-fit typ.p.left expected sub.state.p.left next.state.p.left)

9220+ ?. ?=(%ok -.lf) ~

9221+ =/ right=iresult (infer-call-context-arg val.y expected env state.p.left(sub sub.lf, next next.lf) context)

9222+ ?: ?=(%| -.right) ~

9223+ =/ rf=ifit (itype-fit typ.p.right expected sub.state.p.right next.state.p.right)

9224+ ?. ?=(%ok -.rf) ~

9225+ =/ sub=isub sub.rf

9226+ =/ next=@ud next.rf

9227+ =/ lt=itype (itype-normalize typ.p.left sub)

9228+ =/ rt=itype (itype-normalize typ.p.right sub)

9229+ =/ et=itype (itype-normalize expected sub)

9230+ ?. =(lt rt) ~

9231+ ?: |(?=(^ (itype-vars lt)) ?=(^ (itype-vars rt)) ?=(^ (itype-vars et))) ~

9232+ ?: |((itype-has-tag lt) (itype-has-tag rt) (itype-has-tag et)) ~

9233+ =/ lcheck=ifit (itype-fit typ.p.left expected sub next)

9234+ ?. ?=(%ok -.lcheck) ~

9235+ ?. &(=(sub.lcheck sub) =(next.lcheck next)) ~

9236+ =/ rcheck=ifit (itype-fit typ.p.right expected sub next)

9237+ ?. ?=(%ok -.rcheck) ~

9238+ ?. &(=(sub.rcheck sub) =(next.rcheck next)) ~

9239+ `[%& typ.p.left state.p.right(sub sub, next next)]

9240+ ?~ attempt ordinary

9241+ u.attempt

9242+::

9243+++ infer-call-context-arg

9244+ |= [e=expr expected=itype env=ienv state=istate context=span]

9245+ ^- iresult

9246+ ?: &(?=(^ defer.state) ?=(%branch -.e)) (infer-fragment e env state)

9247+ ?: &(?=(^ defer.state) ?=(^ prelude.state) ?=(%tuple -.e))

9248+ (infer-fragment e env state)

9249+ ?: ?=(%pair -.e) $(e (pair-as-cell e))

9250+ ?: ?=(%group -.e) $(e inner.e)

9251+ ?: &(?=(%body -.e) ?=(~ defs.e)) $(e final.e)

9252+ ?: ?=(%trace -.e)

9253+ =/ traced=iresult (infer-fragment val.e env state)

9254+ ?: ?=(%| -.traced) traced

9255+ $(e then.e, state state.p.traced)

9256+ =/ target=itype (itype-walk expected sub.state)

9257+ |-

9258+ ?: ?=(%face -.target) $(target (itype-walk body.target sub.state))

9259+ ?: (explicit-proj-call e env state)

9260+ (infer-proj-context e expected env state context)

9261+ :: Experimental construction only for a source-proven direct target.

9262+ :: Decline any walked structural binding to retain raw-variable provenance.

9263+ ?: &(?=(%grec -.target) ?=(%tuple -.e) (grec-direct-context expected sub.state))

9264+ =/ unfolded=(unit [view=itype left=@ud]) (grec-unfold-view target jrec-fuel.state)

9265+ ?~ unfolded [%| ["recursive mold unfolding needs unsupported inference" ~]]

9266+ ?~ items.e [%| ["recursive mold constructor needs unsupported inference" ~]]

9267+ =/ first=item i.items.e

9268+ ?. &(?=(~ face.first) ?=(%lit -.val.first) =(%term form.lit.val.first))

9269+ [%| ["recursive mold constructor needs unsupported inference" ~]]

9270+ =/ chosen=(unit itype) (contextual-tagged-case view.u.unfolded val.lit.val.first sub.state)

9271+ ?~ chosen [%| ["recursive mold constructor has no matching case" ~]]

9272+ =/ value=iresult (infer-call-context-items items.e u.chosen env state(jrec-fuel left.u.unfolded) context)

9273+ ?: ?=(%| -.value) value

9274+ =/ fit=ifit (itype-fit typ.p.value u.chosen sub.state.p.value next.state.p.value)

9275+ ?: ?=(%unknown -.fit) [%| ["recursive mold case needs unsupported inference" ~]]

9276+ ?: ?=(%bad -.fit) [%| ["recursive mold case does not fit its source shape" ~]]

9277+ [%& target state.p.value(sub sub.fit, next next.fit)]

9278+ :: Only the source-proven one-layer cell is exposed. Each recursive

9279+ :: descent consumes one written tuple; named values use ordinary fit.

9280+ ?: &(?=(%jrec -.target) ?=(%lit -.e) =(%null form.lit.e))

9281+ ?: =(0 jrec-fuel.state) [%| ["recursive mold unfolding needs unsupported inference" ~]]

9282+ [%& target state(jrec-fuel (dec jrec-fuel.state))]

9283+ ?: &(?=(%jrec -.target) ?=(%tuple -.e))

9284+ ?: =(0 jrec-fuel.state) [%| ["recursive mold unfolding needs unsupported inference" ~]]

9285+ =. state state(jrec-fuel (dec jrec-fuel.state))

9286+ =/ shape=itype

9287+ [%cell [%face head.target [%atom aura.target]] [%face tail.target target]]

9288+ =/ value=iresult (infer-call-context-items items.e shape env state context)

9289+ ?: ?=(%| -.value) value

9290+ =/ fit=ifit (itype-fit typ.p.value shape sub.state.p.value next.state.p.value)

9291+ ?: ?=(%unknown -.fit) [%| ["recursive mold cell constraint needs unsupported inference" ~]]

9292+ ?: ?=(%bad -.fit) [%| ["recursive mold cell does not fit its source shape" ~]]

9293+ [%& target state.p.value(sub sub.fit, next next.fit)]

9294+ ?: ?=(%call -.e) (infer-contextual-call e target env state)

9295+ =/ empty-list=(unit iresult) (empty-list-null-branch e env state `[target context])

9296+ ?^ empty-list u.empty-list

9297+ ?: (single-structured-pattern e)

9298+ ?> ?=(%branch -.e)

9299+ =/ empty-union=(unit iresult) (known-empty-union-wing subject.e env state)

9300+ ?^ empty-union (infer-known-union-context-subject e target env u.empty-union context)

9301+ =/ single=(unit iresult) (grec-single-wing-subject subject.e env state)

9302+ ?^ single (infer-known-union-context-subject e target env u.single context)

9303+ (infer-single-case-branch e env state `[target context])

9304+ ?: (cell-binder-pattern e)

9305+ (infer-cell-branch e env state `[target context])

9306+ :: In an explicit singleton context retain the written loobean noun;

9307+ :: the ordinary singleton fit compares its noun, not its spelling.

9308+ =/ singleton=(unit itype)

9309+ ?. ?=(%lit -.e) ~

9310+ ?. =(%loobean form.lit.e) ~

9311+ ?. |(?=(%const -.target) &(?=(%union -.expected) (explicit-singleton-in-union expected val.lit.e))) ~

9312+ `[%const lit.e]

9313+ ?^ singleton [%& u.singleton state]

9314+ =/ known=(unit iresult)

9315+ ?: ?=(%branch -.e) (known-union-subject subject.e env state)

9316+ ~

9317+ ?: &(?=(^ known) ?=(%| -.u.known) !(duplicate-loobean-arms e)) u.known

9318+ ?: &(?=(^ known) ?=(%& -.u.known) ?=(~ (unit-union-payload (itype-normalize typ.p.u.known sub.state.p.u.known))))

9319+ (infer-known-union-context-subject e target env u.known context)

9320+ ?: &(?=(%union -.target) ?=(%unit -.e))

9321+ (infer-unit-context e target env state context)

9322+ ?: (closed-cell-branch-eligible e expected sub.state)

9323+ (infer-closed-cell-branch e expected env state context)

9324+ ?: &(?=(%flag -.target) (context-union-branch e))

9325+ (infer-union-context e target env state context)

9326+ ?: &(?=(%union -.target) (context-union-branch e))

9327+ (infer-union-context e target env state context)

9328+ ?: &(?=(%collection -.target) =(%list name.target) (context-union-branch e))

9329+ (infer-union-context e target env state context)

9330+ ?: &(?=(%collection -.target) =(%list name.target) (context-list-expression e))

9331+ (infer-list-context e target env state context)

9332+ :: A literal-headed tuple can receive the unique case's payload

9333+ :: context. The ordinary final fit still checks the complete union.

9334+ =/ selected=(unit itype)

9335+ ?. &((contextual-simple-sub sub.state) (contextual-direct-union expected) ?=(%union -.target) ?=(%tuple -.e) ?=(^ items.e)) ~

9336+ ?~ t.items.e ~

9337+ ?^ t.t.items.e ~

9338+ ?. (contextual-direct-payload-call val.i.t.items.e) ~

9339+ =/ first=item i.items.e

9340+ ?. &(?=(~ face.first) ?=(%lit -.val.first) |(=(%term form.lit.val.first) =(%null form.lit.val.first) =(%loobean form.lit.val.first))) ~

9341+ (contextual-tagged-case target val.lit.val.first sub.state)

9342+ ?^ selected

9343+ ?> ?=(%tuple -.e)

9344+ :: On this bounded shallow-call shape, preserve any inference that

9345+ :: already fits before trying the new contextual path. Neither pass

9346+ :: can recursively select a nested tuple from the atomic arguments.

9347+ =/ ordinary=(unit iresult)

9348+ =/ initial=iresult (infer-fragment e env state)

9349+ ?: ?=(%| -.initial) ~

9350+ =/ fit=ifit (itype-fit typ.p.initial target sub.state.p.initial next.state.p.initial)

9351+ ?. ?=(%ok -.fit) ~

9352+ `initial

9353+ ?^ ordinary u.ordinary

9354+ =/ value=iresult (infer-call-context-items items.e u.selected env state context)

9355+ ?: ?=(%| -.value) value

9356+ =/ fit=ifit (itype-fit typ.p.value u.selected sub.state.p.value next.state.p.value)

9357+ ?: ?=(%unknown -.fit) [%| ["tagged case needs unsupported inference" ~]]

9358+ ?: ?=(%bad -.fit) [%| ["tagged case does not fit its expected type" ~[[context "expected union case"] [(span-of e) "value"]]]]

9359+ [%& typ.p.value state.p.value(sub sub.fit, next next.fit)]

9360+ ?: &(?=(%cell -.target) ?=(%tuple -.e))

9361+ (infer-call-context-items items.e target env state context)

9362+ (infer-fragment e env state)

9363+::

9364+:: Preserve each written face; the final complete sample fit checks faces.

9365+:: A tuple or positional field face belongs to the enclosing sample,

9366+:: not to the expression at that position. A second face, if present,

9367+:: is part of the value's own expected type.

9368+++ projection-field-target

9369+ |= expected=itype

9370+ ^- itype

9371+ ?:(?=(%face -.expected) body.expected expected)

9372+::

9373+++ infer-call-context-items

9374+ |= [items=(list item) expected=itype env=ienv state=istate context=span]

9375+ ^- iresult

9376+ ?~ items [%| ["empty cell is not supported by partial inference" ~]]

9377+ ?~ t.items

9378+ =/ last=iresult (infer-call-context-arg val.i.items (projection-field-target expected) env state context)

9379+ ?: ?=(%| -.last) last

9380+ =/ typ=itype typ.p.last

9381+ =. typ ?~(face.i.items typ [%face u.face.i.items typ])

9382+ [%& typ state.p.last]

9383+ =/ target=itype (itype-walk expected sub.state)

9384+ |-

9385+ ?: ?=(%face -.target) $(target (itype-walk body.target sub.state))

9386+ ?. ?=(%cell -.target) (infer-simple-items items env state)

9387+ =/ head=iresult (infer-call-context-arg val.i.items (projection-field-target hed.target) env state context)

9388+ ?: ?=(%| -.head) head

9389+ =/ typ=itype typ.p.head

9390+ =. typ ?~(face.i.items typ [%face u.face.i.items typ])

9391+ =/ tail=iresult (infer-call-context-items t.items tal.target env state.p.head context)

9392+ ?: ?=(%| -.tail) tail

9393+ [%& [%cell typ typ.p.tail] state.p.tail]

9394+::

9395+++ infer-call-context-args

9396+ |= [args=(list expr) expected=itype env=ienv state=istate context=span]

9397+ ^- iresult

9398+ ?~ args [%| ["call has no argument" ~]]

9399+ ?~ t.args (infer-call-context-arg i.args (projection-field-target expected) env state context)

9400+ =/ target=itype (itype-walk expected sub.state)

9401+ |-

9402+ ?: ?=(%face -.target) $(target (itype-walk body.target sub.state))

9403+ ?. ?=(%cell -.target)

9404+ (infer-simple-items (turn args |=(a=expr [(span-of a) ~ a])) env state)

9405+ =/ head=iresult (infer-call-context-arg i.args (projection-field-target hed.target) env state context)

9406+ ?: ?=(%| -.head) head

9407+ =/ tail=iresult (infer-call-context-args t.args tal.target env state.p.head context)

9408+ ?: ?=(%| -.tail) tail

9409+ [%& [%cell typ.p.head typ.p.tail] state.p.tail]

9410+::

9411+:: Tuple and record expressions preserve their explicitly written faces.

5272::

9412::

5273++ infer-simple-items

9413++ infer-simple-items

5274 |= [items=(list item) env=ienv state=istate]

9414 |= [items=(list item) env=ienv state=istate]

5275 ^- iresult

9415 ^- iresult

5276 ?~ items [%| ["empty cell is not supported by partial inference" ~]]

9416 ?~ items [%| ["empty cell is not supported by partial inference" ~]]

5277− ?^ face.i.items [%| ["record faces are not supported by partial inference" ~]]

5278 =/ head=iresult (infer-fragment val.i.items env state)

9417 =/ head=iresult (infer-fragment val.i.items env state)

5279 ?: ?=(%| -.head) head

9418 ?: ?=(%| -.head) head

9419+ =/ ht=itype typ.p.head

9420+ =. ht ?~(face.i.items ht [%face u.face.i.items ht])

5280− ?~ t.items head

9421+ ?~ t.items [%& ht state.p.head]

5281 =/ tail=iresult $(items t.items, state state.p.head)

9422 =/ tail=iresult $(items t.items, state state.p.head)

5282 ?: ?=(%| -.tail) tail

9423 ?: ?=(%| -.tail) tail

5283− [%& [%cell typ.p.head typ.p.tail] state.p.tail]

9424+ [%& [%cell ht typ.p.tail] state.p.tail]

9425+::

9426+:: A single all-binder cell pattern covers a known cell spine; the final

9427+:: binder captures the remaining noun. Other pattern matrices stay partial.

9428+::

9429+:: Validate binders before reading the subject, preserving shadow-error

9430+:: precedence. The last binder receives the entire remaining tail.

9431+++ cell-pattern-names

9432+ |= [pats=(list pattern) env=ienv globals=(list term) seen=(list term)]

9433+ ^- (each (list term) @t)

9434+ ?~ pats [%& ~]

9435+ ?. ?=(%bind -.i.pats) [%| 'branch pattern is not supported by partial inference']

9436+ =/ name=term name.i.pats

9437+ ?: |(=(name %proj) ?=(^ (ienv-lookup name env)) (lien globals |=(n=term =(n name))) (lien seen |=(n=term =(n name))))

9438+ [%| 'pattern shadows a name']

9439+ =/ rest=(each (list term) @t) $(pats t.pats, seen [name seen])

9440+ ?: ?=(%| -.rest) rest

9441+ [%& [name p.rest]]

9442+::

9443+++ cell-pattern-types

9444+ |= [names=(list term) env=ienv next=@ud]

9445+ ^- [typ=itype env=ienv next=@ud]

9446+ ?~ names !!

9447+ =/ head=itype [%var next]

9448+ =/ scope=ienv [[i.names [head ~]] env]

9449+ ?~ t.names [head scope +(next)]

9450+ =/ tail=[typ=itype env=ienv next=@ud] $(names t.names, env scope, next +(next))

9451+ [[%cell head typ.tail] env.tail next.tail]

9452+::

9453+:: At every position that must be a cell, opaque or sum types may still

9454+:: contain cells. Do not report a definite mismatch without unfolding them.

9455+++ cell-pattern-spine-unknown

9456+ |= [typ=itype names=(list term) sub=isub]

9457+ ^- ?

9458+ ?~ names |

9459+ ?~ t.names |

9460+ =. typ (itype-walk typ sub)

9461+ ?: ?=(%cell -.typ) $(typ tal.typ, names t.names)

9462+ |(?=(%union -.typ) ?=(%collection -.typ) ?=(%recursive -.typ) ?=(%jrec -.typ) ?=(%grec -.typ) ?=(%noun -.typ) ?=(%fn -.typ) ?=(%tag -.typ))

5284::

9463::

5285−:: A single two-binder cell pattern covers every value of a cell type.

9464+++ cell-binder-pattern

5286−:: No other pattern matrix is implemented here.

9465+ |= e=expr

9466+ ^- ?

9467+ ?. ?=(%branch -.e) |

9468+ ?~ arms.e |

9469+ ?^ t.arms.e |

9470+ ?. ?=(%cell -.pat.i.arms.e) |

9471+ !(single-structured-pattern e)

5287::

9472::

5288++ infer-cell-branch

9473++ infer-cell-branch

5289− |= [e=expr env=ienv state=istate]

9474+ |= [e=expr env=ienv state=istate expected=(unit [typ=itype context=span])]

5290 ^- iresult

9475 ^- iresult

5291 ?> ?=(%branch -.e)

9476 ?> ?=(%branch -.e)

5292 ?~ arms.e [%| ["branch is not supported by partial inference" ~]]

9477 ?~ arms.e [%| ["branch is not supported by partial inference" ~]]

@@ -5295,21 +9480,31 @@

5295 =/ pats=(list pattern) items.pat.arm

9480 =/ pats=(list pattern) items.pat.arm

5296 ?~ pats [%| ["branch pattern is not supported by partial inference" ~]]

9481 ?~ pats [%| ["branch pattern is not supported by partial inference" ~]]

5297 ?~ t.pats [%| ["branch pattern is not supported by partial inference" ~]]

9482 ?~ t.pats [%| ["branch pattern is not supported by partial inference" ~]]

5298− ?^ t.t.pats [%| ["branch pattern is not supported by partial inference" ~]]

9483+ =/ names=(each (list term) @t) (cell-pattern-names pats env globals.state ~)

5299− ?. ?=(%bind -.i.pats) [%| ["branch pattern is not supported by partial inference" ~]]

9484+ ?: ?=(%| -.names) [%| [(trip p.names) ~]]

5300− ?. ?=(%bind -.i.t.pats) [%| ["branch pattern is not supported by partial inference" ~]]

5301− =/ one=term name.i.pats

5302− =/ two=term name.i.t.pats

5303− ?: |(=(one two) ?=(^ (ienv-lookup one env)) ?=(^ (ienv-lookup two env)) (lien globals.state |=(x=term |(=(x one) =(x two)))))

5304− [%| ["pattern shadows a name" ~]]

5305 =/ subject=iresult (infer-fragment subject.e env state)

9485 =/ subject=iresult (infer-fragment subject.e env state)

5306 ?: ?=(%| -.subject) subject

9486 ?: ?=(%| -.subject) subject

5307 =/ st=istate state.p.subject

9487 =/ st=istate state.p.subject

5308− =/ head=itype [%var next.st]

9488+ =/ subject-type=itype (itype-normalize typ.p.subject sub.st)

5309− =/ tail=itype [%var +(next.st)]

9489+ ?: (itype-has-recursive subject-type)

9490+ [%| ["recursive pattern is not supported by partial inference" ~]]

9491+ ?: (itype-has-face typ.p.subject sub.st)

9492+ [%| ["record patterns are not supported by partial inference" ~]]

9493+ ?: (cell-pattern-spine-unknown subject-type p.names sub.st)

9494+ [%| ["cell pattern subject is not supported by partial inference" ~]]

9495+ =/ binders=[typ=itype env=ienv next=@ud] (cell-pattern-types p.names env next.st)

5310− =/ sub=(unit isub) (itype-unify typ.p.subject [%cell head tail] sub.st)

9496+ =/ sub=(unit isub) (itype-unify typ.p.subject typ.binders sub.st)

5311 ?~ sub [%| ["cell pattern does not match the subject type" ~]]

9497 ?~ sub [%| ["cell pattern does not match the subject type" ~]]

5312− (infer-fragment val.arm [[one [head ~]] [two [tail ~]] env] st(next (add 2 next.st), sub u.sub))

9498+ =. st st(next next.binders, sub u.sub)

9499+ ?~ expected (infer-fragment val.arm env.binders st)

9500+ =/ body=iresult (infer-call-context-arg val.arm typ.u.expected env.binders st context.u.expected)

9501+ ?: ?=(%| -.body) body

9502+ =/ fit=ifit (itype-fit typ.p.body typ.u.expected sub.state.p.body next.state.p.body)

9503+ ?: ?=(%unknown -.fit) [%| ["cell branch result constraint is not supported by partial inference" ~]]

9504+ ?: ?=(%bad -.fit) [%| ["cell branch arm does not fit its expected type" ~[[context.u.expected "expected type"] [(span-of val.arm) "branch arm"]]]]

9505+ ?: (itype-has-tag (itype-normalize typ.u.expected sub.fit))

9506+ [%| ["cell branch result needs context in partial inference" ~]]

9507+ [%& typ.u.expected state.p.body(sub sub.fit, next next.fit)]

5313::

9508::

5314++ show-itype

9509++ show-itype

5315 |= [t=itype sub=isub]

9510 |= [t=itype sub=isub]

@@ -5322,16 +9517,56 @@

5322 %avar

9517 %avar

5323 ?: (lth id.t 26) [(add 65 id.t) ~]

9518 ?: (lth id.t 26) [(add 65 id.t) ~]

5324 "T{<id.t>}"

9519 "T{<id.t>}"

9520+ %rvar

9521+ ?: (lth id.t 26) [(add 65 id.t) ~]

9522+ "T{<id.t>}"

5325 %nvar

9523 %nvar

5326 ?: (lth id.t 26) [(add 65 id.t) ~]

9524 ?: (lth id.t 26) [(add 65 id.t) ~]

5327 "T{<id.t>}"

9525 "T{<id.t>}"

9526+ %rnvar

9527+ ?: (lth id.t 26) [(add 65 id.t) ~]

9528+ "T{<id.t>}"

5328 %atom "@{(trip aura.t)}"

9529 %atom "@{(trip aura.t)}"

5329 %any-atom "@"

9530 %any-atom "@"

5330 %flag "?"

9531 %flag "?"

9532+ %noun "*"

9533+ %empty "!!"

9534+ %tag (trip txt.literal.t)

9535+ %const (trip txt.literal.t)

9536+ %union

9537+ ?~ label.t (show-itype-cases cases.t sub)

9538+ ?~ args.t (trip u.label.t)

9539+ "({(trip u.label.t)} {(show-itype-cases args.t sub)})"

9540+ %recursive ?~(label.t "recursive mold" (trip u.label.t))

9541+ %jrec ?~(label.t "recursive mold" (trip u.label.t))

9542+ %grec ?~(label.t "recursive mold" "({(trip u.label.t)} {(show-itype-cases args.t sub)})")

9543+ %collection "({(trip name.t)} {(show-itype-cases args.t sub)})"

9544+ %face "[{(trip name.t)}={(show-itype-context body.t sub)}]"

5331− %fn "$-({$(t sample.t)} {$(t product.t)})"

9545+ %fn "$-({(show-itype-context sample.t sub)} {(show-itype-context product.t sub)})"

5332− %cell "[{$(t hed.t)} {$(t tal.t)}]"

9546+ %cell "[{(show-itype-item hed.t sub)} {(show-itype-item tal.t sub)}]"

5333 ==

9547 ==

5334::

9548::

9549+++ show-itype-item

9550+ |= [t=itype sub=isub]

9551+ ^- tape

9552+ =. t (itype-walk t sub)

9553+ ?: ?=(%face -.t) "{(trip name.t)}={(show-itype-context body.t sub)}"

9554+ (show-itype-context t sub)

9555+::

9556+++ show-itype-context

9557+ |= [t=itype sub=isub]

9558+ ^- tape

9559+ =. t (itype-walk t sub)

9560+ ?: &(?=(%union -.t) ?=(~ label.t)) "({(show-itype t sub)})"

9561+ (show-itype t sub)

9562+::

9563+++ show-itype-cases

9564+ |= [cases=(list itype) sub=isub]

9565+ ^- tape

9566+ ?~ cases ""

9567+ ?~ t.cases (show-itype-context i.cases sub)

9568+ "{(show-itype-context i.cases sub)} {$(cases t.cases)}"

9569+::

5335:: Include the type at a conflicting site where it can be printed.

9570:: Include the type at a conflicting site where it can be printed.

5336:: A lone unresolved variable or decimal variable keeps the neutral label.

9571:: A lone unresolved variable or decimal variable keeps the neutral label.

5337::

9572::

@@ -5340,11 +9575,23 @@

5340 ^- ?

9575 ^- ?

5341 ?- -.typ

9576 ?- -.typ

5342 %nvar &

9577 %nvar &

9578+ %rnvar &

5343 %var |

9579 %var |

5344 %avar |

9580 %avar |

9581+ %rvar |

5345 %atom |

9582 %atom |

5346 %any-atom |

9583 %any-atom |

5347 %flag |

9584 %flag |

9585+ %noun |

9586+ %empty |

9587+ %tag |

9588+ %const |

9589+ %union |((lien cases.typ |=(c=itype (itype-has-nvar c))) (lien args.typ |=(c=itype (itype-has-nvar c))))

9590+ %recursive |

9591+ %jrec |

9592+ %grec (lien args.typ |=(c=itype (itype-has-nvar c)))

9593+ %collection (lien args.typ |=(c=itype (itype-has-nvar c)))

9594+ %face $(typ body.typ)

5348 %fn |($(typ sample.typ) $(typ product.typ))

9595 %fn |($(typ sample.typ) $(typ product.typ))

5349 %cell |($(typ hed.typ) $(typ tal.typ))

9596 %cell |($(typ hed.typ) $(typ tal.typ))

5350 ==

9597 ==

@@ -5353,7 +9600,8 @@

5353 |= [label=tape typ=itype sub=isub]

9600 |= [label=tape typ=itype sub=isub]

5354 ^- tape

9601 ^- tape

5355 =/ normalized=itype (itype-normalize typ sub)

9602 =/ normalized=itype (itype-normalize typ sub)

5356− ?: |(?=(%var -.normalized) ?=(%avar -.normalized) (itype-has-nvar normalized)) label

9603+ ?: |(?=(%var -.normalized) ?=(%avar -.normalized) ?=(%rvar -.normalized) (itype-has-nvar normalized) (itype-has-tag normalized) (itype-has-union normalized)) label

9604+ ?: (itype-has-hidden-recursive normalized) label

5357 =/ vars=(list @ud) (unique-type-vars (itype-vars normalized))

9605 =/ vars=(list @ud) (unique-type-vars (itype-vars normalized))

5358 ?: (gth (lent vars) 26) label

9606 ?: (gth (lent vars) 26) label

5359 =/ printable=itype (canonical-itype normalized vars)

9607 =/ printable=itype (canonical-itype normalized vars)

@@ -5362,13 +9610,68 @@

5362:: A capital in a written mold is generalized with its enclosing ++.

9610:: A capital in a written mold is generalized with its enclosing ++.

5363:: Atom constraints may remain generic; until full rigidity checking

9611:: Atom constraints may remain generic; until full rigidity checking

5364:: is implemented, do not report a type if one became more specific.

9612:: is implemented, do not report a type if one became more specific.

9613+:: Distinct written capitals cannot be forced equal; use the same

9614+:: capital where a type must be shared (Decisions 2026-10-30).

9615+::

9616+++ cap-id-in

9617+ |= [n=@ud caps=icaps sub=isub]

9618+ ^- ?

9619+ ?~ caps |

9620+ =/ resolved=itype (itype-walk [%var id.i.caps] sub)

9621+ =/ ident=(unit @ud)

9622+ ?+ -.resolved ~

9623+ %var `id.resolved

9624+ %avar `id.resolved

9625+ %rvar `id.resolved

9626+ ==

9627+ ?~ ident $(caps t.caps)

9628+ ?: =(n u.ident) &

9629+ $(caps t.caps)

9630+::

9631+++ cap-with-id

9632+ |= [n=@ud caps=icaps sub=isub]

9633+ ^- (unit icap)

9634+ ?~ caps ~

9635+ =/ resolved=itype (itype-walk [%var id.i.caps] sub)

9636+ =/ ident=(unit @ud)

9637+ ?+ -.resolved ~

9638+ %var `id.resolved

9639+ %avar `id.resolved

9640+ %rvar `id.resolved

9641+ ==

9642+ ?~ ident $(caps t.caps)

9643+ ?: =(n u.ident) `i.caps

9644+ $(caps t.caps)

9645+::

9646+++ merged-capitals

9647+ |= [caps=icaps sub=isub]

9648+ ^- (unit [first=icap second=icap])

9649+ ?~ caps ~

9650+ =/ resolved=itype (itype-walk [%var id.i.caps] sub)

9651+ =/ ident=(unit @ud)

9652+ ?+ -.resolved ~

9653+ %var `id.resolved

9654+ %avar `id.resolved

9655+ %rvar `id.resolved

9656+ ==

9657+ ?~ ident $(caps t.caps)

9658+ =/ found=(unit icap) (cap-with-id u.ident t.caps sub)

9659+ ?^ found `[u.found i.caps]

9660+ $(caps t.caps)

5365::

9661::

5366++ constrained-capitals

9662++ constrained-capitals

5367 |= [caps=icaps sub=isub]

9663 |= [caps=icaps sub=isub]

5368 ^- ?

9664 ^- ?

5369 ?~ caps |

9665 ?~ caps |

5370 =/ resolved=itype (itype-walk [%var id.i.caps] sub)

9666 =/ resolved=itype (itype-walk [%var id.i.caps] sub)

9667+ =/ ident=(unit @ud)

9668+ ?+ -.resolved ~

9669+ %var `id.resolved

5371− ?. |(?=(%var -.resolved) ?=(%avar -.resolved)) &

9670+ %avar `id.resolved

9671+ %rvar `id.resolved

9672+ ==

9673+ ?~ ident &

9674+ ?: (cap-id-in u.ident t.caps sub) &

5372 $(caps t.caps)

9675 $(caps t.caps)

5373::

9676::

5374:: An atom variable may be generalized when an explicit capital, sample

9677:: An atom variable may be generalized when an explicit capital, sample

@@ -5380,8 +9683,8 @@

5380 ^- ?

9683 ^- ?

5381 ?~ caps |

9684 ?~ caps |

5382 =/ resolved=itype (itype-walk [%var id.i.caps] sub)

9685 =/ resolved=itype (itype-walk [%var id.i.caps] sub)

5383− ?: ?=(%avar -.resolved)

9686+ ?: |(?=(%avar -.resolved) ?=(%rvar -.resolved))

5384− ?: =(n id.resolved) &

9687+ ?: =(n +.resolved) &

5385 $(caps t.caps)

9688 $(caps t.caps)

5386 $(caps t.caps)

9689 $(caps t.caps)

5387::

9690::

@@ -5391,10 +9694,22 @@

5391 ?- -.t

9694 ?- -.t

5392 %var |

9695 %var |

5393 %avar =(n id.t)

9696 %avar =(n id.t)

9697+ %rvar =(n id.t)

5394 %nvar |

9698 %nvar |

9699+ %rnvar |

5395 %atom |

9700 %atom |

5396 %any-atom |

9701 %any-atom |

5397 %flag |

9702 %flag |

9703+ %noun |

9704+ %empty |

9705+ %tag |

9706+ %const |

9707+ %union |((lien cases.t |=(c=itype (has-atom-var n c))) (lien args.t |=(c=itype (has-atom-var n c))))

9708+ %recursive |

9709+ %jrec |

9710+ %grec (lien args.t |=(c=itype (has-atom-var n c)))

9711+ %collection (lien args.t |=(c=itype (has-atom-var n c)))

9712+ %face $(t body.t)

5398 %fn |($(t sample.t) $(t product.t))

9713 %fn |($(t sample.t) $(t product.t))

5399 %cell |($(t hed.t) $(t tal.t))

9714 %cell |($(t hed.t) $(t tal.t))

5400 ==

9715 ==

@@ -5432,6 +9747,10 @@

5432 =/ out=tape ""

9747 =/ out=tape ""

5433 |-

9748 |-

5434 ?~ vars out

9749 ?~ vars out

9750+ ?: (itype-var-is-restricted i.vars t)

9751+ =/ sep=tape ?:(printed ", " " where ")

9752+ =/ clause=tape "{sep}{(show-itype [%rvar i.vars] ~)} is an atom other than ?"

9753+ $(vars t.vars, printed &, out (weld out clause))

5435 ?: (itype-var-is-atom i.vars t)

9754 ?: (itype-var-is-atom i.vars t)

5436 =/ sep=tape ?:(printed ", " " where ")

9755 =/ sep=tape ?:(printed ", " " where ")

5437 =/ clause=tape "{sep}{(show-itype [%avar i.vars] ~)} is an atom"

9756 =/ clause=tape "{sep}{(show-itype [%avar i.vars] ~)} is an atom"

@@ -5440,9 +9759,9 @@

5440::

9759::

5441:: Build the supported part of the value environment in dependency order.

9760:: Build the supported part of the value environment in dependency order.

5442:: Each pass adds successful definitions. Forward references become

9761:: Each pass adds successful definitions. Forward references become

5443−:: available on a later pass; recursive groups and unsupported syntax do

9762+:: available on a later pass; unsupported syntax does not enter the

5444−:: not enter the environment. Generalized definitions are closed, so a

9763+:: environment. Generalized definitions are closed, so a use instantiates

5445−:: use instantiates its variables afresh.

9764+:: its variables afresh.

5446::

9765::

5447++ global-value-names

9766++ global-value-names

5448 |= ds=(list def)

9767 |= ds=(list def)

@@ -5460,31 +9779,650 @@

5460 ?~ t.hits &

9779 ?~ t.hits &

5461 |

9780 |

5462::

9781::

5463−++ add-supported-defs

9782+:: A top-level gate may refer to itself through one monomorphic placeholder.

5464− |= [ds=(list def) env=ienv molds=imolds globals=(list term) externals=iexternals surs=(list term) mark-externals=imark-externals marks=(list term)]

9783+:: Its declared sample is inferred first and preserves its field faces.

9784+:: Unify the completed body with that placeholder before generalization;

9785+:: reporting repeats the same check instead of instantiating the gate's

9786+:: generalized interface inside its own body. Mutual groups stay unsupported.

9787+::

9788+++ direct-self-call

9789+ |= [e=expr name=term]

9790+ ^- ?

9791+ ?: ?=(%group -.e) $(e inner.e)

9792+ ?: &(?=(%body -.e) ?=(~ defs.e)) $(e final.e)

9793+ ?. ?=(%call -.e) |

9794+ ?. ?=(%wing -.head.e) |

9795+ =(names.head.e ~[name])

9796+::

9797+++ branch-base-arm

9798+ |= [e=expr name=term]

9799+ ^- (unit expr)

9800+ ?: ?=(%group -.e) $(e inner.e)

9801+ ?: &(?=(%body -.e) ?=(~ defs.e)) $(e final.e)

9802+ ?. ?=(%branch -.e) ~

9803+ ?~ arms.e ~

9804+ ?~ t.arms.e ~

9805+ ?^ t.t.arms.e ~

9806+ =/ x=arm i.arms.e

9807+ =/ y=arm i.t.arms.e

9808+ ?. &(?=(%lit -.pat.x) ?=(%lit -.pat.y)) ~

9809+ ?. &(=(%loobean form.lit.pat.x) =(%loobean form.lit.pat.y)) ~

9810+ ?: =(val.lit.pat.x val.lit.pat.y) ~

9811+ =/ first=? (direct-self-call val.x name)

9812+ =/ second=? (direct-self-call val.y name)

9813+ ?: =(first second) ~

9814+ `?:(first val.y val.x)

9815+::

9816+:: Infer the base arm independently, with the self binding removed. Only

9817+:: a closed type whose constraints resolved can seed the recursive result.

9818+:: The regular body inference then checks both arms with shared state.

9819+::

9820+++ recursive-branch-seed

9821+ |= [d=def env=ienv state=istate]

9822+ ^- (unit itype)

9823+ ?. ?=(%value -.d) ~

9824+ ?. |(?=(%gate -.val.d) ?=(%gate-wide -.val.d)) ~

9825+ =/ gate=expr val.d

9826+ =/ body=expr

9827+ ?- -.gate

9828+ %gate body.gate

9829+ %gate-wide body.gate

9830+ * !!

9831+ ==

9832+ =/ base=(unit expr) (branch-base-arm body name.d)

9833+ ?~ base ~

9834+ =/ outer=ienv (skim env |=(entry=[name=term scheme=ischeme] !=(name.entry name.d)))

9835+ =/ sam=isample-result

9836+ ?- -.gate

9837+ %gate (infer-sample sample.gate outer state)

9838+ %gate-wide (infer-sample sample.gate outer state)

9839+ * !!

9840+ ==

9841+ ?: ?=(%| -.sam) ~

9842+ =/ inferred=iresult (infer-fragment u.base env.p.sam state.p.sam)

9843+ ?: ?=(%| -.inferred) ~

9844+ ?: (pending-tags tags.state.p.inferred sub.state.p.inferred) ~

9845+ ?: (constrained-capitals caps.state.p.inferred sub.state.p.inferred) ~

9846+ =/ typ=itype (itype-normalize typ.p.inferred sub.state.p.inferred)

9847+ ?: ?=(^ (itype-vars typ)) ~

9848+ ?: (itype-has-tag typ) ~

9849+ `typ

9850+::

9851+++ infer-recursive-gate

9852+ |= [d=def env=ienv state=istate]

9853+ ^- iresult

9854+ ?^ defer.state [%| ["deferred recursive inference is unsupported" ~]]

9855+ =. gate-defs.state ~

9856+ ?. ?=(%value -.d) [%| ["recursive definition is not a gate" ~]]

9857+ ?. |(?=(%gate -.val.d) ?=(%gate-wide -.val.d))

9858+ [%| ["recursive definition is not a gate" ~]]

9859+ =/ result=(unit itype) (recursive-branch-seed d env state)

9860+ =/ gate=expr val.d

9861+ =/ sam=isample-result

9862+ ?- -.gate

9863+ %gate (infer-sample sample.gate env state)

9864+ %gate-wide (infer-sample sample.gate env state)

9865+ * !!

9866+ ==

9867+ ?: ?=(%| -.sam)

9868+ =/ diag=(unit idiag)

9869+ ?- -.gate

9870+ %gate (sample-import-invalid sample.gate env state)

9871+ %gate-wide (sample-import-invalid sample.gate env state)

9872+ * ~

9873+ ==

9874+ ?: &(=(p.sam "sample mold is not supported by partial inference") ?=(^ diag)) [%| u.diag]

9875+ [%| [p.sam ~]]

9876+ =/ id=@ud next.state.p.sam

9877+ =/ product=itype ?~(result [%var id] u.result)

9878+ =/ st=istate state.p.sam(next +(id))

9879+ =/ seed=itype [%fn typ.p.sam product]

9880+ =/ seeded=ienv [[name.d [seed ~]] env.p.sam]

9881+ =/ body=expr

9882+ ?- -.gate

9883+ %gate body.gate

9884+ %gate-wide body.gate

9885+ * !!

9886+ ==

9887+ =/ out=iresult (infer-fragment body seeded st)

9888+ ?: ?=(%| -.out) out

9889+ =/ uni=(unit isub) (itype-unify product typ.p.out sub.state.p.out)

9890+ ?~ uni [%| ["recursive gate constraint is not supported by partial inference" ~]]

9891+ [%& [%fn typ.p.sam typ.p.out] state.p.out(sub u.uni)]

9892+::

9893+++ dependency-root

9894+ |= names=(list term)

9895+ ^- (list term)

9896+ ?~ names ~

9897+ ~[(rear names)]

9898+::

9899+++ dependency-exprs

9900+ |= xs=(list expr)

9901+ ^- (list term)

9902+ ?~ xs ~

9903+ =/ first=(list term) (dependency-expr i.xs)

9904+ (weld first $(xs t.xs))

9905+::

9906+++ dependency-pieces

9907+ |= xs=(list piece)

9908+ ^- (list term)

9909+ ?~ xs ~

9910+ =/ first=(list term)

9911+ ?- -.i.xs

9912+ %expr (dependency-expr p.i.xs)

9913+ %text ~

9914+ ==

9915+ (weld first $(xs t.xs))

9916+::

9917+++ dependency-qsegs

9918+ |= xs=(list qseg)

9919+ ^- (list term)

9920+ ?~ xs ~

9921+ =/ first=(list term)

9922+ ?- -.i.xs

9923+ %expr (dependency-expr p.i.xs)

9924+ %knot ~

9925+ ==

9926+ (weld first $(xs t.xs))

9927+::

9928+++ dependency-items

9929+ |= xs=(list item)

9930+ ^- (list term)

9931+ ?~ xs ~

9932+ =/ first=(list term) (dependency-expr val.i.xs)

9933+ (weld first $(xs t.xs))

9934+::

9935+++ dependency-edits

9936+ |= xs=(list edit)

9937+ ^- (list term)

9938+ ?~ xs ~

9939+ =/ first=(list term) (dependency-expr val.i.xs)

9940+ (weld first $(xs t.xs))

9941+::

9942+++ dependency-arms

9943+ |= xs=(list arm)

9944+ ^- (list term)

9945+ ?~ xs ~

9946+ =/ first=(list term) (dependency-expr val.i.xs)

9947+ (weld first $(xs t.xs))

9948+::

9949+++ dependency-defs

9950+ |= xs=(list def)

9951+ ^- (list term)

9952+ ?~ xs ~

9953+ =/ first=(list term)

9954+ ?: ?=(%value -.i.xs) (dependency-expr val.i.xs)

9955+ ~

9956+ (weld first $(xs t.xs))

9957+::

9958+++ dependency-expr

9959+ |= e=expr

9960+ ^- (list term)

9961+ ?- -.e

9962+ %str (dependency-pieces pieces.e)

9963+ %qath (dependency-qsegs segs.e)

9964+ %wing (dependency-root names.e)

9965+ %change

9966+ =/ first=(list term) (dependency-root target.e)

9967+ =/ last=(list term) (dependency-edits edits.e)

9968+ (weld first last)

9969+ %pair (dependency-expr val.e)

9970+ %unit (dependency-expr val.e)

9971+ %group (dependency-expr inner.e)

9972+ %list (dependency-exprs items.e)

9973+ %tuple (dependency-items items.e)

9974+ %gate (dependency-expr body.e)

9975+ %gate-wide (dependency-expr body.e)

9976+ %call

9977+ =/ first=(list term) (dependency-expr head.e)

9978+ =/ last=(list term) (dependency-exprs args.e)

9979+ (weld first last)

9980+ %cast (dependency-expr val.e)

9981+ %trace

9982+ =/ first=(list term) (dependency-expr val.e)

9983+ =/ last=(list term) (dependency-expr then.e)

9984+ (weld first last)

9985+ %branch

9986+ =/ first=(list term) (dependency-expr subject.e)

9987+ =/ last=(list term) (dependency-arms arms.e)

9988+ (weld first last)

9989+ %body

9990+ =/ first=(list term) (dependency-defs defs.e)

9991+ =/ last=(list term) (dependency-expr final.e)

9992+ (weld first last)

9993+ * ~

9994+ ==

9995+::

9996+:: Infer a cyclic component with one monomorphic seed per gate. All members

9997+:: must succeed before any scheme is available; pending constraints and

9998+:: unresolved branch joins remain partial.

9999++$ igate-entry [name=term typ=itype body=expr env=ienv caps=icaps]

10000++$ igate-seeds (each [entries=(list igate-entry) state=istate] idiag)

10001+++ seed-gate-group

10002+ |= [ds=(list def) env=ienv state=istate]

10003+ ^- igate-seeds

10004+ ?~ ds [%& [~ state]]

10005+ =/ d=def i.ds

10006+ ?. ?=(%value -.d) [%| ["recursive group contains a non-gate" ~]]

10007+ =/ gate=expr val.d

10008+ ?. |(?=(%gate -.gate) ?=(%gate-wide -.gate))

10009+ [%| ["recursive group contains a non-gate" ~]]

10010+ =/ initial=istate (reserve-def-caps gate state)

10011+ =/ sam=isample-result

10012+ ?- -.gate

10013+ %gate (infer-sample sample.gate env initial)

10014+ %gate-wide (infer-sample sample.gate env initial)

10015+ * !!

10016+ ==

10017+ ?: ?=(%| -.sam) [%| [p.sam ~]]

10018+ =/ body=expr

10019+ ?- -.gate

10020+ %gate body.gate

10021+ %gate-wide body.gate

10022+ * !!

10023+ ==

10024+ =/ seed=itype [%fn typ.p.sam [%var next.state.p.sam]]

10025+ =/ entry=igate-entry [name.d seed body env.p.sam caps.state.p.sam]

10026+ =/ after=istate state.p.sam(next +(next.state.p.sam), caps caps.state)

10027+ =/ rest=igate-seeds $(ds t.ds, state after)

10028+ ?: ?=(%| -.rest) rest

10029+ [%& [[entry entries.p.rest] state.p.rest]]

10030+::

10031+++ group-seed-env

10032+ |= [entries=(list igate-entry) env=ienv]

5465 ^- ienv

10033 ^- ienv

5466− ?~ ds env

10034+ ?~ entries env

10035+ [[name.i.entries [typ.i.entries ~]] $(entries t.entries)]

10036+::

10037+++ infer-gate-group-bodies

10038+ |= [entries=(list igate-entry) seeds=ienv state=istate]

10039+ ^- igate-seeds

10040+ ?~ entries [%& [~ state]]

10041+ =/ entry=igate-entry i.entries

10042+ ?> ?=(%fn -.typ.entry)

10043+ =/ scope=ienv (weld seeds env.entry)

10044+ =/ out=iresult (infer-fragment body.entry scope state(caps caps.entry))

10045+ ?: ?=(%| -.out) out

10046+ =/ uni=(unit isub) (itype-unify product.typ.entry typ.p.out sub.state.p.out)

10047+ ?~ uni [%| ["recursive group constraint is not supported by partial inference" ~]]

10048+ =. caps.entry caps.state.p.out

10049+ =/ after=istate state.p.out(sub u.uni, caps caps.state)

10050+ =/ rest=igate-seeds $(entries t.entries, state after)

10051+ ?: ?=(%| -.rest) rest

10052+ [%& [[entry entries.p.rest] state.p.rest]]

10053+::

10054+++ group-schemes

10055+ |= [entries=(list igate-entry) env=ienv outer=istate state=istate]

10056+ ^- (each ienv idiag)

10057+ ?~ entries [%& ~]

10058+ =/ entry=igate-entry i.entries

10059+ =/ merged=(unit [first=icap second=icap]) (merged-capitals caps.entry sub.state)

10060+ ?^ merged

10061+ [%| ["distinct type variables must not be forced equal" ~[[at.first.u.merged "first type variable"] [at.second.u.merged "second type variable"]]]]

10062+ ?: (constrained-capitals caps.entry sub.state)

10063+ [%| ["explicit capital constraints are not supported by partial inference" ~]]

10064+ =/ typ=itype (itype-normalize typ.entry sub.state)

10065+ ?: (itype-has-nvar typ) [%| ["recursive group needs unsupported inference" ~]]

10066+ ?: |((itype-has-tag typ) (itype-has-hidden-generic typ) (itype-has-hidden-recursive typ) (unsupported-atom-vars typ caps.entry binders.state sub.state))

10067+ [%| ["recursive group needs unsupported inference" ~]]

10068+ =/ free=(list @ud) (weld (free-env-vars env sub.state) (free-cap-vars caps.outer sub.state))

10069+ =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

10070+ =. vars (skim vars |=(n=@ud !(lien free |=(f=@ud =(f n)))))

10071+ ?: (gth (lent vars) 26) [%| ["recursive group needs too many type variables" ~]]

10072+ =/ rest=(each ienv idiag) $(entries t.entries)

10073+ ?: ?=(%| -.rest) rest

10074+ [%& [[name.entry [typ vars]] p.rest]]

10075+::

10076+++ infer-gate-group

10077+ |= [ds=(list def) env=ienv state=istate]

10078+ ^- ilocal-result

10079+ ?^ defer.state [%| ["deferred recursive inference is unsupported" ~]]

10080+ =/ names=(list term) (global-value-names ds)

10081+ ?. (levy names |=(n=term (unique-value-name n names)))

10082+ [%| ["recursive group contains duplicate names" ~]]

10083+ ?: (lien names |=(n=term ?=(^ (ienv-lookup n env))))

10084+ [%| ["recursive group shadows a name" ~]]

10085+ =/ scoped=istate state(globals (weld names globals.state), gate-defs ~)

10086+ =/ seeded=igate-seeds (seed-gate-group ds env scoped)

10087+ ?: ?=(%| -.seeded) seeded

10088+ =/ seeds=ienv (group-seed-env entries.p.seeded ~)

10089+ =/ body=igate-seeds (infer-gate-group-bodies entries.p.seeded seeds state.p.seeded)

10090+ ?: ?=(%| -.body) body

10091+ :: Per-member ownership through mutual recursion is not implemented.

10092+ ?: !=(projections.state.p.body projections.state)

10093+ [%| ["record projection in recursive groups needs unsupported inference" ~]]

10094+ ?: !=(holes.state.p.body holes.state)

10095+ [%| ["holes in recursive groups need unsupported inference" ~]]

10096+ ?: (pending-tags tags.state.p.body sub.state.p.body)

10097+ [%| ["recursive group has unresolved literal constraints" ~]]

10098+ =/ schemes=(each ienv idiag) (group-schemes entries.p.body env state state.p.body)

10099+ ?: ?=(%| -.schemes) schemes

10100+ [%& [(weld p.schemes env) state.p.body(globals globals.state)]]

10101+::

10102+++ width-finalize

10103+ |= [ps=(list iwprojection) sub=isub visible=(list @ud)]

10104+ ^- (unit (list iwprojection))

10105+ ?~ ps `~

10106+ ?: (lien t.ps |=(p=iwprojection =(at.p at.i.ps))) ~

10107+ =/ src=itype (default-decimals (itype-normalize source.i.ps sub))

10108+ =/ dst=itype (default-decimals (itype-normalize target.i.ps sub))

10109+ ?: |((itype-has-nvar src) (itype-has-nvar dst) (itype-has-tag src) (itype-has-tag dst)) ~

10110+ =/ vars=(list @ud) (weld (itype-vars src) (itype-vars dst))

10111+ ?. (levy vars |=(n=@ud (lien visible |=(v=@ud =(n v))))) ~

10112+ =/ rest=(unit (list iwprojection)) $(ps t.ps)

10113+ ?~ rest ~

10114+ =/ entry=iwprojection i.ps

10115+ =. entry entry(source src, target dst)

10116+ `[entry u.rest]

10117+::

10118+++ add-supported-defs

10119+ |= [ds=(list def) all-defs=(list def) checked=(map term def) heads=(unit igate-prelude-evidence) env=ienv molds=imolds globals=(list term) externals=iexternals surs=(list term) mark-externals=imark-externals marks=(list term) jimports=ijimports reserved-molds=(list term) at=path prelude=(unit ifile) artifacts=(list iwidth-definition)]

10120+ ^- [env=ienv artifacts=(list iwidth-definition)]

10121+ (add-supported-defs-core ds all-defs checked heads env molds globals externals surs mark-externals marks jimports reserved-molds at prelude artifacts ~)

10122+::

10123+

10124++$ iresolved [env=ienv grouped=(list term) artifacts=(list iwidth-definition)]

10125++$ iadj (map term (list term))

10126++$ ivisited (map term ?)

10127++$ iwork (list [name=term done=?])

10128++$ iwresult [seen=ivisited order=(list term)]

10129++$ icresult [seen=ivisited component=(list term)]

10130++$ icomponents (list (list term))

10131+++ graph-nameset

10132+ |= [names=(list term) seen=ivisited]

10133+ ^- ivisited

10134+ ?~ names seen

10135+ $(names t.names, seen (~(put by seen) i.names &))

10136+::

10137+++ graph-edges

10138+ |= [name=term graph=iadj]

10139+ ^- (list term)

10140+ =/ found=(unit (list term)) (~(get by graph) name)

10141+ ?~ found ~

10142+ u.found

10143+::

10144+++ graph-make-forward

10145+ |= [ds=(list def) names=ivisited graph=iadj]

10146+ ^- iadj

10147+ ?~ ds graph

10148+ ?. ?=(%value -.i.ds) $(ds t.ds)

10149+ =/ deps=(list term) (dependency-expr val.i.ds)

10150+ =. deps (skim deps |=(n=term ?=(^ (~(get by names) n))))

10151+ $(ds t.ds, graph (~(put by graph) name.i.ds deps))

10152+::

10153+++ graph-add-reverse

10154+ |= [name=term edges=(list term) reverse=iadj]

10155+ ^- iadj

10156+ ?~ edges reverse

10157+ =/ prior=(list term) (graph-edges i.edges reverse)

10158+ $(edges t.edges, reverse (~(put by reverse) i.edges [name prior]))

10159+::

10160+++ graph-reverse

10161+ |= [names=(list term) graph=iadj reverse=iadj]

10162+ ^- iadj

10163+ ?~ names reverse

10164+ =. reverse (graph-add-reverse i.names (graph-edges i.names graph) reverse)

10165+ $(names t.names)

10166+::

10167+++ graph-order

10168+ |= [todo=iwork seen=ivisited order=(list term) graph=iadj]

10169+ ^- iwresult

10170+ ?~ todo [seen order]

10171+ =/ event=[name=term done=?] i.todo

10172+ ?: done.event $(todo t.todo, order [name.event order])

10173+ ?: ?=(^ (~(get by seen) name.event)) $(todo t.todo)

10174+ =. seen (~(put by seen) name.event &)

10175+ =/ children=iwork (turn (graph-edges name.event graph) |=(n=term [n |]))

10176+ $(todo (weld children [[name.event &] t.todo]))

10177+::

10178+++ graph-collect

10179+ |= [todo=(list term) seen=ivisited component=(list term) graph=iadj]

10180+ ^- icresult

10181+ ?~ todo [seen component]

10182+ ?: ?=(^ (~(get by seen) i.todo)) $(todo t.todo)

10183+ =. seen (~(put by seen) i.todo &)

10184+ $(todo (weld (graph-edges i.todo graph) t.todo), component [i.todo component])

10185+::

10186+++ graph-collect-all

10187+ |= [order=(list term) seen=ivisited graph=iadj comps=icomponents]

10188+ ^- icomponents

10189+ ?~ order comps

10190+ ?: ?=(^ (~(get by seen) i.order)) $(order t.order)

10191+ =/ found=icresult (graph-collect ~[i.order] seen ~ graph)

10192+ $(order t.order, seen seen.found, comps [component.found comps])

10193+::

10194+:: Two depth-first passes find components before group inference. Maps

10195+:: preserve the graph identity; duplicate global names fail closed.

10196+++ graph-components

10197+ |= [ds=(list def) names=(list term)]

10198+ ^- icomponents

10199+ =/ nameset=ivisited ~

10200+ =/ pending=(list term) names

10201+ |-

10202+ ?^ pending

10203+ ?: ?=(^ (~(get by nameset) i.pending)) ~

10204+ $(pending t.pending, nameset (~(put by nameset) i.pending &))

10205+ =/ graph=iadj (graph-make-forward ds nameset ~)

10206+ =/ reverse=iadj (graph-reverse names graph ~)

10207+ =/ order=iwresult (graph-order (turn names |=(n=term [n |])) ~ ~ graph)

10208+ (graph-collect-all order.order ~ reverse ~)

10209+::

10210+++ graph-cycle

10211+ |= [component=(list term) graph=iadj]

10212+ ^- ?

10213+ ?~ component |

10214+ ?^ t.component &

10215+ (lien (graph-edges i.component graph) |=(x=term =(x i.component)))

10216+::

10217+++ add-groups

10218+ |= [ds=(list def) components=icomponents graph=iadj env=ienv grouped=(list term) artifacts=(list iwidth-definition) state=istate]

10219+ ^- iresolved

10220+ ?~ components [env grouped artifacts]

10221+ =/ component=(list term) i.components

10222+ ?. (graph-cycle component graph) $(components t.components)

10223+ ?: (lien component |=(n=term ?=(^ (ienv-lookup n env)))) $(components t.components)

10224+ =/ members=(list def)

10225+ %+ skim ds

10226+ |= d=def

10227+ &(?=(%value -.d) (lien component |=(n=term =(n name.d))))

10228+ ?. =((lent members) (lent component)) $(components t.components)

10229+ ?. (levy component |=(n=term (unique-value-name n globals.state))) $(components t.components)

10230+ =/ result=ilocal-result (infer-gate-group members env state)

10231+ ?: ?=(%| -.result) $(components t.components)

10232+ $(components t.components, env env.p.result, grouped (weld component grouped))

10233+::

10234+++ resolve-groups

10235+ |= [ds=(list def) molds=imolds globals=(list term) externals=iexternals surs=(list term) mark-externals=imark-externals marks=(list term) jimports=ijimports reserved-molds=(list term) at=path prelude=(unit ifile)]

10236+ ^- iresolved

10237+ (resolve-groups-core ds molds globals externals surs mark-externals marks jimports reserved-molds at prelude ~)

10238+::

10239+

10240++$ iadded-definition

10241+ [env=ienv checked=(map term def) artifacts=(list iwidth-definition)]

10242+++ add-supported-result

10243+ |= [d=def result=iresult initial=istate env=ienv checked=(map term def) artifacts=(list iwidth-definition)]

10244+ ^- (unit iadded-definition)

10245+ ?> ?=(%value -.d)

10246+ ?: ?=(%| -.result) ~

10247+ =. state.p.result (promote-restricted-numbers state.p.result env)

10248+ =. state.p.result (default-hole-numbers holes.state.p.result holes.initial state.p.result env !(itype-has-gate (itype-normalize typ.p.result sub.state.p.result)))

10249+ ?^ (unresolved-hole holes.state.p.result holes.initial state.p.result) ~

10250+ ?: (constrained-capitals caps.state.p.result sub.state.p.result) ~

10251+ =/ typ=itype (default-decimals (itype-normalize typ.p.result sub.state.p.result))

10252+ ?: |((pending-tags tags.state.p.result sub.state.p.result) (itype-has-tag typ)) ~

10253+ ?: (unsupported-atom-vars typ caps.state.p.result binders.state.p.result sub.state.p.result) ~

10254+ =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

10255+ ?: (gth (lent vars) 26) ~

10256+ =/ finalized=(unit (list iwprojection))

10257+ (width-finalize projections.state.p.result sub.state.p.result vars)

10258+ ?~ finalized ~

10259+ =? artifacts ?=(^ u.finalized)

10260+ [[name.d val.d typ sub.state.p.result (flop u.finalized)] artifacts]

10261+ =? checked |(?=(%gate -.val.d) ?=(%gate-wide -.val.d)) (~(put by checked) name.d d)

10262+ `[[[name.d [typ vars]] env] checked artifacts]

10263+++ add-supported-defs-core

10264+ |= [ds=(list def) all-defs=(list def) checked=(map term def) heads=(unit igate-prelude-evidence) env=ienv molds=imolds globals=(list term) externals=iexternals surs=(list term) mark-externals=imark-externals marks=(list term) jimports=ijimports reserved-molds=(list term) at=path prelude=(unit ifile) artifacts=(list iwidth-definition) index=(unit [at=path source=@t prelude=ifile shapes=(map term shape)])]

10265+ ^- [env=ienv artifacts=(list iwidth-definition)]

10266+ ?~ ds [env artifacts]

5467 =/ d=def i.ds

10267 =/ d=def i.ds

5468 ?: ?=(%mold -.d) $(ds t.ds)

10268 ?: ?=(%mold -.d) $(ds t.ds)

5469 ?. (unique-value-name name.d globals) $(ds t.ds)

10269 ?. (unique-value-name name.d globals) $(ds t.ds)

5470 ?^ (ienv-lookup name.d env) $(ds t.ds)

10270 ?^ (ienv-lookup name.d env) $(ds t.ds)

10271+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

10272+ =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | at top prelude ~ 256 ~ ~ ~ ~ ~ ~]

10273+ =. grec-index.initial index

10274+ =. gate-defs.initial checked

10275+ =. head-evidence.initial heads

10276+ =. initial (reserve-def-caps val.d initial)

5471− =/ result=iresult (infer-fragment val.d env [0 ~ ~ ~ molds globals externals surs mark-externals marks ~ |])

10277+ =/ result=iresult (infer-fragment val.d env initial)

5472− ?: ?=(%| -.result) $(ds t.ds)

10278+ =? result ?=(%| -.result) (infer-recursive-gate d env initial)

5473− ?: (constrained-capitals caps.state.p.result sub.state.p.result) $(ds t.ds)

10279+ =/ added=(unit iadded-definition)

5474− =/ typ=itype (itype-normalize typ.p.result sub.state.p.result)

10280+ (add-supported-result d result initial env checked artifacts)

5475− ?: (unsupported-atom-vars typ caps.state.p.result binders.state.p.result sub.state.p.result) $(ds t.ds)

10281+ ?~ added $(ds t.ds)

5476− =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

10282+ $(ds t.ds, env env.u.added, checked checked.u.added, artifacts artifacts.u.added)

5477− ?: (gth (lent vars) 26) $(ds t.ds)

10283+::

5478− $(ds t.ds, env [[name.d [typ vars]] env])

10284+++ resolve-groups-core

10285+ |= [ds=(list def) molds=imolds globals=(list term) externals=iexternals surs=(list term) mark-externals=imark-externals marks=(list term) jimports=ijimports reserved-molds=(list term) at=path prelude=(unit ifile) index=(unit [at=path source=@t prelude=ifile shapes=(map term shape)])]

10286+ ^- iresolved

10287+ =/ env=ienv ~

10288+ =/ grouped=(list term) ~

10289+ =/ artifacts=(list iwidth-definition) ~

10290+ =/ names=(list term) (global-value-names ds)

10291+ =/ nameset=ivisited (graph-nameset names ~)

10292+ =/ graph=iadj (graph-make-forward ds nameset ~)

10293+ =/ components=icomponents (graph-components ds names)

10294+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

10295+ =/ heads=(unit igate-prelude-evidence) (direct-prelude-evidence ds prelude)

10296+ |-

10297+ =/ next=[env=ienv artifacts=(list iwidth-definition)]

10298+ (add-supported-defs-core ds ds (direct-checked-gates ds env) heads env molds globals externals surs mark-externals marks jimports reserved-molds at prelude artifacts index)

10299+ =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | at top prelude ~ 256 ~ ~ ~ ~ ~ ~]

10300+ =. grec-index.initial index

10301+ =/ out=iresolved (add-groups ds components graph env.next grouped artifacts.next initial)

10302+ ?: =(env env.out) out

10303+ $(env env.out, grouped grouped.out, artifacts artifacts.out)

5479::

10304::

5480++ resolve-supported-defs

10305++ resolve-supported-defs

5481− |= [ds=(list def) molds=imolds globals=(list term) externals=iexternals surs=(list term) mark-externals=imark-externals marks=(list term)]

10306+ |= [ds=(list def) molds=imolds globals=(list term) externals=iexternals surs=(list term) mark-externals=imark-externals marks=(list term) jimports=ijimports reserved-molds=(list term) at=path prelude=(unit ifile)]

5482 ^- ienv

10307 ^- ienv

5483− =/ env=ienv ~

10308+ env:(resolve-groups ds molds globals externals surs mark-externals marks jimports reserved-molds at prelude)

10309+::

10310+:: A diagnostic-only proof for a narrow syntactic value cycle. Every

10311+:: edge is an unqualified wing in a supported expression, and samples

10312+:: may not shadow global bindings. Unknown forms yield no conclusion.

10313++$ icyclesite [name=term at=span]

10314++$ icycle [name=term first=span next=span]

10315+++ cycle-sites-list

10316+ |= [xs=(list expr) globals=(list term) locals=(list term)]

10317+ ^- (unit (list icyclesite))

10318+ ?~ xs `~

10319+ =/ first=(unit (list icyclesite)) (cycle-sites i.xs globals locals)

10320+ ?~ first ~

10321+ =/ tail=(unit (list icyclesite)) $(xs t.xs)

10322+ ?~ tail ~

10323+ `(weld u.first u.tail)

10324+::

10325+++ cycle-sample-name

10326+ |= [sam=sample globals=(list term) locals=(list term)]

10327+ ^- (unit (unit term))

10328+ ?- -.sam

10329+ %bind

10330+ ?: (lien (weld globals locals) |=(n=term =(n name.sam))) ~

10331+ ``name.sam

10332+ %face

10333+ ?: (lien (weld globals locals) |=(n=term =(n name.sam))) ~

10334+ ``name.sam

10335+ %bare `~

10336+ * ~

10337+ ==

10338+::

10339+++ cycle-sites

10340+ |= [e=expr globals=(list term) locals=(list term)]

10341+ ^- (unit (list icyclesite))

10342+ ?- -.e

10343+ %wing

10344+ ?. ?=([@ ~] names.e) ~

10345+ `~[[i.names.e at.e]]

10346+ %lit `~

10347+ %str

10348+ ?: (lien pieces.e |=(p=piece ?=(%expr -.p))) ~

10349+ `~

10350+ %group $(e inner.e)

10351+ %body ?~(defs.e $(e final.e) ~)

10352+ %cast $(e val.e)

10353+ %gate

10354+ =/ binder=(unit (unit term)) (cycle-sample-name sample.e globals locals)

10355+ ?~ binder ~

10356+ =/ nested=(list term) ?~(u.binder locals [u.u.binder locals])

10357+ $(e body.e, locals nested)

10358+ %gate-wide

10359+ =/ binder=(unit (unit term)) (cycle-sample-name sample.e globals locals)

10360+ ?~ binder ~

10361+ =/ nested=(list term) ?~(u.binder locals [u.u.binder locals])

10362+ $(e body.e, locals nested)

10363+ %call

10364+ =/ first=(unit (list icyclesite)) $(e head.e)

10365+ ?~ first ~

10366+ =/ tail=(unit (list icyclesite)) (cycle-sites-list args.e globals locals)

10367+ ?~ tail ~

10368+ `(weld u.first u.tail)

10369+ * ~

10370+ ==

10371+::

10372+++ cycle-definitely-atom

10373+ |= e=expr

10374+ ^- ?

10375+ ?: ?=(%group -.e) $(e inner.e)

10376+ ?: &(?=(%body -.e) ?=(~ defs.e)) $(e final.e)

10377+ ?. ?=(%cast -.e) |

10378+ |(?=(%aura -.shape.e) ?=(%flag -.shape.e))

10379+::

10380+++ cycle-proof-group

10381+ |= [members=(list def) globals=(list term)]

10382+ ^- ?

10383+ ?~ members &

10384+ ?. ?=(%value -.i.members) |

10385+ ?. (unique-value-name name.i.members globals) |

10386+ ?. ?=(^ (cycle-sites val.i.members globals ~)) |

10387+ $(members t.members)

10388+::

10389+++ cycle-find-site

10390+ |= [sites=(list icyclesite) component=(list term)]

10391+ ^- (unit span)

10392+ ?~ sites ~

10393+ ?: (lien component |=(n=term =(n name.i.sites))) `at.i.sites

10394+ $(sites t.sites)

10395+::

10396+++ cycle-group-errors

10397+ |= [members=(list def) component=(list term) globals=(list term)]

10398+ ^- (list icycle)

10399+ ?~ members ~

10400+ =/ d=def i.members

10401+ ?> ?=(%value -.d)

10402+ =/ tail=(list icycle) $(members t.members)

10403+ ?. (cycle-definitely-atom val.d) tail

10404+ =/ sites=(unit (list icyclesite)) (cycle-sites val.d globals ~)

10405+ ?~ sites tail

10406+ =/ found=(unit span) (cycle-find-site u.sites component)

10407+ ?~ found tail

10408+ [[name.d at.d u.found] tail]

10409+::

10410+++ definite-value-cycles

10411+ |= [ds=(list def) globals=(list term)]

10412+ ^- (list icycle)

10413+ =/ names=(list term) (global-value-names ds)

10414+ =/ graph=iadj (graph-make-forward ds (graph-nameset names ~) ~)

10415+ =/ components=icomponents (graph-components ds names)

10416+ =/ out=(list icycle) ~

5484 |-

10417 |-

5485− =/ next=ienv (add-supported-defs ds env molds globals externals surs mark-externals marks)

10418+ ?~ components out

5486− ?: =(next env) env

10419+ =/ component=(list term) i.components

5487− $(env next)

10420+ ?. (graph-cycle component graph) $(components t.components)

10421+ =/ members=(list def)

10422+ (skim ds |=(d=def &(?=(%value -.d) (lien component |=(n=term =(n name.d))))))

10423+ ?. =((lent members) (lent component)) $(components t.components)

10424+ ?. (cycle-proof-group members globals) $(components t.components)

10425+ $(components t.components, out (weld (cycle-group-errors members component globals) out))

5488::

10426::

5489+| %union-analysis

10427+| %union-analysis

5490::

10428::

@@ -5608,6 +10546,257 @@

5608 %overlap

10546 %overlap

5609 %unknown

10547 %unknown

5610::

10548::

10549+:: A source-only fallback for literal-tagged cells and one-hop local

10550+:: generic applications. It screens all work before ordinary inference.

10551+++ union-simple-shape-budget

10552+ |= [s=shape fuel=@ud vars=(unit (list @t))]

10553+ ^- (unit @ud)

10554+ ?: =(0 fuel) ~

10555+ =. fuel (dec fuel)

10556+ ?- -.s

10557+ ?(%aura %noun %void %flag) `fuel

10558+ %tvar

10559+ ?~ vars `fuel

10560+ ?:((lien u.vars |=(n=@t =(n name.s))) `fuel ~)

10561+ %const

10562+ ?. |(=(%term form.lit.s) =(%null form.lit.s) =(%loobean form.lit.s)) ~

10563+ ?: &(=(%loobean form.lit.s) !|(=(0 val.lit.s) =(1 val.lit.s))) ~

10564+ `fuel

10565+ %cell (union-simple-fields-budget fields.s fuel vars)

10566+ %fn

10567+ =/ left=(unit @ud) $(s sample.s, fuel fuel)

10568+ ?~ left ~

10569+ $(s product.s, fuel u.left)

10570+ * ~

10571+ ==

10572+++ union-simple-fields-budget

10573+ |= [fields=(list field) fuel=@ud vars=(unit (list @t))]

10574+ ^- (unit @ud)

10575+ ?~ fields `fuel

10576+ ?: =(0 fuel) ~

10577+ =/ field-shape=shape

10578+ ?- -.i.fields

10579+ %bare shape.i.fields

10580+ %face shape.i.fields

10581+ %pun [%ref at.i.fields ~[name.i.fields]]

10582+ ==

10583+ =/ head=(unit @ud) (union-simple-shape-budget field-shape (dec fuel) vars)

10584+ ?~ head ~

10585+ $(fields t.fields, fuel u.head)

10586+++ union-source-find

10587+ |= [n=term molds=imolds fuel=@ud]

10588+ ^- (unit [body=shape left=@ud])

10589+ =/ found=(unit shape) ~

10590+ |-

10591+ ?~ molds

10592+ ?~ found ~

10593+ `[u.found fuel]

10594+ ?: =(0 fuel) ~

10595+ ?: =(n name.i.molds)

10596+ ?^ found ~

10597+ $(molds t.molds, fuel (dec fuel), found `body.i.molds)

10598+ $(molds t.molds, fuel (dec fuel))

10599+++ union-source-args-budget

10600+ |= [vars=(list @t) args=(list shape) fuel=@ud]

10601+ ^- (unit @ud)

10602+ =/ seen=(set @t) *(set @t)

10603+ |-

10604+ ?~ vars ?~(args `fuel ~)

10605+ ?~ args ~

10606+ ?: =(0 fuel) ~

10607+ ?: (~(has in:..zuse seen) i.vars) ~

10608+ =/ arg=(unit @ud) (union-simple-shape-budget i.args (dec fuel) ~)

10609+ ?~ arg ~

10610+ $(vars t.vars, args t.args, fuel u.arg, seen (~(put in:..zuse seen) i.vars))

10611+++ union-source-cell-tag

10612+ |= s=shape

10613+ ^- (unit @)

10614+ ?. ?=(%cell -.s) ~

10615+ ?~ fields.s ~

10616+ ?~ t.fields.s ~

10617+ ?. ?=(%bare -.i.fields.s) ~

10618+ =/ head=shape shape.i.fields.s

10619+ ?. ?=(%const -.head) ~

10620+ ?. |(=(%term form.lit.head) =(%null form.lit.head) =(%loobean form.lit.head)) ~

10621+ ?: &(=(%loobean form.lit.head) !|(=(0 val.lit.head) =(1 val.lit.head))) ~

10622+ `val.lit.head

10623+++ union-source-case-tag

10624+ |= [s=shape molds=imolds fuel=@ud]

10625+ ^- (unit [tag=@ left=@ud])

10626+ ?: ?=(%cell -.s)

10627+ =/ tag=(unit @) (union-source-cell-tag s)

10628+ ?~ tag ~

10629+ =/ left=(unit @ud) (union-simple-shape-budget s fuel ~)

10630+ ?~ left ~

10631+ `[u.tag u.left]

10632+ ?. ?=(%apply -.s) ~

10633+ ?. ?=([@ ~] ref.s) ~

10634+ ?: =(0 fuel) ~

10635+ =/ found=(unit [body=shape left=@ud]) (union-source-find i.ref.s molds (dec fuel))

10636+ ?~ found ~

10637+ ?. ?=(%generic -.body.u.found) ~

10638+ ?~ vars.body.u.found ~

10639+ =/ tag=(unit @) (union-source-cell-tag body.body.u.found)

10640+ ?~ tag ~

10641+ =/ args=(unit @ud) (union-source-args-budget vars.body.u.found args.s left.u.found)

10642+ ?~ args ~

10643+ =/ left=(unit @ud) (union-simple-shape-budget body.body.u.found u.args `vars.body.u.found)

10644+ ?~ left ~

10645+ `[u.tag u.left]

10646+++ union-source-distinct-tags

10647+ |= [cases=(list shape) molds=imolds fuel=@ud]

10648+ ^- ?

10649+ =/ seen=(set @) *(set @)

10650+ =/ has-application=? |

10651+ |-

10652+ ?~ cases has-application

10653+ ?: =(0 fuel) |

10654+ =/ item=(unit [tag=@ left=@ud]) (union-source-case-tag i.cases molds (dec fuel))

10655+ ?~ item |

10656+ ?: (~(has in:..zuse seen) tag.u.item) |

10657+ $(cases t.cases, fuel left.u.item, seen (~(put in:..zuse seen) tag.u.item), has-application |(has-application ?=(%apply -.i.cases)))

10658+::

10659+:: This inference-only screen bounds inherited work that the small source

10660+:: slice may consult. It does not authenticate a caller-created state.

10661+++ union-state-leaf

10662+ |= t=itype

10663+ ^- ?

10664+ ?=(?(%var %avar %rvar %nvar %rnvar %atom %any-atom %flag %noun %empty %const) -.t)

10665+++ union-state-params-budget

10666+ |= [params=iparams fuel=@ud]

10667+ ^- (unit @ud)

10668+ ?~ params `fuel

10669+ ?: =(0 fuel) ~

10670+ ?. (union-state-leaf typ.i.params) ~

10671+ $(params t.params, fuel (dec fuel))

10672+++ union-state-sub-budget

10673+ |= [sub=isub fuel=@ud]

10674+ ^- (unit @ud)

10675+ ?~ sub `fuel

10676+ ?: =(0 fuel) ~

10677+ ?. (union-state-leaf val.i.sub) ~

10678+ $(sub t.sub, fuel (dec fuel))

10679+++ union-state-caps-budget

10680+ |= [caps=icaps fuel=@ud]

10681+ ^- (unit @ud)

10682+ ?~ caps `fuel

10683+ ?: =(0 fuel) ~

10684+ $(caps t.caps, fuel (dec fuel))

10685+++ union-state-active-budget

10686+ |= [active=(list term) fuel=@ud]

10687+ ^- (unit @ud)

10688+ ?~ active `fuel

10689+ ?: =(0 fuel) ~

10690+ $(active t.active, fuel (dec fuel))

10691+++ union-state-tags-budget

10692+ |= [tags=(list ipending) fuel=@ud]

10693+ ^- (unit @ud)

10694+ ?~ tags `fuel

10695+ ?: =(0 fuel) ~

10696+ $(tags t.tags, fuel (dec fuel))

10697+++ union-source-state-safe

10698+ |= [state=istate fuel=@ud]

10699+ ^- ?

10700+ ?^ grec-index.state |

10701+ ?^ holes.state |

10702+ ?^ defer.state |

10703+ ?^ obligations.state |

10704+ =/ params=(unit @ud) (union-state-params-budget params.state fuel)

10705+ ?~ params |

10706+ =/ sub=(unit @ud) (union-state-sub-budget sub.state u.params)

10707+ ?~ sub |

10708+ =/ caps=(unit @ud) (union-state-caps-budget caps.state u.sub)

10709+ ?~ caps |

10710+ =/ active=(unit @ud) (union-state-active-budget active.state u.caps)

10711+ ?~ active |

10712+ ?=(^ (union-state-tags-budget tags.state u.active))

10713+::

10714+:: Positive overlap witnesses from parsed, one-hop local source only.

10715+:: Unknown or exhausted work returns no witness, never disjointness.

10716++$ uow-case [at=span head=@ payload=upat]

10717+++ union-overlap-primitive

10718+ |= s=shape

10719+ ^- (unit upat)

10720+ ?- -.s

10721+ %aura `[%atom ~]

10722+ %noun `[%all ~]

10723+ %void `[%empty ~]

10724+ %flag `[%flag ~]

10725+ %const

10726+ ?. |(=(%term form.lit.s) =(%null form.lit.s) =(%loobean form.lit.s)) ~

10727+ ?: &(=(%loobean form.lit.s) !|(=(0 val.lit.s) =(1 val.lit.s))) ~

10728+ `[%atom `val.lit.s]

10729+ * ~

10730+ ==

10731+++ union-overlap-case

10732+ |= [s=shape molds=imolds fuel=@ud]

10733+ ^- (unit [item=uow-case left=@ud])

10734+ ?: =(0 fuel) ~

10735+ =. fuel (dec fuel)

10736+ :: Each body has exactly two fields; an application has exactly one

10737+ :: parameter and one concrete primitive argument. The full mold table

10738+ :: is scanned to establish unique ownership.

10739+ =/ expanded=(unit [body=shape param=(unit [name=@t pat=upat]) left=@ud])

10740+ ?: ?=(%cell -.s) `[s ~ fuel]

10741+ ?. ?=(%apply -.s) ~

10742+ ?. ?=([@ ~] ref.s) ~

10743+ ?. ?=([* ~] args.s) ~

10744+ ?: =(0 fuel) ~

10745+ =/ found=(unit [body=shape left=@ud]) (union-source-find i.ref.s molds (dec fuel))

10746+ ?~ found ~

10747+ ?. ?=(%generic -.body.u.found) ~

10748+ ?. ?=([@ ~] vars.body.u.found) ~

10749+ ?: =(0 left.u.found) ~

10750+ =/ argument=(unit upat) (union-overlap-primitive i.args.s)

10751+ ?~ argument ~

10752+ `[body.body.u.found `[i.vars.body.u.found u.argument] (dec left.u.found)]

10753+ ?~ expanded ~

10754+ =/ body=shape body.u.expanded

10755+ ?. ?=(%cell -.body) ~

10756+ ?. ?=([* * ~] fields.body) ~

10757+ :: Charge the cell, two fields, and the head and payload nodes.

10758+ ?: (lth left.u.expanded 5) ~

10759+ =/ head=(unit @) (union-source-cell-tag body)

10760+ ?~ head ~

10761+ =/ field=field i.t.fields.body

10762+ =/ payload=shape

10763+ ?- -.field

10764+ %bare shape.field

10765+ %face shape.field

10766+ %pun [%ref at.field ~[name.field]]

10767+ ==

10768+ =/ pattern=(unit upat)

10769+ ?: ?=(%tvar -.payload)

10770+ ?~ param.u.expanded ~

10771+ ?. =(name.payload name.u.param.u.expanded) ~

10772+ `pat.u.param.u.expanded

10773+ (union-overlap-primitive payload)

10774+ ?~ pattern ~

10775+ `[[at.s u.head u.pattern] (sub left.u.expanded 5)]

10776+++ union-overlap-against

10777+ |= [first=uow-case rest=(list shape) molds=imolds fuel=@ud]

10778+ ^- (unit [witness=(unit upair) left=@ud])

10779+ ?~ rest `[~ fuel]

10780+ ?: =(0 fuel) ~

10781+ =/ other=(unit [item=uow-case left=@ud]) (union-overlap-case i.rest molds (dec fuel))

10782+ ?~ other ~

10783+ ?: &(=(head.first head.item.u.other) =(%overlap (union-relate payload.first payload.item.u.other)))

10784+ `[`[at.first at.item.u.other %overlap] left.u.other]

10785+ $(rest t.rest, fuel left.u.other)

10786+++ union-source-overlap

10787+ |= [cases=(list shape) molds=imolds fuel=@ud]

10788+ ^- (unit upair)

10789+ ?~ cases ~

10790+ ?~ t.cases ~

10791+ ?: =(0 fuel) ~

10792+ =/ first=(unit [item=uow-case left=@ud]) (union-overlap-case i.cases molds (dec fuel))

10793+ ?~ first ~

10794+ =/ found=(unit [witness=(unit upair) left=@ud])

10795+ (union-overlap-against item.u.first t.cases molds left.u.first)

10796+ ?~ found ~

10797+ ?^ witness.u.found witness.u.found

10798+ $(cases t.cases, fuel left.u.found)

10799+::

5611++ union-pairs

10800++ union-pairs

5612 |= [cases=(list shape) molds=imolds]

10801 |= [cases=(list shape) molds=imolds]

5613 ^- (list upair)

10802 ^- (list upair)

@@ -5621,15 +10810,151 @@

5621 [at.first at.second (union-relate a (project-union-mold second molds ~))]

10810 [at.first at.second (union-relate a (project-union-mold second molds ~))]

5622 (weld pairs $(cases t.cases))

10811 (weld pairs $(cases t.cases))

5623::

10812::

10813+:: A closed structural mold supplies no equation to determine a hole.

10814+:: Applications, references, unbound capitals and unions are unproved.

10815+++ simple-mold-hole

10816+ |= sh=shape

10817+ ^- (unit (unit span))

10818+ ?: ?=(%generic -.sh)

10819+ ?~ vars.sh ~

10820+ ?. (distinct-params vars.sh) ~

10821+ (simple-mold-hole-in body.sh vars.sh)

10822+ (simple-mold-hole-in sh ~)

10823+++ simple-mold-hole-in

10824+ |= [sh=shape vars=(list @t)]

10825+ ^- (unit (unit span))

10826+ ?- -.sh

10827+ %hole ``at.sh

10828+ ?(%aura %noun %void %flag %const) `~

10829+ %tvar ?:((lien vars |=(v=@t =(v name.sh))) `~ ~)

10830+ %cell (simple-mold-field-holes fields.sh vars)

10831+ %fn

10832+ =/ a=(unit (unit span)) $(sh sample.sh)

10833+ ?~ a ~

10834+ =/ b=(unit (unit span)) $(sh product.sh)

10835+ ?~ b ~

10836+ `?~(u.a u.b u.a)

10837+ %generic ~

10838+ * ~

10839+ ==

10840+++ simple-mold-field-holes

10841+ |= [fields=(list field) vars=(list @t)]

10842+ ^- (unit (unit span))

10843+ ?~ fields `~

10844+ =/ f=field i.fields

10845+ =/ first=(unit (unit span))

10846+ ?- -.f

10847+ %face (simple-mold-hole-in shape.f vars)

10848+ %bare (simple-mold-hole-in shape.f vars)

10849+ %pun ~

10850+ ==

10851+ ?~ first ~

10852+ =/ rest=(unit (unit span)) $(fields t.fields)

10853+ ?~ rest ~

10854+ `?~(u.first u.rest u.first)

10855+++ simple-local-mold-hole

10856+ |= defs=(list def)

10857+ ^- (unit span)

10858+ ?~ defs ~

10859+ ?. ?=(%mold -.i.defs) $(defs t.defs)

10860+ =/ found=(unit (unit span)) (simple-mold-hole shape.i.defs)

10861+ ?~ found $(defs t.defs)

10862+ ?^ u.found u.found

10863+ $(defs t.defs)

10864+::

10865+:: A partial prelude may omit unsupported declarations, but may not

10866+:: publish an interface while a named mold's hole remains unchecked.

10867+++ shape-has-hole

10868+ |= sh=shape

10869+ ^- ?

10870+ ?- -.sh

10871+ %hole &

10872+ %path (lien segs.sh |=(s=pseg ?=(%inferred -.s)))

10873+ %apply (lien args.sh shape-has-hole)

10874+ %union (lien cases.sh shape-has-hole)

10875+ %cell (lien fields.sh field-has-hole)

10876+ %fn |($(sh sample.sh) $(sh product.sh))

10877+ %generic $(sh body.sh)

10878+ * |

10879+ ==

10880+++ field-has-hole

10881+ |= f=field

10882+ ^- ?

10883+ ?- -.f

10884+ %face (shape-has-hole shape.f)

10885+ %bare (shape-has-hole shape.f)

10886+ %pun |

10887+ ==

10888+++ named-mold-has-hole

10889+ |= ds=(list def)

10890+ ^- ?

10891+ ?~ ds |

10892+ ?: &(?=(%mold -.i.ds) (shape-has-hole shape.i.ds)) &

10893+ $(ds t.ds)

10894+::

10895+++ sample-has-hole

10896+ |= sam=sample

10897+ ^- ?

10898+ ?- -.sam

10899+ %face (shape-has-hole shape.sam)

10900+ %bare (shape-has-hole shape.sam)

10901+ %cell (lien items.sam sample-has-hole)

10902+ * |

10903+ ==

10904+++ def-has-hole

10905+ |= d=def

10906+ ^- ?

10907+ ?- -.d

10908+ %mold (shape-has-hole shape.d)

10909+ %value (expr-has-hole val.d)

10910+ ==

10911+++ expr-has-hole

10912+ |= e=expr

10913+ ^- ?

10914+ ?- -.e

10915+ %str (lien pieces.e |=(p=piece ?:(?=(%expr -.p) (expr-has-hole p.p) |)))

10916+ %qath (lien segs.e |=(p=qseg ?:(?=(%expr -.p) (expr-has-hole p.p) |)))

10917+ %change (lien edits.e |=(p=edit (expr-has-hole val.p)))

10918+ %pair $(e val.e)

10919+ %unit $(e val.e)

10920+ %group $(e inner.e)

10921+ %list (lien items.e expr-has-hole)

10922+ %tuple (lien items.e |=(i=item (expr-has-hole val.i)))

10923+ ?(%gate %gate-wide) |((sample-has-hole sample.e) $(e body.e))

10924+ %cast |((shape-has-hole shape.e) $(e val.e))

10925+ %call |($(e head.e) (lien args.e expr-has-hole))

10926+ %trace |($(e val.e) $(e then.e))

10927+ %branch |($(e subject.e) (lien arms.e |=(a=arm (expr-has-hole val.a))))

10928+ %body |((lien defs.e def-has-hole) $(e final.e))

10929+ * |

10930+ ==

10931+++ hole-values-present

10932+ |= [ds=(list def) env=ienv]

10933+ ^- ?

10934+ ?~ ds &

10935+ ?. ?=(%value -.i.ds) $(ds t.ds)

10936+ ?: (expr-has-hole val.i.ds)

10937+ ?. ?=(^ (ienv-lookup name.i.ds env)) |

10938+ $(ds t.ds)

10939+ $(ds t.ds)

5624++ show-partial-mold

10940++ show-partial-mold

5625 |= [file=path src=@t d=def molds=imolds]

10941 |= [file=path src=@t d=def molds=imolds]

5626 ^- @t

10942 ^- @t

5627 ?> ?=(%mold -.d)

10943 ?> ?=(%mold -.d)

5628 =/ sh=shape shape.d

10944 =/ sh=shape shape.d

10945+ =/ hole=(unit (unit span)) (simple-mold-hole sh)

10946+ ?: &(?=(^ hole) ?=(^ u.hole))

10947+ =/ text=@t (show-error src [file line.beg.u.u.hole col.beg.u.u.hole "unresolved type hole"])

10948+ (of-wain:format ~[(crip "+$ {(trip name.d)}: type hole needs a determined type") text])

5629 =? sh ?=(%generic -.sh) body.sh

10949 =? sh ?=(%generic -.sh) body.sh

5630 ?. ?=(%union -.sh) (crip "+$ {(trip name.d)}: not checked")

10950 ?. ?=(%union -.sh) (crip "+$ {(trip name.d)}: not checked")

5631 =/ pairs=(list upair) (union-pairs cases.sh molds)

10951 =/ pairs=(list upair) (union-pairs cases.sh molds)

5632 =/ overlapping=(list upair) (skim pairs |=(p=upair =(%overlap relation.p)))

10952 =/ overlapping=(list upair) (skim pairs |=(p=upair =(%overlap relation.p)))

10953+ =. overlapping

10954+ ?^ overlapping overlapping

10955+ ?. (lien pairs |=(p=upair =(%unknown relation.p))) ~

10956+ =/ witness=(unit upair) (union-source-overlap cases.sh molds 256)

10957+ ?~(witness ~ ~[u.witness])

5633 ?^ overlapping

10958 ?^ overlapping

5634 =/ p=upair i.overlapping

10959 =/ p=upair i.overlapping

5635 =/ summary=@t (crip "+$ {(trip name.d)}: overlapping cases; mold not checked")

10960 =/ summary=@t (crip "+$ {(trip name.d)}: overlapping cases; mold not checked")

@@ -5637,7 +10962,9 @@

5637 =/ second=@t (show-error src [file line.beg.second.p col.beg.second.p "overlapping case"])

10962 =/ second=@t (show-error src [file line.beg.second.p col.beg.second.p "overlapping case"])

5638 (of-wain:format ~[summary first second])

10963 (of-wain:format ~[summary first second])

5639 ?: (lien pairs |=(p=upair =(%unknown relation.p)))

10964 ?: (lien pairs |=(p=upair =(%unknown relation.p)))

10965+ ?. (union-source-distinct-tags cases.sh molds 256)

5640− (crip "+$ {(trip name.d)}: case disjointness unresolved; mold not checked")

10966+ (crip "+$ {(trip name.d)}: case disjointness unresolved; mold not checked")

10967+ (crip "+$ {(trip name.d)}: cases proven disjoint; mold not checked")

5641 (crip "+$ {(trip name.d)}: cases proven disjoint; mold not checked")

10968 (crip "+$ {(trip name.d)}: cases proven disjoint; mold not checked")

5642::

10969::

5643:: +show-inference-diagnostic: a partial report with both source sites

10970:: +show-inference-diagnostic: a partial report with both source sites

@@ -5652,6 +10979,21 @@

5652 (show-error src [file line.beg.at.site col.beg.at.site note.site])

10979 (show-error src [file line.beg.at.site col.beg.at.site note.site])

5653 (of-wain:format [summary excerpts])

10980 (of-wain:format [summary excerpts])

5654::

10981::

10982+:: Both written field sites are shown in the source that declares them.

10983+++ show-duplicate-fields

10984+ |= [file=path src=@t diagnostic=idiag]

10985+ ^- @t

10986+ =/ excerpts=(list @t)

10987+ %+ turn sites.diagnostic

10988+ |= site=[at=span note=tape]

10989+ (show-error src [file line.beg.at.site col.beg.at.site note.site])

10990+ (of-wain:format [(crip msg.diagnostic) excerpts])

10991+::

10992+++ duplicate-fields-report

10993+ |= [file=path src=@t diagnostic=idiag]

10994+ ^- @t

10995+ (of-wain:format ~['partial inference; module not checked' (show-duplicate-fields file src diagnostic)])

10996+::

5655:: +golden-types: a partial report; it does not claim the module checks

10997:: +golden-types: a partial report; it does not claim the module checks

5656::

10998::

5657++ golden-types

10999++ golden-types

@@ -5670,21 +11012,2070 @@

5670 ^- @t

11012 ^- @t

5671 (golden-types-with-marks file src externals ~)

11013 (golden-types-with-marks file src externals ~)

5672::

11014::

11015+:: A supplied module is addressed by its logical /ui/.../name/jibb path.

11016+:: Interfaces are closed inference schemes, never raw source shapes.

11017+:: Recursive modules, APIs, derived gates and unsupported definitions do

11018+:: not yield an interface. The reachable graph is checked before the root.

11019+::

11020++$ jsource [at=path source=@t]

11021++$ jbundle (list jsource)

11022++$ jcache (list [at=path iface=ifile])

11023++$ jfile-result (each [iface=ifile cache=jcache] @t)

11024+:: Overlap evidence retains the exact source that supplied its spans.

11025+:: Ordinary Jibb imports preserve this evidence through the resolver.

11026++$ jfile-overlap [file=path source=@t name=term cases=upair]

11027++$ jfile-failure [message=@t overlap=(unit jfile-overlap)]

11028++$ jfile-detailed-result (each [iface=ifile cache=jcache] jfile-failure)

11029++$ jimports-result (each [resolved=ijimports cache=jcache] @t)

11030+:: Preserve an imported overlap's original file and source across the graph.

11031++$ jimports-detailed-result (each [resolved=ijimports cache=jcache] jfile-failure)

11032+::

11033+:: Written record fields each have their own lexical record scope.

11034++$ written-fields (map term span)

11035+++ duplicate-written-field

11036+ |= [name=term at=span seen=written-fields]

11037+ ^- (unit idiag)

11038+ =/ prior=(unit span) (~(get by seen) name)

11039+ ?~ prior ~

11040+ `["record field `{(trip name)}` is repeated" ~[[u.prior "first field"] [at "repeated field"]]]

11041+++ duplicate-shapes

11042+ |= xs=(list shape)

11043+ ^- (unit idiag)

11044+ ?~ xs ~

11045+ =/ first (duplicate-shape i.xs)

11046+ ?^ first first

11047+ $(xs t.xs)

11048+++ duplicate-fields

11049+ |= [fields=(list field) seen=written-fields]

11050+ ^- (unit idiag)

11051+ ?~ fields ~

11052+ =/ f=field i.fields

11053+ =/ n=(unit term)

11054+ ?- -.f

11055+ %face `name.f

11056+ %pun `name.f

11057+ %bare ~

11058+ ==

11059+ =/ dup=(unit idiag) ?~(n ~ (duplicate-written-field u.n at.f seen))

11060+ ?^ dup dup

11061+ =/ inner=(unit idiag)

11062+ ?- -.f

11063+ %face (duplicate-shape shape.f)

11064+ %pun ~

11065+ %bare (duplicate-shape shape.f)

11066+ ==

11067+ ?^ inner inner

11068+ $(fields t.fields, seen ?~(n seen (~(put by seen) u.n at.f)))

11069+++ duplicate-shape

11070+ |= s=shape

11071+ ^- (unit idiag)

11072+ ?- -.s

11073+ %cell (duplicate-fields fields.s ~)

11074+ %apply (duplicate-shapes args.s)

11075+ %union (duplicate-shapes cases.s)

11076+ %fn

11077+ =/ left (duplicate-shape sample.s)

11078+ ?^ left left

11079+ (duplicate-shape product.s)

11080+ %generic (duplicate-shape body.s)

11081+ * ~

11082+ ==

11083+++ duplicate-samples

11084+ |= [items=(list sample) seen=written-fields]

11085+ ^- (unit idiag)

11086+ ?~ items ~

11087+ =/ a=sample i.items

11088+ =/ n=(unit term)

11089+ ?- -.a

11090+ %bind `name.a

11091+ %face `name.a

11092+ %pun `name.a

11093+ * ~

11094+ ==

11095+ =/ dup=(unit idiag) ?~(n ~ (duplicate-written-field u.n at.a seen))

11096+ ?^ dup dup

11097+ =/ inner (duplicate-sample a)

11098+ ?^ inner inner

11099+ $(items t.items, seen ?~(n seen (~(put by seen) u.n at.a)))

11100+++ duplicate-sample

11101+ |= s=sample

11102+ ^- (unit idiag)

11103+ ?- -.s

11104+ %cell (duplicate-samples items.s ~)

11105+ %face (duplicate-shape shape.s)

11106+ %bare (duplicate-shape shape.s)

11107+ * ~

11108+ ==

11109+++ duplicate-exprs

11110+ |= xs=(list expr)

11111+ ^- (unit idiag)

11112+ ?~ xs ~

11113+ =/ first (duplicate-expr i.xs)

11114+ ?^ first first

11115+ $(xs t.xs)

11116+++ duplicate-items

11117+ |= [items=(list item) seen=written-fields]

11118+ ^- (unit idiag)

11119+ ?~ items ~

11120+ =/ a=item i.items

11121+ =/ dup=(unit idiag) ?~(face.a ~ (duplicate-written-field u.face.a at.a seen))

11122+ ?^ dup dup

11123+ =/ inner (duplicate-expr val.a)

11124+ ?^ inner inner

11125+ $(items t.items, seen ?~(face.a seen (~(put by seen) u.face.a at.a)))

11126+++ duplicate-pieces

11127+ |= pieces=(list piece)

11128+ ^- (unit idiag)

11129+ ?~ pieces ~

11130+ =/ first=(unit idiag) ?:(?=(%expr -.i.pieces) (duplicate-expr p.i.pieces) ~)

11131+ ?^ first first

11132+ $(pieces t.pieces)

11133+++ duplicate-qsegs

11134+ |= segs=(list qseg)

11135+ ^- (unit idiag)

11136+ ?~ segs ~

11137+ =/ first=(unit idiag) ?:(?=(%expr -.i.segs) (duplicate-expr p.i.segs) ~)

11138+ ?^ first first

11139+ $(segs t.segs)

11140+++ duplicate-edits

11141+ |= edits=(list edit)

11142+ ^- (unit idiag)

11143+ ?~ edits ~

11144+ =/ first (duplicate-expr val.i.edits)

11145+ ?^ first first

11146+ $(edits t.edits)

11147+++ duplicate-arms

11148+ |= arms=(list arm)

11149+ ^- (unit idiag)

11150+ ?~ arms ~

11151+ =/ first (duplicate-expr val.i.arms)

11152+ ?^ first first

11153+ $(arms t.arms)

11154+++ duplicate-defs

11155+ |= defs=(list def)

11156+ ^- (unit idiag)

11157+ ?~ defs ~

11158+ =/ first=(unit idiag)

11159+ ?- -.i.defs

11160+ %mold (duplicate-shape shape.i.defs)

11161+ %value (duplicate-expr val.i.defs)

11162+ ==

11163+ ?^ first first

11164+ $(defs t.defs)

11165+++ duplicate-expr

11166+ |= e=expr

11167+ ^- (unit idiag)

11168+ ?- -.e

11169+ %str (duplicate-pieces pieces.e)

11170+ %qath (duplicate-qsegs segs.e)

11171+ %change (duplicate-edits edits.e)

11172+ %pair (duplicate-expr val.e)

11173+ %unit (duplicate-expr val.e)

11174+ %group (duplicate-expr inner.e)

11175+ %list (duplicate-exprs items.e)

11176+ %tuple (duplicate-items items.e ~)

11177+ %gate-wide

11178+ =/ first (duplicate-sample sample.e)

11179+ ?^ first first

11180+ (duplicate-expr body.e)

11181+ %gate

11182+ =/ first (duplicate-sample sample.e)

11183+ ?^ first first

11184+ (duplicate-expr body.e)

11185+ %cast

11186+ =/ first (duplicate-shape shape.e)

11187+ ?^ first first

11188+ (duplicate-expr val.e)

11189+ %call

11190+ =/ first (duplicate-expr head.e)

11191+ ?^ first first

11192+ (duplicate-exprs args.e)

11193+ %trace

11194+ =/ first (duplicate-expr val.e)

11195+ ?^ first first

11196+ (duplicate-expr then.e)

11197+ %branch

11198+ =/ first (duplicate-expr subject.e)

11199+ ?^ first first

11200+ (duplicate-arms arms.e)

11201+ %body

11202+ =/ first (duplicate-defs defs.e)

11203+ ?^ first first

11204+ (duplicate-expr final.e)

11205+ * ~

11206+ ==

11207+++ import-binding-names

11208+ |= imports=(list import)

11209+ ^- (list term)

11210+ ?~ imports ~

11211+ =/ n=term

11212+ ?- -.i.imports

11213+ %jibb face.i.imports

11214+ %sur name.i.imports

11215+ %mark mark.i.imports

11216+ ==

11217+ [n $(imports t.imports)]

11218+::

11219+++ reserved-proj-sample

11220+ |= sam=sample

11221+ ^- ?

11222+ ?- -.sam

11223+ %bind =(name.sam %proj)

11224+ %face =(name.sam %proj)

11225+ %pun =(name.sam %proj)

11226+ %cell (lien items.sam reserved-proj-sample)

11227+ * |

11228+ ==

11229+++ reserved-proj-pattern

11230+ |= p=pattern

11231+ ^- ?

11232+ ?- -.p

11233+ %bind =(name.p %proj)

11234+ %cell (lien items.p reserved-proj-pattern)

11235+ * |

11236+ ==

11237+++ reserved-proj-def

11238+ |= d=def

11239+ ^- ?

11240+ ?: =(name.d %proj) &

11241+ ?: ?=(%value -.d) (reserved-proj-expr val.d)

11242+ |

11243+++ reserved-proj-expr

11244+ |= e=expr

11245+ ^- ?

11246+ ?- -.e

11247+ %str (lien pieces.e |=(p=piece ?:(?=(%expr -.p) (reserved-proj-expr p.p) |)))

11248+ %qath (lien segs.e |=(p=qseg ?:(?=(%expr -.p) (reserved-proj-expr p.p) |)))

11249+ %change (lien edits.e |=(p=edit (reserved-proj-expr val.p)))

11250+ %pair $(e val.e)

11251+ %unit $(e val.e)

11252+ %group $(e inner.e)

11253+ %list (lien items.e reserved-proj-expr)

11254+ %tuple (lien items.e |=(i=item (reserved-proj-expr val.i)))

11255+ ?(%gate %gate-wide) |((reserved-proj-sample sample.e) $(e body.e))

11256+ %cast $(e val.e)

11257+ %call |($(e head.e) (lien args.e reserved-proj-expr))

11258+ %trace |($(e val.e) $(e then.e))

11259+ %branch |($(e subject.e) (lien arms.e |=(a=arm |((reserved-proj-pattern pat.a) (reserved-proj-expr val.a)))))

11260+ %body |((lien defs.e reserved-proj-def) $(e final.e))

11261+ * |

11262+ ==

11263+::

11264+++ module-has-reserved-proj

11265+ |= mod=module

11266+ ^- ?

11267+ =/ imported=(list term) (import-binding-names imports.mod)

11268+ =/ vals=(list term) (global-value-names defs.mod)

11269+ =/ molds=imolds (collect-simple-molds defs.mod)

11270+ =/ mold-names=(list term) (turn molds |=(m=[name=term body=shape] name.m))

11271+ |((lien (weld imported (weld vals mold-names)) |=(n=term =(n %proj))) (lien defs.mod reserved-proj-def))

11272+::

11273+++ module-scope-valid

11274+ |= [mod=module prelude-values=(list term) prelude-molds=(list term)]

11275+ ^- ?

11276+ =/ imported=(list term) (import-binding-names imports.mod)

11277+ =/ vals=(list term) (global-value-names defs.mod)

11278+ =/ molds=imolds (collect-simple-molds defs.mod)

11279+ =/ mold-names=(list term) (turn molds |=(m=[name=term body=shape] name.m))

11280+ ?: (module-has-reserved-proj mod) |

11281+ ?. %+ levy imported

11282+ |= n=term

11283+ &((unique-value-name n imported) !(lien vals |=(v=term =(n v))) !(lien mold-names |=(m=term =(n m))) !(lien prelude-values |=(v=term =(n v))) !(lien prelude-molds |=(m=term =(n m))))

11284+ |

11285+ ?. (levy vals |=(n=term &((unique-value-name n vals) !(lien prelude-values |=(v=term =(n v)))))) |

11286+ (levy mold-names |=(n=term &((unique-value-name n mold-names) !(lien prelude-molds |=(m=term =(n m))))))

11287+::

11288+:: In an API file or before main's kind is known, a lone `+$ poke`

11289+:: may be a declaration rather than a mold that shadows the prelude. Do not call

11290+:: that one collision definite, and do not hide unrelated scope errors.

11291+++ pending-declared-poke

11292+ |= [at=path mod=module prelude-values=(list term) prelude-molds=(list term)]

11293+ ^- ?

11294+ ?. (lien prelude-molds |=(n=term =(%poke n))) |

11295+ ?. |(?=([%ui %api @ %jibb ~] at) (lien defs.mod |=(d=def &(?=(%value -.d) =(%main name.d))))) |

11296+ =/ pokes=(list def)

11297+ (skim defs.mod |=(d=def &(?=(%mold -.d) =(%poke name.d))))

11298+ ?~ pokes |

11299+ ?^ t.pokes |

11300+ =/ remaining=(list def)

11301+ (skim defs.mod |=(d=def !&(?=(%mold -.d) =(%poke name.d))))

11302+ (module-scope-valid mod(defs remaining) prelude-values prelude-molds)

11303+::

11304+:: A detailed failure is attached only to the first mold that actually

11305+:: failed in this check, using that module's checked source mold table.

11306++$ imold-failure [message=@t overlap=(unit [name=term cases=upair])]

11307+:: Validate a generic wrapper without an unbounded duplicate-name pass.

11308+++ module-mold-params-valid

11309+ |= [vars=(list @t) seen=(set @t) fuel=@ud]

11310+ ^- ?

11311+ ?~ vars &

11312+ ?: =(0 fuel) |

11313+ ?: (~(has in:..zuse seen) i.vars) |

11314+ $(vars t.vars, seen (~(put in:..zuse seen) i.vars), fuel (dec fuel))

11315+++ module-mold-overlap

11316+ |= [m=[name=term body=shape] molds=imolds]

11317+ ^- (unit upair)

11318+ =/ sh=shape body.m

11319+ =/ valid=?

11320+ ?. ?=(%generic -.sh) &

11321+ ?~ vars.sh |

11322+ (module-mold-params-valid vars.sh *(set @t) 256)

11323+ ?. valid ~

11324+ =? sh ?=(%generic -.sh) body.sh

11325+ ?. ?=(%union -.sh) ~

11326+ (union-source-overlap cases.sh molds 256)

11327+++ module-mold-types-detail

11328+ |= [molds=imolds state=istate]

11329+ ^- (each imold-types imold-failure)

11330+ ?~ molds [%& ~]

11331+ =/ m=[name=term body=shape] i.molds

11332+ =/ t=(unit [template=ischeme state=istate])

11333+ (infer-mold-template body.m state(active [name.m active.state], in-mold &))

11334+ ?~ t

11335+ =/ overlap=(unit upair) (module-mold-overlap m molds.state)

11336+ [%| ['module mold needs unsupported inference' ?~(overlap ~ `[name.m u.overlap])]]

11337+ =. typ.template.u.t (label-direct-union typ.template.u.t body.m name.m state)

11338+ =/ rest=(each imold-types imold-failure) $(molds t.molds)

11339+ ?: ?=(%| -.rest) rest

11340+ [%& [[name.m template.u.t] p.rest]]

11341+++ module-mold-types

11342+ |= [molds=imolds state=istate]

11343+ ^- (each imold-types @t)

11344+ ?~ molds [%& ~]

11345+ =/ m=[name=term body=shape] i.molds

11346+ =/ t=(unit [template=ischeme state=istate])

11347+ (infer-mold-template body.m state(active [name.m active.state], in-mold &))

11348+ ?~ t [%| 'module mold needs unsupported inference']

11349+ =. typ.template.u.t (label-direct-union typ.template.u.t body.m name.m state)

11350+ =/ rest=(each imold-types @t) $(molds t.molds)

11351+ ?: ?=(%| -.rest) rest

11352+ [%& [[name.m template.u.t] p.rest]]

11353+::

11354+:: Prepare a provisional interface from the trusted vendored source.

11355+:: Every declared name remains reserved, but only molds and values this

11356+:: fragment can infer are usable. Unsupported bodies are not validated.

11357+:: An optional internal source supplies the prelude's one supported import;

11358+:: clients cannot import that path directly. Named unions retain their origin.

11359+::

11360+:: Recognize only the complete standard prelude list shape. Its recursive

11361+:: tail uses the same parameter and the unqualified list name. The reader

11362+:: verifies Hoon's list provenance before producing the same collection type.

11363+:: The prelude source and reader output are trusted caller inputs.

11364+::

11365+++ standard-prelude-list

11366+ |= sh=shape

11367+ ^- ?

11368+ ?. ?=(%generic -.sh) |

11369+ ?~ vars.sh |

11370+ ?^ t.vars.sh |

11371+ =/ var=@t i.vars.sh

11372+ ?. ?=(%union -.body.sh) |

11373+ =/ cs=(list shape) cases.body.sh

11374+ ?~ cs |

11375+ ?~ t.cs |

11376+ ?^ t.t.cs |

11377+ ?. ?=(%const -.i.cs) |

11378+ ?. =(%null form.lit.i.cs) |

11379+ ?. ?=(%cell -.i.t.cs) |

11380+ =/ fs=(list field) fields.i.t.cs

11381+ ?~ fs |

11382+ ?~ t.fs |

11383+ ?^ t.t.fs |

11384+ ?. ?=(%face -.i.fs) |

11385+ ?. =(%i name.i.fs) |

11386+ ?. ?=(%tvar -.shape.i.fs) |

11387+ ?. =(var name.shape.i.fs) |

11388+ ?. ?=(%face -.i.t.fs) |

11389+ ?. =(%t name.i.t.fs) |

11390+ =/ tail=shape shape.i.t.fs

11391+ ?. ?=(%apply -.tail) |

11392+ ?. =(~[%list] ref.tail) |

11393+ ?~ args.tail |

11394+ ?^ t.args.tail |

11395+ ?. ?=(%tvar -.i.args.tail) |

11396+ =(var name.i.args.tail)

11397+::

11398+++ prelude-label

11399+ |= [typ=itype name=term vars=(list @ud)]

11400+ ^- itype

11401+ ?: ?=(%jrec -.typ) typ(label `name)

11402+ ?: ?=(%grec -.typ)

11403+ ?. (identity-union-parameters vars args.typ) typ(label ~)

11404+ typ(label `name)

11405+ ?. ?=(%union -.typ) typ

11406+ ?. (identity-union-parameters vars args.typ)

11407+ ?~ origin.typ typ

11408+ ?: =(at.u.origin.typ /lib/jibb/internal/jibb) typ(label ~)

11409+ typ

11410+ typ(label `name)

11411+::

11412+++ partial-prelude-molds

11413+ |= [molds=imolds state=istate]

11414+ ^- imold-types

11415+ ?~ molds ~

11416+ =/ m=[name=term body=shape] i.molds

11417+ ?: &(=(at.state /lib/jibb/prelude/jibb) =(%list name.m))

11418+ ?. (standard-prelude-list body.m) $(molds t.molds)

11419+ [[%list [[%collection %list ~[[%var 0]]] ~[0]]] $(molds t.molds)]

11420+ =/ out=(unit [template=ischeme state=istate])

11421+ (infer-mold-template body.m state(active [name.m active.state], in-mold &))

11422+ ?~ out $(molds t.molds)

11423+ =. typ.template.u.out (label-direct-union typ.template.u.out body.m name.m state)

11424+ =. typ.template.u.out (prelude-label typ.template.u.out name.m vars.template.u.out)

11425+ [[name.m template.u.out] $(molds t.molds)]

11426+::

11427+:: A compiler-owned interface available only to the dedicated

11428+:: internal-prelude preparation path, never the ordinary module resolver.

11429+++ private-primitive-interface

11430+ ^- ifile

11431+ =/ a=itype [%avar 0]

11432+ =/ pair=itype [%cell a a]

11433+ =/ b=itype [%rvar 0]

11434+ =/ plus=ischeme [[%fn [%cell b b] b] ~[0]]

11435+ =/ minus=ischeme [[%fn b b] ~[0]]

11436+ =/ greater=ischeme [[%fn pair [%flag ~]] ~[0]]

11437+ =/ utf8=itype [%atom 'tD']

11438+ =/ tape=itype [%collection %list ~[utf8]]

11439+ =/ codepoints=itype [%collection %list ~[[%atom %c]]]

11440+ =/ text-trip=ischeme [[%fn [%atom %t] tape] ~]

11441+ =/ text-tuba=ischeme [[%fn tape codepoints] ~]

11442+ [~[[%raw-add plus] [%raw-dec minus] [%raw-gth greater] [%raw-trip text-trip] [%raw-tuba text-tuba]] ~ /lib/jibb/primitives/jibb ~ ~ ~ ~ ~]

11443+::

11444+++ infer-private-internal

11445+ |= [src=@t public-source=@t]

11446+ ^- (unit ifile)

11447+ =/ at=path /lib/jibb/internal/jibb

11448+ =/ parsed (parse at src)

11449+ ?: ?=(%| -.parsed) ~

11450+ =/ mod=module p.parsed

11451+ ?^ (duplicate-defs defs.mod) ~

11452+ ?~ imports.mod

11453+ =/ built=jfile-result (infer-jibb-file at src ~ ~ ~ ~[at] ~ ~ ~ ~)

11454+ ?: ?=(%| -.built) ~

11455+ `iface.p.built

11456+ ?. ?=([[%jibb *] ~] imports.mod) ~

11457+ ?. =(path.i.imports.mod /lib/jibb/primitives) ~

11458+ ?. (module-scope-valid mod ~ ~) ~

11459+ =/ vals=(list term) (global-value-names defs.mod)

11460+ ?: (lien vals |=(n=term =(n %main))) ~

11461+ =/ molds=imolds (collect-simple-molds defs.mod)

11462+ =/ globals=(list term) (weld (import-binding-names imports.mod) vals)

11463+ :: The private source can use the public list and unit molds before the

11464+ :: prelude is otherwise prepared. Re-read the trusted public source here

11465+ :: and admit only its validated canonical templates; do not accept schemes

11466+ :: supplied independently by the caller.

11467+ =/ public=(each module error) (parse /lib/jibb/prelude/jibb public-source)

11468+ ?: ?=(%| -.public) ~

11469+ ?^ (duplicate-defs defs.p.public) ~

11470+ ?. (module-scope-valid p.public ~ ~) ~

11471+ =/ source-molds=imolds (collect-simple-molds defs.p.public)

11472+ =/ written-list=(unit shape) (find-simple-mold %list source-molds)

11473+ =/ source-list=(unit ischeme)

11474+ ?~ written-list ~

11475+ ?. (standard-prelude-list u.written-list) ~

11476+ `[[%collection %list ~[[%var 0]]] ~[0]]

11477+ :: Derive the public unit template from its actual source, then compare

11478+ :: the complete nominal template before making it available privately.

11479+ =/ unit-decl=(unit shape) (find-simple-mold %unit source-molds)

11480+ =/ source-unit=(unit ischeme)

11481+ ?~ unit-decl ~

11482+ =/ unit-molds=imolds ~[[%unit u.unit-decl]]

11483+ =/ unit-state=istate [0 ~ ~ ~ unit-molds ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ | /lib/jibb/prelude/jibb ~[%unit] ~ ~ 256 ~ ~ ~ ~ ~ ~]

11484+ =/ unit-types=imold-types (partial-prelude-molds unit-molds unit-state)

11485+ =/ unit-iface=ifile [~ unit-types /lib/jibb/prelude/jibb ~ ~ ~ ~ ~]

11486+ =/ found=(unit ischeme) (find-jibb-mold %unit unit-iface)

11487+ ?~ found ~

11488+ ?. (standard-unit-template u.found /lib/jibb/prelude/jibb) ~

11489+ found

11490+ =/ primitive=ifile private-primitive-interface

11491+ =? primitive ?=(^ source-list)

11492+ primitive(molds [[%list u.source-list] molds.primitive])

11493+ =? primitive ?=(^ source-unit)

11494+ primitive(molds [[%unit u.source-unit] molds.primitive])

11495+ =/ js=ijimports ~[[face.i.imports.mod primitive]]

11496+ =/ reserved=(list term) ~[face.i.imports.mod]

11497+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

11498+ =/ state=istate [0 ~ ~ ~ molds globals ~ ~ ~ ~ js reserved ~ ~ ~ | at top ~ ~ 256 ~ ~ ~ ~ ~ ~]

11499+ =/ mts=(each imold-types @t) (module-mold-types molds state)

11500+ =/ usable=(unit imold-types)

11501+ ?: ?=(%& -.mts) `p.mts

11502+ :: Missing public templates may make an unrelated internal mold

11503+ :: unavailable. Validate all molds once with isolated canonical

11504+ :: templates before admitting only those inferred using the actual

11505+ :: source-backed templates. The proof interface is never exported.

11506+ ?. |(?=(~ source-list) ?=(~ source-unit)) ~

11507+ =/ nil=itype [%const [%null %n 0 '~']]

11508+ =/ canonical-unit=ischeme

11509+ [[%union ~[nil [%cell nil [%face %u [%var 0]]]] `[/lib/jibb/prelude/jibb %unit] `%unit ~[[%var 0]]] ~[0]]

11510+ =/ canonical-list=ischeme [[%collection %list ~[[%var 0]]] ~[0]]

11511+ =/ proof-primitive=ifile private-primitive-interface

11512+ =. molds.proof-primitive ~[[%list canonical-list] [%unit canonical-unit]]

11513+ =/ proof-imports=ijimports ~[[face.i.imports.mod proof-primitive]]

11514+ =/ proof=(each imold-types @t) (module-mold-types molds state(jimports proof-imports))

11515+ ?: ?=(%| -.proof) ~

11516+ `(partial-prelude-molds molds state)

11517+ ?~ usable ~

11518+ =/ resolution=iresolved (resolve-groups defs.mod molds globals ~ ~ ~ ~ js reserved at ~)

11519+ =/ env=ienv env.resolution

11520+ ?. (module-values-complete defs.mod env) ~

11521+ `[env u.usable at ~ artifacts.resolution ~ `src ~]

11522+::

11523+++ partial-prelude-interface-with-internal

11524+ |= [src=@t internal-source=(unit @t)]

11525+ ^- (unit ifile)

11526+ ?: =(0 src) ~

11527+ =/ at=path /lib/jibb/prelude/jibb

11528+ =/ parsed (parse at src)

11529+ ?: ?=(%| -.parsed) ~

11530+ ?: (named-mold-has-hole defs.p.parsed) ~

11531+ ?^ (duplicate-defs defs.p.parsed) ~

11532+ =/ private=(unit ijimports)

11533+ ?~ imports.p.parsed `~

11534+ ?. ?=([[%jibb *] ~] imports.p.parsed) ~

11535+ ?. =(path.i.imports.p.parsed /lib/jibb/internal) ~

11536+ ?~ internal-source ~

11537+ =/ built=(unit ifile) (infer-private-internal u.internal-source src)

11538+ ?~ built ~

11539+ `~[[face.i.imports.p.parsed u.built]]

11540+ ?~ private ~

11541+ ?~ defs.p.parsed ~

11542+ ?. (module-scope-valid p.parsed ~ ~) ~

11543+ =/ ds=(list def) defs.p.parsed

11544+ =/ molds=imolds (collect-simple-molds ds)

11545+ =/ names=(list term) (turn molds |=(m=[name=term body=shape] name.m))

11546+ =/ globals=(list term) (weld (import-binding-names imports.p.parsed) (global-value-names ds))

11547+ :: Remove raw list before inferring any template, so an altered list

11548+ :: cannot leak through an alias. Its name remains reserved either way.

11549+ =/ declared=? (lien names |=(name=term =(%list name)))

11550+ =/ env-molds=imolds molds

11551+ =? env-molds declared

11552+ (skim molds |=(m=[name=term body=shape] !=(%list name.m)))

11553+ =/ reserved=(list term) ?:(declared ~[%list] ~)

11554+ =/ state=istate [0 ~ ~ ~ env-molds globals ~ ~ ~ ~ u.private reserved ~ ~ ~ | at names ~ ~ 256 ~ ~ ~ ~ ~ ~]

11555+ :: Other prelude molds may use list only after its source has passed

11556+ :: the standard-list check. The raw declaration remains removed.

11557+ =/ declared-list=(unit shape) (find-simple-mold %list molds)

11558+ =/ mold-prelude=(unit ifile)

11559+ ?~ declared-list ~

11560+ ?. (standard-prelude-list u.declared-list) ~

11561+ `[~ ~[[%list [[%collection %list ~[[%var 0]]] ~[0]]]] at ~ ~ ~ ~ ~]

11562+ =/ mt=imold-types (partial-prelude-molds molds state(prelude mold-prelude))

11563+ =/ partial=ifile [~ mt at ~ ~ ~ ~ ~]

11564+ :: An explicitly qualified re-export must resolve. Other unsupported

11565+ :: prelude declarations remain reserved but absent from the interface.

11566+ =/ required=imolds

11567+ %+ skim molds

11568+ |= m=[name=term body=shape]

11569+ =/ sh=shape body.m

11570+ ?. ?=(%ref -.sh) |

11571+ ?~ names.sh |

11572+ ?=(^ t.names.sh)

11573+ ?. (levy required |=(m=[name=term body=shape] ?=(^ (find-jibb-mold name.m partial)))) ~

11574+ =/ resolution=iresolved (resolve-groups ds env-molds globals ~ ~ ~ ~ u.private reserved at `partial)

11575+ =/ env=ienv env.resolution

11576+ ?. (hole-values-present ds env) ~

11577+ =/ deps=(list iwidth-dependency)

11578+ ?~ u.private ~

11579+ ~[[at.interface.i.u.private source.interface.i.u.private elaborations.interface.i.u.private]]

11580+ `[env mt at ~ artifacts.resolution deps `src ~]

11581+::

11582+++ partial-prelude-interface

11583+ |= src=@t

11584+ ^- (unit ifile)

11585+ (partial-prelude-interface-with-internal src ~)

11586+::

11587++$ iprelude [iface=ifile values=(list term) molds=(list term)]

11588+::

11589+++ prepare-prelude

11590+ |= src=@t

11591+ ^- (unit iprelude)

11592+ =/ iface=(unit ifile) (partial-prelude-interface src)

11593+ ?~ iface ~

11594+ =/ parsed (parse /lib/jibb/prelude/jibb src)

11595+ ?: ?=(%| -.parsed) ~

11596+ =/ vals=(list term) (global-value-names defs.p.parsed)

11597+ =/ ms=(list term) (turn (collect-simple-molds defs.p.parsed) |=(m=[name=term body=shape] name.m))

11598+ `[u.iface vals ms]

11599+::

11600+++ prepare-prelude-with-internal

11601+ |= [src=@t internal-source=@t]

11602+ ^- (unit iprelude)

11603+ =/ iface=(unit ifile) (partial-prelude-interface-with-internal src `internal-source)

11604+ ?~ iface ~

11605+ =/ parsed (parse /lib/jibb/prelude/jibb src)

11606+ ?: ?=(%| -.parsed) ~

11607+ =/ vals=(list term) (global-value-names defs.p.parsed)

11608+ =/ ms=(list term) (turn (collect-simple-molds defs.p.parsed) |=(m=[name=term body=shape] name.m))

11609+ `[u.iface vals ms]

11610+::

11611+++ module-values-complete

11612+ |= [ds=(list def) env=ienv]

11613+ ^- ?

11614+ ?~ ds &

11615+ ?: ?=(%mold -.i.ds) $(ds t.ds)

11616+ ?~ (ienv-lookup name.i.ds env) |

11617+ $(ds t.ds)

11618+::

11619+:: Cache only completed interfaces for this invocation. The source bundle,

11620+:: imported Hoon types and prelude are fixed for the whole graph. Check the

11621+:: active path and duplicate sources before consulting it, so a cache hit

11622+:: cannot hide a cycle or ambiguous source.

11623+::

11624+++ find-jibb-cache

11625+ |= [at=path cache=jcache]

11626+ ^- (unit ifile)

11627+ ?~ cache ~

11628+ ?: =(at at.i.cache) `iface.i.cache

11629+ $(cache t.cache)

11630+::

11631+:: These certificates retain the complete checked source closure. The

11632+:: trusted host must supply the identical prepared prelude and reader nouns.

11633+:: Exact bundle equality binds all source paths and versions; the set

11634+:: retains transitive paths for active-cycle checks. Request-bearing graphs

11635+:: alone have a size limit; incompatible diamond evidence fails closed.

11636+++ request-graph-requests-add

11637+ |= [pending=(list irequest-evidence) acc=(list irequest-evidence) fuel=@ud]

11638+ ^- (unit (list irequest-evidence))

11639+ ?~ pending `acc

11640+ ?: =(0 fuel) ~

11641+ =/ hit=(list irequest-evidence)

11642+ (skim acc |=(x=irequest-evidence &(=(api-at.x api-at.i.pending) =(name.x name.i.pending))))

11643+ ?^ hit

11644+ ?. ?=([* ~] hit) ~

11645+ ?. =(i.hit i.pending) ~

11646+ $(pending t.pending, fuel (dec fuel))

11647+ $(pending t.pending, acc [i.pending acc], fuel (dec fuel))

11648+++ request-graph-inputs-match

11649+ |= [g=irequest-graph externals=iexternals marks=imark-externals modules=jbundle values=(list term) molds=(list term) prelude=(unit ifile)]

11650+ ^- ?

11651+ ?& =(bundle-input.g modules)

11652+ =(prelude-input.g prelude)

11653+ =(prelude-values.g values)

11654+ =(prelude-molds.g molds)

11655+ =(externals.g externals)

11656+ =(marks.g marks)

11657+ ==

11658+++ request-graph-merge

11659+ |= [imports=ijimports g=irequest-graph fuel=@ud]

11660+ ^- (unit irequest-graph)

11661+ ?~ imports `g

11662+ ?: =(0 fuel) ~

11663+ =/ child=ifile interface.i.imports

11664+ ?~ graph.child ~

11665+ =/ cg=irequest-graph u.graph.child

11666+ ?. ?& =(bundle-input.g bundle-input.cg)

11667+ =(prelude-input.g prelude-input.cg)

11668+ =(prelude-values.g prelude-values.cg)

11669+ =(prelude-molds.g prelude-molds.cg)

11670+ =(externals.g externals.cg)

11671+ =(marks.g marks.cg)

11672+ ==

11673+ ~

11674+ =/ merged=(set path) (~(uni in:..zuse paths.g) paths.cg)

11675+ =/ rs=(unit (list irequest-evidence))

11676+ (request-graph-requests-add requests.cg requests.g (add 1 (lent requests.cg)))

11677+ ?~ rs ~

11678+ ?: &(?=(^ u.rs) |((gth (lent ~(tap in:..zuse merged)) 256) (gth (lent u.rs) 256))) ~

11679+ $(imports t.imports, g g(paths merged, requests u.rs), fuel (dec fuel))

11680+++ request-graph-reusable

11681+ |= [f=ifile src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) values=(list term) molds=(list term) prelude=(unit ifile)]

11682+ ^- ?

11683+ ?~ source.f |

11684+ ?. =(u.source.f src) |

11685+ ?~ graph.f |

11686+ =/ g=irequest-graph u.graph.f

11687+ ?. (request-graph-inputs-match g externals marks modules values molds prelude) |

11688+ ?. (~(has in:..zuse paths.g) at.f) |

11689+ !(lien active |=(p=path (~(has in:..zuse paths.g) p)))

11690+::

11691+++ resolve-jibb-imports

11692+ |= [imports=(list import) externals=iexternals mark-externals=imark-externals modules=jbundle active=(list path) prelude-values=(list term) prelude-molds=(list term) cache=jcache prelude=(unit ifile)]

11693+ ^- jimports-result

11694+ =/ result=jimports-detailed-result

11695+ (resolve-jibb-imports-detailed imports externals mark-externals modules active prelude-values prelude-molds cache prelude)

11696+ ?: ?=(%| -.result) [%| message.p.result]

11697+ [%& p.result]

11698+++ resolve-jibb-imports-detailed

11699+ |= [imports=(list import) externals=iexternals mark-externals=imark-externals modules=jbundle active=(list path) prelude-values=(list term) prelude-molds=(list term) cache=jcache prelude=(unit ifile)]

11700+ ^- jimports-detailed-result

11701+ ?~ imports [%& [~ cache]]

11702+ ?. ?=(%jibb -.i.imports) $(imports t.imports)

11703+ =/ at=path (weld path.i.imports `path`~[%jibb])

11704+ ?: =(at /lib/jibb/internal/jibb)

11705+ [%| ['the prelude internal module is private' ~]]

11706+ ?: =(at /lib/jibb/primitives/jibb)

11707+ [%| ['the prelude primitive interface is private' ~]]

11708+ ?: (lien active |=(p=path =(p at)))

11709+ [%| [(crip "import cycle at {(spud at)}") ~]]

11710+ =/ found=jbundle (skim modules |=(m=jsource =(at at.m)))

11711+ ?~ found [%| [(crip "module source missing: {(spud at)}") ~]]

11712+ ?^ t.found [%| [(crip "duplicate module sources: {(spud at)}") ~]]

11713+ =/ cached=(unit ifile) (find-jibb-cache at cache)

11714+ =/ iface=jfile-detailed-result

11715+ ?^ cached

11716+ ?. =(at.u.cached at) [%| ['cached module identity needs unsupported inference' ~]]

11717+ ?~ graph.u.cached

11718+ :: A detached legacy interface has unknown evidence. Rebuild it

11719+ :: against the current graph, without retaining any stale entry.

11720+ =/ clean=jcache (skim cache |=(x=[at=path iface=ifile] !=(at.x at)))

11721+ (infer-jibb-file-detailed at source.i.found externals mark-externals modules [at active] prelude-values prelude-molds clean prelude)

11722+ ?. (request-graph-reusable u.cached source.i.found externals mark-externals modules active prelude-values prelude-molds prelude)

11723+ [%| ['cached module evidence needs unsupported inference' ~]]

11724+ [%& [u.cached cache]]

11725+ (infer-jibb-file-detailed at source.i.found externals mark-externals modules [at active] prelude-values prelude-molds cache prelude)

11726+ ?: ?=(%| -.iface) [%| p.iface]

11727+ =/ rest=jimports-detailed-result $(imports t.imports, cache cache.p.iface)

11728+ ?: ?=(%| -.rest) rest

11729+ [%& [[[face.i.imports iface.p.iface] resolved.p.rest] cache.p.rest]]

11730+::

11731+:: Provisional declaration extraction only; this does not derive asks,

11732+:: validate imported types, or claim that an API module has checked.

11733++$ iapi-path [at=span name=term segments=(list pseg) full=term diffs=(list term) scry=(unit (list pseg))]

11734+++ api-path-mark

11735+ |= [sh=shape marks=(list term)]

11736+ ^- (unit term)

11737+ ?. ?=(%ref -.sh) ~

11738+ ?. ?=([@ ~] names.sh) ~

11739+ ?. (unique-value-name i.names.sh marks) ~

11740+ `i.names.sh

11741+::

11742+++ api-path-diffs

11743+ |= [shapes=(list shape) marks=(list term) used=(list term)]

11744+ ^- (unit (list term))

11745+ ?~ shapes `~

11746+ =/ n=(unit term) (api-path-mark i.shapes marks)

11747+ ?~ n ~

11748+ ?: (lien used |=(x=term =(x u.n))) ~

11749+ =/ rest=(unit (list term)) $(shapes t.shapes, used [u.n used])

11750+ ?~ rest ~

11751+ `[u.n u.rest]

11752+::

11753+++ api-path-payload

11754+ |= [sh=shape marks=(list term)]

11755+ ^- (unit [full=term diffs=(list term)])

11756+ =/ direct=(unit term) (api-path-mark sh marks)

11757+ ?^ direct `[u.direct ~]

11758+ ?. ?=(%apply -.sh) ~

11759+ ?. =(~[%facts] ref.sh) ~

11760+ ?~ args.sh ~

11761+ ?~ t.args.sh ~

11762+ =/ full=(unit term) (api-path-mark i.args.sh marks)

11763+ ?~ full ~

11764+ =/ diffs=(unit (list term)) (api-path-diffs t.args.sh marks ~[u.full])

11765+ ?~ diffs ~

11766+ `[u.full u.diffs]

11767+::

11768++$ iapi-parameter [name=term aura=@ta at=span]

11769+++ api-path-parameters

11770+ |= [segments=(list pseg) seen=(list term)]

11771+ ^- (unit (list iapi-parameter))

11772+ ?~ segments `~

11773+ ?: ?=(%knot -.i.segments) $(segments t.segments)

11774+ =/ seg=pseg i.segments

11775+ ?. ?=(%typed -.seg) ~

11776+ ?: =(0 aura.seg) ~

11777+ ?: (lien seen |=(n=term =(n name.seg))) ~

11778+ =/ rest=(unit (list iapi-parameter)) $(segments t.segments, seen [name.seg seen])

11779+ ?~ rest ~

11780+ `[[name.seg aura.seg at.seg] u.rest]

11781+::

11782+++ api-scry-parameters-compatible

11783+ |= [scry=(list iapi-parameter) watch=(list iapi-parameter)]

11784+ ^- ?

11785+ ?~ scry &

11786+ ?. (lien watch |=(p=iapi-parameter &(=(name.p name.i.scry) =(aura.p aura.i.scry)))) |

11787+ $(scry t.scry)

11788+::

11789+++ api-path-one

11790+ |= [sh=shape marks=(list term)]

11791+ ^- (unit iapi-path)

11792+ ?. ?=(%cell -.sh) ~

11793+ =/ fs=(list field) fields.sh

11794+ ?~ fs ~

11795+ ?~ t.fs ~

11796+ ?~ t.t.fs ~

11797+ ?: (gth (lent fs) 4) ~

11798+ ?. ?=(%bare -.i.fs) ~

11799+ =/ tag=shape shape.i.fs

11800+ ?. ?=(%const -.tag) ~

11801+ ?. =(%term form.lit.tag) ~

11802+ =/ name=term val.lit.tag

11803+ ?. (jibb-face-name name) ~

11804+ ?. ?=(%bare -.i.t.fs) ~

11805+ =/ path-shape=shape shape.i.t.fs

11806+ ?. ?=(%path -.path-shape) ~

11807+ ?. ?=(%bare -.i.t.t.fs) ~

11808+ =/ payload=(unit [full=term diffs=(list term)]) (api-path-payload shape.i.t.t.fs marks)

11809+ ?~ payload ~

11810+ =/ scry=(unit (unit (list pseg)))

11811+ ?~ t.t.t.fs `~

11812+ =/ entry=field i.t.t.t.fs

11813+ ?. ?=(%face -.entry) ~

11814+ ?. =(%scry name.entry) ~

11815+ ?. ?=(%path -.shape.entry) ~

11816+ ``segs.shape.entry

11817+ ?~ scry ~

11818+ =/ params=(unit (list iapi-parameter)) (api-path-parameters segs.path-shape ~)

11819+ ?~ params ~

11820+ ?^ u.scry

11821+ =/ scry-params=(unit (list iapi-parameter)) (api-path-parameters u.u.scry ~)

11822+ ?~ scry-params ~

11823+ ?. (api-scry-parameters-compatible u.scry-params u.params) ~

11824+ `[at.sh name segs.path-shape full.u.payload diffs.u.payload u.scry]

11825+ `[at.sh name segs.path-shape full.u.payload diffs.u.payload u.scry]

11826+::

11827+++ api-path-many

11828+ |= [shapes=(list shape) marks=(list term) seen=(list term)]

11829+ ^- (unit (list iapi-path))

11830+ ?~ shapes `~

11831+ =/ one=(unit iapi-path) (api-path-one i.shapes marks)

11832+ ?~ one ~

11833+ ?: (lien seen |=(n=term =(n name.u.one))) ~

11834+ =/ rest=(unit (list iapi-path)) $(shapes t.shapes, seen [name.u.one seen])

11835+ ?~ rest ~

11836+ `[u.one u.rest]

11837+::

11838+++ api-path-declaration

11839+ |= [sh=shape marks=(list term)]

11840+ ^- (unit (list iapi-path))

11841+ ?: ?=(%union -.sh) (api-path-many cases.sh marks ~)

11842+ (api-path-many ~[sh] marks ~)

11843+::

11844+:: Derived gates share the value namespace. /% marks name molds; /- and

11845+:: /= also introduce faces that cannot be shadowed by a derived value.

11846+++ api-import-faces

11847+ |= imports=(list import)

11848+ ^- (list term)

11849+ ?~ imports ~

11850+ ?- -.i.imports

11851+ %mark $(imports t.imports)

11852+ %sur [name.i.imports $(imports t.imports)]

11853+ %jibb [face.i.imports $(imports t.imports)]

11854+ ==

11855+::

11856+++ api-derived-names-valid

11857+ |= [paths=(list iapi-path) poke-names=(list term) mod=module prelude-values=(list term)]

11858+ ^- ?

11859+ =/ path-names=(list term) (turn paths |=(p=iapi-path name.p))

11860+ =/ derived=(list term) (weld path-names poke-names)

11861+ ?: (lien derived |=(n=term =(n %proj))) |

11862+ =/ outer=(list term) (weld prelude-values (weld (global-value-names defs.mod) (api-import-faces imports.mod)))

11863+ (levy derived |=(n=term &((unique-value-name n derived) !(lien outer |=(x=term =(n x))))))

11864+::

11865+:: Analysis only. Successful external entries must be unchanged results

11866+:: produced for the declared marks; no request interface is produced.

11867++$ iapi-mark-type [name=term typ=itype]

11868++$ iapi-path-typed [path=iapi-path full=itype diffs=(list iapi-mark-type)]

11869+++ api-diff-types

11870+ |= [names=(list term) externals=imark-externals declared=(list term)]

11871+ ^- (unit (list iapi-mark-type))

11872+ ?~ names `~

11873+ =/ typ=(unit itype) (find-imported-mark i.names externals declared)

11874+ ?~ typ ~

11875+ =/ tail=(unit (list iapi-mark-type)) $(names t.names)

11876+ ?~ tail ~

11877+ `[[i.names u.typ] u.tail]

11878+::

11879+++ api-path-types

11880+ |= [paths=(list iapi-path) externals=imark-externals declared=(list term)]

11881+ ^- (unit (list iapi-path-typed))

11882+ ?~ paths `~

11883+ =/ full=(unit itype) (find-imported-mark full.i.paths externals declared)

11884+ ?~ full ~

11885+ =/ diffs=(unit (list iapi-mark-type)) (api-diff-types diffs.i.paths externals declared)

11886+ ?~ diffs ~

11887+ =/ tail=(unit (list iapi-path-typed)) $(paths t.paths)

11888+ ?~ tail ~

11889+ `[[i.paths u.full u.diffs] u.tail]

11890+::

11891+++ api-poke-mark-names

11892+ |= [pokes=(list def) declared=(list term)]

11893+ ^- (unit (list term))

11894+ ?~ pokes `~

11895+ ?^ t.pokes ~

11896+ =/ d=def i.pokes

11897+ ?. ?=(%mold -.d) ~

11898+ =/ sh=shape shape.d

11899+ ?: ?=(%union -.sh) (api-path-diffs cases.sh declared ~)

11900+ =/ name=(unit term) (api-path-mark sh declared)

11901+ ?~ name ~

11902+ `~[u.name]

11903+::

11904+++ api-path-analysis

11905+ |= [mod=module externals=imark-externals prelude-values=(list term) prelude-molds=(list term)]

11906+ ^- (unit (list iapi-path-typed))

11907+ ?: (lien defs.mod def-has-hole) ~

11908+ ?^ (duplicate-defs defs.mod) ~

11909+ =/ ds=(list def) defs.mod

11910+ =/ declarations=(list def)

11911+ (skim ds |=(d=def &(?=(%mold -.d) =(%paths name.d))))

11912+ ?. ?=([* ~] declarations) ~

11913+ =/ pokes=(list def)

11914+ (skim ds |=(d=def &(?=(%mold -.d) =(%poke name.d))))

11915+ ?: (gth (lent pokes) 1) ~

11916+ =/ ordinary=(list def)

11917+ (skim ds |=(d=def !&(?=(%mold -.d) |(=(%paths name.d) =(%poke name.d)))))

11918+ ?. (module-scope-valid mod(defs ordinary) prelude-values prelude-molds) ~

11919+ =/ declared=(list term) (collect-mark-imports imports.mod)

11920+ =/ poke-names=(unit (list term)) (api-poke-mark-names pokes declared)

11921+ ?~ poke-names ~

11922+ =/ decl=def i.declarations

11923+ ?> ?=(%mold -.decl)

11924+ =/ paths=(unit (list iapi-path)) (api-path-declaration shape.decl declared)

11925+ ?~ paths ~

11926+ ?. (api-derived-names-valid u.paths u.poke-names mod prelude-values) ~

11927+ (api-path-types u.paths externals declared)

11928+::

11929+:: Source/graph entry for path analysis only. The returned paths retain

11930+:: reader-derived mark types and import resolution has checked reachable

11931+:: Jibb dependencies. This is not an API interface or a module check.

11932+++ api-path-analysis-source

11933+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

11934+ ^- (each (list iapi-path-typed) @t)

11935+ ?. ?=([%ui %api @ %jibb ~] file) [%| 'API path analysis requires /ui/api/<agent>.jibb']

11936+ =/ parsed (parse file src)

11937+ ?: ?=(%| -.parsed) [%| 'API path source does not parse']

11938+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11939+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

11940+ ?~ prepared [%| 'API path analysis needs the prepared prelude']

11941+ =/ prelude=(unit ifile) `iface.u.prepared

11942+ =/ deps=jimports-result

11943+ (resolve-jibb-imports imports.p.parsed externals marks modules ~[file] values.u.prepared molds.u.prepared ~ prelude)

11944+ ?: ?=(%| -.deps) [%| p.deps]

11945+ =/ paths=(unit (list iapi-path-typed))

11946+ (api-path-analysis p.parsed marks values.u.prepared molds.u.prepared)

11947+ ?~ paths [%| 'API path declaration needs unsupported analysis']

11948+ [%& u.paths]

11949+::

11950+:: Analysis evidence retains the API source, the prepared interface, the

11951+:: caller's reader results and the resolved Jibb dependency cache alongside

11952+:: the typed path declarations. Reader results and prepared interfaces are

11953+:: trusted inputs: this does not verify their underlying Hoon source/version,

11954+:: create requests or check the provenance of arbitrary values.

11955++$ iapi-path-evidence

11956+ [at=path source=@t prepared=iprelude externals=iexternals marks=imark-externals dependencies=jcache paths=(list iapi-path-typed)]

11957+++ api-path-evidence-source

11958+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

11959+ ^- (each iapi-path-evidence @t)

11960+ ?. ?=([%ui %api @ %jibb ~] file) [%| 'API path evidence requires /ui/api/<agent>.jibb']

11961+ =/ parsed (parse file src)

11962+ ?: ?=(%| -.parsed) [%| 'API path evidence source does not parse']

11963+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11964+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

11965+ ?~ prepared [%| 'API path evidence needs the prepared prelude']

11966+ =/ public=ifile iface.u.prepared

11967+ =/ deps=jimports-result

11968+ (resolve-jibb-imports imports.p.parsed externals marks modules ~[file] values.u.prepared molds.u.prepared ~ `public)

11969+ ?: ?=(%| -.deps) [%| p.deps]

11970+ =/ paths=(unit (list iapi-path-typed))

11971+ (api-path-analysis p.parsed marks values.u.prepared molds.u.prepared)

11972+ ?~ paths [%| 'API path declaration needs unsupported analysis']

11973+ [%& [file src u.prepared externals marks cache.p.deps u.paths]]

11974+:: Graph-aware variant preserves the caller active stack and cache.

11975+++ api-path-evidence-graph

11976+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

11977+ ^- (each iapi-path-evidence @t)

11978+ ?~ active [%| 'API analysis needs an active graph']

11979+ ?. =(i.active file) [%| 'API analysis active graph does not start at the source']

11980+ ?: (lien t.active |=(p=path =(p file))) [%| 'API analysis active graph contains a cycle']

11981+ ?. ?=([%ui %api @ %jibb ~] file) [%| 'API path evidence requires /ui/api/<agent>.jibb']

11982+ =/ parsed (parse file src)

11983+ ?: ?=(%| -.parsed) [%| 'API path evidence source does not parse']

11984+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11985+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

11986+ ?~ prepared [%| 'API path evidence needs the prepared prelude']

11987+ =/ public=ifile iface.u.prepared

11988+ =/ deps=jimports-result

11989+ (resolve-jibb-imports imports.p.parsed externals marks modules active values.u.prepared molds.u.prepared cache `public)

11990+ ?: ?=(%| -.deps) [%| p.deps]

11991+ =/ paths=(unit (list iapi-path-typed))

11992+ (api-path-analysis p.parsed marks values.u.prepared molds.u.prepared)

11993+ ?~ paths [%| 'API path declaration needs unsupported analysis']

11994+ [%& [file src u.prepared externals marks cache.p.deps u.paths]]

11995+::

11996+:: This query classifies a unique path declaration only. Missing evidence

11997+:: or a nonunique name is unknown; it proves nothing about an ask value.

11998+:: Like prepared interfaces, the supplied evidence is a trusted host input.

11999+++ api-path-watchability

12000+ |= [evidence=(unit iapi-path-evidence) case-name=term]

12001+ ^- ?(%watchable %not-watchable %unknown)

12002+ ?~ evidence %unknown

12003+ =/ found=(list iapi-path-typed)

12004+ (skim paths.u.evidence |=(p=iapi-path-typed =(name.path.p case-name)))

12005+ ?. ?=([* ~] found) %unknown

12006+ ?~ scry.path.i.found %watchable

12007+ %not-watchable

12008+::

12009+:: These are declaration-derived request components, not a callable gate,

12010+:: an ask value, or proof of a value's provenance. Keep the exact trusted

12011+:: source/reader evidence until a later checked interface and lowerer can

12012+:: attach it to a generated request. No argument ordering is claimed here.

12013++$ iapi-request-parameter [name=term typ=itype at=span]

12014++$ iapi-request-parts

12015+ [evidence=iapi-path-evidence path=iapi-path-typed parameters=(list iapi-request-parameter) reply-sample=itype fold=(unit itype) watchability=?(%watchable %not-watchable)]

12016+++ api-request-parameter-types

12017+ |= params=(list iapi-parameter)

12018+ ^- (unit (list iapi-request-parameter))

12019+ ?~ params `~

12020+ =/ aura=@ta aura.i.params

12021+ ?. |(?=(?(%u %ud %ux %uv %t %ta %tas %p %da %dr) aura) =('tD' aura)) ~

12022+ =/ rest=(unit (list iapi-request-parameter)) $(params t.params)

12023+ ?~ rest ~

12024+ `[[name.i.params [%atom aura] at.i.params] u.rest]

12025+::

12026+:: A single diff's fold consumes the tagged diff and the previous full value.

12027+:: Multiple-diff unions need a checked union representation and remain open.

12028+++ api-request-fold-type

12029+ |= p=iapi-path-typed

12030+ ^- (unit (unit itype))

12031+ ?~ diffs.p `~

12032+ ?^ t.diffs.p ~

12033+ =/ d=iapi-mark-type i.diffs.p

12034+ =/ literal=lit [%term %tas name.d (crip ['%' (trip name.d)])]

12035+ =/ sample=itype [%cell [%cell [%const literal] typ.d] full.p]

12036+ ``[%fn sample full.p]

12037+::

12038+++ api-request-parts

12039+ |= [evidence=(unit iapi-path-evidence) case-name=term]

12040+ ^- (unit iapi-request-parts)

12041+ ?~ evidence ~

12042+ =/ found=(list iapi-path-typed)

12043+ (skim paths.u.evidence |=(p=iapi-path-typed =(name.path.p case-name)))

12044+ ?. ?=([* ~] found) ~

12045+ =/ p=iapi-path-typed i.found

12046+ =/ raw=(unit (list iapi-parameter)) (api-path-parameters segments.path.p ~)

12047+ ?~ raw ~

12048+ =/ params=(unit (list iapi-request-parameter)) (api-request-parameter-types u.raw)

12049+ ?~ params ~

12050+ =/ fold=(unit (unit itype)) (api-request-fold-type p)

12051+ ?~ fold ~

12052+ =/ watch=?(%watchable %not-watchable) ?~(scry.path.p %watchable %not-watchable)

12053+ `[u.evidence p u.params full.p u.fold watch]

12054+::

12055+:: Check ordinary API molds and values plus every declared mark type using

12056+:: the same trusted source, prepared prelude and reader inputs as path

12057+:: evidence. Keep elaborations with those inputs for a later interface.

12058+:: This is partial analysis: an unused /- core is not independently checked,

12059+:: definitions needing derived values remain unsupported, and no complete

12060+:: API, request or constructor is exported or given runtime behavior.

12061++$ iapi-support-evidence

12062+ [paths=iapi-path-evidence values=ienv molds=imold-types marks=(list iapi-mark-type) elaborations=(list iwidth-definition)]

12063+++ api-support-analysis-source

12064+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

12065+ ^- (each iapi-support-evidence @t)

12066+ =/ path-result (api-path-evidence-source file src externals marks modules prepared)

12067+ ?: ?=(%| -.path-result) [%| p.path-result]

12068+ =/ evidence=iapi-path-evidence p.path-result

12069+ =/ parsed (parse file src)

12070+ ?: ?=(%| -.parsed) [%| 'API source does not parse']

12071+ =/ mod=module p.parsed

12072+ =/ ordinary=(list def)

12073+ (skim defs.mod |=(d=def !&(?=(%mold -.d) |(=(%paths name.d) =(%poke name.d)))))

12074+ =/ prep=iprelude prepared.evidence

12075+ ?. (module-scope-valid mod(defs ordinary) values.prep molds.prep) [%| 'API ordinary scope needs unsupported inference']

12076+ =/ vals=(list term) (global-value-names ordinary)

12077+ ?: (lien vals |=(n=term =(n %main))) [%| 'API module kind needs unsupported inference']

12078+ =/ declared=(list term) (collect-mark-imports imports.mod)

12079+ =/ mark-types=(unit (list iapi-mark-type)) (api-diff-types declared marks declared)

12080+ ?~ mark-types [%| 'API declared marks need unsupported inference']

12081+ =/ prelude=(unit ifile) `iface.prep

12082+ =/ deps=jimports-result

12083+ (resolve-jibb-imports imports.mod externals marks modules ~[file] values.prep molds.prep dependencies.evidence prelude)

12084+ ?: ?=(%| -.deps) [%| p.deps]

12085+ =/ molds=imolds (collect-simple-molds ordinary)

12086+ =/ globals=(list term) (weld values.prep (weld (import-binding-names imports.mod) vals))

12087+ =/ surs=(list term) (collect-sur-imports imports.mod)

12088+ =/ reserved=(list term) (weld molds.prep (turn resolved.p.deps |=(j=[face=term interface=ifile] face.j)))

12089+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

12090+ =/ state=istate [0 ~ ~ ~ molds globals externals surs marks declared resolved.p.deps reserved ~ ~ ~ | file top prelude ~ 256 ~ ~ ~ ~ ~ ~]

12091+ =/ mts=(each imold-types @t) (module-mold-types molds state)

12092+ ?: ?=(%| -.mts) [%| p.mts]

12093+ =/ resolution=iresolved (resolve-groups ordinary molds globals externals surs marks declared resolved.p.deps reserved file prelude)

12094+ ?. (module-values-complete ordinary env.resolution) [%| 'API ordinary definitions need unsupported inference']

12095+ [%& [evidence env.resolution p.mts u.mark-types artifacts.resolution]]

12096+:: Preserve the same graph context through supporting definitions.

12097+++ api-support-analysis-graph

12098+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

12099+ ^- (each iapi-support-evidence @t)

12100+ =/ path-result (api-path-evidence-graph file src externals marks modules active cache prepared)

12101+ ?: ?=(%| -.path-result) [%| p.path-result]

12102+ =/ evidence=iapi-path-evidence p.path-result

12103+ =/ parsed (parse file src)

12104+ ?: ?=(%| -.parsed) [%| 'API source does not parse']

12105+ =/ mod=module p.parsed

12106+ =/ ordinary=(list def)

12107+ (skim defs.mod |=(d=def !&(?=(%mold -.d) |(=(%paths name.d) =(%poke name.d)))))

12108+ =/ prep=iprelude prepared.evidence

12109+ ?. (module-scope-valid mod(defs ordinary) values.prep molds.prep) [%| 'API ordinary scope needs unsupported inference']

12110+ =/ vals=(list term) (global-value-names ordinary)

12111+ ?: (lien vals |=(n=term =(n %main))) [%| 'API module kind needs unsupported inference']

12112+ =/ declared=(list term) (collect-mark-imports imports.mod)

12113+ =/ mark-types=(unit (list iapi-mark-type)) (api-diff-types declared marks declared)

12114+ ?~ mark-types [%| 'API declared marks need unsupported inference']

12115+ =/ prelude=(unit ifile) `iface.prep

12116+ =/ deps=jimports-result

12117+ (resolve-jibb-imports imports.mod externals marks modules active values.prep molds.prep dependencies.evidence prelude)

12118+ ?: ?=(%| -.deps) [%| p.deps]

12119+ =/ molds=imolds (collect-simple-molds ordinary)

12120+ =/ globals=(list term) (weld values.prep (weld (import-binding-names imports.mod) vals))

12121+ =/ surs=(list term) (collect-sur-imports imports.mod)

12122+ =/ reserved=(list term) (weld molds.prep (turn resolved.p.deps |=(j=[face=term interface=ifile] face.j)))

12123+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

12124+ =/ state=istate [0 ~ ~ ~ molds globals externals surs marks declared resolved.p.deps reserved ~ ~ ~ | file top prelude ~ 256 ~ ~ ~ ~ ~ ~]

12125+ =/ mts=(each imold-types @t) (module-mold-types molds state)

12126+ ?: ?=(%| -.mts) [%| p.mts]

12127+ =/ resolution=iresolved (resolve-groups ordinary molds globals externals surs marks declared resolved.p.deps reserved file prelude)

12128+ ?. (module-values-complete ordinary env.resolution) [%| 'API ordinary definitions need unsupported inference']

12129+ [%& [evidence env.resolution p.mts u.mark-types artifacts.resolution]]

12130+::

12131+:: Type-analysis artifact for one plain request. The resolver may publish

12132+:: its interface only together with trusted source and reader evidence.

12133+:: No lowering or runtime validator exists.

12134+:: Value watchability remains unproved even for a watchable declaration.

12135++$ ione-request-interface

12136+ [support=iapi-support-evidence parts=iapi-request-parts iface=ifile]

12137+++ request-compatible-ask

12138+ |= prelude=iprelude

12139+ ^- (unit ischeme)

12140+ =/ public=ifile iface.prelude

12141+ ?. =(at.public /lib/jibb/prelude/jibb) ~

12142+ =/ ask=(unit ischeme) (find-jibb-mold %ask public)

12143+ ?~ ask ~

12144+ ?. ?=([@ ~] vars.u.ask) ~

12145+ ?. ?=(%union -.typ.u.ask) ~

12146+ ?. =(origin.typ.u.ask `[/lib/jibb/internal/jibb %ask]) ~

12147+ ?. (identity-union-parameters vars.u.ask args.typ.u.ask) ~

12148+ =/ m=@ud i.vars.u.ask

12149+ ?: (itype-var-is-atom m typ.u.ask) ~

12150+ ?. (levy (itype-vars typ.u.ask) |=(n=@ud =(n m))) ~

12151+ ?: (itype-has-tag typ.u.ask) ~

12152+ =/ private=(list iwidth-dependency)

12153+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

12154+ ?. ?=([* ~] private) ~

12155+ ?~ source.i.private ~

12156+ =/ path=(unit ischeme) (find-jibb-mold %path public)

12157+ ?~ path ~

12158+ ?^ vars.u.path ~

12159+ =/ path-type=itype [%collection %list ~[[%atom %ta]]]

12160+ ?. =(typ.u.path path-type) ~

12161+ =/ unit-template=(unit ischeme) (find-jibb-mold %unit public)

12162+ ?~ unit-template ~

12163+ ?. (standard-unit-template u.unit-template /lib/jibb/prelude/jibb) ~

12164+ =/ state-unit=(unit itype) (template-apply u.unit-template ~[[%noun ~]])

12165+ ?~ state-unit ~

12166+ =/ path-unit=(unit itype) (template-apply u.unit-template ~[path-type])

12167+ ?~ path-unit ~

12168+ =/ output=itype [%cell [%face %state [%noun ~]] [%face %message [%var m]]]

12169+ =/ agent-input=itype [%cell [%face %mark [%atom %tas]] [%cell [%face %state u.state-unit] [%face %fact [%noun ~]]]]

12170+ =/ store-input=itype [%cell [%face %state u.state-unit] [%face %fact [%noun ~]]]

12171+ =/ pure-case=itype [%cell [%const [%term %tas %pure '%pure']] [%face %value [%var m]]]

12172+ =/ agent-case=itype

12173+ [%cell [%const [%term %tas %agent '%agent']] [%cell [%face %api [%atom %t]] [%cell [%face %case [%atom %tas]] [%cell [%face %agent [%atom %tas]] [%cell [%face %path path-type] [%cell [%face %scry u.path-unit] [%face %receive [%fn agent-input output]]]]]]]]

12174+ =/ store-case=itype

12175+ [%cell [%const [%term %tas %store '%store']] [%cell [%face %module [%atom %t]] [%cell [%face %name [%atom %tas]] [%face %receive [%fn store-input output]]]]]

12176+ ?. =(cases.typ.u.ask ~[pure-case agent-case store-case]) ~

12177+ ask

12178+::

12179+:: The first supported standalone API has exactly one mark import and one

12180+:: plain path declaration, with no other definitions or imports. No partial

12181+:: success is published when source, schema, or a required mold is unknown.

12182+++ one-request-interface-source

12183+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

12184+ ^- (each ione-request-interface @t)

12185+ =/ out (api-support-analysis-source file src externals marks modules prepared)

12186+ ?: ?=(%| -.out) [%| p.out]

12187+ =/ support=iapi-support-evidence p.out

12188+ =/ ev=iapi-path-evidence paths.support

12189+ =/ parsed (parse file src)

12190+ ?: ?=(%| -.parsed) [%| 'request source does not parse']

12191+ =/ mod=module p.parsed

12192+ ?. ?=(?([[%mark *] ~] [[%mark *] [%mark *] ~]) imports.mod) [%| 'request imports need unsupported inference']

12193+ ?. ?=([[%mold *] ~] defs.mod) [%| 'request definitions need unsupported inference']

12194+ ?. =(%paths name.i.defs.mod) [%| 'request declaration needs unsupported inference']

12195+ ?. ?=([* ~] paths.ev) [%| 'request count needs unsupported inference']

12196+ =/ p=iapi-path-typed i.paths.ev

12197+ =/ parts=(unit iapi-request-parts) (api-request-parts `ev name.path.p)

12198+ ?~ parts [%| 'request components need unsupported inference']

12199+ ?. ?=(?(~ [* ~]) parameters.u.parts) [%| 'request parameters need unsupported inference']

12200+ ?: &(?=(^ fold.u.parts) ?=(^ parameters.u.parts)) [%| 'request parameter and fold need unsupported inference']

12201+ ?^ scry.path.p [%| 'request scry needs unsupported inference']

12202+ =/ valid-marks=?

12203+ ?~ fold.u.parts ?=([* ~] marks.support)

12204+ ?=([* [* ~]] marks.support)

12205+ ?. valid-marks [%| 'request marks need unsupported inference']

12206+ =/ fold-open=?

12207+ ?~ fold.u.parts |

12208+ |(?=(^ (itype-vars u.fold.u.parts)) (itype-has-tag u.fold.u.parts))

12209+ ?: fold-open [%| 'request fold needs unsupported inference']

12210+ ?^ (itype-vars reply-sample.u.parts) [%| 'request payload needs unsupported inference']

12211+ ?: (itype-has-tag reply-sample.u.parts) [%| 'request payload needs unsupported inference']

12212+ =/ ask=(unit ischeme) (request-compatible-ask prepared.ev)

12213+ ?~ ask [%| 'request ask needs unsupported inference']

12214+ =/ result=(unit itype) (template-apply u.ask ~[[%var 0]])

12215+ ?~ result [%| 'request ask needs unsupported inference']

12216+ =/ callback=itype [%fn reply-sample.u.parts [%var 0]]

12217+ =/ sample=itype

12218+ ?^ fold.u.parts [%cell callback u.fold.u.parts]

12219+ ?~ parameters.u.parts callback

12220+ [%cell typ.i.parameters.u.parts callback]

12221+ =/ scheme=ischeme [[%fn sample u.result] ~[0]]

12222+ =/ exports=imold-types

12223+ (turn marks.support |=(m=iapi-mark-type [name.m [typ.m ~]]))

12224+ =/ prelude=iprelude prepared.ev

12225+ =/ public=ifile iface.prelude

12226+ ?~ source.public [%| 'request prelude source needs unsupported inference']

12227+ =/ private=(list iwidth-dependency)

12228+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

12229+ ?. ?=([* ~] private) [%| 'request internal source needs unsupported inference']

12230+ ?~ source.i.private [%| 'request internal source needs unsupported inference']

12231+ =/ req=irequest-evidence

12232+ [file name.path.p p src u.source.public u.source.i.private values.prelude molds.prelude externals marks]

12233+ =/ interface=ifile [~[[name.path.p scheme]] exports file ~ ~ ~ `src `[(silt `(list path)`~[file]) ~[req] modules `public values.prelude molds.prelude externals marks]]

12234+ [%& [support u.parts interface]]

12235+:: Graph-aware request artifact; resolver use remains type-only.

12236+++ one-request-interface-graph

12237+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

12238+ ^- (each ione-request-interface @t)

12239+ =/ out (api-support-analysis-graph file src externals marks modules active cache prepared)

12240+ ?: ?=(%| -.out) [%| p.out]

12241+ =/ support=iapi-support-evidence p.out

12242+ =/ ev=iapi-path-evidence paths.support

12243+ =/ parsed (parse file src)

12244+ ?: ?=(%| -.parsed) [%| 'request source does not parse']

12245+ =/ mod=module p.parsed

12246+ ?. ?=(?([[%mark *] ~] [[%mark *] [%mark *] ~]) imports.mod) [%| 'request imports need unsupported inference']

12247+ ?. ?=([[%mold *] ~] defs.mod) [%| 'request definitions need unsupported inference']

12248+ ?. =(%paths name.i.defs.mod) [%| 'request declaration needs unsupported inference']

12249+ ?. ?=([* ~] paths.ev) [%| 'request count needs unsupported inference']

12250+ =/ p=iapi-path-typed i.paths.ev

12251+ =/ parts=(unit iapi-request-parts) (api-request-parts `ev name.path.p)

12252+ ?~ parts [%| 'request components need unsupported inference']

12253+ ?. ?=(?(~ [* ~]) parameters.u.parts) [%| 'request parameters need unsupported inference']

12254+ ?: &(?=(^ fold.u.parts) ?=(^ parameters.u.parts)) [%| 'request parameter and fold need unsupported inference']

12255+ ?^ scry.path.p [%| 'request scry needs unsupported inference']

12256+ =/ valid-marks=?

12257+ ?~ fold.u.parts ?=([* ~] marks.support)

12258+ ?=([* [* ~]] marks.support)

12259+ ?. valid-marks [%| 'request marks need unsupported inference']

12260+ =/ fold-open=?

12261+ ?~ fold.u.parts |

12262+ |(?=(^ (itype-vars u.fold.u.parts)) (itype-has-tag u.fold.u.parts))

12263+ ?: fold-open [%| 'request fold needs unsupported inference']

12264+ ?^ (itype-vars reply-sample.u.parts) [%| 'request payload needs unsupported inference']

12265+ ?: (itype-has-tag reply-sample.u.parts) [%| 'request payload needs unsupported inference']

12266+ =/ ask=(unit ischeme) (request-compatible-ask prepared.ev)

12267+ ?~ ask [%| 'request ask needs unsupported inference']

12268+ =/ result=(unit itype) (template-apply u.ask ~[[%var 0]])

12269+ ?~ result [%| 'request ask needs unsupported inference']

12270+ =/ callback=itype [%fn reply-sample.u.parts [%var 0]]

12271+ =/ sample=itype

12272+ ?^ fold.u.parts [%cell callback u.fold.u.parts]

12273+ ?~ parameters.u.parts callback

12274+ [%cell typ.i.parameters.u.parts callback]

12275+ =/ scheme=ischeme [[%fn sample u.result] ~[0]]

12276+ =/ exports=imold-types

12277+ (turn marks.support |=(m=iapi-mark-type [name.m [typ.m ~]]))

12278+ =/ prelude=iprelude prepared.ev

12279+ =/ public=ifile iface.prelude

12280+ ?~ source.public [%| 'request prelude source needs unsupported inference']

12281+ =/ private=(list iwidth-dependency)

12282+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

12283+ ?. ?=([* ~] private) [%| 'request internal source needs unsupported inference']

12284+ ?~ source.i.private [%| 'request internal source needs unsupported inference']

12285+ =/ req=irequest-evidence

12286+ [file name.path.p p src u.source.public u.source.i.private values.prelude molds.prelude externals marks]

12287+ =/ interface=ifile [~[[name.path.p scheme]] exports file ~ ~ ~ `src `[(silt `(list path)`~[file]) ~[req] modules `public values.prelude molds.prelude externals marks]]

12288+ [%& [support u.parts interface]]

12289+::

12290+++ api-mark-exports

12291+ |= [marks=(list term) all=(list term) externals=imark-externals]

12292+ ^- imold-types

12293+ ?~ marks ~

12294+ =/ t=(unit itype) (find-imported-mark i.marks externals all)

12295+ ?~ t $(marks t.marks)

12296+ [[i.marks [u.t ~]] $(marks t.marks)]

12297+::

12298+:: Experimental direct poke-only API. Unsupported API declarations fail

12299+:: as a whole; supplied mark reader results retain their existing boundary.

12300+++ api-poke-interface

12301+ |= [at=path mod=module mark-externals=imark-externals prelude-values=(list term) prelude-molds=(list term) prelude=(unit ifile)]

12302+ ^- (unit ifile)

12303+ ?: (lien defs.mod def-has-hole) ~

12304+ ?. ?=([%ui %api @ %jibb ~] at) ~

12305+ ?^ (duplicate-defs defs.mod) ~

12306+ ?~ prelude ~

12307+ ?. =(at.u.prelude /lib/jibb/prelude/jibb) ~

12308+ =/ poke=(unit ischeme) (find-jibb-mold %poke u.prelude)

12309+ ?~ poke ~

12310+ ?. ?=(%union -.typ.u.poke) ~

12311+ ?^ vars.u.poke ~

12312+ =/ compatible=?

12313+ %+ lien cases.typ.u.poke

12314+ |= c=itype

12315+ ?=([%cell [%const [%term %tas %agent *]] [%cell [%face %agent [%atom %tas]] [%cell [%face %mark [%atom %tas]] [%face %payload [%noun ~]]]]] c)

12316+ ?. compatible ~

12317+ ?. (module-scope-valid mod(defs ~) prelude-values prelude-molds) ~

12318+ ?. (levy imports.mod |=(i=import ?=(%mark -.i))) ~

12319+ =/ marks=(list term) (collect-mark-imports imports.mod)

12320+ ?. ?=([@ ~] marks) ~

12321+ =/ ds=(list def) defs.mod

12322+ ?. ?=([[%mold *] ~] ds) ~

12323+ ?. =(%poke name.i.ds) ~

12324+ =/ sh=shape shape.i.ds

12325+ ?. ?=([%ref *] sh) ~

12326+ ?. ?=([@ ~] names.sh) ~

12327+ =/ n=term i.names.sh

12328+ ?. (unique-value-name n marks) ~

12329+ ?: |((lien prelude-values |=(x=term =(n x))) (lien prelude-molds |=(x=term =(n x)))) ~

12330+ =/ mark=(unit itype) (find-imported-mark n mark-externals marks)

12331+ ?~ mark ~

12332+ =/ sc=ischeme [[%fn u.mark typ.u.poke] ~]

12333+ `[~[[n sc]] (api-mark-exports marks marks mark-externals) at ~[[n i.t.t.at n]] ~ ~ ~ ~]

12334+::

12335+:: Source-proven ordinary helpers validate each selected /sur dependency.

12336+:: Unused or less direct cores remain unsupported by this first interface.

12337+++ api-sur-covered

12338+ |= [surs=(list term) defs=(list def) externals=iexternals all=(list term)]

12339+ ^- ?

12340+ ?~ surs &

12341+ =/ found=(list def)

12342+ %+ skim defs

12343+ |= d=def

12344+ ?. ?=(%mold -.d) |

12345+ ?. ?=(%ref -.shape.d) |

12346+ ?. ?=([@ [@ ~]] names.shape.d) |

12347+ =(i.t.names.shape.d i.surs)

12348+ ?~ found |

12349+ =/ selected=def i.found

12350+ ?. ?=(%mold -.selected) |

12351+ =/ sh=shape shape.selected

12352+ ?. ?=(%ref -.sh) |

12353+ ?. ?=([@ [@ ~]] names.sh) |

12354+ =/ checked=(unit itype) (find-imported-mold i.surs i.names.sh externals all)

12355+ ?~ checked |

12356+ $(surs t.surs)

12357+::

12358++$ imulti-request-gates [values=ienv requests=(list irequest-evidence)]

12359+++ api-request-gates

12360+ |= [paths=(list iapi-path-typed) ev=iapi-path-evidence ask=ischeme file=path src=@t public=@t internal=@t externals=iexternals marks=imark-externals fuel=@ud]

12361+ ^- (unit imulti-request-gates)

12362+ ?~ paths `[~ ~]

12363+ ?: =(0 fuel) ~

12364+ =/ p=iapi-path-typed i.paths

12365+ =/ parts=(unit iapi-request-parts) (api-request-parts `ev name.path.p)

12366+ ?~ parts ~

12367+ ?. ?=(?(~ [* ~]) parameters.u.parts) ~

12368+ ?: &(?=(^ fold.u.parts) ?=(^ parameters.u.parts)) ~

12369+ ?^ scry.path.p ~

12370+ ?^ (itype-vars reply-sample.u.parts) ~

12371+ ?: (itype-has-tag reply-sample.u.parts) ~

12372+ =/ open-fold=?

12373+ ?~ fold.u.parts |

12374+ |(?=(^ (itype-vars u.fold.u.parts)) (itype-has-tag u.fold.u.parts))

12375+ ?: open-fold ~

12376+ =/ result=(unit itype) (template-apply ask ~[[%var 0]])

12377+ ?~ result ~

12378+ =/ callback=itype [%fn reply-sample.u.parts [%var 0]]

12379+ =/ sample=itype

12380+ ?^ fold.u.parts [%cell callback u.fold.u.parts]

12381+ ?~ parameters.u.parts callback

12382+ [%cell typ.i.parameters.u.parts callback]

12383+ =/ scheme=ischeme [[%fn sample u.result] ~[0]]

12384+ =/ prep=iprelude prepared.ev

12385+ =/ req=irequest-evidence

12386+ [file name.path.p p src public internal values.prep molds.prep externals marks]

12387+ =/ rest=(unit imulti-request-gates)

12388+ $(paths t.paths, fuel (dec fuel))

12389+ ?~ rest ~

12390+ `[[[name.path.p scheme] values.u.rest] [req requests.u.rest]]

12391+::

12392+++ api-poke-from-checked

12393+ |= [file=path mod=module marks=imark-externals values=(list term) molds=(list term) prelude=(unit ifile)]

12394+ ^- (unit [values=ienv derived=(list iderived)])

12395+ =/ pokes=(list def)

12396+ (skim defs.mod |=(d=def &(?=(%mold -.d) =(%poke name.d))))

12397+ ?~ pokes `[~ ~]

12398+ ?. ?=([* ~] pokes) ~

12399+ =/ declared=(list term) (collect-mark-imports imports.mod)

12400+ =/ ns=(unit (list term)) (api-poke-mark-names pokes declared)

12401+ ?~ ns ~

12402+ ?. ?=([@ ~] u.ns) ~

12403+ =/ matching=(list import)

12404+ %+ skim imports.mod

12405+ |= i=import

12406+ ?. ?=(%mark -.i) |

12407+ =(mark.i i.u.ns)

12408+ ?. ?=([* ~] matching) ~

12409+ =/ checked=(unit ifile)

12410+ (api-poke-interface file mod(defs pokes, imports matching) marks values molds prelude)

12411+ ?~ checked ~

12412+ `[values.u.checked derived.u.checked]

12413+::

12414+:: The partial interface is published atomically: all paths, ordinary

12415+:: source definitions, declared marks and the poke must check. Unselected

12416+:: /sur bindings, runtime validation and value watchability remain unproved.

12417+++ multi-request-interface-graph

12418+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

12419+ ^- (each [iface=ifile cache=jcache] @t)

12420+ =/ out (api-support-analysis-graph file src externals marks modules active cache prepared)

12421+ ?: ?=(%| -.out) [%| p.out]

12422+ =/ support=iapi-support-evidence p.out

12423+ =/ ev=iapi-path-evidence paths.support

12424+ =/ parsed (parse file src)

12425+ ?: ?=(%| -.parsed) [%| 'request source does not parse']

12426+ =/ mod=module p.parsed

12427+ ?. (levy imports.mod |=(i=import ?=(?(%mark %sur) -.i)))

12428+ [%| 'request imports need unsupported inference']

12429+ =/ surs=(list term) (collect-sur-imports imports.mod)

12430+ ?. (api-sur-covered surs defs.mod externals surs)

12431+ [%| 'API source dependency needs unsupported inference']

12432+ ?~ paths.ev [%| 'request count needs unsupported inference']

12433+ =/ ask=(unit ischeme) (request-compatible-ask prepared.ev)

12434+ ?~ ask [%| 'request ask needs unsupported inference']

12435+ =/ prep=iprelude prepared.ev

12436+ =/ public=ifile iface.prep

12437+ ?~ source.public [%| 'request prelude source needs unsupported inference']

12438+ =/ private=(list iwidth-dependency)

12439+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

12440+ ?. ?=([* ~] private) [%| 'request internal source needs unsupported inference']

12441+ ?~ source.i.private [%| 'request internal source needs unsupported inference']

12442+ =/ gates=(unit imulti-request-gates)

12443+ (api-request-gates paths.ev ev u.ask file src u.source.public u.source.i.private externals marks 256)

12444+ ?~ gates [%| 'request paths need unsupported inference']

12445+ =/ poke=(unit [values=ienv derived=(list iderived)])

12446+ (api-poke-from-checked file mod marks values.prep molds.prep `public)

12447+ ?~ poke [%| 'API poke needs unsupported inference']

12448+ =/ mark-molds=imold-types

12449+ (turn marks.support |=(m=iapi-mark-type [name.m [typ.m ~]]))

12450+ =/ exports=imold-types (weld mark-molds molds.support)

12451+ =/ names=(list term) (turn exports |=(m=[name=term template=ischeme] name.m))

12452+ ?. (levy names |=(n=term (unique-value-name n names)))

12453+ [%| 'API exported molds need unsupported inference']

12454+ =/ env=ienv (weld values.u.gates (weld values.u.poke values.support))

12455+ =/ graph=irequest-graph

12456+ [(silt `(list path)`~[file]) requests.u.gates modules `public values.prep molds.prep externals marks]

12457+ =/ iface=ifile

12458+ [env exports file derived.u.poke elaborations.support ~ `src `graph]

12459+ [%& [iface dependencies.ev]]

12460+::

12461+:: A checked program main is only the direct four-component source call.

12462+:: Grouping is transparent, but aliases, qualified wings and other module

12463+:: kinds remain outside this slice.

12464+++ program-main-def

12465+ |= ds=(list def)

12466+ ^- (unit def)

12467+ ?~ ds ~

12468+ ?: &(?=(%value -.i.ds) =(%main name.i.ds)) `i.ds

12469+ $(ds t.ds)

12470+::

12471+++ program-main-wing

12472+ |= e=expr

12473+ ^- (unit term)

12474+ ?: ?=(%group -.e) $(e inner.e)

12475+ ?. ?=(%wing -.e) ~

12476+ ?. ?=([@ ~] names.e) ~

12477+ `i.names.e

12478+::

12479+++ program-main-args

12480+ |= d=def

12481+ ^- (unit (list expr))

12482+ ?. ?=(%value -.d) ~

12483+ |-

12484+ ?: ?=(%group -.val.d) $(val.d inner.val.d)

12485+ ?. ?=(%call -.val.d) ~

12486+ =/ head=(unit term) (program-main-wing head.val.d)

12487+ ?~ head ~

12488+ ?. =(%program u.head) ~

12489+ ?. ?=([* * * * ~] args.val.d) ~

12490+ `args.val.d

12491+::

12492+++ program-main-parts

12493+ |= d=def

12494+ ^- (unit [init=term update=term view=term subs=term])

12495+ ?. ?=(%value -.d) ~

12496+ |-

12497+ ?: ?=(%group -.val.d) $(val.d inner.val.d)

12498+ ?. ?=(%call -.val.d) ~

12499+ =/ head=(unit term) (program-main-wing head.val.d)

12500+ ?~ head ~

12501+ ?. =(%program u.head) ~

12502+ ?. ?=([* * * * ~] args.val.d) ~

12503+ =/ args=(list expr) args.val.d

12504+ ?> ?=([* * * * ~] args)

12505+ =/ init=(unit term) (program-main-wing i.args)

12506+ =/ update=(unit term) (program-main-wing i.t.args)

12507+ =/ view=(unit term) (program-main-wing i.t.t.args)

12508+ =/ subs=(unit term) (program-main-wing i.t.t.t.args)

12509+ ?~ init ~

12510+ ?~ update ~

12511+ ?~ view ~

12512+ ?~ subs ~

12513+ `[u.init u.update u.view u.subs]

12514+::

12515+++ program-empty-null

12516+ |= e=expr

12517+ ^- ?

12518+ ?- -.e

12519+ %lit =(%null form.lit.e)

12520+ %cast $(e val.e)

12521+ %group $(e inner.e)

12522+ %body ?~(defs.e $(e final.e) |)

12523+ * |

12524+ ==

12525+::

12526+++ program-subs-empty

12527+ |= d=def

12528+ ^- ?

12529+ ?. ?=(%value -.d) |

12530+ ?- -.val.d

12531+ %gate (program-empty-null body.val.d)

12532+ %gate-wide (program-empty-null body.val.d)

12533+ * |

12534+ ==

12535+::

12536+++ program-transparent

12537+ |= e=expr

12538+ ^- expr

12539+ ?- -.e

12540+ %group $(e inner.e)

12541+ %cast $(e val.e)

12542+ %body ?~(defs.e $(e final.e) e)

12543+ * e

12544+ ==

12545+++ program-init-tuple-null

12546+ |= d=def

12547+ ^- ?

12548+ ?. ?=(%value -.d) |

12549+ ?. |(?=(%gate -.val.d) ?=(%gate-wide -.val.d)) |

12550+ =/ body=expr

12551+ ?- -.val.d

12552+ %gate body.val.d

12553+ %gate-wide body.val.d

12554+ * !!

12555+ ==

12556+ =. body (program-transparent body)

12557+ ?. ?=(%tuple -.body) |

12558+ ?~ items.body |

12559+ (program-empty-null val:(rear items.body))

12560+::

12561+:: Recover only the initializer of an already recognized direct program main.

12562+:: The derived call is evidence for an ordinary init/main retry, never an

12563+:: interface to publish on its own. Any failure returns the original resolution.

12564+++ program-init-context

12565+ |= [main=def parts=[init=term update=term view=term subs=term] ds=(list def) resolution=iresolved initial=istate]

12566+ ^- (unit iresolved)

12567+ =/ env=ienv env.resolution

12568+ ?^ (ienv-lookup %main env) ~

12569+ ?^ (ienv-lookup init.parts env) ~

12570+ =/ update=(unit ischeme) (ienv-lookup update.parts env)

12571+ =/ view=(unit ischeme) (ienv-lookup view.parts env)

12572+ =/ subs=(unit ischeme) (ienv-lookup subs.parts env)

12573+ ?~ update ~

12574+ ?~ view ~

12575+ ?~ subs ~

12576+ =/ inits=(list def)

12577+ (skim ds |=(d=def &(?=(%value -.d) =(init.parts name.d))))

12578+ ?. ?=([* ~] inits) ~

12579+ =/ init-def=def i.inits

12580+ ?> ?=(%value -.init-def)

12581+ ?. (program-init-tuple-null init-def) ~

12582+ =/ args=(unit (list expr)) (program-main-args main)

12583+ ?~ args ~

12584+ ?~ prelude.initial ~

12585+ =/ program=(unit ischeme) (ienv-lookup %program values.u.prelude.initial)

12586+ ?~ program ~

12587+ =/ heads=(unit igate-prelude-evidence) (direct-prelude-evidence ds prelude.initial)

12588+ ?~ heads ~

12589+ =/ written=(unit def) (~(get by gates.u.heads) %program)

12590+ ?~ written ~

12591+ =/ written-sample=(unit sample) (direct-gate-sample u.written)

12592+ ?~ written-sample ~

12593+ ?. ?=(%cell -.u.written-sample) ~

12594+ ?~ items.u.written-sample ~

12595+ =/ checked=(map term def) (direct-checked-gates ds env)

12596+ =/ templates=ienv

12597+ (turn molds.u.prelude.initial |=(x=[name=term template=ischeme] [name.x template.x]))

12598+ =/ scanned=(unit dgscan)

12599+ (dg-all-env-ids (weld env (weld values.u.prelude.initial templates)) 32.768 ~)

12600+ ?~ scanned ~

12601+ =. next.initial (dg-next-id ids.u.scanned 0)

12602+ =/ instance=[typ=itype state=istate] (instantiate-scheme u.program initial)

12603+ ?. ?=(%fn -.typ.instance) ~

12604+ ?. ?=(%cell -.sample.typ.instance) ~

12605+ =/ expected-init=(unit itype)

12606+ (direct-slot-body hed.sample.typ.instance (direct-sample-name i.items.u.written-sample))

12607+ ?~ expected-init ~

12608+ ?. ?=(%fn -.u.expected-init) ~

12609+ ?. ?=(%var -.sample.u.expected-init) ~

12610+ =/ data=@ud id.sample.u.expected-init

12611+ =/ init-var=itype [%var next.state.instance]

12612+ =/ st=istate state.instance(next +(next.state.instance))

12613+ =/ up=[typ=itype state=istate] (instantiate-scheme u.update st)

12614+ =/ vw=[typ=itype state=istate] (instantiate-scheme u.view state.up)

12615+ =/ sb=[typ=itype state=istate] (instantiate-scheme u.subs state.vw)

12616+ =. st state.sb(gate-defs checked, head-evidence heads)

12617+ =/ actual=itype [%cell init-var [%cell typ.up [%cell typ.vw typ.sb]]]

12618+ =/ fit=ifit

12619+ (direct-positional-fit u.args items.u.written-sample actual sample.typ.instance env st sub.st next.st)

12620+ ?. ?=(%ok -.fit) ~

12621+ =/ actual-final=itype (itype-normalize actual sub.fit)

12622+ =/ expected-final=itype (itype-normalize sample.typ.instance sub.fit)

12623+ =/ open=(list @ud)

12624+ (unique-type-vars (weld (itype-vars actual-final) (itype-vars expected-final)))

12625+ ?. (levy open |=(n=@ud =(data n))) ~

12626+ ?: |((itype-has-tag actual-final) (itype-has-tag expected-final)) ~

12627+ =/ replay=ifit

12628+ (direct-positional-fit u.args items.u.written-sample actual sample.typ.instance env st sub.fit next.fit)

12629+ ?. ?=(%ok -.replay) ~

12630+ ?. &(=(sub.fit sub.replay) =(next.fit next.replay)) ~

12631+ =/ expected=itype (itype-normalize u.expected-init sub.fit)

12632+ ?. ?=(%fn -.expected) ~

12633+ =. st st(sub sub.fit, next next.fit)

12634+ =/ init-state=istate (reserve-def-caps val.init-def st)

12635+ =/ inferred=iresult (infer-fragment val.init-def env init-state)

12636+ =? inferred ?=(%| -.inferred) (infer-recursive-gate init-def env init-state)

12637+ ?: ?=(%| -.inferred) ~

12638+ ?. ?=(%fn -.typ.p.inferred) ~

12639+ =/ data-fit=ifit

12640+ (itype-fit sample.typ.p.inferred sample.expected sub.state.p.inferred next.state.p.inferred)

12641+ ?. ?=(%ok -.data-fit) ~

12642+ =/ closed=itype (itype-normalize expected sub.data-fit)

12643+ ?. ?=(%fn -.closed) ~

12644+ :: Resolve the ordinary tuple cast first, then check the complete gate.

12645+ :: General function fit remains unchanged; only this recovered candidate

12646+ :: receives the derived result context before its whole-type cast fit.

12647+ =/ product-fit=ifit

12648+ (itype-fit product.typ.p.inferred product.closed sub.data-fit next.data-fit)

12649+ ?. ?=(%ok -.product-fit) ~

12650+ =/ product=itype

12651+ (itype-merge-faces product.typ.p.inferred product.closed sub.product-fit)

12652+ =/ actual-cast=itype [%fn sample.typ.p.inferred product]

12653+ =/ cast=ifit

12654+ (itype-fit actual-cast closed sub.product-fit next.product-fit)

12655+ ?. ?=(%ok -.cast) ~

12656+ =/ merged=itype (itype-merge-faces actual-cast closed sub.cast)

12657+ =/ adjusted=iresult

12658+ [%& merged state.p.inferred(sub sub.cast, next next.cast)]

12659+ =/ added=(unit iadded-definition)

12660+ (add-supported-result init-def adjusted init-state env checked artifacts.resolution)

12661+ ?~ added ~

12662+ =/ recovered=(unit ischeme) (ienv-lookup init.parts env.u.added)

12663+ ?~ recovered ~

12664+ ?. ?=(~ vars.u.recovered) ~

12665+ ?. ?=(~ (itype-vars typ.u.recovered)) ~

12666+ =/ completed=[env=ienv artifacts=(list iwidth-definition)]

12667+ (add-supported-defs-core ~[main] ds checked.u.added heads env.u.added molds.initial globals.initial externals.initial surs.initial mark-externals.initial marks.initial jimports.initial reserved-molds.initial at.initial prelude.initial artifacts.u.added grec-index.initial)

12668+ ?~ (ienv-lookup %main env.completed) ~

12669+ `[env.completed grouped.resolution artifacts.completed]

12670+::

12671+++ program-subs-watch

12672+ |= [d=def imports=ijimports graph=irequest-graph prelude=ifile]

12673+ ^- ?

12674+ ?. ?=(%value -.d) |

12675+ ?. |(?=(%gate -.val.d) ?=(%gate-wide -.val.d)) |

12676+ =/ body=expr

12677+ ?- -.val.d

12678+ %gate body.val.d

12679+ %gate-wide body.val.d

12680+ * val.d

12681+ ==

12682+ =. body (program-transparent body)

12683+ ?. ?=(%list -.body) |

12684+ ?. ?=([* ~] items.body) |

12685+ =/ watch=expr (program-transparent i.items.body)

12686+ ?. ?=(%tuple -.watch) |

12687+ ?. ?=([* * ~] items.watch) |

12688+ =/ tag=item i.items.watch

12689+ =/ payload=item i.t.items.watch

12690+ ?. &(?=(~ face.tag) ?=(~ face.payload)) |

12691+ =/ tag-expr=expr (program-transparent val.tag)

12692+ ?. ?=(%lit -.tag-expr) |

12693+ ?. &(?=(%term form.lit.tag-expr) =(%watch val.lit.tag-expr)) |

12694+ =/ request=expr (program-transparent val.payload)

12695+ ?. ?=(%call -.request) |

12696+ ?. ?=([* ~] args.request) |

12697+ =/ head=expr (program-transparent head.request)

12698+ ?. ?=(%wing -.head) |

12699+ ?. ?=([@ @ ~] names.head) |

12700+ =/ case=term i.names.head

12701+ =/ face=term i.t.names.head

12702+ =/ callback=expr (program-transparent i.args.request)

12703+ ?. ?=(%ctor -.callback) |

12704+ ?. ?=(%term form.tag.callback) |

12705+ =/ selected=(list [face=term interface=ifile])

12706+ (skim imports |=(j=[face=term interface=ifile] =(face face.j)))

12707+ ?. ?=([* ~] selected) |

12708+ =/ iface=ifile interface.i.selected

12709+ =/ member=(unit ischeme) (ienv-lookup case values.iface)

12710+ ?~ member |

12711+ ?~ source.iface |

12712+ =/ evidence=(list irequest-evidence)

12713+ (skim requests.graph |=(r=irequest-evidence &(=(api-at.r at.iface) =(name.r case))))

12714+ ?. ?=([* ~] evidence) |

12715+ =/ request-evidence=irequest-evidence i.evidence

12716+ ?. =(u.source.iface api-source.request-evidence) |

12717+ ?. =(name.path.path.request-evidence case) |

12718+ ?~ graph.iface |

12719+ ?. (lien requests.u.graph.iface |=(r=irequest-evidence =(r request-evidence))) |

12720+ ?. ?=(~ scry.path.path.request-evidence) |

12721+ ?. &(?=(~ diffs.path.request-evidence) ?=(~ diffs.path.path.request-evidence)) |

12722+ ?: (lien segments.path.path.request-evidence |=(p=pseg !?=(%knot -.p))) |

12723+ ?. ?=([@ ~] vars.u.member) |

12724+ =/ message=@ud i.vars.u.member

12725+ ?. ?=(%fn -.typ.u.member) |

12726+ ?. ?=(%fn -.sample.typ.u.member) |

12727+ ?. =(sample.sample.typ.u.member full.path.request-evidence) |

12728+ ?. =(product.sample.typ.u.member [%var message]) |

12729+ =/ prep=iprelude [prelude prelude-values.graph prelude-molds.graph]

12730+ =/ ask=(unit ischeme) (request-compatible-ask prep)

12731+ ?~ ask |

12732+ =/ result=(unit itype) (template-apply u.ask ~[[%var message]])

12733+ ?~ result |

12734+ =(product.typ.u.member u.result)

12735+::

12736+++ program-main-closed

12737+ |= [parts=[init=term update=term view=term subs=term] ds=(list def) env=ienv prelude=(unit ifile) imports=ijimports graph=irequest-graph]

12738+ ^- ?

12739+ ?~ prelude |

12740+ ?~ (ienv-lookup %program values.u.prelude) |

12741+ =/ program=(unit ischeme) (find-jibb-mold %program u.prelude)

12742+ ?~ program |

12743+ =/ main=(unit ischeme) (ienv-lookup %main env)

12744+ ?~ main |

12745+ ?. ?=(~ vars.u.main) |

12746+ ?. ?=(~ (itype-vars typ.u.main)) |

12747+ =/ instance=[typ=itype state=istate] (instantiate-scheme u.program *istate)

12748+ =/ main-fit=ifit (direct-invariant typ.u.main typ.instance ~ next.state.instance)

12749+ ?. ?=(%ok -.main-fit) |

12750+ =/ init=(unit ischeme) (ienv-lookup init.parts env)

12751+ ?~ init |

12752+ ?. ?=(~ vars.u.init) |

12753+ ?. ?=(%fn -.typ.u.init) |

12754+ ?. ?=(~ (itype-vars sample.typ.u.init)) |

12755+ ?. ?=(~ (itype-vars product.typ.u.init)) |

12756+ =/ data=igate-free (gate-free-type sample.typ.u.init 256 ~)

12757+ ?. =(%yes verdict.data) |

12758+ =/ model=igate-free (gate-free-type product.typ.u.init left.data ~)

12759+ ?. =(%yes verdict.model) |

12760+ =/ subs=(list def)

12761+ (skim ds |=(d=def &(?=(%value -.d) =(subs.parts name.d))))

12762+ ?. ?=([* ~] subs) |

12763+ |((program-subs-empty i.subs) (program-subs-watch i.subs imports graph u.prelude))

12764+::

12765+++ infer-jibb-file

12766+ |= [at=path src=@t externals=iexternals mark-externals=imark-externals modules=jbundle active=(list path) prelude-values=(list term) prelude-molds=(list term) cache=jcache prelude=(unit ifile)]

12767+ ^- jfile-result

12768+ =/ out=jfile-detailed-result

12769+ (infer-jibb-file-detailed at src externals mark-externals modules active prelude-values prelude-molds cache prelude)

12770+ ?: ?=(%| -.out) [%| message.p.out]

12771+ [%& p.out]

12772+:: Returns structured root-source overlap evidence after the same full check.

12773+++ infer-jibb-file-detailed

12774+ |= [at=path src=@t externals=iexternals mark-externals=imark-externals modules=jbundle active=(list path) prelude-values=(list term) prelude-molds=(list term) cache=jcache prelude=(unit ifile)]

12775+ ^- jfile-detailed-result

12776+ =/ parsed (parse at src)

12777+ ?: ?=(%| -.parsed) [%| [(crip "module source does not parse: {(spud at)}") ~]]

12778+ =/ mod=module p.parsed

12779+ =/ duplicate=(unit idiag) (duplicate-defs defs.mod)

12780+ ?^ duplicate [%| [(show-duplicate-fields at src u.duplicate) ~]]

12781+ ?: &(?=([%ui %api *] at) ?=(^ (program-main-def defs.mod)))

12782+ [%| [(crip "module kind needs unsupported inference: {(spud at)}") ~]]

12783+ ?: ?=([%ui %api *] at)

12784+ =/ iface=(unit ifile) (api-poke-interface at mod mark-externals prelude-values prelude-molds prelude)

12785+ ?^ iface

12786+ =/ checked=ifile u.iface(source `src, graph `[(silt `(list path)`~[at]) ~ modules prelude prelude-values prelude-molds externals mark-externals])

12787+ [%& [checked [[at checked] cache]]]

12788+ ?~ prelude [%| [(crip "API module needs unsupported inference: {(spud at)}") ~]]

12789+ =/ prepared=iprelude [u.prelude prelude-values prelude-molds]

12790+ =/ narrow=?

12791+ ?. ?=([[%mark *] ~] imports.mod) |

12792+ ?. ?=([[%mold *] ~] defs.mod) |

12793+ ?. =(%paths name.i.defs.mod) |

12794+ !?=(%union -.shape.i.defs.mod)

12795+ ?: narrow

12796+ =/ request=(each ione-request-interface @t)

12797+ (one-request-interface-graph at src externals mark-externals modules active cache `prepared)

12798+ ?: ?=(%| -.request) [%| [(crip "API module needs unsupported inference: {(spud at)}") ~]]

12799+ =/ checked=ifile iface.p.request

12800+ [%& [checked [[at checked] dependencies.paths.support.p.request]]]

12801+ =/ multi=(each [iface=ifile cache=jcache] @t)

12802+ (multi-request-interface-graph at src externals mark-externals modules active cache `prepared)

12803+ ?: ?=(%| -.multi) [%| [(crip "API module needs unsupported inference: {(spud at)}") ~]]

12804+ [%& [iface.p.multi [[at iface.p.multi] cache.p.multi]]]

12805+ ?. (module-scope-valid mod prelude-values prelude-molds)

12806+ ?: (pending-declared-poke at mod prelude-values prelude-molds)

12807+ [%| [(crip "module kind or scope needs unsupported inference: {(spud at)}") ~]]

12808+ [%| [(crip "module has conflicting names: {(spud at)}") ~]]

12809+ =/ vals=(list term) (global-value-names defs.mod)

12810+ =/ main=(unit def) (program-main-def defs.mod)

12811+ =/ main-parts=(unit [init=term update=term view=term subs=term])

12812+ ?~(main ~ (program-main-parts u.main))

12813+ ?. ?~(main & &(!?=([%ui %stores *] at) ?=(^ main-parts)))

12814+ [%| [(crip "module kind needs unsupported inference: {(spud at)}") ~]]

12815+ =/ js=jimports-detailed-result (resolve-jibb-imports-detailed imports.mod externals mark-externals modules active prelude-values prelude-molds cache prelude)

12816+ ?: ?=(%| -.js) [%| p.js]

12817+ =/ collected=grec-collected

12818+ ?^ imports.mod [(collect-simple-molds defs.mod) *(map term shape)]

12819+ (grec-collect-molds defs.mod)

12820+ =/ molds=imolds molds.collected

12821+ =/ globals=(list term) (weld prelude-values (weld (import-binding-names imports.mod) vals))

12822+ =/ surs=(list term) (collect-sur-imports imports.mod)

12823+ =/ marks=(list term) (collect-mark-imports imports.mod)

12824+ =/ reserved=(list term) (weld prelude-molds (turn resolved.p.js |=(j=[face=term interface=ifile] face.j)))

12825+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

12826+ =/ state=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks resolved.p.js reserved ~ ~ ~ | at top prelude ~ 256 ~ ~ ~ ~ ~ ~]

12827+ :: Source and scope were checked above; preserve that exact root and prelude.

12828+ :: This first integration only indexes import-free library sources.

12829+ =/ index=(unit [at=path source=@t prelude=ifile shapes=(map term shape)])

12830+ ?^ imports.mod ~

12831+ ?~ prelude ~

12832+ =/ standard=(unit ischeme) (find-jibb-mold %list u.prelude)

12833+ ?~ standard ~

12834+ ?. =(u.standard [[%collection %list ~[[%var 0]]] ~[0]]) ~

12835+ =/ index=(map term shape) proofs.collected

12836+ ?. !=(index *(map term shape)) ~

12837+ ?: (lien molds |=(m=[name=term body=shape] =(%list name.m))) ~

12838+ `[at src u.prelude index]

12839+ =. grec-index.state index

12840+ =/ mts=(each imold-types imold-failure) (module-mold-types-detail molds state)

12841+ ?: ?=(%| -.mts)

12842+ ?~ overlap.p.mts [%| [(crip "{(trip message.p.mts)}: {(spud at)}") ~]]

12843+ =/ witness=[name=term cases=upair] u.overlap.p.mts

12844+ =/ first=@t (show-error src [at line.beg.first.cases.witness col.beg.first.cases.witness "first union case"])

12845+ =/ second=@t (show-error src [at line.beg.second.cases.witness col.beg.second.cases.witness "overlapping case"])

12846+ =/ msg=@t (of-wain:format ~[(crip "module mold {(trip name.witness)} has overlapping cases") first second])

12847+ [%| [msg `[at src name.witness cases.witness]]]

12848+ =/ resolution=iresolved

12849+ ?~ index

12850+ (resolve-groups defs.mod molds globals externals surs mark-externals marks resolved.p.js reserved at prelude)

12851+ (resolve-groups-core defs.mod molds globals externals surs mark-externals marks resolved.p.js reserved at prelude index)

12852+ =/ env=ienv env.resolution

12853+ =/ recovered=(unit iresolved)

12854+ ?~ main ~

12855+ ?~ main-parts ~

12856+ (program-init-context u.main u.main-parts defs.mod resolution state)

12857+ =. env ?~(recovered env env.u.recovered)

12858+ =. artifacts.resolution

12859+ ?~(recovered artifacts.resolution artifacts.u.recovered)

12860+ =. env

12861+ ?: (module-values-complete defs.mod env) env

12862+ ?: |(?=([%ui %stores *] at) ?=(^ imports.mod) ?=(^ prelude) ?=(^ prelude-values) ?=(^ prelude-molds)) env

12863+ ?: (gth (met 3 src) 65.536) env

12864+ ?: (gth (lent defs.mod) 64) env

12865+ ?. (dg-source-candidate defs.mod 64) env

12866+ =/ transaction=(unit dgcommit) (dg-root-source at src)

12867+ ?~ transaction env

12868+ ?: (dg-interface-safe env.u.transaction) env.u.transaction

12869+ env

12870+ ?. (module-values-complete defs.mod env)

12871+ [%| [(crip "module definitions need unsupported inference: {(spud at)}") ~]]

12872+ =/ initial=irequest-graph [(silt `(list path)`~[at]) ~ modules prelude prelude-values prelude-molds externals mark-externals]

12873+ =/ graph=(unit irequest-graph) (request-graph-merge resolved.p.js initial (add 1 (lent resolved.p.js)))

12874+ ?~ graph [%| ['module request evidence needs unsupported inference' ~]]

12875+ ?. ?~(main & ?~(main-parts | (program-main-closed u.main-parts defs.mod env prelude resolved.p.js u.graph)))

12876+ [%| [(crip "module kind needs unsupported inference: {(spud at)}") ~]]

12877+ =/ iface=ifile [env p.mts at ~ artifacts.resolution ~ `src graph]

12878+ [%& [iface [[at iface] cache.p.js]]]

12879+::

12880+:: A source-bound analysis of one named mold, not a module, island,

12881+:: request, watchability or runtime check. The host owns the trusted

12882+:: prepared prelude, canonical paths and reader/source version identities.

12883+:: The 256-node cap covers only classification, not source/graph work.

12884++$ igate-free-mold

12885+ [at=path source=@t name=term prepared=iprelude externals=iexternals marks=imark-externals modules=jbundle dependencies=jcache mold=ischeme requested=@ud budget=@ud result=igate-free]

12886+++ gate-free-mold-source

12887+ |= [file=path src=@t name=term externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude) fuel=@ud]

12888+ ^- (each igate-free-mold @t)

12889+ ?~ file [%| 'mold analysis needs a path ending in jibb']

12890+ ?. =(%jibb (rear file)) [%| 'mold analysis needs a path ending in jibb']

12891+ ?: |(=(file /lib/jibb/internal/jibb) =(file /lib/jibb/primitives/jibb))

12892+ [%| 'the prelude internal modules are private']

12893+ ?: ?=([%ui %api *] file) [%| 'API declarations need unsupported mold analysis']

12894+ ?: ?=([%ui %stores *] file) [%| 'store declarations need unsupported mold analysis']

12895+ =/ entries=jbundle (skim modules |=(m=jsource =(file at.m)))

12896+ ?: (gth (lent entries) 1) [%| 'duplicate root module sources']

12897+ =/ wrong-root=? ?~(entries | !=(source.i.entries src))

12898+ ?: wrong-root [%| 'root module source does not match bundle']

12899+ =/ parsed (parse file src)

12900+ ?: ?=(%| -.parsed) [%| 'mold source does not parse']

12901+ =/ mod=module p.parsed

12902+ =/ duplicate=(unit idiag) (duplicate-defs defs.mod)

12903+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

12904+ ?~ prepared [%| 'mold analysis needs the prepared prelude']

12905+ ?. (module-scope-valid mod values.u.prepared molds.u.prepared)

12906+ [%| 'mold source has conflicting or unsupported scope']

12907+ =/ selected=(list def)

12908+ (skim defs.mod |=(d=def &(?=(%mold -.d) =(name.d name))))

12909+ ?~ selected [%| 'selected mold is not declared']

12910+ ?^ t.selected [%| 'selected mold is not unique']

12911+ ?> ?=(%mold -.i.selected)

12912+ =/ public=ifile iface.u.prepared

12913+ =/ js=jimports-result

12914+ (resolve-jibb-imports imports.mod externals marks modules ~[file] values.u.prepared molds.u.prepared ~ `public)

12915+ ?: ?=(%| -.js) [%| p.js]

12916+ =/ ms=imolds (collect-simple-molds defs.mod)

12917+ =/ vals=(list term) (global-value-names defs.mod)

12918+ =/ globals=(list term) (weld values.u.prepared (weld (import-binding-names imports.mod) vals))

12919+ =/ surs=(list term) (collect-sur-imports imports.mod)

12920+ =/ declared=(list term) (collect-mark-imports imports.mod)

12921+ =/ reserved=(list term) (weld molds.u.prepared (turn resolved.p.js |=(j=[face=term interface=ifile] face.j)))

12922+ =/ top=(list term) (turn ms |=(m=[name=term body=shape] name.m))

12923+ =/ state=istate [0 ~ ~ ~ ms globals externals surs marks declared resolved.p.js reserved ~ ~ ~ | file top `public ~ 256 ~ ~ ~ ~ ~ ~]

12924+ =/ inferred=(unit [template=ischeme state=istate])

12925+ (infer-mold-template shape.i.selected state(active ~[name], in-mold &))

12926+ ?~ inferred [%| 'selected mold needs unsupported inference']

12927+ =/ template=ischeme template.u.inferred

12928+ =. typ.template (label-direct-union typ.template shape.i.selected name state)

12929+ =. typ.template (itype-normalize typ.template sub.state.u.inferred)

12930+ =/ cap=@ud (min fuel 256)

12931+ =/ analysis=igate-free (gate-free-type typ.template cap ~)

12932+ [%& [file src name u.prepared externals marks modules cache.p.js template fuel cap analysis]]

12933+::

12934+:: +golden-types-with-modules fails closed for imports without prelude

12935+:: scope. +golden-types-with-prelude resolves supported library graphs;

12936+:: its report remains partial and unreachable sources are not examined.

12937+::

12938+++ golden-types-with-modules

12939+ |= [file=path src=@t externals=iexternals mark-externals=imark-externals modules=jbundle]

12940+ ^- @t

12941+ =/ parsed (parse file src)

12942+ ?: ?=(%| -.parsed) (show-error src p.parsed)

12943+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

12944+ ?^ duplicate (duplicate-fields-report file src u.duplicate)

12945+ ?: (lien imports.p.parsed |=(i=import ?=(%jibb -.i)))

12946+ 'partial inference; module not checked\0aprelude source missing; module import inference unsupported'

12947+ (golden-types-with-marks file src externals mark-externals)

12948+::

12949+:: The caller supplies the actual prelude source. Its declared names are

12950+:: reserved, and supported inferred types are made available. The inventory

12951+:: and the checker are incomplete, so this never claims a checked module.

12952+:: Hosts may prepare the same trusted source once and reuse its interface.

12953+::

12954+++ golden-types-with-prelude

12955+ |= [file=path src=@t externals=iexternals mark-externals=imark-externals modules=jbundle prelude-source=@t]

12956+ ^- @t

12957+ =/ parsed (parse file src)

12958+ ?: ?=(%| -.parsed) (show-error src p.parsed)

12959+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

12960+ ?^ duplicate (duplicate-fields-report file src u.duplicate)

12961+ ?: =(0 prelude-source) 'partial inference; module not checked\0aprelude source missing; module import inference unsupported'

12962+ =/ prelude (parse /lib/jibb/prelude/jibb prelude-source)

12963+ ?: ?=(%| -.prelude) 'partial inference; module not checked\0aprelude source does not parse; module import inference unsupported'

12964+ =/ prepared=(unit iprelude) (prepare-prelude prelude-source)

12965+ ?~ prepared 'partial inference; module not checked\0aprelude interface is not supported'

12966+ (golden-types-with-prepared-prelude file src externals mark-externals modules prepared)

12967+::

12968+++ golden-types-with-prelude-and-internal

12969+ |= [file=path src=@t externals=iexternals mark-externals=imark-externals modules=jbundle prelude-source=@t internal-source=@t]

12970+ ^- @t

12971+ =/ prepared=(unit iprelude) (prepare-prelude-with-internal prelude-source internal-source)

12972+ (golden-types-with-prepared-prelude file src externals mark-externals modules prepared)

12973+::

12974+++ golden-types-with-prepared-prelude

12975+ |= [file=path src=@t externals=iexternals mark-externals=imark-externals modules=jbundle prepared=(unit iprelude)]

12976+ ^- @t

12977+ =/ parsed (parse file src)

12978+ ?: ?=(%| -.parsed) (show-error src p.parsed)

12979+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

12980+ ?^ duplicate (duplicate-fields-report file src u.duplicate)

12981+ ?~ prepared 'partial inference; module not checked\0aprelude interface is not supported'

12982+ =/ prelude-values=(list term) values.u.prepared

12983+ =/ prelude-molds=(list term) molds.u.prepared

12984+ =/ iface=(unit ifile) `iface.u.prepared

12985+ ?. (module-scope-valid p.parsed prelude-values prelude-molds)

12986+ ?: (pending-declared-poke file p.parsed prelude-values prelude-molds)

12987+ 'partial inference; module not checked\0amodule kind or scope needs unsupported inference'

12988+ 'partial inference; module not checked\0amodule has conflicting names'

12989+ =/ js=jimports-result

12990+ (resolve-jibb-imports imports.p.parsed externals mark-externals modules ~[file] prelude-values prelude-molds ~ iface)

12991+ ?: ?=(%| -.js) (of-wain:format ~['partial inference; module not checked' p.js])

12992+ =/ scope-values=(list term)

12993+ (weld prelude-values (weld (collect-sur-imports imports.p.parsed) (collect-mark-imports imports.p.parsed)))

12994+ (golden-types-in-context-core file src externals mark-externals resolved.p.js scope-values prelude-molds iface prepared)

12995+::

5673:: +golden-types-with-marks: supply declared mark types separately from /sur

12996:: +golden-types-with-marks: supply declared mark types separately from /sur

5674:: entries, as [mark result] with the result from +read-mark:jibb-import.

12997:: entries, as [mark result] with the result from +read-mark:jibb-import.

5675:: Unknown, duplicated, failed and undeclared entries never resolve a mold.

12998:: Unknown, duplicated, failed and undeclared entries never resolve a mold.

5676::

12999::

13000+:: Callers pass unchanged structured reader results; graph validation

13001+:: remains in the existing bridge, and failures stay available lazily.

13002+++ reader-result-for-checker

13003+ |= result=*

13004+ ^- *

13005+ ?: ?=([%ok *] result) [%& +.result]

13006+ result

13007+::

13008+++ golden-types-with-reader-diagnostics

13009+ |= [file=path src=@t externals=iexternals mark-externals=imark-externals]

13010+ ^- @t

13011+ =/ ex=iexternals

13012+ (turn externals |=(e=[module=term name=term result=*] [module.e name.e (reader-result-for-checker result.e)]))

13013+ =/ mx=imark-externals

13014+ (turn mark-externals |=(e=[mark=term result=*] [mark.e (reader-result-for-checker result.e)]))

13015+ (golden-types-with-marks file src ex mx)

13016+::

5677++ golden-types-with-marks

13017++ golden-types-with-marks

5678 |= [file=path src=@t externals=iexternals mark-externals=imark-externals]

13018 |= [file=path src=@t externals=iexternals mark-externals=imark-externals]

5679 ^- @t

13019 ^- @t

13020+ (golden-types-in-context file src externals mark-externals ~ ~ ~ ~)

13021+::

13022+++ golden-types-in-context

13023+ |= [file=path src=@t externals=iexternals mark-externals=imark-externals jimports=ijimports prelude-values=(list term) reserved-molds=(list term) prelude=(unit ifile)]

13024+ ^- @t

13025+ (golden-types-in-context-core file src externals mark-externals jimports prelude-values reserved-molds prelude ~)

13026+++ golden-types-in-context-core

13027+ |= [file=path src=@t externals=iexternals mark-externals=imark-externals jimports=ijimports prelude-values=(list term) reserved-molds=(list term) prelude=(unit ifile) prepared=(unit iprelude)]

13028+ ^- @t

13029+ =. reserved-molds (weld reserved-molds (turn jimports |=(j=[face=term interface=ifile] face.j)))

5680 =/ parsed (parse file src)

13030 =/ parsed (parse file src)

5681 ?: ?=(%| -.parsed) (show-error src p.parsed)

13031 ?: ?=(%| -.parsed) (show-error src p.parsed)

13032+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

13033+ ?^ duplicate (duplicate-fields-report file src u.duplicate)

13034+ ?: (module-has-reserved-proj p.parsed)

13035+ 'module has reserved proj name'

5682 =/ ds=(list def) defs.p.parsed

13036 =/ ds=(list def) defs.p.parsed

5683 =/ molds=imolds (collect-simple-molds ds)

13037 =/ molds=imolds (collect-simple-molds ds)

5684− =/ globals=(list term) (global-value-names ds)

13038+ =/ globals=(list term) (weld prelude-values (weld (turn jimports |=(j=[face=term interface=ifile] face.j)) (global-value-names ds)))

5685 =/ surs=(list term) (collect-sur-imports imports.p.parsed)

13039 =/ surs=(list term) (collect-sur-imports imports.p.parsed)

5686 =/ marks=(list term) (collect-mark-imports imports.p.parsed)

13040 =/ marks=(list term) (collect-mark-imports imports.p.parsed)

5687− =/ env=ienv (resolve-supported-defs ds molds globals externals surs mark-externals marks)

13041+ =/ resolution=iresolved (resolve-groups ds molds globals externals surs mark-externals marks jimports reserved-molds file prelude)

13042+ =/ cycles=(list icycle) (definite-value-cycles ds globals)

13043+ =/ env=ienv env.resolution

13044+ =/ recovered=(list term) ~

13045+ =/ eligible=?

13046+ ?& ?=(~ imports.p.parsed)

13047+ ?=(~ jimports)

13048+ !?=([%ui %api *] file)

13049+ !?=([%ui %stores *] file)

13050+ !(lien (global-value-names ds) |=(n=term =(n %main)))

13051+ !(module-values-complete ds env)

13052+ (lte (met 3 src) 65.536)

13053+ (lte (lent ds) 64)

13054+ ?| &(?=(~ prepared) ?=(~ prelude) ?=(~ prelude-values) ?=(~ reserved-molds) (module-scope-valid p.parsed ~ ~) (dg-source-candidate ds 64))

13055+ ?& ?=(^ prepared)

13056+ ?=(^ prelude)

13057+ =(u.prelude iface.u.prepared)

13058+ =(prelude-values values.u.prepared)

13059+ =(reserved-molds molds.u.prepared)

13060+ (module-scope-valid p.parsed values.u.prepared molds.u.prepared)

13061+ (dg-prepared-candidate ds 64)

13062+ ==

13063+ ==

13064+ ==

13065+ =/ transaction=(unit dgcommit)

13066+ ?. eligible ~

13067+ ?~ prepared (dg-root-source file src)

13068+ (dg-root-prepared file src u.prepared)

13069+ =. recovered

13070+ ?~ transaction ~

13071+ ?. &((module-values-complete ds env.u.transaction) (dg-interface-safe env.u.transaction)) ~

13072+ (turn (skim env.u.transaction |=(entry=[name=term scheme=ischeme] ?=(~ (ienv-lookup name.entry env)))) |=(entry=[name=term scheme=ischeme] name.entry))

13073+ =. env

13074+ ?~ transaction env

13075+ ?: &((module-values-complete ds env.u.transaction) (dg-interface-safe env.u.transaction)) env.u.transaction

13076+ env

13077+ =/ source-defs=(map term def) (direct-checked-gates ds env)

13078+ =/ heads=(unit igate-prelude-evidence) (direct-prelude-evidence ds prelude)

5688 =/ lines=(list @t) ~

13079 =/ lines=(list @t) ~

5689 |-

13080 |-

5690 ?~ ds (of-wain:format ['partial inference; module not checked' (flop lines)])

13081 ?~ ds (of-wain:format ['partial inference; module not checked' (flop lines)])

@@ -5693,18 +13084,730 @@

5693 $(ds t.ds, lines [(show-partial-mold file src d molds) lines])

13084 $(ds t.ds, lines [(show-partial-mold file src d molds) lines])

5694 ?. (unique-value-name name.d globals)

13085 ?. (unique-value-name name.d globals)

5695 $(ds t.ds, lines [(crip "++ {(trip name.d)}: name already in scope") lines])

13086 $(ds t.ds, lines [(crip "++ {(trip name.d)}: name already in scope") lines])

13087+ =/ cycle=(list icycle) (skim cycles |=(c=icycle =(name.c name.d)))

13088+ ?^ cycle

13089+ =/ diag=idiag ["non-gate value depends on itself through a cycle" ~[[first.i.cycle "value in cycle"] [next.i.cycle "dependency in cycle"]]]

13090+ $(ds t.ds, lines [(show-inference-diagnostic file src name.d diag) lines])

13091+ ?: (lien recovered |=(n=term =(n name.d)))

13092+ =/ found=(unit ischeme) (ienv-lookup name.d env)

13093+ ?~ found $(ds t.ds, lines [(crip "++ {(trip name.d)}: committed definition unavailable") lines])

13094+ ?: (itype-has-hidden-recursive typ.u.found)

13095+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: recursive mold name is not available in this scope") lines])

13096+ ?: (itype-has-hidden-generic typ.u.found)

13097+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: generic union name is not available in this scope") lines])

13098+ =/ typ=itype (canonical-itype typ.u.found vars.u.found)

13099+ =/ line=@t (crip "++ {(trip name.d)}: {(show-itype typ ~)}{(show-atom-constraint typ)}")

13100+ $(ds t.ds, lines [line lines])

13101+ ?: (lien grouped.resolution |=(n=term =(n name.d)))

13102+ =/ found=(unit ischeme) (ienv-lookup name.d env)

13103+ ?~ found $(ds t.ds, lines [(crip "++ {(trip name.d)}: recursive group unavailable") lines])

13104+ =/ typ=itype (canonical-itype typ.u.found vars.u.found)

13105+ =/ line=@t (crip "++ {(trip name.d)}: {(show-itype typ ~)}{(show-atom-constraint typ)}")

13106+ $(ds t.ds, lines [line lines])

13107+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

5696− =/ result=iresult (infer-fragment val.d env [0 ~ ~ ~ molds globals externals surs mark-externals marks ~ |])

13108+ =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | file top prelude ~ 256 ~ ~ ~ ~ ~ ~]

13109+ =. gate-defs.initial source-defs

13110+ =. head-evidence.initial heads

13111+ =. initial (reserve-def-caps val.d initial)

13112+ =/ result=iresult

13113+ ?: |(?=(%gate -.val.d) ?=(%gate-wide -.val.d))

13114+ (infer-recursive-gate d env initial)

13115+ (infer-fragment val.d env initial)

5697 ?: ?=(%| -.result)

13116 ?: ?=(%| -.result)

5698 $(ds t.ds, lines [(show-inference-diagnostic file src name.d p.result) lines])

13117 $(ds t.ds, lines [(show-inference-diagnostic file src name.d p.result) lines])

13118+ =. state.p.result (promote-restricted-numbers state.p.result env)

13119+ =. state.p.result (default-hole-numbers holes.state.p.result holes.initial state.p.result env !(itype-has-gate (itype-normalize typ.p.result sub.state.p.result)))

13120+ =/ hole=(unit idiag) (unresolved-hole holes.state.p.result holes.initial state.p.result)

13121+ ?^ hole

13122+ $(ds t.ds, lines [(show-inference-diagnostic file src name.d u.hole) lines])

13123+ =/ merged=(unit [first=icap second=icap])

13124+ (merged-capitals caps.state.p.result sub.state.p.result)

13125+ ?^ merged

13126+ =/ diag=idiag

13127+ ["distinct type variables `{(trip name.first.u.merged)}` and `{(trip name.second.u.merged)}` must not be forced equal; use the same capital for a shared type" ~[[at.first.u.merged "first type variable"] [at.second.u.merged "second type variable"]]]

13128+ $(ds t.ds, lines [(show-inference-diagnostic file src name.d diag) lines])

5699 ?: (constrained-capitals caps.state.p.result sub.state.p.result)

13129 ?: (constrained-capitals caps.state.p.result sub.state.p.result)

5700 $(ds t.ds, lines [(crip "++ {(trip name.d)}: explicit capital constraints are not supported by partial inference") lines])

13130 $(ds t.ds, lines [(crip "++ {(trip name.d)}: explicit capital constraints are not supported by partial inference") lines])

5701− =/ typ=itype (itype-normalize typ.p.result sub.state.p.result)

13131+ =/ typ=itype (default-decimals (itype-normalize typ.p.result sub.state.p.result))

13132+ ?: (pending-null tags.state.p.result sub.state.p.result)

13133+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: `~` needs context in partial inference") lines])

13134+ ?: |((pending-tags tags.state.p.result sub.state.p.result) (itype-has-tag typ))

13135+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: tag needs context in partial inference") lines])

13136+ ?: (itype-has-hidden-recursive typ)

13137+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: recursive mold name is not available in this scope") lines])

13138+ ?: (itype-has-hidden-generic typ)

13139+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: generic union name is not available in this scope") lines])

5702 ?: (unsupported-atom-vars typ caps.state.p.result binders.state.p.result sub.state.p.result)

13140 ?: (unsupported-atom-vars typ caps.state.p.result binders.state.p.result sub.state.p.result)

5703 $(ds t.ds, lines [(crip "++ {(trip name.d)}: unresolved aura-variable inference") lines])

13141 $(ds t.ds, lines [(crip "++ {(trip name.d)}: unresolved aura-variable inference") lines])

5704 =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

13142 =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

5705 ?: (gth (lent vars) 26)

13143 ?: (gth (lent vars) 26)

5706 $(ds t.ds, lines [(crip "++ {(trip name.d)}: too many variables for partial printer") lines])

13144 $(ds t.ds, lines [(crip "++ {(trip name.d)}: too many variables for partial printer") lines])

13145+ ?~ (width-finalize projections.state.p.result sub.state.p.result vars)

13146+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: record projection elaboration needs unsupported inference") lines])

5707 =/ printable=itype (canonical-itype typ vars)

13147 =/ printable=itype (canonical-itype typ vars)

5708 =/ line=@t (crip "++ {(trip name.d)}: {(show-itype printable ~)}{(show-atom-constraint printable)}")

13148 =/ line=@t (crip "++ {(trip name.d)}: {(show-itype printable ~)}{(show-atom-constraint printable)}")

5709 $(ds t.ds, lines [line lines])

13149 $(ds t.ds, lines [line lines])

13150+:: Experimental module-owned pending-constraint generalization only.

13151+:: Inputs, IDs and substitution come from one checker-owned transaction.

13152++$ dgscan [ids=(list @ud) fuel=@ud]

13153+++ dg-scan

13154+ |= [todo=(list itype) sub=isub fuel=@ud ids=(list @ud)]

13155+ ^- (unit dgscan)

13156+ ?~ todo `[ids fuel]

13157+ ?: =(0 fuel) ~

13158+ =. fuel (dec fuel)

13159+ =/ t=itype i.todo

13160+ ?: ?=(?(%var %avar %rvar %nvar %rnvar %tag) -.t)

13161+ =/ node-id=@ud ?:(?=(%tag -.t) id.t +.t)

13162+ =/ found=(unit itype) (itype-lookup node-id sub)

13163+ ?~ found $(todo t.todo, ids [node-id ids])

13164+ ?: &(?=(?(%rvar %rnvar) -.u.found) =(node-id +.u.found))

13165+ $(todo t.todo, ids [node-id ids])

13166+ $(todo [u.found t.todo])

13167+ ?: ?=(%jrec -.t) $(todo t.todo)

13168+ ?+ -.t ~

13169+ %collection $(todo (weld args.t t.todo))

13170+ %union $(todo (weld args.t (weld cases.t t.todo)))

13171+ %face $(todo [body.t t.todo])

13172+ %fn $(todo [sample.t product.t t.todo])

13173+ %cell $(todo [hed.t tal.t t.todo])

13174+ %atom $(todo t.todo)

13175+ %any-atom $(todo t.todo)

13176+ %flag $(todo t.todo)

13177+ %noun $(todo t.todo)

13178+ %empty $(todo t.todo)

13179+ %const $(todo t.todo)

13180+ ==

13181+::

13182+++ dg-scan-ids

13183+ |= [ids=(list @ud) sub=isub fuel=@ud blocked=(list @ud)]

13184+ ^- (unit dgscan)

13185+ ?~ ids `[blocked fuel]

13186+ =/ one=(unit dgscan) (dg-scan ~[[%var i.ids]] sub fuel blocked)

13187+ ?~ one ~

13188+ $(ids t.ids, fuel fuel.u.one, blocked ids.u.one)

13189+::

13190+++ dg-env

13191+ |= [env=ienv sub=isub fuel=@ud blocked=(list @ud)]

13192+ ^- (unit dgscan)

13193+ ?~ env `[blocked fuel]

13194+ =/ sc=ischeme scheme.i.env

13195+ :: Quantifiers are local to the scheme: first find raw free IDs, then

13196+ :: follow those IDs in the module substitution without capturing them.

13197+ =/ raw=(unit dgscan) (dg-scan ~[typ.sc] ~ fuel ~)

13198+ ?~ raw ~

13199+ =/ free=(list @ud) (skim ids.u.raw |=(n=@ud !(lien vars.sc |=(q=@ud =(q n)))))

13200+ =/ resolved=(unit dgscan) (dg-scan-ids free sub fuel.u.raw blocked)

13201+ ?~ resolved ~

13202+ $(env t.env, fuel fuel.u.resolved, blocked ids.u.resolved)

13203+::

13204+++ dg-obligations

13205+ |= [pending=(list dgo) sub=isub fuel=@ud blocked=(list @ud)]

13206+ ^- (unit dgscan)

13207+ ?~ pending `[blocked fuel]

13208+ =/ found=(unit dgscan) (dg-scan ~[left.i.pending right.i.pending] sub fuel blocked)

13209+ ?~ found ~

13210+ $(pending t.pending, fuel fuel.u.found, blocked ids.u.found)

13211+::

13212+++ dg-tags

13213+ |= [tags=(list ipending) sub=isub fuel=@ud blocked=(list @ud)]

13214+ ^- (unit dgscan)

13215+ ?~ tags `[blocked fuel]

13216+ ?: =(0 fuel) ~

13217+ =/ found=(unit itype) (itype-lookup id.i.tags sub)

13218+ ?~ found $(tags t.tags, fuel (dec fuel), blocked [id.i.tags blocked])

13219+ :: Until this entry is explicitly discharged, retain variables reachable

13220+ :: through its binding; mere existence of a substitution is not proof.

13221+ =/ reached=(unit dgscan) (dg-scan ~[u.found] sub (dec fuel) blocked)

13222+ ?~ reached ~

13223+ $(tags t.tags, fuel fuel.u.reached, blocked ids.u.reached)

13224+::

13225+++ dg-generalize

13226+ |= [typ=itype env=ienv pending=(list dgo) tags=(list ipending) captured=(list @ud) state=istate fuel=@ud]

13227+ ^- (unit ischeme)

13228+ :: Bound the obligation list and all graph/substitution walks. The

13229+ :: substitution is assumed checker-owned and occurs-checked.

13230+ ?: (gth (lent pending) 64) ~

13231+ =/ capt=(unit dgscan) (dg-scan-ids captured sub.state fuel ~)

13232+ ?~ capt ~

13233+ =/ env-free=(unit dgscan) (dg-env env sub.state fuel.u.capt ids.u.capt)

13234+ ?~ env-free ~

13235+ =/ obligations=(unit dgscan) (dg-obligations pending sub.state fuel.u.env-free ids.u.env-free)

13236+ ?~ obligations ~

13237+ =/ tagged=(unit dgscan) (dg-tags tags sub.state fuel.u.obligations ids.u.obligations)

13238+ ?~ tagged ~

13239+ =/ bounded=(unit dgscan) (dg-scan ~[typ] sub.state fuel.u.tagged ~)

13240+ ?~ bounded ~

13241+ =/ normalized=itype (itype-normalize typ sub.state)

13242+ =/ vars=(list @ud) (unique-type-vars (itype-vars normalized))

13243+ =/ quantified=(list @ud) (skim vars |=(n=@ud !(lien ids.u.tagged |=(b=@ud =(b n)))))

13244+ `[[normalized quantified]]

13245+::

13246++$ dgcommit [env=ienv state=istate]

13247+:: A branch literal must not acquire a value face through replay.

13248+++ dg-literal-target-safe

13249+ |= target=itype

13250+ ^- ?

13251+ ?: ?=(%union -.target)

13252+ (levy cases.target |=(c=itype ?=(?(%const %cell) -.c)))

13253+ ?=(?(%const %atom %any-atom %flag %noun) -.target)

13254+::

13255+++ dg-replay-edges

13256+ |= [edges=(list dgo) state=istate fuel=@ud]

13257+ ^- (unit istate)

13258+ ?~ edges `state

13259+ ?: =(0 fuel) ~

13260+ =/ trial=ifit (itype-fit left.i.edges right.i.edges sub.state next.state)

13261+ ?. ?=(%ok -.trial) ~

13262+ =/ valid=?

13263+ ?: ?=(%tag -.left.i.edges)

13264+ ?. constructor.left.i.edges

13265+ =/ closed=(unit dgscan) (dg-scan ~[right.i.edges] sub.trial 512 ~)

13266+ ?~ closed |

13267+ ?^ ids.u.closed |

13268+ (dg-literal-target-safe (itype-normalize right.i.edges sub.trial))

13269+ =((itype-walk left.i.edges sub.trial) (itype-walk right.i.edges sub.trial))

13270+ =((itype-walk left.i.edges sub.trial) (itype-walk right.i.edges sub.trial))

13271+ ?. valid ~

13272+ $(edges t.edges, state state(sub sub.trial, next next.trial), fuel (dec fuel))

13273+::

13274+++ dg-close-env

13275+ |= [env=ienv sub=isub fuel=@ud]

13276+ ^- (unit ienv)

13277+ ?~ env `~

13278+ ?: =(0 fuel) ~

13279+ =/ s=ischeme scheme.i.env

13280+ :: Quantified IDs are scheme-local and cannot be rewritten on publication.

13281+ ?. (levy vars.s |=(n=@ud ?=(~ (itype-lookup n sub)))) ~

13282+ =/ bounded=(unit dgscan) (dg-scan ~[typ.s] sub (dec fuel) ~)

13283+ ?~ bounded ~

13284+ =/ normalized=itype (itype-normalize typ.s sub)

13285+ ?: (itype-has-tag normalized) ~

13286+ =/ vars=(list @ud) (unique-type-vars (itype-vars normalized))

13287+ ?. (levy vars |=(n=@ud (lien vars.s |=(v=@ud =(v n))))) ~

13288+ =/ rest=(unit ienv) (dg-close-env t.env sub fuel.u.bounded)

13289+ ?~ rest ~

13290+ `[[name.i.env [normalized vars.s]] u.rest]

13291+::

13292+:: A deferred boolean branch has exactly the two literal flag patterns.

13293+:: Arms are inferred in order. Equal types are retained; two direct pending

13294+:: literals may instead retain source-owned obligations for later context.

13295+++ dg-boolean-patterns

13296+ |= e=expr

13297+ ^- ?

13298+ ?. ?=(%branch -.e) |

13299+ ?~ arms.e |

13300+ ?~ t.arms.e |

13301+ ?^ t.t.arms.e |

13302+ =/ x=arm i.arms.e

13303+ =/ y=arm i.t.arms.e

13304+ ?. &(?=(%lit -.pat.x) ?=(%lit -.pat.y)) |

13305+ ?. &(=(%loobean form.lit.pat.x) =(%loobean form.lit.pat.y)) |

13306+ !=(val.lit.pat.x val.lit.pat.y)

13307+:: Only a direct source literal which created its own unbound pending tag

13308+:: may create a branch edge. The caller must retain the exact source and state.

13309+++ dg-owned-arm-literal

13310+ |= [e=expr t=itype tags=(list ipending) sub=isub initial=@ud]

13311+ ^- ?

13312+ ?. ?=(%lit -.e) |

13313+ ?. ?=(%tag -.t) |

13314+ ?: constructor.t |

13315+ ?. =(lit.e literal.t) |

13316+ ?: (lth id.t initial) |

13317+ ?^ (itype-lookup id.t sub) |

13318+ (lien tags |=(x=ipending &(=(id.x id.t) =(literal.x literal.t))))

13319+++ dg-boolean-branch

13320+ |= [e=expr env=ienv state=istate]

13321+ ^- iresult

13322+ ?. (dg-boolean-patterns e) [%| ["deferred branch patterns need unsupported inference" ~]]

13323+ ?> ?=(%branch -.e)

13324+ ?> ?=(^ arms.e)

13325+ ?> ?=(^ t.arms.e)

13326+ =/ x=arm i.arms.e

13327+ =/ y=arm i.t.arms.e

13328+ =/ subject=iresult (infer-fragment subject.e env state)

13329+ ?: ?=(%| -.subject) subject

13330+ =/ su=(unit isub) (itype-unify typ.p.subject [%flag ~] sub.state.p.subject)

13331+ ?~ su [%| ["deferred branch subject does not unify with ?" ~]]

13332+ =/ left=iresult (infer-fragment val.x env state.p.subject(sub u.su))

13333+ ?: ?=(%| -.left) left

13334+ =/ right=iresult (infer-fragment val.y env state.p.left)

13335+ ?: ?=(%| -.right) right

13336+ ?. (dg-stable-fit typ.p.left typ.p.right sub.state.p.right)

13337+ =/ st=istate state.p.right

13338+ ?. (dg-owned-arm-literal val.x typ.p.left tags.st sub.st next.state)

13339+ [%| ["deferred branch arm context needs unsupported inference" ~]]

13340+ ?. (dg-owned-arm-literal val.y typ.p.right tags.st sub.st next.state)

13341+ [%| ["deferred branch arm context needs unsupported inference" ~]]

13342+ ?> ?=(%tag -.typ.p.left)

13343+ ?> ?=(%tag -.typ.p.right)

13344+ ?: =(id.typ.p.left id.typ.p.right)

13345+ [%| ["deferred branch arm context needs unsupported inference" ~]]

13346+ ?: (gth (lent obligations.st) 62)

13347+ [%| ["deferred branch arm context needs unsupported inference" ~]]

13348+ =/ result=itype [%var next.st]

13349+ =/ ex=dgo [typ.p.left result (span-of val.x) (span-of e)]

13350+ =/ ey=dgo [typ.p.right result (span-of val.y) (span-of e)]

13351+ [%& result st(next +(next.st), obligations [ex ey obligations.st])]

13352+ [%& typ.p.left state.p.right]

13353+::

13354+:: A direct tuple literal may wait for a later exact result context.

13355+:: Each pending literal retains its source tag and its own fit obligation.

13356+++ dg-infer-tuple-items

13357+ |= [items=(list item) env=ienv state=istate]

13358+ ^- iresult

13359+ ?~ items [%| ["empty cell is not supported by partial inference" ~]]

13360+ =/ head=iresult (infer-fragment val.i.items env state)

13361+ ?: ?=(%| -.head) head

13362+ =/ typ=itype typ.p.head

13363+ =/ st=istate state.p.head

13364+ =/ adjusted=(unit [typ=itype state=istate])

13365+ ?. (dg-owned-arm-literal val.i.items typ tags.st sub.st next.state) `[typ st]

13366+ ?: (gth (lent obligations.st) 63) ~

13367+ =/ pending=itype [%var next.st]

13368+ =/ edge=dgo [typ pending (span-of val.i.items) at.i.items]

13369+ `[pending st(next +(next.st), obligations [edge obligations.st])]

13370+ ?~ adjusted [%| ["deferred tuple context needs unsupported inference" ~]]

13371+ =. typ typ.u.adjusted

13372+ =. st state.u.adjusted

13373+ =. typ ?~(face.i.items typ [%face u.face.i.items typ])

13374+ ?~ t.items [%& typ st]

13375+ =/ tail=iresult $(items t.items, state st)

13376+ ?: ?=(%| -.tail) tail

13377+ [%& [%cell typ typ.p.tail] state.p.tail]

13378+::

13379+:: Deferred inference uses only source forms whose successful fit sites are

13380+:: guarded below; a shared source-node budget bounds this screen.

13381+++ dg-safe-expressions

13382+ |= [todo=(list expr) fuel=@ud]

13383+ ^- (unit @ud)

13384+ ?~ todo `fuel

13385+ =/ first=(unit @ud) (dg-safe-expression i.todo fuel)

13386+ ?~ first ~

13387+ $(todo t.todo, fuel u.first)

13388+++ dg-safe-items

13389+ |= [items=(list item) fuel=@ud]

13390+ ^- (unit @ud)

13391+ ?~ items `fuel

13392+ =/ first=(unit @ud) (dg-safe-expression val.i.items fuel)

13393+ ?~ first ~

13394+ $(items t.items, fuel u.first)

13395+++ dg-safe-expression

13396+ |= [e=expr fuel=@ud]

13397+ ^- (unit @ud)

13398+ ?: =(0 fuel) ~

13399+ =. fuel (dec fuel)

13400+ ?+ -.e ~

13401+ ?(%lit %ctor) `fuel

13402+ %wing ?:(?=([@ ~] names.e) `fuel ~)

13403+ %str

13404+ ?. (levy pieces.e |=(p=piece ?=(%text -.p))) ~

13405+ `fuel

13406+ %group $(e inner.e, fuel fuel)

13407+ %body

13408+ ?^ defs.e ~

13409+ $(e final.e, fuel fuel)

13410+ %gate $(e body.e, fuel fuel)

13411+ %gate-wide $(e body.e, fuel fuel)

13412+ %tuple (dg-safe-items items.e fuel)

13413+ %branch

13414+ ?. (dg-boolean-patterns e) ~

13415+ ?> ?=(^ arms.e)

13416+ ?> ?=(^ t.arms.e)

13417+ =/ subject=(unit @ud) $(e subject.e, fuel fuel)

13418+ ?~ subject ~

13419+ (dg-safe-expressions ~[val.i.arms.e val.i.t.arms.e] u.subject)

13420+ %cast $(e val.e, fuel fuel)

13421+ %call

13422+ =/ head=(unit @ud) $(e head.e, fuel fuel)

13423+ ?~ head ~

13424+ (dg-safe-expressions args.e u.head)

13425+ ==

13426+:: Exact normalized equality is preserved by all later substitutions.

13427+:: The bounded scan declines opaque types and oversized inputs.

13428+++ dg-stable-fit

13429+ |= [actual=itype expected=itype sub=isub]

13430+ ^- ?

13431+ ?~ (dg-scan ~[actual expected] sub 512 ~) |

13432+ =((itype-normalize actual sub) (itype-normalize expected sub))

13433+::

13434+:: A positional call peels sample-slot faces during its separate face check.

13435+:: Require its argument, sample and result closed so that check stays valid.

13436+++ dg-stable-call-fit

13437+ |= [actual=itype expected=itype product=itype sub=isub positional=?]

13438+ ^- ?

13439+ =/ checked=(unit dgscan) (dg-scan ~[actual expected product] sub 512 ~)

13440+ ?~ checked |

13441+ ?: &(positional ?=(^ ids.u.checked)) |

13442+ =((itype-normalize actual sub) (itype-normalize expected sub))

13443+::

13444+:: One definition attempt retains state only when inference succeeds.

13445++$ dg-step [env=ienv state=istate pending=(list dgo)]

13446+++ dg-stage-one

13447+ |= [d=def env=ienv state=istate]

13448+ ^- (unit dg-step)

13449+ ?> ?=(%value -.d)

13450+ ?~ (dg-safe-expression val.d 512) ~

13451+ =/ local=istate (reserve-def-caps val.d state)

13452+ :: This first slice declines all written capitals and holes/projections.

13453+ ?^ caps.local ~

13454+ =/ ordinary=iresult (infer-fragment val.d env local)

13455+ ?: ?=(%| -.ordinary) ~

13456+ =/ typ=itype typ.p.ordinary

13457+ =/ after=istate state.p.ordinary

13458+ =/ edges=(list dgo) obligations.after

13459+ ?. =(binders.after binders.state) ~

13460+ ?. =(molds.after molds.state) ~

13461+ ?. =(globals.after globals.state) ~

13462+ ?. =(externals.after externals.state) ~

13463+ ?. =(surs.after surs.state) ~

13464+ ?. =(mark-externals.after mark-externals.state) ~

13465+ ?. =(marks.after marks.state) ~

13466+ ?. =(jimports.after jimports.state) ~

13467+ ?. =(reserved-molds.after reserved-molds.state) ~

13468+ ?. =(params.after params.state) ~

13469+ ?. =(active.after active.state) ~

13470+ ?. =(in-mold.after in-mold.state) ~

13471+ ?. =(at.after at.state) ~

13472+ ?. =(top-molds.after top-molds.state) ~

13473+ ?. =(prelude.after prelude.state) ~

13474+ ?. =(gate-defs.after gate-defs.state) ~

13475+ ?. =(head-evidence.after head-evidence.state) ~

13476+ ?. =(grec-index.after grec-index.state) ~

13477+ ?. =(defer.after defer.state) ~

13478+ ?. =(holes.after holes.state) ~

13479+ ?. =(caps.after caps.state) ~

13480+ ?. =(projections.after projections.state) ~

13481+ ?: (unsupported-atom-vars (itype-normalize typ sub.after) caps.after binders.after sub.after) ~

13482+ ?: (itype-has-nvar (itype-normalize typ sub.after)) ~

13483+ =/ scheme=(unit ischeme) (dg-generalize typ env edges tags.after ~ after 32.768)

13484+ ?~ scheme ~

13485+ `[[[name.d u.scheme] env] after edges]

13486+:: Retry only definitions that did not infer. Successful definitions are

13487+:: committed into the local transaction, never published until all close.

13488+++ dg-stage

13489+ |= [ds=(list def) base=ienv env=ienv state=istate pending=(list dgo) fuel=@ud]

13490+ ^- (unit dgcommit)

13491+ ?: (gth fuel 64) ~

13492+ ?: (gth (lent ds) fuel) ~

13493+ =/ remaining=(list def) ds

13494+ =/ waiting=(list def) ~

13495+ =/ progress=? |

13496+ =/ attempts=@ud (mul fuel fuel)

13497+ |-

13498+ ?~ remaining

13499+ ?^ waiting

13500+ ?. progress ~

13501+ $(remaining (flop waiting), waiting ~, progress |)

13502+ =/ replayed=(unit istate) (dg-replay-edges pending state 64)

13503+ ?~ replayed ~

13504+ ?: (pending-tags tags.u.replayed sub.u.replayed) ~

13505+ =/ closed-edges=(unit dgscan) (dg-obligations pending sub.u.replayed 32.768 ~)

13506+ ?~ closed-edges ~

13507+ ?^ ids.u.closed-edges ~

13508+ =/ rechecked=(unit istate) (dg-replay-edges pending u.replayed 64)

13509+ ?~ rechecked ~

13510+ ?. =(sub.u.rechecked sub.u.replayed) ~

13511+ ?. =(next.u.rechecked next.u.replayed) ~

13512+ =/ closed=(unit ienv) (dg-close-env env sub.u.replayed 32.768)

13513+ ?~ closed ~

13514+ `[[u.closed u.replayed(defer ~, obligations ~)]]

13515+ ?: =(0 attempts) ~

13516+ =. attempts (dec attempts)

13517+ =/ d=def i.remaining

13518+ ?: ?=(%mold -.d) $(remaining t.remaining)

13519+ ?^ (ienv-lookup name.d base) $(remaining t.remaining)

13520+ ?^ (ienv-lookup name.d env) ~

13521+ =/ done=(unit dg-step) (dg-stage-one d env state)

13522+ ?~ done $(remaining t.remaining, waiting [d waiting])

13523+ $(remaining t.remaining, env env.u.done, state state.u.done, pending pending.u.done, progress &)

13524+::

13525+:: Cheap bounded eligibility check on the already parsed source. This

13526+:: deliberately covers only direct constructor calls beneath transparent

13527+:: groups, gates, casts and definition-free bodies. Other shapes decline

13528+:: this fallback without a second parse or resolution pass.

13529+++ dg-direct-source

13530+ |= [e=expr fuel=@ud]

13531+ ^- ?

13532+ ?: =(0 fuel) |

13533+ ?+ -.e |

13534+ %group $(e inner.e, fuel (dec fuel))

13535+ %gate $(e body.e, fuel (dec fuel))

13536+ %gate-wide $(e body.e, fuel (dec fuel))

13537+ %cast $(e val.e, fuel (dec fuel))

13538+ %body ?~(defs.e $(e final.e, fuel (dec fuel)) |)

13539+ %call

13540+ ?. ?=([* ~] args.e) |

13541+ ?=(%ctor -.i.args.e)

13542+ ==

13543+++ dg-source-candidate

13544+ |= [ds=(list def) fuel=@ud]

13545+ ^- ?

13546+ ?~ ds |

13547+ ?: =(0 fuel) |

13548+ ?. ?=(%value -.i.ds) $(ds t.ds, fuel (dec fuel))

13549+ ?: (dg-direct-source val.i.ds 64) &

13550+ $(ds t.ds, fuel (dec fuel))

13551+::

13552+++ dg-prepared-source

13553+ |= [e=expr fuel=@ud]

13554+ ^- ?

13555+ ?: (dg-direct-source e fuel) &

13556+ ?: =(0 fuel) |

13557+ ?+ -.e |

13558+ %group $(e inner.e, fuel (dec fuel))

13559+ %gate $(e body.e, fuel (dec fuel))

13560+ %gate-wide $(e body.e, fuel (dec fuel))

13561+ %cast $(e val.e, fuel (dec fuel))

13562+ %body ?~(defs.e $(e final.e, fuel (dec fuel)) |)

13563+ %tuple &

13564+ ==

13565+++ dg-prepared-candidate

13566+ |= [ds=(list def) fuel=@ud]

13567+ ^- ?

13568+ ?~ ds |

13569+ ?: =(0 fuel) |

13570+ ?. ?=(%value -.i.ds) $(ds t.ds, fuel (dec fuel))

13571+ ?: (dg-prepared-source val.i.ds 64) &

13572+ $(ds t.ds, fuel (dec fuel))

13573+::

13574+++ dg-interface-safe

13575+ |= [env=ienv]

13576+ ^- ?

13577+ ?~ env &

13578+ =/ sc=ischeme scheme.i.env

13579+ ?: |((itype-has-hidden-recursive typ.sc) (itype-has-hidden-generic typ.sc)) |

13580+ ?: (gth (lent vars.sc) 26) |

13581+ $(env t.env)

13582+:: Parse status and the transaction result come from the same source parse.

13583++$ dgparse [parsed=? result=(unit dgcommit)]

13584+++ dg-root-source

13585+ |= [at=path src=@t]

13586+ ^- (unit dgcommit)

13587+ result:(dg-root-detail at src)

13588+++ dg-root-detail

13589+ |= [at=path src=@t]

13590+ ^- dgparse

13591+ =/ parsed (parse at src)

13592+ ?: ?=(%| -.parsed) [| ~]

13593+ =/ transact

13594+ |.

13595+ ?^ imports.p.parsed ~

13596+ ?. (module-scope-valid p.parsed ~ ~) ~

13597+ ?^ (duplicate-defs defs.p.parsed) ~

13598+ =/ defs=(list def) defs.p.parsed

13599+ ?: (gth (lent defs) 64) ~

13600+ =/ molds=imolds (collect-simple-molds defs)

13601+ =/ globals=(list term) (global-value-names defs)

13602+ =/ resolution=iresolved (resolve-groups defs molds globals ~ ~ ~ ~ ~ ~ at ~)

13603+ ?^ grouped.resolution ~

13604+ ?^ artifacts.resolution ~

13605+ =/ base=ienv env.resolution

13606+ =/ free=(unit dgscan) (dg-env base ~ 32.768 ~)

13607+ ?~ free ~

13608+ ?^ ids.u.free ~

13609+ =/ all=(unit dgscan) (dg-all-env-ids base 32.768 ~)

13610+ ?~ all ~

13611+ =/ fresh=@ud (dg-next-id ids.u.all 0)

13612+ =/ st=istate *istate

13613+ =. st st(next fresh, defer `~, molds molds, globals globals, at at, top-molds (turn molds |=(m=[name=term body=shape] name.m)), in-mold |, jrec-fuel 256)

13614+ =/ checked-molds=(each imold-types @t) (module-mold-types molds st)

13615+ ?: ?=(%| -.checked-molds) ~

13616+ (dg-stage defs base base st ~ 64)

13617+ ::

13618+ [& (transact)]

13619+:: The caller supplies the trusted prepared prelude. This transaction is

13620+:: only report evidence; the ordinary module resolver does not publish it.

13621+++ dg-root-prepared

13622+ |= [at=path src=@t prepared=iprelude]

13623+ ^- (unit dgcommit)

13624+ ?: ?=([%ui %api *] at) ~

13625+ ?: ?=([%ui %stores *] at) ~

13626+ ?: (gth (met 3 src) 65.536) ~

13627+ =/ parsed (parse at src)

13628+ ?: ?=(%| -.parsed) ~

13629+ ?^ imports.p.parsed ~

13630+ ?. (module-scope-valid p.parsed values.prepared molds.prepared) ~

13631+ ?^ (duplicate-defs defs.p.parsed) ~

13632+ =/ defs=(list def) defs.p.parsed

13633+ ?: (gth (lent defs) 64) ~

13634+ ?: (lien (global-value-names defs) |=(n=term =(n %main))) ~

13635+ ?. (dg-prepared-candidate defs 64) ~

13636+ =/ local-molds=imolds (collect-simple-molds defs)

13637+ =/ globals=(list term) (weld values.prepared (global-value-names defs))

13638+ =/ iface=ifile iface.prepared

13639+ =/ prelude=(unit ifile) `iface

13640+ =/ resolution=iresolved

13641+ (resolve-groups defs local-molds globals ~ ~ ~ ~ ~ molds.prepared at prelude)

13642+ ?^ grouped.resolution ~

13643+ ?^ artifacts.resolution ~

13644+ =/ base=ienv env.resolution

13645+ =/ templates=ienv

13646+ (turn molds.iface |=(x=[name=term template=ischeme] [name.x template.x]))

13647+ =/ all-env=ienv (weld base (weld values.iface templates))

13648+ =/ free=(unit dgscan) (dg-env all-env ~ 32.768 ~)

13649+ ?~ free ~

13650+ ?^ ids.u.free ~

13651+ =/ all=(unit dgscan) (dg-all-env-ids all-env 32.768 ~)

13652+ ?~ all ~

13653+ =/ fresh=@ud (dg-next-id ids.u.all 0)

13654+ =/ st=istate *istate

13655+ =. st st(next fresh, defer `~, molds local-molds, globals globals, at at, reserved-molds molds.prepared, prelude prelude, top-molds (turn local-molds |=(m=[name=term body=shape] name.m)), in-mold |, jrec-fuel 256)

13656+ =/ checked-molds=(each imold-types @t) (module-mold-types local-molds st)

13657+ ?: ?=(%| -.checked-molds) ~

13658+ (dg-stage defs base base st ~ 64)

13659+::

13660+++ dg-all-env-ids

13661+ |= [env=ienv fuel=@ud ids=(list @ud)]

13662+ ^- (unit dgscan)

13663+ ?~ env `[ids fuel]

13664+ ?: =(0 fuel) ~

13665+ =/ sc=ischeme scheme.i.env

13666+ ?: (itype-has-tag typ.sc) ~

13667+ =/ raw=(unit dgscan) (dg-scan ~[typ.sc] ~ (dec fuel) ids)

13668+ ?~ raw ~

13669+ =/ quant=(unit dgscan) (dg-scan-ids vars.sc ~ fuel.u.raw ids.u.raw)

13670+ ?~ quant ~

13671+ $(env t.env, fuel fuel.u.quant, ids ids.u.quant)

13672+::

13673+++ dg-next-id

13674+ |= [ids=(list @ud) largest=@ud]

13675+ ^- @ud

13676+ ?~ ids +(largest)

13677+ $(ids t.ids, largest (max largest i.ids))

13678+::

13679+++ dg-eligible-ctor

13680+ |= [e=expr head=itype actual=itype expected=itype state=istate]

13681+ ^- (unit dgo)

13682+ ?. ?=(%call -.e) ~

13683+ ?. ?=([* ~] args.e) ~

13684+ ?. ?=(%ctor -.i.args.e) ~

13685+ ?. ?=(%fn -.head) ~

13686+ ?. ?=(%fn -.expected) ~

13687+ ?. ?=(%tag -.actual) ~

13688+ ?. constructor.actual ~

13689+ ?. ?=(%var -.product.expected) ~

13690+ ?^ (itype-lookup id.product.expected sub.state) ~

13691+ =/ bounded=(unit dgscan) (dg-scan ~[sample.expected] sub.state 256 ~)

13692+ ?~ bounded ~

13693+ ?^ ids.u.bounded ~

13694+ `[[actual expected (span-of i.args.e) (span-of head.e)]]

13695+::

13696+:: Experimental per-module, source-derived recursive tree index.

13697+:: The two tags and the exact children/list/self layout are fixed-shape

13698+:: checks, so ordinary definitions incur no type-tree or source scans.

13699+++ grec-tagged-fields

13700+ |= sh=shape

13701+ ^- (unit [tag=@ fields=(list field)])

13702+ ?. ?=(%cell -.sh) ~

13703+ ?~ fields.sh ~

13704+ =/ head=field i.fields.sh

13705+ ?. ?=(%bare -.head) ~

13706+ ?. ?=(%const -.shape.head) ~

13707+ ?. &(?=(%term form.lit.shape.head) =(%tas aura.lit.shape.head)) ~

13708+ `[val.lit.shape.head t.fields.sh]

13709+++ grec-tree-children

13710+ |= [fs=(list field) param=@t]

13711+ ^- (unit field)

13712+ ?~ fs ~

13713+ ?~ t.fs `i.fs

13714+ ?^ t.t.fs ~

13715+ =/ event=field i.fs

13716+ =/ kids=field i.t.fs

13717+ ?. &(?=(%face -.event) ?=(%face -.kids)) ~

13718+ ?. !=(name.event name.kids) ~

13719+ ?. ?=(%fn -.shape.event) ~

13720+ ?. ?=(%aura -.sample.shape.event) ~

13721+ ?. =(%t aura.sample.shape.event) ~

13722+ ?. ?=(%tvar -.product.shape.event) ~

13723+ ?. =(param name.product.shape.event) ~

13724+ `kids

13725+::

13726+++ grec-tree-proof

13727+ |= [name=term sh=shape]

13728+ ^- ?

13729+ ?. ?=(%generic -.sh) |

13730+ ?. ?=([@ ~] vars.sh) |

13731+ =/ param=@t i.vars.sh

13732+ ?. ?=(%union -.body.sh) |

13733+ ?. ?=([* [* ~]] cases.body.sh) |

13734+ =/ a=(unit [tag=@ fields=(list field)]) (grec-tagged-fields i.cases.body.sh)

13735+ =/ b=(unit [tag=@ fields=(list field)]) (grec-tagged-fields i.t.cases.body.sh)

13736+ ?~ a |

13737+ ?~ b |

13738+ ?. !=(tag.u.a tag.u.b) |

13739+ ?. ?=([* ~] fields.u.a) |

13740+ =/ value=field i.fields.u.a

13741+ ?. ?=(%face -.value) |

13742+ ?. ?=(%aura -.shape.value) |

13743+ ?. =(%t aura.shape.value) |

13744+ =/ selected=(unit field) (grec-tree-children fields.u.b param)

13745+ ?~ selected |

13746+ =/ kids=field u.selected

13747+ ?. ?=(%face -.kids) |

13748+ ?. ?=(%apply -.shape.kids) |

13749+ ?. =(ref.shape.kids ~[%list]) |

13750+ ?. ?=([* ~] args.shape.kids) |

13751+ =/ self=shape i.args.shape.kids

13752+ ?. ?=(%apply -.self) |

13753+ ?. =(ref.self ~[name]) |

13754+ ?. ?=([* ~] args.self) |

13755+ ?. ?=(%tvar -.i.args.self) |

13756+ =(name.i.args.self param)

13757++$ grec-collected [molds=imolds proofs=(map term shape)]

13758+:: Experimental one-layer analysis view, never an exported mold identity.

13759+++ grec-unfold-view

13760+ |= [typ=itype fuel=@ud]

13761+ ^- (unit [view=itype left=@ud])

13762+ ?. ?=(%grec -.typ) ~

13763+ ?: =(fuel 0) ~

13764+ ?. ?=([* ~] args.typ) ~

13765+ =/ sh=shape proof.typ

13766+ ?. (grec-tree-proof name.typ sh) ~

13767+ ?> ?=(%generic -.sh)

13768+ ?> ?=([@ ~] vars.sh)

13769+ ?> ?=(%union -.body.sh)

13770+ ?> ?=([* [* ~]] cases.body.sh)

13771+ =/ ca=shape i.cases.body.sh

13772+ =/ cb=shape i.t.cases.body.sh

13773+ ?> ?=(%cell -.ca)

13774+ ?> ?=(%cell -.cb)

13775+ ?> ?=([* [* ~]] fields.ca)

13776+ ?> ?=([* *] fields.cb)

13777+ =/ tag-a=field i.fields.ca

13778+ =/ tag-b=field i.fields.cb

13779+ ?> ?=(%bare -.tag-a)

13780+ ?> ?=(%bare -.tag-b)

13781+ ?> ?=(%const -.shape.tag-a)

13782+ ?> ?=(%const -.shape.tag-b)

13783+ =/ text-field=field i.t.fields.ca

13784+ ?> ?=(%face -.text-field)

13785+ =/ branch=(list field) t.fields.cb

13786+ =/ kids=(unit field) (grec-tree-children branch i.vars.sh)

13787+ ?~ kids ~

13788+ ?> ?=(%face -.u.kids)

13789+ =/ children=itype [%face name.u.kids [%collection %list ~[typ]]]

13790+ ?> ?=(^ branch)

13791+ =/ payload=itype

13792+ ?~ t.branch children

13793+ =/ event=field i.branch

13794+ ?> ?=(%face -.event)

13795+ [%cell [%face name.event [%fn [%atom %t] i.args.typ]] children]

13796+ =/ leaf=itype [%cell [%const lit.shape.tag-a] [%face name.text-field [%atom %t]]]

13797+ =/ node=itype [%cell [%const lit.shape.tag-b] payload]

13798+ `[[%union ~[leaf node] ~ ~ ~] (dec fuel)]

13799+::

13800+++ grec-collect-molds

13801+ |= ds=(list def)

13802+ ^- grec-collected

13803+ ?~ ds [~ *(map term shape)]

13804+ =/ rest=grec-collected $(ds t.ds)

13805+ ?. ?=(%mold -.i.ds) rest

13806+ =/ name=term name.i.ds

13807+ =/ body=shape shape.i.ds

13808+ =/ proofs=(map term shape) proofs.rest

13809+ =? proofs (grec-tree-proof name body) (~(put by proofs) name body)

13810+ [[[name body] molds.rest] proofs]

13811+::

13812+

5710--

13813--

jibb-dev/lib/jibb/internal.jibbnew file+33

@@ -0,0 +1,33 @@

1+/= core /lib/jibb/primitives

3+:: Representation for agent and in-process store pokes.

4+:: The prelude re-exports this mold; effect lowering and the runtime must

5+:: agree on these cells when effect execution is implemented.

6++$ poke

7+ [%agent agent=@tas mark=@tas payload=*]

8+ [%store module=@t action=@tas payload=*]

10+:: The compiler supplies this private interface; execution is not yet implemented.

11+++ gth-atom |= args=[A A] (raw-gth.core args)

12+

13+:: Application paths are knot sequences.

14++$ qath

15+ ~

16+ [i=@ta t=qath]

17+

18+:: Private compiler primitive wrappers; execution is a later milestone.

19+++ add-atom |= args=[A A] (raw-add.core args)

20+++ dec-atom |= atom=A (raw-dec.core atom)

21+++ trip-text |= value=@t (raw-trip.core value)

22+++ tuba-text |= values (raw-tuba.core values)

23+

24+:: Transparent request data. Identity and path fields are writable and do not

25+:: prove a schema or watchability. A future executor must bind them to checked

26+:: source evidence and validate facts and state; generated receivers must

27+:: decode before calling typed replies or folds. Runtime validation, watch

28+:: provenance and effect execution are not implemented.

29++$ agent-path (list.core @ta)

30++$ ask |$ [M]

31+ [%pure value=M]

32+ [%agent api=@t case=@tas agent=@tas path=agent-path scry=(unit.core agent-path) receive=$-([mark=@tas state=(unit.core *) fact=*] [state=* message=M])]

33+ [%store module=@t name=@tas receive=$-([state=(unit.core *) fact=*] [state=* message=M])]

jibb-dev/lib/jibb/prelude.jibb+354−24

@@ -1,4 +1,9 @@

1+/= internal /lib/jibb/internal

2++$ poke poke.internal

3++$ qath qath.internal

1:: Initial prelude functions. The rest of the inventory is still to come.

5:: Initial prelude functions. The rest of the inventory is still to come.

2++ same |= x=A x

7++ same |= x=A x

4++ head |= p=[A B]

9++ head |= p=[A B]

@@ -37,16 +42,18 @@

37++ weld |= args=[(list A) (list A)]

42++ weld |= args=[(list A) (list A)]

38 ?- args

43 ?- args

39 [xs ys]

44 [xs ys]

45+ ^- (list A)

40− ?- xs

46+ ?- xs

41− ~ ys

47+ ~ ys

42− [item rest] [item (weld rest ys)]

48+ [item rest] [item (weld rest ys)]

44++ turn |= args=[(list A) $-(A B)]

50++ turn |= args=[(list A) $-(A B)]

45 ?- args

51 ?- args

46 [xs f]

52 [xs f]

53+ ^- (list B)

47− ?- xs

54+ ?- xs

48− ~ ~

55+ ~ ~

49− [item rest] [(f item) (turn rest f)]

56+ [item rest] [(f item) (turn rest f)]

51+$ dime [p=@ta q=@]

58+$ dime [p=@ta q=@]

@@ -94,6 +101,14 @@

101

95+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

102+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

103

104+++ like |= [f=$-(A B) result=(like A)]

105+ ++ mapped

106+ ^- (unit [p=B q=nail])

107+ ?- q.result

108+ ~ ~

109+ [~ value] `[p=(f p.value) q=q.value]

110+ ^- (like B) [p=p.result q=mapped]

111+

97++ wonk |= veq=(like A)

112++ wonk |= veq=(like A)

98 ?- q.veq

113 ?- q.veq

99 ~ !!

114 ~ !!

@@ -138,40 +153,355 @@

138 (reverse-into xs ~)

153 (reverse-into xs ~)

139

154

140++ drop |= maybe=(unit A)

155++ drop |= maybe=(unit A)

156+ ^- (list A)

141− ?- maybe

157+ ?- maybe

142− ~ ~

158+ ~ ~

143− [~ value] [value ~]

159+ [~ value] [value ~]

160+

161+++ bond |= fallback=$-(~ A)

162+ |= maybe=(unit A)

163+ ?- maybe

164+ ~ (fallback ~)

165+ [~ value] value

144

166

145++ bind |= args=[(unit A) $-(A B)]

167++ bind |= args=[(unit A) $-(A B)]

146 ?- args

168 ?- args

147− [maybe f]

169+ [maybe f] ^- (unit B)

148 ?- maybe

170 ?- maybe

149 ~ ~

171 ~ ~

150 [~ value] `(f value)

172 [~ value] `(f value)

151

173

152++ biff |= args=[(unit A) $-(A (unit B))]

174++ biff |= args=[(unit A) $-(A (unit B))]

153 ?- args

175 ?- args

154− [maybe f]

176+ [maybe f] ^- (unit B)

155 ?- maybe

177 ?- maybe

156 ~ ~

178 ~ ~

157 [~ value] (f value)

179 [~ value] (f value)

158

180

159−++ skim |= args=[(list A) $-(A ?)]

181+++ both |= args=[(unit A) (unit B)]

160 ?- args

182 ?- args

161− [xs predicate]

183+ [first second] ^- (unit [A B])

162− ?- xs

184+ ?- first

163 ~ ~

185 ~ ~

186+ [~ a]

187+ ?- second

188+ ~ ~

189+ [~ b] `[a b]

190+

191+++ clap |= args=[(unit A) (unit A) $-([A A] A)]

192+ ?- args

193+ [first second combine] ^- (unit A)

194+ ?- first

195+ ~ second

196+ [~ a]

197+ ?- second

198+ ~ first

199+ [~ b] `(combine a b)

200+

201+++ clef |= args=[(unit A) (unit B) $-([A B] (unit C))]

202+ ?- args

203+ [first second combine] ^- (unit C)

204+ ?- first

205+ ~ ~

206+ [~ a]

207+ ?- second

208+ ~ ~

209+ [~ b] (combine a b)

210+

211+++ skim |= args=[(list A) $-(A ?)]

212+ ?- args

213+ [xs predicate] ^- (list A)

214+ ?- xs

215+ ~ ~

164− [item rest]

216+ [item rest]

165− ?- (predicate item)

217+ ?- (predicate item)

166− %.y [item (skim rest predicate)]

218+ %.y [item (skim rest predicate)]

167− %.n (skim rest predicate)

219+ %.n (skim rest predicate)

168

220

169++ skip |= args=[(list A) $-(A ?)]

221++ skip |= args=[(list A) $-(A ?)]

170 ?- args

222 ?- args

171− [xs predicate]

223+ [xs predicate] ^- (list A)

224+ ?- xs

225+ ~ ~

226+ [item rest]

227+ ?- (predicate item)

228+ %.y (skip rest predicate)

229+ %.n [item (skip rest predicate)]

230+

231+++ levy |= args=[(list A) $-(A ?)]

232+ ^- ?

233+ ?- args

234+ [xs predicate]

235+ ?- xs

236+ ~ %.y

237+ [item rest]

238+ ?- (predicate item)

239+ %.y (levy rest predicate)

240+ %.n %.n

241+

242+++ lien |= args=[(list A) $-(A ?)]

243+ ^- ?

244+ ?- args

245+ [xs predicate]

246+ ?- xs

247+ ~ %.n

248+ [item rest]

249+ ?- (predicate item)

250+ %.y %.y

251+ %.n (lien rest predicate)

252+

253+++ roll |= args=[(list A) B $-([A B] B)]

254+ ?- args

255+ [xs start combine]

172 ?- xs

256 ?- xs

173− ~ ~

257+ ~ start

174− [item rest]

258+ [item rest] (roll rest (combine item start) combine)

259+

260+++ reel |= args=[(list A) B $-([A B] B)]

261+ ?- args

262+ [xs start combine]

263+ ?- xs

264+ ~ start

265+ [item rest] (combine item (reel rest start combine))

266+

267+++ flit |= predicate=$-(A ?)

268+ |= value=A

269+ ^- (unit A)

175− ?- (predicate item)

270+ ?- (predicate value)

176− %.y (skip rest predicate)

271+ %.y `value

177− %.n [item (skip rest predicate)]

272+ %.n ~

273+

274+++ murn |= args=[(list A) $-(A (unit B))]

275+ ?- args

276+ [xs f] ^- (list B)

277+ ?- xs

278+ ~ ~

279+ [item rest]

280+ ?- (f item)

281+ ~ (murn rest f)

282+ [~ value] [value (murn rest f)]

283+

284+++ join |= args=[A (list A)]

285+ ?- args

286+ [separator xs] ^- (list A)

287+ ?- xs

288+ ~ ~

289+ [item rest]

290+ ?- rest

291+ ~ [item ~]

292+ [next more] [item [separator (join separator rest)]]

293+

294+++ snip |= xs=(list A)

295+ ^- (list A)

296+ ?- xs

297+ ~ ~

298+ [item rest]

299+ ?- rest

300+ ~ ~

301+ [next more] [item (snip rest)]

302+

303+++ rear |= xs=(list A)

304+ ?- xs

305+ ~ !!

306+ [item rest]

307+ ?- rest

308+ ~ item

309+ [next more] (rear rest)

310+

311+++ cork |= gates=[$-(A B) $-(B C)]

312+ ?- gates

313+ [f g] |= x=A (g (f x))

314+

315+++ corl |= gates=[$-(B C) $-(A B)]

316+ ?- gates

317+ [f g] |= x=A (f (g x))

318+

319+++ cury |= args=[$-([A B] C) A]

320+ ?- args

321+ [f a] |= b=B (f a b)

322+

323+++ curr |= args=[$-([A B] C) B]

324+ ?- args

325+ [f b] |= a=A (f a b)

326+

327++$ cmd |$ [M]

328+ [%poke p=poke reply=$-((unit @t) M)]

329+ [%go url=@t]

330+ [%wait gap=@dr msg=M]

331+ [%now reply=$-(@da M)]

332+ [%who reply=$-(@p M)]

333+

334+++ gth |= args=[A A] (gth-atom.internal args)

335+++ add |= args=[A A] (add-atom.internal args)

336+++ dec |= atom=A (dec-atom.internal atom)

337+

338++$ ask |$ [M] (ask.internal M)

339+++ pure |= x=M ^- (ask M) [%pure x]

340+

341+:: This mold describes the value; island watchability needs separate proof.

342++$ sub |$ [M]

343+ [%watch a=(ask M)]

344+ [%every gap=@dr reply=$-(@da M)]

345+ [%url reply=$-(path M)]

346+

347+:: Count a finite list with the source-backed addition gate.

348+++ lent |= xs=(list A)

349+ ^- @ud

350+ ?- xs

351+ ~ 0

352+ [item rest] (add 1 (lent rest))

353+

354+++ lth |= args=[A A]

355+ ?- args

356+ [x y] (gth y x)

357+

358+++ gte |= args=[A A]

359+ ?- args

360+ [x y] (not (gth y x))

361+

362+++ lte |= args=[A A]

363+ ?- args

364+ [x y] (not (gth x y))

365+

366+++ zing |= xss=(list (list A))

367+ ^- (list A)

368+ ?- xss

369+ ~ ~

370+ [xs rest] (weld xs (zing rest))

371+

372+++ lead |= first=A |= second=B [first second]

373+++ late |= second=B |= first=A [first second]

374+

375+++ succ |= x=A (add x 1)

376+

377+++ trip |= value=@t (trip-text.internal value)

378+++ tuba |= values=(list @tD) (tuba-text.internal values)

379+

380+:: UI values are source-level descriptions only. Nested element payloads are

381+:: erased in the nonrecursive union; the public constructors below retain the

382+:: typed composition boundaries. Raw-constructor encapsulation, rendering and

383+:: execution are not established by this slice.

384++$ length

385+ [%chars n=@ud]

386+ [%fill n=@ud]

387+ %shrink

388+

389++$ align

390+ %start

391+ %center

392+ %end

393+

394++$ role

395+ %body

396+ %caption

397+ %label

398+

399++$ tone

400+ %normal

401+ %muted

402+ %accent

403+ %danger

404+

405++$ attr

406+ [%pad %s0]

407+ [%pad %s1]

408+ [%pad %s2]

409+ [%pad %s3]

410+ [%gap %s0]

411+ [%gap %s1]

412+ [%gap %s2]

413+ [%gap %s3]

414+ [%width width=length]

415+ [%align align=align]

416+ [%role role=role]

417+ [%tone tone=tone]

418+

419++$ element |$ [M]

420+ [%row attrs=(list attr) kids=*]

421+ [%column attrs=(list attr) kids=*]

422+ [%wrap attrs=(list attr) kids=*]

423+ [%stack attrs=(list attr) kids=*]

424+ [%el attrs=(list attr) kid=*]

425+ [%para kids=*]

426+ [%text words=@t]

427+ [%heading level=@ud words=@t]

428+ [%each items=*]

429+ [%table columns=* rows=*]

430+ [%image source=qath description=@t]

431+ [%image-unsafe source=[url=@t width=@ud height=@ud] description=@t]

432+ [%link target=qath label=@t]

433+ [%link-unsafe target=@t label=@t]

434+ [%button label=@t message=M]

435+ [%toggle on=? label=@t message=M]

436+ [%field label=@t value=@t reply=$-(@t M)]

437+ [%form message=M kids=*]

438+ [%island payload=*]

439+

440+++ row |= [attrs=(list attr) kids=(list (element M))]

441+ ^- (element M) [%row attrs kids]

442+

443+++ column |= [attrs=(list attr) kids=(list (element M))]

444+ ^- (element M) [%column attrs kids]

445+

446+++ wrap |= [attrs=(list attr) kids=(list (element M))]

447+ ^- (element M) [%wrap attrs kids]

448+

449+++ stack |= [attrs=(list attr) kids=(list (element M))]

450+ ^- (element M) [%stack attrs kids]

451+

452+++ el |= [attrs=(list attr) kid=(element M)]

453+ ^- (element M) [%el attrs kid]

454+

455+++ para |= kids=(list (element M))

456+ ^- (element M) [%para kids]

457+

458+++ text |= words=@t

459+ ^- (element M) [%text words]

460+

461+++ heading |= [level=@ud words=@t]

462+ ^- (element M) [%heading level words]

463+

464+++ each |= items=(list [key=K el=(element M)])

465+ ^- (element M) [%each items]

466+

467+++ table |= [columns=(list [header=@t width=length align=align]) rows=(list [key=K cells=(list (element M))])]

468+ ^- (element M) [%table columns rows]

469+

470+++ image |= [source=qath description=@t]

471+ ^- (element M) [%image source description]

472+

473+++ image-unsafe |= [source=[url=@t width=@ud height=@ud] description=@t]

474+ ^- (element M) [%image-unsafe source description]

475+

476+++ link |= [target=qath label=@t]

477+ ^- (element M) [%link target label]

478+

479+++ link-unsafe |= [target=@t label=@t]

480+ ^- (element M) [%link-unsafe target label]

481+

482+++ button |= [label=@t message=M]

483+ ^- (element M) [%button label message]

484+

485+++ toggle |= [on=? label=@t message=M]

486+ ^- (element M) [%toggle on label message]

487+

488+++ field |= [label=@t value=@t reply=$-(@t M)]

489+ ^- (element M) [%field label value reply]

490+

491+++ form |= [message=M kids=(list (element M))]

492+ ^- (element M) [%form message kids]

493+

494++$ program |$ [D X M]

495+ [init=$-(D X) update=$-([M X] [X (list (cmd M))]) view=$-(X (element M)) subs=$-(X (list (sub M)))]

496+

497+++ program |= [init=$-(D X) update=$-([M X] [X (list (cmd M))]) view=$-(X (element M)) subs=$-(X (list (sub M)))]

498+ ^- (program D X M) [init update view subs]

499+

500+++ island |= [p=(program D X M) data=D]

501+ ^- (element !!) [%island [p data]]

502+

503++$ page |$ [R D]

504+ [load=$-(R (ask D)) view=$-(D (element !!))]

505+

506+++ page |= [load=$-(R (ask D)) view=$-(D (element !!))]

507+ ^- (page R D) [load view]

my-app/sur/blog.hoon+1

@@ -2,4 +2,5 @@

2|%

3+$ title @t

4+$ post [title=title slug=@ta]

5++$ chain $@(~ [value=@ud next=chain])

5--

6--

my-app/sur/import-fixture.hoon+2

@@ -2,4 +2,6 @@

2:: Fixture for the Hoon importer; not supplied by the design doc.

3|%

4+$ sample [title=title:blog values=(list @ud)]

5++$ recursive chain:blog

6++$ nested [id=@ud value=$^(@ud [a=@ud b=@t])]

5--

7--

tests/clay-fixtures/ford-nested-union-bridge-expected.txtnew file+1

@@ -0,0 +1 @@

1+'partial inference; module not checked\0a++ value: $-([id=@ud value=([a=@ud b=@t] @ud)] ([a=@ud b=@t] @ud))\0a++ values: $-([title=@t values=(list @ud)] (list @ud))\0a++ chain: $-(chain.blog chain.blog)'

tests/clay-fixtures/ford-nested-union-bridge.txtnew file+14

@@ -0,0 +1,14 @@

1+=/ m (strand ,vase)

2+;< =bowl:spider bind:m get-bowl

3+=/ now=@da now.bowl

4+=/ src=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/sur/import-fixture/hoon)

5+=/ blog=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/sur/blog/hoon)

6+=/ reader=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/lib/jibb-import/hoon)

7+=/ jibb=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/lib/jibb/hoon)

8+=/ read-gate=vase (slap reader (ream 'read-named'))

9+=/ result=vase (slym read-gate [%import-fixture %nested -.src])

10+=/ sample-result=vase (slym read-gate [%import-fixture %sample -.src])

11+=/ chain-result=vase (slym read-gate [%blog %chain -.blog])

12+=/ check-gate=vase (slap jibb (ream 'golden-types-imports'))

13+=/ text=@t '/- import-fixture\0a/- blog\0a++ value |= x=nested.import-fixture value.x\0a++ values |= x=sample.import-fixture values.x\0a++ chain |= x=chain.blog x\0a'

14+(pure:m (slym check-gate [/ui/test/jibb text ~[[%import-fixture %nested +.result] [%import-fixture %sample +.sample-result] [%blog %chain +.chain-result]]]))

tests/clay-fixtures/ford-nested-union-expected.txtnew file+1

@@ -0,0 +1 @@

1+"[id=@ud value=(union [a=@ud b=@t] @ud)]"

tests/clay-fixtures/ford-nested-union.txtnew file+9

@@ -0,0 +1,9 @@

1+=/ m (strand ,vase)

2+;< =bowl:spider bind:m get-bowl

3+=/ now=@da now.bowl

4+=/ src=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/sur/import-fixture/hoon)

5+=/ reader=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/lib/jibb-import/hoon)

6+=/ read-gate=vase (slap reader (ream 'read-named'))

7+=/ got=vase (slym read-gate [%import-fixture %nested -.src])

8+=/ show-gate=vase (slap reader (ream 'show-result'))

9+(pure:m (slym show-gate +.got))

tests/clay-fixtures/ford-recursive-expected.txtnew file+1

@@ -0,0 +1 @@

1+"(union [value=@ud next=chain.blog] @n:0)"

tests/clay-fixtures/ford-recursive.txtnew file+9

@@ -0,0 +1,9 @@

1+=/ m (strand ,vase)

2+;< =bowl:spider bind:m get-bowl

3+=/ now=@da now.bowl

4+=/ src=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/sur/import-fixture/hoon)

5+=/ reader=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/lib/jibb-import/hoon)

6+=/ read-gate=vase (slap reader (ream 'read-named'))

7+=/ got=vase (slym read-gate [%import-fixture %recursive -.src])

8+=/ show-gate=vase (slap reader (ream 'show-result'))

9+(pure:m (slym show-gate +.got))

tests/clay-fixtures/mark-update-import-expected.txtnew file+1

@@ -0,0 +1 @@

1+"(union [added item=[id=@ud [done=(union @f:0 @f:1) text=@t]]] [toggled id=@ud])"

tests/clay-fixtures/mark-update-import.txtnew file+9

@@ -0,0 +1,9 @@

1+=/ m (strand ,vase)

2+;< =bowl:spider bind:m get-bowl

3+=/ now=@da now.bowl

4+=/ mark=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/mar/todo-update/hoon)

5+=/ reader=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/lib/jibb-import/hoon)

6+=/ read-gate=vase (slap reader (ream 'read-mark'))

7+=/ got=vase (slym read-gate [%todo-update -.mark])

8+=/ show-gate=vase (slap reader (ream 'show-result'))

9+(pure:m (slym show-gate +.got))

tests/clay-fixtures/record-bridge-expected.txtnew file+1

@@ -0,0 +1 @@

1+'partial inference; module not checked\0a++ title: $-([title=@t slug=@ta] @t)'

tests/clay-fixtures/record-bridge.txtnew file+11

@@ -0,0 +1,11 @@

1+=/ m (strand ,vase)

2+;< =bowl:spider bind:m get-bowl

3+=/ now=@da now.bowl

4+=/ blog=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/sur/blog/hoon)

5+=/ reader=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/lib/jibb-import/hoon)

6+=/ jibb=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/lib/jibb/hoon)

7+=/ read-gate=vase (slap reader (ream 'read-named'))

8+=/ post-result=vase (slym read-gate [%blog %post -.blog])

9+=/ check-gate=vase (slap jibb (ream 'golden-types-imports'))

10+=/ src=@t '/- blog\0a++ title |= x=post.blog title.x\0a'

11+(pure:m (slym check-gate [/ui/test/jibb src ~[[%blog %post +.post-result]]]))

tests/clay-fixtures/tlon-mop-expected.txtnew file+1

@@ -0,0 +1 @@

1+[%.y %.y %.y]

tests/clay-fixtures/tlon-mop.txtnew file+20

@@ -0,0 +1,20 @@

1+=/ m (strand ,vase)

2+;< =bowl:spider bind:m get-bowl

3+=/ now=@da now.bowl

4+=/ src=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/sur/mop-tlon-probe/hoon)

5+=/ reader=vase .^(vase %ca /[(scot %p our.bowl)]/my-app/[(scot %da now)]/lib/jibb-import/hoon)

6+=/ read-gate=vase (slap reader (ream 'read-named'))

7+=/ result=vase (slym read-gate [%notes %log -.src])

8+=/ recursive=vase (slym read-gate [%notes %import-node -.src])

9+=/ nested=vase (slym read-gate [%notes %a-notebook -.src])

10+=/ contains-ref

11+ |= node=*

12+ ?: =(node [%ref %notes %import-node]) &

13+ ?@ node |

14+ |($(node -.node) $(node +.node))

15+=/ contains-named

16+ |= node=*

17+ ?: ?=([%named %notes %import-node [%fork *]] node) (contains-ref node)

18+ ?@ node |

19+ |($(node -.node) $(node +.node))

20+(pure:m !>([?=([%& [%apply %mop [[%atom %da ~] [%fork *] ~]]] +.result) &(?=([%& [%fork *]] +.recursive) (contains-ref +.recursive)) &(?=([%& [%fork *]] +.nested) (contains-named +.nested))]))

tests/golden/doc-grammar-04-step/about.txt+1

@@ -1,3 +1,4 @@

1source: Grammar tab, section "Patterns", code block 4 of the tab

2tests: a union `+$ step` with one case per deeper line: cells with tags at the head, in the middle and at the end, faced fields, and a bare term; a blank line between definitions; a `?-` whose arms are cell patterns mixing tags and binding names, and a bare term, with their expressions aligned by extra spaces; interpolated strings and a name as arm expressions

3expect: parses

4+expect-types: a partial inference report

tests/golden/doc-grammar-04-step/modules.txtnew file+1

@@ -0,0 +1 @@

1+# no module fixtures

tests/golden/doc-grammar-04-step/source.jibb+1−1

@@ -10,5 +10,5 @@

10 [%move %left n] "left {n}"

11 [%move %right n] "right {n}"

12 [t %draft] t

13− [t %sent at] t

13+ [t %sent sent-at] t

14 %stop "stop"

tests/golden/doc-grammar-04-step/tokens.txt+2−2

@@ -74,8 +74,8 @@

7413:5 glyph [

7513:6 tight name t

7613:8 lit %sent

77−13:14 name at

77+13:14 name sent-at

78−13:16 tight glyph ]

78+13:21 tight glyph ]

7913:23 name t

8014:5 NEWLINE

8114:5 lit %stop

tests/golden/doc-grammar-04-step/tree.txt+1−1

@@ -33,6 +33,6 @@

33 (cell 12:5 (bind 12:6 t) (lit 12:8 %draft))

34 (wing 12:23 t))

35 (arm 13:5

36− (cell 13:5 (bind 13:6 t) (lit 13:8 %sent) (bind 13:14 at))

36+ (cell 13:5 (bind 13:6 t) (lit 13:8 %sent) (bind 13:14 sent-at))

37 (wing 13:23 t))

38 (arm 14:5 (lit 14:5 %stop) (str 14:23 "stop")))))))

tests/golden/doc-grammar-04-step/types.txtnew file+3

@@ -0,0 +1,3 @@

1+partial inference; module not checked

2++$ step: cases proven disjoint; mold not checked

3+++ describe: $-(step @t)

tests/golden/doc-grammar-06-cart-store/about.txt+1

@@ -1,3 +1,4 @@

1source: Grammar tab, section "Example: a store and an island", code block 6 of the tab (block 5 is the EBNF)

2tests: a store module: a record mold with a mold application and the loobean mold `?`; a union with its cases below; a mold that is a name; a blank line; `++ main (store init update)`; a cast with its mold and expression on one line, `^- state [~ %.n]`; a gate with a cell sample; `?-` arms whose expressions are changes, `s(items=[item items.s])` and `s(open=(not open.s))`

3expect: parses

4+expect-types: a partial inference report; store kind and declaration scope remain unresolved

tests/golden/doc-grammar-06-cart-store/modules.txtnew file+1

@@ -0,0 +1 @@

1+# no module fixtures

tests/golden/doc-grammar-06-cart-store/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+module kind or scope needs unsupported inference

tests/golden/inline-mold-opaque/about.txt+2−2

@@ -1,3 +1,3 @@

1−source: Grammar tab, Molds: "Opaque: `poke`, `ask` and `qath`, built only by derived gates, `pure` and application-path literals."

1+source: Grammar tab, Molds: "`poke`, `ask` and `qath` are transparent types, defined in the internal prelude and re-exported normally; callers can construct and inspect their values."

2−tests: the opaque molds by name

2+tests: the effect and application-path types by name

3expect: parses

tests/golden/module-cache-dag/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module and import cycles are errors.

2+tests: A shared acyclic graph imports each library twice under distinct faces; the reachable identity still infers.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-cache-dag/module-trees.txtnew file+46

@@ -0,0 +1,46 @@

1+/ui/n0.jibb

2+(module

3+ (jibb 1:1 left /ui/n1)

4+ (jibb 2:1 right /ui/n1)

5+ (value 3:1 id

6+ (gate-wide 3:7 (bind 3:10 x) (wing 3:12 x))))

7+/ui/n1.jibb

8+(module

9+ (jibb 1:1 left /ui/n2)

10+ (jibb 2:1 right /ui/n2)

11+ (value 3:1 id

12+ (gate-wide 3:7 (bind 3:10 x) (wing 3:12 x))))

13+/ui/n2.jibb

14+(module

15+ (jibb 1:1 left /ui/n3)

16+ (jibb 2:1 right /ui/n3)

17+ (value 3:1 id

18+ (gate-wide 3:7 (bind 3:10 x) (wing 3:12 x))))

19+/ui/n3.jibb

20+(module

21+ (jibb 1:1 left /ui/n4)

22+ (jibb 2:1 right /ui/n4)

23+ (value 3:1 id

24+ (gate-wide 3:7 (bind 3:10 x) (wing 3:12 x))))

25+/ui/n4.jibb

26+(module

27+ (jibb 1:1 left /ui/n5)

28+ (jibb 2:1 right /ui/n5)

29+ (value 3:1 id

30+ (gate-wide 3:7 (bind 3:10 x) (wing 3:12 x))))

31+/ui/n5.jibb

32+(module

33+ (jibb 1:1 left /ui/n6)

34+ (jibb 2:1 right /ui/n6)

35+ (value 3:1 id

36+ (gate-wide 3:7 (bind 3:10 x) (wing 3:12 x))))

37+/ui/n6.jibb

38+(module

39+ (jibb 1:1 left /ui/n7)

40+ (jibb 2:1 right /ui/n7)

41+ (value 3:1 id

42+ (gate-wide 3:7 (bind 3:10 x) (wing 3:12 x))))

43+/ui/n7.jibb

44+(module

45+ (value 1:1 id

46+ (gate-wide 1:7 (bind 1:10 x) (wing 1:12 x))))

tests/golden/module-cache-dag/modules.txtnew file+8

@@ -0,0 +1,8 @@

1+/ui/n0.jibb

2+/ui/n1.jibb

3+/ui/n2.jibb

4+/ui/n3.jibb

5+/ui/n4.jibb

6+/ui/n5.jibb

7+/ui/n6.jibb

8+/ui/n7.jibb

tests/golden/module-cache-dag/modules/ui/n0.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= left /ui/n1

2+/= right /ui/n1

3+++ id |=(x x)

tests/golden/module-cache-dag/modules/ui/n1.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= left /ui/n2

2+/= right /ui/n2

3+++ id |=(x x)

tests/golden/module-cache-dag/modules/ui/n2.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= left /ui/n3

2+/= right /ui/n3

3+++ id |=(x x)

tests/golden/module-cache-dag/modules/ui/n3.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= left /ui/n4

2+/= right /ui/n4

3+++ id |=(x x)

tests/golden/module-cache-dag/modules/ui/n4.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= left /ui/n5

2+/= right /ui/n5

3+++ id |=(x x)

tests/golden/module-cache-dag/modules/ui/n5.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= left /ui/n6

2+/= right /ui/n6

3+++ id |=(x x)

tests/golden/module-cache-dag/modules/ui/n6.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= left /ui/n7

2+/= right /ui/n7

3+++ id |=(x x)

tests/golden/module-cache-dag/modules/ui/n7.jibbnew file+1

@@ -0,0 +1 @@

1+++ id |=(x x)

tests/golden/module-cache-dag/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= a /ui/n0

2+++ value (id.a "hi")

tests/golden/module-cache-dag/tokens.txtnew file+14

@@ -0,0 +1,14 @@

1+1:1 glyph /=

2+1:5 name a

3+1:7 glyph /

4+1:8 tight knot ui

5+1:10 tight glyph /

6+1:11 tight knot n0

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name value

10+2:10 glyph (

11+2:11 tight wing id.a

12+2:16 str "hi"

13+2:20 tight glyph )

14+2:21 NEWLINE

tests/golden/module-cache-dag/tree.txtnew file+5

@@ -0,0 +1,5 @@

1+(module

2+ (jibb 1:1 a /ui/n0)

3+ (value 2:1 value

4+ (group 2:10

5+ (call 2:11 (wing 2:11 id.a) (str 2:16 "hi")))))

tests/golden/module-cache-dag/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+++ value: @t

tests/golden/module-cache-faces/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "Everything is exported and read through the import's face"; Imports: "Import cycles are errors".

2+tests: The same library reached under two faces has independently instantiated identity schemes.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-cache-faces/module-trees.txtnew file+4

@@ -0,0 +1,4 @@

1+/ui/shared.jibb

2+(module

3+ (value 1:1 id

4+ (gate-wide 1:7 (bind 1:10 x) (wing 1:12 x))))

tests/golden/module-cache-faces/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/shared.jibb

tests/golden/module-cache-faces/modules/ui/shared.jibbnew file+1

@@ -0,0 +1 @@

1+++ id |=(x x)

tests/golden/module-cache-faces/source.jibbnew file+4

@@ -0,0 +1,4 @@

1+/= first /ui/shared

2+/= second /ui/shared

3+++ ship (id.first ~zod)

4+++ text-value (id.second "hi")

tests/golden/module-cache-faces/tokens.txtnew file+28

@@ -0,0 +1,28 @@

1+1:1 glyph /=

2+1:5 name first

3+1:11 glyph /

4+1:12 tight knot ui

5+1:14 tight glyph /

6+1:15 tight knot shared

7+2:1 NEWLINE

8+2:1 glyph /=

9+2:5 name second

10+2:12 glyph /

11+2:13 tight knot ui

12+2:15 tight glyph /

13+2:16 tight knot shared

14+3:1 NEWLINE

15+3:1 glyph ++

16+3:4 name ship

17+3:9 glyph (

18+3:10 tight wing id.first

19+3:19 lit ~zod

20+3:23 tight glyph )

21+4:1 NEWLINE

22+4:1 glyph ++

23+4:4 name text-value

24+4:15 glyph (

25+4:16 tight wing id.second

26+4:26 str "hi"

27+4:30 tight glyph )

28+4:31 NEWLINE

tests/golden/module-cache-faces/tree.txtnew file+9

@@ -0,0 +1,9 @@

1+(module

2+ (jibb 1:1 first /ui/shared)

3+ (jibb 2:1 second /ui/shared)

4+ (value 3:1 ship

5+ (group 3:9

6+ (call 3:10 (wing 3:10 id.first) (lit 3:19 ~zod))))

7+ (value 4:1 text-value

8+ (group 4:15

9+ (call 4:16 (wing 4:16 id.second) (str 4:26 "hi")))))

tests/golden/module-cache-faces/types.txtnew file+3

@@ -0,0 +1,3 @@

1+partial inference; module not checked

2+++ ship: @p

3+++ text-value: @t

tests/golden/module-cache-incomplete/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "Everything is exported and read through the import's face"; Imports: "Import cycles are errors".

2+tests: A shared library with a recursive mold, which partial inference does not yet support, yields no interface even though one value could be inferred.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-cache-incomplete/module-trees.txtnew file+8

@@ -0,0 +1,8 @@

1+/ui/bad.jibb

2+(module

3+ (mold 1:1 recursive

4+ (cell 1:14

5+ (face 1:15 next (ref 1:20 recursive))

6+ (face 1:30 value (aura 1:36 @t))))

7+ (value 2:1 id

8+ (gate-wide 2:7 (bind 2:10 x) (wing 2:12 x))))

tests/golden/module-cache-incomplete/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/bad.jibb

tests/golden/module-cache-incomplete/modules/ui/bad.jibbnew file+2

@@ -0,0 +1,2 @@

1++$ recursive [next=recursive value=@t]

2+++ id |=(x x)

tests/golden/module-cache-incomplete/source.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= first /ui/bad

2+/= second /ui/bad

3+++ result (id.first "hi")

tests/golden/module-cache-incomplete/tokens.txtnew file+21

@@ -0,0 +1,21 @@

1+1:1 glyph /=

2+1:5 name first

3+1:11 glyph /

4+1:12 tight knot ui

5+1:14 tight glyph /

6+1:15 tight knot bad

7+2:1 NEWLINE

8+2:1 glyph /=

9+2:5 name second

10+2:12 glyph /

11+2:13 tight knot ui

12+2:15 tight glyph /

13+2:16 tight knot bad

14+3:1 NEWLINE

15+3:1 glyph ++

16+3:4 name result

17+3:11 glyph (

18+3:12 tight wing id.first

19+3:21 str "hi"

20+3:25 tight glyph )

21+3:26 NEWLINE

tests/golden/module-cache-incomplete/tree.txtnew file+6

@@ -0,0 +1,6 @@

1+(module

2+ (jibb 1:1 first /ui/bad)

3+ (jibb 2:1 second /ui/bad)

4+ (value 3:1 result

5+ (group 3:11

6+ (call 3:12 (wing 3:12 id.first) (str 3:21 "hi")))))

tests/golden/module-cache-incomplete/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+module mold needs unsupported inference: /ui/bad/jibb

tests/golden/module-cache-sibling-cycle/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "Everything is exported and read through the import's face"; Imports: "Import cycles are errors".

2+tests: A cycle reached after a previously checked sibling dependency is still reported.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-cache-sibling-cycle/module-trees.txtnew file+15

@@ -0,0 +1,15 @@

1+/ui/safe.jibb

2+(module

3+ (value 1:1 id

4+ (gate-wide 1:7 (bind 1:10 x) (wing 1:12 x))))

5+/ui/a.jibb

6+(module

7+ (jibb 1:1 shared /ui/safe)

8+ (jibb 2:1 next /ui/b)

9+ (value 3:1 id

10+ (gate-wide 3:7 (bind 3:10 x) (wing 3:12 x))))

11+/ui/b.jibb

12+(module

13+ (jibb 1:1 back /ui/a)

14+ (value 2:1 id

15+ (gate-wide 2:7 (bind 2:10 x) (wing 2:12 x))))

tests/golden/module-cache-sibling-cycle/modules.txtnew file+3

@@ -0,0 +1,3 @@

1+/ui/safe.jibb

2+/ui/a.jibb

3+/ui/b.jibb

tests/golden/module-cache-sibling-cycle/modules/ui/a.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= shared /ui/safe

2+/= next /ui/b

3+++ id |=(x x)

tests/golden/module-cache-sibling-cycle/modules/ui/b.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= back /ui/a

2+++ id |=(x x)

tests/golden/module-cache-sibling-cycle/modules/ui/safe.jibbnew file+1

@@ -0,0 +1 @@

1+++ id |=(x x)

tests/golden/module-cache-sibling-cycle/source.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= first /ui/safe

2+/= second /ui/a

3+++ result 1

tests/golden/module-cache-sibling-cycle/tokens.txtnew file+18

@@ -0,0 +1,18 @@

1+1:1 glyph /=

2+1:5 name first

3+1:11 glyph /

4+1:12 tight knot ui

5+1:14 tight glyph /

6+1:15 tight knot safe

7+2:1 NEWLINE

8+2:1 glyph /=

9+2:5 name second

10+2:12 glyph /

11+2:13 tight knot ui

12+2:15 tight glyph /

13+2:16 tight knot a

14+3:1 NEWLINE

15+3:1 glyph ++

16+3:4 name result

17+3:11 lit 1

18+3:12 NEWLINE

tests/golden/module-cache-sibling-cycle/tree.txtnew file+4

@@ -0,0 +1,4 @@

1+(module

2+ (jibb 1:1 first /ui/safe)

3+ (jibb 2:1 second /ui/a)

4+ (value 3:1 result (lit 3:11 1)))

tests/golden/module-cache-sibling-cycle/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+import cycle at /ui/a/jibb

tests/golden/module-fixture-eof/about.txtnew file+3

@@ -0,0 +1,3 @@

1+source: Grammar, Modules: `+$` takes a mold on its line or its cases on the lines below.

2+tests: The root module parses. The supplied module fixture ends without a newline after `+$ x`; both runners preserve those bytes and report the fixture's missing mold at the same location.

3+expect: parses; the fixture's tree is an error at its end of file

tests/golden/module-fixture-eof/module-trees.txtnew file+4

@@ -0,0 +1,4 @@

1+/ui/incomplete.jibb

2+/ui/incomplete.jibb:1:5: expected a mold, on its line or a deeper one, found the end of the file

3++$ x

4+ ^

tests/golden/module-fixture-eof/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/incomplete.jibb

tests/golden/module-fixture-eof/modules/ui/incomplete.jibbnew file+1

@@ -0,0 +1 @@

1++$ x

tests/golden/module-fixture-eof/source.jibbnew file+1

@@ -0,0 +1 @@

1+++ main 1

tests/golden/module-fixture-eof/tokens.txtnew file+4

@@ -0,0 +1,4 @@

1+1:1 glyph ++

2+1:4 name main

3+1:9 lit 1

4+1:10 NEWLINE

tests/golden/module-fixture-eof/tree.txtnew file+2

@@ -0,0 +1,2 @@

1+(module

2+ (value 1:1 main (lit 1:9 1)))

tests/golden/module-import-atom-scheme/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "No name may shadow one already in scope, imports and the prelude included"; type variables are generalized per `++`.

2+tests: An exported atom-constrained gate re-exported by an intermediate module is instantiated independently for @p and @t and rejects a cell.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-atom-scheme/module-trees.txtnew file+13

@@ -0,0 +1,13 @@

1+/ui/mid.jibb

2+(module

3+ (jibb 1:1 base /ui/base)

4+ (value 2:1 alias (wing 2:10 keep.base)))

5+/ui/base.jibb

6+(module

7+ (value 1:1 keep

8+ (gate 1:9

9+ (bind 1:12 x)

10+ (body 2:3

11+ (trace 2:3

12+ (cast 2:6 (aura 2:9 @) (wing 2:11 x))

13+ (body 3:5 (wing 3:5 x)))))))

tests/golden/module-import-atom-scheme/modules.txtnew file+2

@@ -0,0 +1,2 @@

1+/ui/mid.jibb

2+/ui/base.jibb

tests/golden/module-import-atom-scheme/modules/ui/base.jibbnew file+3

@@ -0,0 +1,3 @@

1+++ keep |= x

2+ ~& ^- @ x

3+ x

tests/golden/module-import-atom-scheme/modules/ui/mid.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= base /ui/base

2+++ alias keep.base

tests/golden/module-import-atom-scheme/source.jibbnew file+4

@@ -0,0 +1,4 @@

1+/= mid /ui/mid

2+++ ship (alias.mid ~zod)

3+++ text-value (alias.mid "hello")

4+++ bad (alias.mid [~zod "hi"])

tests/golden/module-import-atom-scheme/tokens.txtnew file+31

@@ -0,0 +1,31 @@

1+1:1 glyph /=

2+1:5 name mid

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot mid

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name ship

10+2:9 glyph (

11+2:10 tight wing alias.mid

12+2:20 lit ~zod

13+2:24 tight glyph )

14+3:1 NEWLINE

15+3:1 glyph ++

16+3:4 name text-value

17+3:15 glyph (

18+3:16 tight wing alias.mid

19+3:26 str "hello"

20+3:33 tight glyph )

21+4:1 NEWLINE

22+4:1 glyph ++

23+4:4 name bad

24+4:8 glyph (

25+4:9 tight wing alias.mid

26+4:19 glyph [

27+4:20 tight lit ~zod

28+4:25 str "hi"

29+4:29 tight glyph ]

30+4:30 tight glyph )

31+4:31 NEWLINE

tests/golden/module-import-atom-scheme/tree.txtnew file+13

@@ -0,0 +1,13 @@

1+(module

2+ (jibb 1:1 mid /ui/mid)

3+ (value 2:1 ship

4+ (group 2:9

5+ (call 2:10 (wing 2:10 alias.mid) (lit 2:20 ~zod))))

6+ (value 3:1 text-value

7+ (group 3:15

8+ (call 3:16 (wing 3:16 alias.mid) (str 3:26 "hello"))))

9+ (value 4:1 bad

10+ (group 4:8

11+ (call 4:9

12+ (wing 4:9 alias.mid)

13+ (tuple 4:19 (lit 4:20 ~zod) (str 4:25 "hi"))))))

tests/golden/module-import-atom-scheme/types.txtnew file+10

@@ -0,0 +1,10 @@

1+partial inference; module not checked

2+++ ship: @p

3+++ text-value: @t

4+++ bad: call's sample and argument types do not unify

5+/tests/golden/module-import-atom-scheme/source.jibb:4:9: called gate has type $-(A A) where A is an atom

6+++ bad (alias.mid [~zod "hi"])

7+ ^

8+/tests/golden/module-import-atom-scheme/source.jibb:4:19: argument has type [@p @t]

9+++ bad (alias.mid [~zod "hi"])

10+ ^

tests/golden/module-import-cycle/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module; import cycles are errors.

2+tests: A cycle between supplied modules is reported without recursing forever.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-cycle/module-trees.txtnew file+16

@@ -0,0 +1,16 @@

1+/ui/a.jibb

2+(module

3+ (jibb 1:1 b /ui/b)

4+ (value 2:1 identity

5+ (gate-wide 2:13

6+ (bind 2:16 x)

7+ (group 2:18

8+ (call 2:19 (wing 2:19 identity.b) (wing 2:30 x))))))

9+/ui/b.jibb

10+(module

11+ (jibb 1:1 a /ui/a)

12+ (value 2:1 identity

13+ (gate-wide 2:13

14+ (bind 2:16 x)

15+ (group 2:18

16+ (call 2:19 (wing 2:19 identity.a) (wing 2:30 x))))))

tests/golden/module-import-cycle/modules.txtnew file+2

@@ -0,0 +1,2 @@

1+/ui/a.jibb

2+/ui/b.jibb

tests/golden/module-import-cycle/modules/ui/a.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= b /ui/b

2+++ identity |=(x (identity.b x))

tests/golden/module-import-cycle/modules/ui/b.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= a /ui/a

2+++ identity |=(x (identity.a x))

tests/golden/module-import-cycle/path.txtnew file+1

@@ -0,0 +1 @@

1+/ui/main.jibb

tests/golden/module-import-cycle/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= a /ui/a

2+++ text-value (identity.a "hi")

tests/golden/module-import-cycle/tokens.txtnew file+14

@@ -0,0 +1,14 @@

1+1:1 glyph /=

2+1:5 name a

3+1:7 glyph /

4+1:8 tight knot ui

5+1:10 tight glyph /

6+1:11 tight knot a

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name text-value

10+2:15 glyph (

11+2:16 tight wing identity.a

12+2:27 str "hi"

13+2:31 tight glyph )

14+2:32 NEWLINE

tests/golden/module-import-cycle/tree.txtnew file+5

@@ -0,0 +1,5 @@

1+(module

2+ (jibb 1:1 a /ui/a)

3+ (value 2:1 text-value

4+ (group 2:15

5+ (call 2:16 (wing 2:16 identity.a) (str 2:27 "hi")))))

tests/golden/module-import-cycle/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+import cycle at /ui/a/jibb

tests/golden/module-import-empty/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module; import cycles are errors.

2+tests: An explicit empty source bundle reports the missing imported module.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-empty/modules.txtnew file+1

@@ -0,0 +1 @@

1+# no module fixtures

tests/golden/module-import-empty/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= lib /ui/lib

2+++ x (identity.lib "hi")

tests/golden/module-import-empty/tokens.txtnew file+14

@@ -0,0 +1,14 @@

1+1:1 glyph /=

2+1:5 name lib

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot lib

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name x

10+2:6 glyph (

11+2:7 tight wing identity.lib

12+2:20 str "hi"

13+2:24 tight glyph )

14+2:25 NEWLINE

tests/golden/module-import-empty/tree.txtnew file+5

@@ -0,0 +1,5 @@

1+(module

2+ (jibb 1:1 lib /ui/lib)

3+ (value 2:1 x

4+ (group 2:6

5+ (call 2:7 (wing 2:7 identity.lib) (str 2:20 "hi")))))

tests/golden/module-import-empty/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+module source missing: /ui/lib/jibb

tests/golden/module-import-face-shadow/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "No name may shadow one already in scope, imports and the prelude included"; type variables are generalized per `++`.

2+tests: A body-local mold cannot shadow an imported module face.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-face-shadow/module-trees.txtnew file+4

@@ -0,0 +1,4 @@

1+/ui/lib.jibb

2+(module

3+ (value 1:1 identity

4+ (gate-wide 1:13 (bind 1:16 x) (wing 1:18 x))))

tests/golden/module-import-face-shadow/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/lib.jibb

tests/golden/module-import-face-shadow/modules/ui/lib.jibbnew file+1

@@ -0,0 +1 @@

1+++ identity |=(x x)

tests/golden/module-import-face-shadow/source.jibbnew file+4

@@ -0,0 +1,4 @@

1+/= lib /ui/lib

2+++ f |= x

3+ +$ lib @t

4+ x

tests/golden/module-import-face-shadow/tokens.txtnew file+19

@@ -0,0 +1,19 @@

1+1:1 glyph /=

2+1:5 name lib

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot lib

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name f

10+2:6 glyph |=

11+2:9 name x

12+3:3 INDENT

13+3:3 glyph +$

14+3:6 name lib

15+3:10 aura @t

16+4:3 NEWLINE

17+4:3 name x

18+4:4 DEDENT

19+4:4 NEWLINE

tests/golden/module-import-face-shadow/tree.txtnew file+8

@@ -0,0 +1,8 @@

1+(module

2+ (jibb 1:1 lib /ui/lib)

3+ (value 2:1 f

4+ (gate 2:6

5+ (bind 2:9 x)

6+ (body 3:3

7+ (mold 3:3 lib (aura 3:10 @t))

8+ (wing 4:3 x)))))

tests/golden/module-import-face-shadow/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+++ f: local molds shadow a name

tests/golden/module-import-identity/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module; import cycles are errors.

2+tests: An imported identity is instantiated independently for a cord and a ship.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-identity/module-trees.txtnew file+4

@@ -0,0 +1,4 @@

1+/ui/lib.jibb

2+(module

3+ (value 1:1 identity

4+ (gate-wide 1:13 (bind 1:16 x) (wing 1:18 x))))

tests/golden/module-import-identity/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/lib.jibb

tests/golden/module-import-identity/modules/ui/lib.jibbnew file+1

@@ -0,0 +1 @@

1+++ identity |=(x x)

tests/golden/module-import-identity/source.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= lib /ui/lib

2+++ text-value (identity.lib "hi")

3+++ ship (identity.lib ~zod)

tests/golden/module-import-identity/tokens.txtnew file+21

@@ -0,0 +1,21 @@

1+1:1 glyph /=

2+1:5 name lib

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot lib

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name text-value

10+2:15 glyph (

11+2:16 tight wing identity.lib

12+2:29 str "hi"

13+2:33 tight glyph )

14+3:1 NEWLINE

15+3:1 glyph ++

16+3:4 name ship

17+3:9 glyph (

18+3:10 tight wing identity.lib

19+3:23 lit ~zod

20+3:27 tight glyph )

21+3:28 NEWLINE

tests/golden/module-import-identity/tree.txtnew file+8

@@ -0,0 +1,8 @@

1+(module

2+ (jibb 1:1 lib /ui/lib)

3+ (value 2:1 text-value

4+ (group 2:15

5+ (call 2:16 (wing 2:16 identity.lib) (str 2:29 "hi"))))

6+ (value 3:1 ship

7+ (group 3:9

8+ (call 3:10 (wing 3:10 identity.lib) (lit 3:23 ~zod)))))

tests/golden/module-import-identity/types.txtnew file+3

@@ -0,0 +1,3 @@

1+partial inference; module not checked

2+++ text-value: @t

3+++ ship: @p

tests/golden/module-import-invalid/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module; import cycles are errors.

2+tests: A malformed imported module is reported at its logical path.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-invalid/module-trees.txtnew file+4

@@ -0,0 +1,4 @@

1+/ui/lib.jibb

2+/ui/lib.jibb:1:10: expected a mold, on its line or a deeper one, found the end of the file

3++$ broken

4+ ^

tests/golden/module-import-invalid/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/lib.jibb

tests/golden/module-import-invalid/modules/ui/lib.jibbnew file+1

@@ -0,0 +1 @@

1++$ broken

tests/golden/module-import-invalid/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= lib /ui/lib

2+++ x (identity.lib "hi")

tests/golden/module-import-invalid/tokens.txtnew file+14

@@ -0,0 +1,14 @@

1+1:1 glyph /=

2+1:5 name lib

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot lib

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name x

10+2:6 glyph (

11+2:7 tight wing identity.lib

12+2:20 str "hi"

13+2:24 tight glyph )

14+2:25 NEWLINE

tests/golden/module-import-invalid/tree.txtnew file+5

@@ -0,0 +1,5 @@

1+(module

2+ (jibb 1:1 lib /ui/lib)

3+ (value 2:1 x

4+ (group 2:6

5+ (call 2:7 (wing 2:7 identity.lib) (str 2:20 "hi")))))

tests/golden/module-import-invalid/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+module source does not parse: /ui/lib/jibb

tests/golden/module-import-missing-member/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module; import cycles are errors.

2+tests: A missing member of a supplied module is reported.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-missing-member/module-trees.txtnew file+4

@@ -0,0 +1,4 @@

1+/ui/lib.jibb

2+(module

3+ (value 1:1 identity

4+ (gate-wide 1:13 (bind 1:16 x) (wing 1:18 x))))

tests/golden/module-import-missing-member/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/lib.jibb

tests/golden/module-import-missing-member/modules/ui/lib.jibbnew file+1

@@ -0,0 +1 @@

1+++ identity |=(x x)

tests/golden/module-import-missing-member/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= lib /ui/lib

2+++ x (absent.lib "hi")

tests/golden/module-import-missing-member/tokens.txtnew file+14

@@ -0,0 +1,14 @@

1+1:1 glyph /=

2+1:5 name lib

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot lib

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name x

10+2:6 glyph (

11+2:7 tight wing absent.lib

12+2:18 str "hi"

13+2:22 tight glyph )

14+2:23 NEWLINE

tests/golden/module-import-missing-member/tree.txtnew file+5

@@ -0,0 +1,5 @@

1+(module

2+ (jibb 1:1 lib /ui/lib)

3+ (value 2:1 x

4+ (group 2:6

5+ (call 2:7 (wing 2:7 absent.lib) (str 2:18 "hi")))))

tests/golden/module-import-missing-member/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+++ x: module member is not available to partial inference

tests/golden/module-import-mold/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module; import cycles are errors.

2+tests: A simple named mold exported by an imported module is used in a sample.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-mold/module-trees.txtnew file+3

@@ -0,0 +1,3 @@

1+/ui/lib.jibb

2+(module

3+ (mold 1:1 title (aura 1:10 @t)))

tests/golden/module-import-mold/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/lib.jibb

tests/golden/module-import-mold/modules/ui/lib.jibbnew file+1

@@ -0,0 +1 @@

1++$ title @t

tests/golden/module-import-mold/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= lib /ui/lib

2+++ identity |= x=title.lib x

tests/golden/module-import-mold/tokens.txtnew file+15

@@ -0,0 +1,15 @@

1+1:1 glyph /=

2+1:5 name lib

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot lib

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name identity

10+2:13 glyph |=

11+2:16 name x

12+2:17 tight glyph =

13+2:18 tight wing title.lib

14+2:28 name x

15+2:29 NEWLINE

tests/golden/module-import-mold/tree.txtnew file+6

@@ -0,0 +1,6 @@

1+(module

2+ (jibb 1:1 lib /ui/lib)

3+ (value 2:1 identity

4+ (gate 2:13

5+ (face 2:16 x (ref 2:18 title.lib))

6+ (wing 2:28 x))))

tests/golden/module-import-mold/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+++ identity: $-(@t @t)

tests/golden/module-import-prelude-cross-namespace/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "No name may shadow one already in scope, imports and the prelude included"; molds and values have separate namespaces.

2+tests: A value may share the prelude mold `list` name because the namespaces are separate.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-prelude-cross-namespace/modules.txtnew file+1

@@ -0,0 +1 @@

1+# no module fixtures

tests/golden/module-import-prelude-cross-namespace/source.jibbnew file+1

@@ -0,0 +1 @@

1+++ list |=(x x)

tests/golden/module-import-prelude-cross-namespace/tokens.txtnew file+7

@@ -0,0 +1,7 @@

1+1:1 glyph ++

2+1:4 name list

3+1:9 glyph |=(

4+1:12 tight name x

5+1:14 name x

6+1:15 tight glyph )

7+1:16 NEWLINE

tests/golden/module-import-prelude-cross-namespace/tree.txtnew file+3

@@ -0,0 +1,3 @@

1+(module

2+ (value 1:1 list

3+ (gate-wide 1:9 (bind 1:12 x) (wing 1:14 x))))

tests/golden/module-import-prelude-cross-namespace/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+++ list: $-(A A)

tests/golden/module-import-prelude-mold-shadow/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "No name may shadow one already in scope, imports and the prelude included"; molds and values have separate namespaces.

2+tests: A root mold cannot shadow the prelude mold `list`, even with no imports.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-prelude-mold-shadow/modules.txtnew file+1

@@ -0,0 +1 @@

1+# no modules

tests/golden/module-import-prelude-mold-shadow/source.jibbnew file+2

@@ -0,0 +1,2 @@

1++$ list @t

2+++ x 1

tests/golden/module-import-prelude-mold-shadow/tokens.txtnew file+8

@@ -0,0 +1,8 @@

1+1:1 glyph +$

2+1:4 name list

3+1:9 aura @t

4+2:1 NEWLINE

5+2:1 glyph ++

6+2:4 name x

7+2:6 lit 1

8+2:7 NEWLINE

tests/golden/module-import-prelude-mold-shadow/tree.txtnew file+3

@@ -0,0 +1,3 @@

1+(module

2+ (mold 1:1 list (aura 1:9 @t))

3+ (value 2:1 x (lit 2:6 1)))

tests/golden/module-import-prelude-mold-shadow/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+module has conflicting names

tests/golden/module-import-prelude-sample-shadow/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "No name may shadow one already in scope, imports and the prelude included"; molds and values have separate namespaces.

2+tests: A gate sample cannot shadow the prelude value `same`.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-prelude-sample-shadow/module-trees.txtnew file+4

@@ -0,0 +1,4 @@

1+/ui/lib.jibb

2+(module

3+ (value 1:1 identity

4+ (gate-wide 1:13 (bind 1:16 x) (wing 1:18 x))))

tests/golden/module-import-prelude-sample-shadow/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/lib.jibb

tests/golden/module-import-prelude-sample-shadow/modules/ui/lib.jibbnew file+1

@@ -0,0 +1 @@

1+++ identity |=(x x)

tests/golden/module-import-prelude-sample-shadow/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= lib /ui/lib

2+++ f |=(same same)

tests/golden/module-import-prelude-sample-shadow/tokens.txtnew file+14

@@ -0,0 +1,14 @@

1+1:1 glyph /=

2+1:5 name lib

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot lib

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name f

10+2:6 glyph |=(

11+2:9 tight name same

12+2:14 name same

13+2:18 tight glyph )

14+2:19 NEWLINE

tests/golden/module-import-prelude-sample-shadow/tree.txtnew file+4

@@ -0,0 +1,4 @@

1+(module

2+ (jibb 1:1 lib /ui/lib)

3+ (value 2:1 f

4+ (gate-wide 2:6 (bind 2:9 same) (wing 2:14 same))))

tests/golden/module-import-prelude-sample-shadow/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+++ f: sample shadows a name

tests/golden/module-import-prelude-value-shadow/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "No name may shadow one already in scope, imports and the prelude included"; molds and values have separate namespaces.

2+tests: An imported value cannot shadow the prelude value `same`.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-prelude-value-shadow/module-trees.txtnew file+4

@@ -0,0 +1,4 @@

1+/ui/lib.jibb

2+(module

3+ (value 1:1 same

4+ (gate-wide 1:9 (bind 1:12 x) (wing 1:14 x))))

tests/golden/module-import-prelude-value-shadow/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/lib.jibb

tests/golden/module-import-prelude-value-shadow/modules/ui/lib.jibbnew file+1

@@ -0,0 +1 @@

1+++ same |=(x x)

tests/golden/module-import-prelude-value-shadow/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= lib /ui/lib

2+++ x 1

tests/golden/module-import-prelude-value-shadow/tokens.txtnew file+11

@@ -0,0 +1,11 @@

1+1:1 glyph /=

2+1:5 name lib

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot lib

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name x

10+2:6 lit 1

11+2:7 NEWLINE

tests/golden/module-import-prelude-value-shadow/tree.txtnew file+3

@@ -0,0 +1,3 @@

1+(module

2+ (jibb 1:1 lib /ui/lib)

3+ (value 2:1 x (lit 2:6 1)))

tests/golden/module-import-prelude-value-shadow/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+module has conflicting names: /ui/lib/jibb

tests/golden/module-import-root-cycle/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module; import cycles are errors.

2+tests: A cycle back to the root uses its explicit logical path.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-root-cycle/module-trees.txtnew file+8

@@ -0,0 +1,8 @@

1+/ui/a.jibb

2+(module

3+ (jibb 1:1 main /ui/main)

4+ (value 2:1 identity

5+ (gate-wide 2:13

6+ (bind 2:16 x)

7+ (group 2:18

8+ (call 2:19 (wing 2:19 identity.main) (wing 2:33 x))))))

tests/golden/module-import-root-cycle/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/a.jibb

tests/golden/module-import-root-cycle/modules/ui/a.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= main /ui/main

2+++ identity |=(x (identity.main x))

tests/golden/module-import-root-cycle/path.txtnew file+1

@@ -0,0 +1 @@

1+/ui/main.jibb

tests/golden/module-import-root-cycle/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= a /ui/a

2+++ identity |=(x (identity.a x))

tests/golden/module-import-root-cycle/tokens.txtnew file+17

@@ -0,0 +1,17 @@

1+1:1 glyph /=

2+1:5 name a

3+1:7 glyph /

4+1:8 tight knot ui

5+1:10 tight glyph /

6+1:11 tight knot a

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name identity

10+2:13 glyph |=(

11+2:16 tight name x

12+2:18 glyph (

13+2:19 tight wing identity.a

14+2:30 name x

15+2:31 tight glyph )

16+2:32 tight glyph )

17+2:33 NEWLINE

tests/golden/module-import-root-cycle/tree.txtnew file+7

@@ -0,0 +1,7 @@

1+(module

2+ (jibb 1:1 a /ui/a)

3+ (value 2:1 identity

4+ (gate-wide 2:13

5+ (bind 2:16 x)

6+ (group 2:18

7+ (call 2:19 (wing 2:19 identity.a) (wing 2:30 x))))))

tests/golden/module-import-root-cycle/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+import cycle at /ui/main/jibb

tests/golden/module-import-root-import-shadow/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "No name may shadow one already in scope, imports and the prelude included".

2+tests: Samples in the root module cannot shadow names declared by `/-` or `/%`; an explicit empty Jibb module bundle opts into module-aware checking.

3+expect: parses

4+expect-types: partial inference reports each shadowing sample

tests/golden/module-import-root-import-shadow/imports.txtnew file+1

@@ -0,0 +1 @@

1+fixture title

tests/golden/module-import-root-import-shadow/mar/label.txtnew file+5

@@ -0,0 +1,5 @@

1+|_ a=@t

2+++ grab |% ++ noun @t --

3+++ grow |% ++ noun a --

4+++ grad %noun

5+--

tests/golden/module-import-root-import-shadow/marks.txtnew file+1

@@ -0,0 +1 @@

1+label

tests/golden/module-import-root-import-shadow/modules.txtnew file+1

@@ -0,0 +1 @@

1+# no module fixtures

tests/golden/module-import-root-import-shadow/source.jibbnew file+4

@@ -0,0 +1,4 @@

1+/- fixture

2+/% %label

3+++ shadow-sur |=(fixture fixture)

4+++ shadow-mark |=(label label)

tests/golden/module-import-root-import-shadow/sur/fixture.txtnew file+3

@@ -0,0 +1,3 @@

1+|%

2++$ title @t

3+--

tests/golden/module-import-root-import-shadow/tokens.txtnew file+20

@@ -0,0 +1,20 @@

1+1:1 glyph /-

2+1:5 name fixture

3+2:1 NEWLINE

4+2:1 glyph /%

5+2:5 lit %label

6+3:1 NEWLINE

7+3:1 glyph ++

8+3:4 name shadow-sur

9+3:15 glyph |=(

10+3:18 tight name fixture

11+3:26 name fixture

12+3:33 tight glyph )

13+4:1 NEWLINE

14+4:1 glyph ++

15+4:4 name shadow-mark

16+4:16 glyph |=(

17+4:19 tight name label

18+4:25 name label

19+4:30 tight glyph )

20+4:31 NEWLINE

tests/golden/module-import-root-import-shadow/tree.txtnew file+7

@@ -0,0 +1,7 @@

1+(module

2+ (sur 1:1 fixture)

3+ (mark 2:1 %label)

4+ (value 3:1 shadow-sur

5+ (gate-wide 3:15 (bind 3:18 fixture) (wing 3:26 fixture)))

6+ (value 4:1 shadow-mark

7+ (gate-wide 4:16 (bind 4:19 label) (wing 4:25 label))))

tests/golden/module-import-root-import-shadow/types.txtnew file+3

@@ -0,0 +1,3 @@

1+partial inference; module not checked

2+++ shadow-sur: sample shadows a name

3+++ shadow-mark: sample shadows a name

tests/golden/module-import-separate-namespaces/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Modules: "No name may shadow one already in scope, imports and the prelude included"; molds and values have separate namespaces.

2+tests: A mold and a value may share a name because their namespaces are separate.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-separate-namespaces/module-trees.txtnew file+5

@@ -0,0 +1,5 @@

1+/ui/lib.jibb

2+(module

3+ (mold 1:1 thing (aura 1:10 @t))

4+ (value 2:1 thing

5+ (gate-wide 2:10 (bind 2:13 x) (wing 2:15 x))))

tests/golden/module-import-separate-namespaces/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/lib.jibb

tests/golden/module-import-separate-namespaces/modules/ui/lib.jibbnew file+2

@@ -0,0 +1,2 @@

1++$ thing @t

2+++ thing |=(x x)

tests/golden/module-import-separate-namespaces/source.jibbnew file+3

@@ -0,0 +1,3 @@

1+/= lib /ui/lib

2+++ f |= x=thing.lib x

3+++ y (thing.lib "hi")

tests/golden/module-import-separate-namespaces/tokens.txtnew file+22

@@ -0,0 +1,22 @@

1+1:1 glyph /=

2+1:5 name lib

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot lib

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name f

10+2:6 glyph |=

11+2:9 name x

12+2:10 tight glyph =

13+2:11 tight wing thing.lib

14+2:21 name x

15+3:1 NEWLINE

16+3:1 glyph ++

17+3:4 name y

18+3:6 glyph (

19+3:7 tight wing thing.lib

20+3:17 str "hi"

21+3:21 tight glyph )

22+3:22 NEWLINE

tests/golden/module-import-separate-namespaces/tree.txtnew file+9

@@ -0,0 +1,9 @@

1+(module

2+ (jibb 1:1 lib /ui/lib)

3+ (value 2:1 f

4+ (gate 2:6

5+ (face 2:9 x (ref 2:11 thing.lib))

6+ (wing 2:21 x)))

7+ (value 3:1 y

8+ (group 3:6

9+ (call 3:7 (wing 3:7 thing.lib) (str 3:17 "hi")))))

tests/golden/module-import-separate-namespaces/types.txtnew file+3

@@ -0,0 +1,3 @@

1+partial inference; module not checked

2+++ f: $-(@t @t)

3+++ y: @t

tests/golden/module-import-sur-scope/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module; import cycles are errors.

2+tests: A module may not see the root module’s Hoon import without declaring it.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-sur-scope/imports.txtnew file+1

@@ -0,0 +1 @@

1+fixture title

tests/golden/module-import-sur-scope/module-trees.txtnew file+6

@@ -0,0 +1,6 @@

1+/ui/lib.jibb

2+(module

3+ (value 1:1 identity

4+ (gate 1:13

5+ (face 1:16 x (ref 1:18 title.fixture))

6+ (wing 1:32 x))))

tests/golden/module-import-sur-scope/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/lib.jibb

tests/golden/module-import-sur-scope/modules/ui/lib.jibbnew file+1

@@ -0,0 +1 @@

1+++ identity |= x=title.fixture x

tests/golden/module-import-sur-scope/source.jibbnew file+4

@@ -0,0 +1,4 @@

1+/- fixture

2+/= lib /ui/lib

3+++ root |= x=title.fixture x

4+++ imported (identity.lib "hi")

tests/golden/module-import-sur-scope/sur/fixture.txtnew file+3

@@ -0,0 +1,3 @@

1+|%

2++$ title @t

3+--

tests/golden/module-import-sur-scope/tokens.txtnew file+25

@@ -0,0 +1,25 @@

1+1:1 glyph /-

2+1:5 name fixture

3+2:1 NEWLINE

4+2:1 glyph /=

5+2:5 name lib

6+2:9 glyph /

7+2:10 tight knot ui

8+2:12 tight glyph /

9+2:13 tight knot lib

10+3:1 NEWLINE

11+3:1 glyph ++

12+3:4 name root

13+3:9 glyph |=

14+3:12 name x

15+3:13 tight glyph =

16+3:14 tight wing title.fixture

17+3:28 name x

18+4:1 NEWLINE

19+4:1 glyph ++

20+4:4 name imported

21+4:13 glyph (

22+4:14 tight wing identity.lib

23+4:27 str "hi"

24+4:31 tight glyph )

25+4:32 NEWLINE

tests/golden/module-import-sur-scope/tree.txtnew file+10

@@ -0,0 +1,10 @@

1+(module

2+ (sur 1:1 fixture)

3+ (jibb 2:1 lib /ui/lib)

4+ (value 3:1 root

5+ (gate 3:9

6+ (face 3:12 x (ref 3:14 title.fixture))

7+ (wing 3:28 x)))

8+ (value 4:1 imported

9+ (group 4:13

10+ (call 4:14 (wing 4:14 identity.lib) (str 4:27 "hi")))))

tests/golden/module-import-sur-scope/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+module definitions need unsupported inference: /ui/lib/jibb

tests/golden/module-import-transitive/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module; import cycles are errors.

2+tests: Imported modules use a transitive, explicitly supplied A-to-B-to-C dependency chain.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-transitive/module-trees.txtnew file+20

@@ -0,0 +1,20 @@

1+/ui/a.jibb

2+(module

3+ (jibb 1:1 b /ui/b)

4+ (value 2:1 identity

5+ (gate-wide 2:13

6+ (bind 2:16 x)

7+ (group 2:18

8+ (call 2:19 (wing 2:19 identity.b) (wing 2:30 x))))))

9+/ui/b.jibb

10+(module

11+ (jibb 1:1 c /ui/c)

12+ (value 2:1 identity

13+ (gate-wide 2:13

14+ (bind 2:16 x)

15+ (group 2:18

16+ (call 2:19 (wing 2:19 identity.c) (wing 2:30 x))))))

17+/ui/c.jibb

18+(module

19+ (value 1:1 identity

20+ (gate-wide 1:13 (bind 1:16 x) (wing 1:18 x))))

tests/golden/module-import-transitive/modules.txtnew file+3

@@ -0,0 +1,3 @@

1+/ui/a.jibb

2+/ui/b.jibb

3+/ui/c.jibb

tests/golden/module-import-transitive/modules/ui/a.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= b /ui/b

2+++ identity |=(x (identity.b x))

tests/golden/module-import-transitive/modules/ui/b.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= c /ui/c

2+++ identity |=(x (identity.c x))

tests/golden/module-import-transitive/modules/ui/c.jibbnew file+1

@@ -0,0 +1 @@

1+++ identity |=(x x)

tests/golden/module-import-transitive/path.txtnew file+1

@@ -0,0 +1 @@

1+/ui/main.jibb

tests/golden/module-import-transitive/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= a /ui/a

2+++ text-value (identity.a "hi")

tests/golden/module-import-transitive/tokens.txtnew file+14

@@ -0,0 +1,14 @@

1+1:1 glyph /=

2+1:5 name a

3+1:7 glyph /

4+1:8 tight knot ui

5+1:10 tight glyph /

6+1:11 tight knot a

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name text-value

10+2:15 glyph (

11+2:16 tight wing identity.a

12+2:27 str "hi"

13+2:31 tight glyph )

14+2:32 NEWLINE

tests/golden/module-import-transitive/tree.txtnew file+5

@@ -0,0 +1,5 @@

1+(module

2+ (jibb 1:1 a /ui/a)

3+ (value 2:1 text-value

4+ (group 2:15

5+ (call 2:16 (wing 2:16 identity.a) (str 2:27 "hi")))))

tests/golden/module-import-transitive/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+++ text-value: @t

tests/golden/module-import-unused-invalid/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Imports: `/=` imports a Jibb module; import cycles are errors.

2+tests: An unused malformed fixture is parsed in module-trees but must not invalidate import inference.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/module-import-unused-invalid/module-trees.txtnew file+8

@@ -0,0 +1,8 @@

1+/ui/good.jibb

2+(module

3+ (value 1:1 identity

4+ (gate-wide 1:13 (bind 1:16 x) (wing 1:18 x))))

5+/ui/unused.jibb

6+/ui/unused.jibb:1:10: expected a mold, on its line or a deeper one, found the end of the file

7++$ broken

8+ ^

tests/golden/module-import-unused-invalid/modules.txtnew file+2

@@ -0,0 +1,2 @@

1+/ui/good.jibb

2+/ui/unused.jibb

tests/golden/module-import-unused-invalid/modules/ui/good.jibbnew file+1

@@ -0,0 +1 @@

1+++ identity |=(x x)

tests/golden/module-import-unused-invalid/modules/ui/unused.jibbnew file+1

@@ -0,0 +1 @@

1++$ broken

tests/golden/module-import-unused-invalid/source.jibbnew file+2

@@ -0,0 +1,2 @@

1+/= good /ui/good

2+++ text-value (identity.good "hi")

tests/golden/module-import-unused-invalid/tokens.txtnew file+14

@@ -0,0 +1,14 @@

1+1:1 glyph /=

2+1:5 name good

3+1:10 glyph /

4+1:11 tight knot ui

5+1:13 tight glyph /

6+1:14 tight knot good

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name text-value

10+2:15 glyph (

11+2:16 tight wing identity.good

12+2:30 str "hi"

13+2:34 tight glyph )

14+2:35 NEWLINE

tests/golden/module-import-unused-invalid/tree.txtnew file+5

@@ -0,0 +1,5 @@

1+(module

2+ (jibb 1:1 good /ui/good)

3+ (value 2:1 text-value

4+ (group 2:15

5+ (call 2:16 (wing 2:16 identity.good) (str 2:30 "hi")))))

tests/golden/module-import-unused-invalid/types.txtnew file+2

@@ -0,0 +1,2 @@

1+partial inference; module not checked

2+++ text-value: @t

tests/golden/parser-hole-parameter-rejected/about.txtnew file+3

@@ -0,0 +1,3 @@

1+source: Grammar, Types and molds: `_` is an inferred type hole.

2+tests: An anonymous hole is not a named generic parameter.

3+expect: error at 1:12

tests/golden/parser-hole-parameter-rejected/source.jibbnew file+1

@@ -0,0 +1 @@

1++$ bad |$ [_] @t

tests/golden/parser-hole-parameter-rejected/tokens.txtnew file+8

@@ -0,0 +1,8 @@

1+1:1 glyph +$

2+1:4 name bad

3+1:8 glyph |$

4+1:11 glyph [

5+1:12 tight glyph _

6+1:13 tight glyph ]

7+1:15 aura @t

8+1:17 NEWLINE

tests/golden/parser-hole-parameter-rejected/tree.txtnew file+3

@@ -0,0 +1,3 @@

1+/tests/golden/parser-hole-parameter-rejected/source.jibb:1:12: expected a type variable, found `_`

2++$ bad |$ [_] @t

3+ ^

tests/golden/parser-hole-path-space/about.txtnew file+3

@@ -0,0 +1,3 @@

1+source: Grammar, Types and molds: `_` is an inferred type hole.

2+tests: A path-segment type hole must remain tight after the field's `=`.

3+expect: error at 1:14

tests/golden/parser-hole-path-space/source.jibbnew file+1

@@ -0,0 +1 @@

1++$ path /[id= _]

tests/golden/parser-hole-path-space/tokens.txtnew file+9

@@ -0,0 +1,9 @@

1+1:1 glyph +$

2+1:4 name path

3+1:9 glyph /

4+1:10 tight glyph [

5+1:11 tight name id

6+1:13 tight glyph =

7+1:15 glyph _

8+1:16 tight glyph ]

9+1:17 NEWLINE

tests/golden/parser-hole-path-space/tree.txtnew file+3

@@ -0,0 +1,3 @@

1+/tests/golden/parser-hole-path-space/source.jibb:1:14: expected an aura or type hole right after `=`, found a space

2++$ path /[id= _]

3+ ^

tests/golden/parser-hole-path/about.txtnew file+3

@@ -0,0 +1,3 @@

1+source: Grammar, Types and molds: `_` is an inferred type hole.

2+tests: Underscores in `/_` and `%/_` remain literal path knots, while `[id=_]` is a typed-segment hole.

3+expect: parses

tests/golden/parser-hole-path/source.jibbnew file+4

@@ -0,0 +1,4 @@

1++$ root /_

2++$ child /item/_x

3+++ show %/_

4++$ inferred /items/[id=_]

tests/golden/parser-hole-path/tokens.txtnew file+28

@@ -0,0 +1,28 @@

1+1:1 glyph +$

2+1:4 name root

3+1:9 glyph /

4+1:10 tight knot _

5+2:1 NEWLINE

6+2:1 glyph +$

7+2:4 name child

8+2:10 glyph /

9+2:11 tight knot item

10+2:15 tight glyph /

11+2:16 tight knot _x

12+3:1 NEWLINE

13+3:1 glyph ++

14+3:4 name show

15+3:9 glyph %/

16+3:11 tight knot _

17+4:1 NEWLINE

18+4:1 glyph +$

19+4:4 name inferred

20+4:13 glyph /

21+4:14 tight knot items

22+4:19 tight glyph /

23+4:20 tight glyph [

24+4:21 tight name id

25+4:23 tight glyph =

26+4:24 tight glyph _

27+4:25 tight glyph ]

28+4:26 NEWLINE

tests/golden/parser-hole-path/tree.txtnew file+5

@@ -0,0 +1,5 @@

1+(module

2+ (mold 1:1 root (path 1:9 /_))

3+ (mold 2:1 child (path 2:10 /item/_x))

4+ (value 3:1 show (qath 3:9 _))

5+ (mold 4:1 inferred (path 4:13 /items/[id=_])))

tests/golden/parser-hole-pattern-rejected/about.txtnew file+3

@@ -0,0 +1,3 @@

1+source: Grammar, Types and molds: `_` is an inferred type hole.

2+tests: A type hole is not a branch-pattern wildcard.

3+expect: error at 3:5

tests/golden/parser-hole-pattern-rejected/source.jibbnew file+3

@@ -0,0 +1,3 @@

1+++ bad |= x=@t

2+ ?- x

3+ _ "no"

tests/golden/parser-hole-pattern-rejected/tokens.txtnew file+15

@@ -0,0 +1,15 @@

1+1:1 glyph ++

2+1:4 name bad

3+1:8 glyph |=

4+1:11 name x

5+1:12 tight glyph =

6+1:13 tight aura @t

7+2:3 INDENT

8+2:3 glyph ?-

9+2:6 name x

10+3:5 INDENT

11+3:5 glyph _

12+3:7 str "no"

13+3:11 DEDENT

14+3:11 DEDENT

15+3:11 NEWLINE

tests/golden/parser-hole-pattern-rejected/tree.txtnew file+3

@@ -0,0 +1,3 @@

1+/tests/golden/parser-hole-pattern-rejected/source.jibb:3:5: expected a pattern, found `_`

2+ _ "no"

3+ ^

tests/golden/parser-hole-shapes/about.txtnew file+3

@@ -0,0 +1,3 @@

1+source: Grammar, Types and molds: `_` is an inferred type hole.

2+tests: Holes in samples, casts, nested records, gate molds and generic mold arguments have their own source spans.

3+expect: parses

tests/golden/parser-hole-shapes/source.jibbnew file+11

@@ -0,0 +1,11 @@

1++$ unused _

2++$ nested [a=_ b=$-(_ (list _))]

3++$ alias |$ [A] (pair A _)

4+++ identity |= x=_ x

5+++ inferred ^- _ "hello"

6+++ cast-nested |= x=[$-(_ _) (list _)] ^- [first=_ second=_] [x x]

7+++ bare-sample |= _ "hello"

8+++ cell-sample |= [a=_ b=_] [a b]

9+++ local |= x=@t

10+ ++ inside |= y=_ ^- _ y

11+ (inside x)

tests/golden/parser-hole-shapes/tokens.txtnew file+121

@@ -0,0 +1,121 @@

1+1:1 glyph +$

2+1:4 name unused

3+1:11 glyph _

4+2:1 NEWLINE

5+2:1 glyph +$

6+2:4 name nested

7+2:11 glyph [

8+2:12 tight name a

9+2:13 tight glyph =

10+2:14 tight glyph _

11+2:16 name b

12+2:17 tight glyph =

13+2:18 tight glyph $-(

14+2:21 tight glyph _

15+2:23 glyph (

16+2:24 tight name list

17+2:29 glyph _

18+2:30 tight glyph )

19+2:31 tight glyph )

20+2:32 tight glyph ]

21+3:1 NEWLINE

22+3:1 glyph +$

23+3:4 name alias

24+3:10 glyph |$

25+3:13 glyph [

26+3:14 tight tvar A

27+3:15 tight glyph ]

28+3:17 glyph (

29+3:18 tight name pair

30+3:23 tvar A

31+3:25 glyph _

32+3:26 tight glyph )

33+4:1 NEWLINE

34+4:1 glyph ++

35+4:4 name identity

36+4:13 glyph |=

37+4:16 name x

38+4:17 tight glyph =

39+4:18 tight glyph _

40+4:20 name x

41+5:1 NEWLINE

42+5:1 glyph ++

43+5:4 name inferred

44+5:13 glyph ^-

45+5:16 glyph _

46+5:18 str "hello"

47+6:1 NEWLINE

48+6:1 glyph ++

49+6:4 name cast-nested

50+6:16 glyph |=

51+6:19 name x

52+6:20 tight glyph =

53+6:21 tight glyph [

54+6:22 tight glyph $-(

55+6:25 tight glyph _

56+6:27 glyph _

57+6:28 tight glyph )

58+6:30 glyph (

59+6:31 tight name list

60+6:36 glyph _

61+6:37 tight glyph )

62+6:38 tight glyph ]

63+6:40 glyph ^-

64+6:43 glyph [

65+6:44 tight name first

66+6:49 tight glyph =

67+6:50 tight glyph _

68+6:52 name second

69+6:58 tight glyph =

70+6:59 tight glyph _

71+6:60 tight glyph ]

72+6:62 glyph [

73+6:63 tight name x

74+6:65 name x

75+6:66 tight glyph ]

76+7:1 NEWLINE

77+7:1 glyph ++

78+7:4 name bare-sample

79+7:16 glyph |=

80+7:19 glyph _

81+7:21 str "hello"

82+8:1 NEWLINE

83+8:1 glyph ++

84+8:4 name cell-sample

85+8:16 glyph |=

86+8:19 glyph [

87+8:20 tight name a

88+8:21 tight glyph =

89+8:22 tight glyph _

90+8:24 name b

91+8:25 tight glyph =

92+8:26 tight glyph _

93+8:27 tight glyph ]

94+8:29 glyph [

95+8:30 tight name a

96+8:32 name b

97+8:33 tight glyph ]

98+9:1 NEWLINE

99+9:1 glyph ++

100+9:4 name local

101+9:10 glyph |=

102+9:13 name x

103+9:14 tight glyph =

104+9:15 tight aura @t

105+10:3 INDENT

106+10:3 glyph ++

107+10:6 name inside

108+10:13 glyph |=

109+10:16 name y

110+10:17 tight glyph =

111+10:18 tight glyph _

112+10:20 glyph ^-

113+10:23 glyph _

114+10:25 name y

115+11:3 NEWLINE

116+11:3 glyph (

117+11:4 tight name inside

118+11:11 name x

119+11:12 tight glyph )

120+11:13 DEDENT

121+11:13 NEWLINE

tests/golden/parser-hole-shapes/tree.txtnew file+47

@@ -0,0 +1,47 @@

1+(module

2+ (mold 1:1 unused (hole 1:11))

3+ (mold 2:1 nested

4+ (cell 2:11

5+ (face 2:12 a (hole 2:14))

6+ (face 2:16 b

7+ (fn 2:18

8+ (hole 2:21)

9+ (apply 2:23 list (hole 2:29))))))

10+ (mold 3:1 alias

11+ (generic 3:10 A

12+ (apply 3:17 pair (tvar 3:23 A) (hole 3:25))))

13+ (value 4:1 identity

14+ (gate 4:13

15+ (face 4:16 x (hole 4:18))

16+ (wing 4:20 x)))

17+ (value 5:1 inferred

18+ (cast 5:13 (hole 5:16) (str 5:18 "hello")))

19+ (value 6:1 cast-nested

20+ (gate 6:16

21+ (face 6:19 x

22+ (cell 6:21

23+ (fn 6:22 (hole 6:25) (hole 6:27))

24+ (apply 6:30 list (hole 6:36))))

25+ (cast 6:40

26+ (cell 6:43

27+ (face 6:44 first (hole 6:50))

28+ (face 6:52 second (hole 6:59)))

29+ (tuple 6:62 (wing 6:63 x) (wing 6:65 x)))))

30+ (value 7:1 bare-sample

31+ (gate 7:16 (hole 7:19) (str 7:21 "hello")))

32+ (value 8:1 cell-sample

33+ (gate 8:16

34+ (cell 8:19

35+ (face 8:20 a (hole 8:22))

36+ (face 8:24 b (hole 8:26)))

37+ (tuple 8:29 (wing 8:30 a) (wing 8:32 b))))

38+ (value 9:1 local

39+ (gate 9:10

40+ (face 9:13 x (aura 9:15 @t))

41+ (body 10:3

42+ (value 10:3 inside

43+ (gate 10:13

44+ (face 10:16 y (hole 10:18))

45+ (cast 10:20 (hole 10:23) (wing 10:25 y))))

46+ (group 11:3

47+ (call 11:4 (wing 11:4 inside) (wing 11:11 x)))))))

tests/golden/parser-hole-value-rejected/about.txtnew file+3

@@ -0,0 +1,3 @@

1+source: Grammar, Types and molds: `_` is an inferred type hole.

2+tests: A type hole is not a value expression.

3+expect: error at 1:8

tests/golden/parser-hole-value-rejected/source.jibbnew file+1

@@ -0,0 +1 @@

1+++ bad _

tests/golden/parser-hole-value-rejected/tokens.txtnew file+4

@@ -0,0 +1,4 @@

1+1:1 glyph ++

2+1:4 name bad

3+1:8 glyph _

4+1:9 NEWLINE

tests/golden/parser-hole-value-rejected/tree.txtnew file+3

@@ -0,0 +1,3 @@

1+/tests/golden/parser-hole-value-rejected/source.jibb:1:8: expected an expression, found `_`

2+++ bad _

3+ ^

tests/golden/prelude-1c-structural/source.jibb+16−6

@@ -37,16 +37,18 @@

37++ weld |= args=[(list A) (list A)]

38 ?- args

39 [xs ys]

40+ ^- (list A)

40− ?- xs

41+ ?- xs

41− ~ ys

42+ ~ ys

42− [item rest] [item (weld rest ys)]

43+ [item rest] [item (weld rest ys)]

44++ turn |= args=[(list A) $-(A B)]

45++ turn |= args=[(list A) $-(A B)]

45 ?- args

46 ?- args

46 [xs f]

47 [xs f]

48+ ^- (list B)

47− ?- xs

49+ ?- xs

48− ~ ~

50+ ~ ~

49− [item rest] [(f item) (turn rest f)]

51+ [item rest] [(f item) (turn rest f)]

51+$ dime [p=@ta q=@]

53+$ dime [p=@ta q=@]

@@ -94,6 +96,14 @@

95+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

97+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

99+++ like |= [f=$-(A B) result=(like A)]

100+ ++ mapped

101+ ^- (unit [p=B q=nail])

102+ ?- q.result

103+ ~ ~

104+ [~ value] `[p=(f p.value) q=q.value]

105+ ^- (like B) [p=p.result q=mapped]

106+

97++ wonk |= veq=(like A)

107++ wonk |= veq=(like A)

98 ?- q.veq

108 ?- q.veq

99 ~ !!

109 ~ !!

tests/golden/prelude-1c-structural/tokens.txt+531−442

@@ -190,528 +190,617 @@

19039:9 name ys

19139:11 tight glyph ]

19240:7 INDENT

193−40:7 glyph ?-

193+40:7 glyph ^-

194−40:10 name xs

194+40:10 glyph (

195+40:11 tight name list

196+40:16 tvar A

197+40:17 tight glyph )

19541:9 INDENT

19841:9 INDENT

196−41:9 lit ~

199+41:9 glyph ?-

200+41:12 name xs

201+42:11 INDENT

202+42:11 lit ~

197−41:11 name ys

203+42:13 name ys

198−42:9 NEWLINE

204+43:11 NEWLINE

199−42:9 glyph [

205+43:11 glyph [

200−42:10 tight name item

206+43:12 tight name item

201−42:15 name rest

207+43:17 name rest

202−42:19 tight glyph ]

208+43:21 tight glyph ]

203−42:21 glyph [

209+43:23 glyph [

204−42:22 tight name item

210+43:24 tight name item

205−42:27 glyph (

211+43:29 glyph (

206−42:28 tight name weld

212+43:30 tight name weld

207−42:33 name rest

213+43:35 name rest

208−42:38 name ys

214+43:40 name ys

209−42:40 tight glyph )

215+43:42 tight glyph )

210−42:41 tight glyph ]

216+43:43 tight glyph ]

217+45:1 DEDENT

211−44:1 DEDENT

218+45:1 DEDENT

212−44:1 DEDENT

219+45:1 DEDENT

213−44:1 DEDENT

220+45:1 DEDENT

214−44:1 DEDENT

221+45:1 DEDENT

215−44:1 NEWLINE

222+45:1 NEWLINE

216−44:1 glyph ++

223+45:1 glyph ++

217−44:4 name turn

224+45:4 name turn

218−44:9 glyph |=

225+45:9 glyph |=

219−44:12 name args

226+45:12 name args

220−44:16 tight glyph =

227+45:16 tight glyph =

221−44:17 tight glyph [

228+45:17 tight glyph [

222−44:18 tight glyph (

229+45:18 tight glyph (

223−44:19 tight name list

230+45:19 tight name list

224−44:24 tvar A

231+45:24 tvar A

225−44:25 tight glyph )

232+45:25 tight glyph )

226−44:27 glyph $-(

233+45:27 glyph $-(

227−44:30 tight tvar A

234+45:30 tight tvar A

228−44:32 tvar B

235+45:32 tvar B

229−44:33 tight glyph )

236+45:33 tight glyph )

230−44:34 tight glyph ]

237+45:34 tight glyph ]

231−45:3 INDENT

238+46:3 INDENT

232−45:3 glyph ?-

239+46:3 glyph ?-

233−45:6 name args

240+46:6 name args

234−46:5 INDENT

241+47:5 INDENT

235−46:5 glyph [

242+47:5 glyph [

236−46:6 tight name xs

243+47:6 tight name xs

237−46:9 name f

244+47:9 name f

238−46:10 tight glyph ]

245+47:10 tight glyph ]

239−47:7 INDENT

246+48:7 INDENT

240−47:7 glyph ?-

247+48:7 glyph ^-

241−47:10 name xs

248+48:10 glyph (

249+48:11 tight name list

250+48:16 tvar B

251+48:17 tight glyph )

242−48:9 INDENT

252+49:9 INDENT

253+49:9 glyph ?-

254+49:12 name xs

255+50:11 INDENT

243−48:9 lit ~

256+50:11 lit ~

244−48:11 lit ~

257+50:13 lit ~

245−49:9 NEWLINE

258+51:11 NEWLINE

246−49:9 glyph [

259+51:11 glyph [

247−49:10 tight name item

260+51:12 tight name item

248−49:15 name rest

261+51:17 name rest

249−49:19 tight glyph ]

262+51:21 tight glyph ]

250−49:21 glyph [

263+51:23 glyph [

251−49:22 tight glyph (

264+51:24 tight glyph (

252−49:23 tight name f

265+51:25 tight name f

253−49:25 name item

266+51:27 name item

254−49:29 tight glyph )

255−49:31 glyph (

267+51:31 tight glyph )

268+51:33 glyph (

256−49:32 tight name turn

269+51:34 tight name turn

257−49:37 name rest

270+51:39 name rest

258−49:42 name f

271+51:44 name f

259−49:43 tight glyph )

272+51:45 tight glyph )

260−49:44 tight glyph ]

273+51:46 tight glyph ]

261−51:1 DEDENT

274+53:1 DEDENT

262−51:1 DEDENT

275+53:1 DEDENT

263−51:1 DEDENT

276+53:1 DEDENT

264−51:1 DEDENT

277+53:1 DEDENT

265−51:1 NEWLINE

278+53:1 DEDENT

266−51:1 glyph +$

267−51:4 name dime

268−51:9 glyph [

269−51:10 tight name p

270−51:11 tight glyph =

271−51:12 tight aura @ta

272−51:16 name q

273−51:17 tight glyph =

274−51:18 tight aura @

275−51:19 tight glyph ]

27653:1 NEWLINE

27953:1 NEWLINE

27753:1 glyph +$

28053:1 glyph +$

278−53:4 name hair

281+53:4 name dime

27953:9 glyph [

28253:9 glyph [

28053:10 tight name p

28353:10 tight name p

28153:11 tight glyph =

28453:11 tight glyph =

282−53:12 tight aura @ud

285+53:12 tight aura @ta

28353:16 name q

28653:16 name q

28453:17 tight glyph =

28753:17 tight glyph =

285−53:18 tight aura @ud

288+53:18 tight aura @

286−53:21 tight glyph ]

289+53:19 tight glyph ]

28755:1 NEWLINE

29055:1 NEWLINE

28855:1 glyph +$

29155:1 glyph +$

289−55:4 name pint

292+55:4 name hair

29055:9 glyph [

29355:9 glyph [

29155:10 tight name p

29455:10 tight name p

29255:11 tight glyph =

29555:11 tight glyph =

293−55:12 tight glyph [

296+55:12 tight aura @ud

294−55:13 tight name p

297+55:16 name q

295−55:14 tight glyph =

298+55:17 tight glyph =

296−55:15 tight aura @

297−55:17 name q

298−55:18 tight glyph =

299+55:18 tight aura @ud

299−55:19 tight aura @

300−55:20 tight glyph ]

301−55:22 name q

302−55:23 tight glyph =

303−55:24 tight glyph [

304−55:25 tight name p

305−55:26 tight glyph =

306−55:27 tight aura @

307−55:29 name q

308−55:30 tight glyph =

309−55:31 tight aura @

310−55:32 tight glyph ]

311−55:33 tight glyph ]

300+55:21 tight glyph ]

31257:1 NEWLINE

30157:1 NEWLINE

31357:1 glyph +$

30257:1 glyph +$

314−57:4 name coin

303+57:4 name pint

315−58:3 INDENT

316−58:3 glyph [

317−58:4 tight lit %$

318−58:7 name p

319−58:8 tight glyph =

320−58:9 tight name dime

321−58:13 tight glyph ]

304+57:9 glyph [

322−59:3 NEWLINE

323−59:3 glyph [

324−59:4 tight lit %blob

325−59:10 name p

305+57:10 tight name p

326−59:11 tight glyph =

306+57:11 tight glyph =

327−59:12 tight glyph *

307+57:12 tight glyph [

328−59:13 tight glyph ]

308+57:13 tight name p

329−60:3 NEWLINE

309+57:14 tight glyph =

310+57:15 tight aura @

311+57:17 name q

312+57:18 tight glyph =

313+57:19 tight aura @

314+57:20 tight glyph ]

315+57:22 name q

316+57:23 tight glyph =

317+57:24 tight glyph [

318+57:25 tight name p

319+57:26 tight glyph =

320+57:27 tight aura @

321+57:29 name q

322+57:30 tight glyph =

323+57:31 tight aura @

324+57:32 tight glyph ]

325+57:33 tight glyph ]

326+59:1 NEWLINE

327+59:1 glyph +$

328+59:4 name coin

329+60:3 INDENT

33060:3 glyph [

331−60:4 tight lit %many

331+60:4 tight lit %$

332+60:7 name p

333+60:8 tight glyph =

334+60:9 tight name dime

335+60:13 tight glyph ]

336+61:3 NEWLINE

337+61:3 glyph [

338+61:4 tight lit %blob

339+61:10 name p

340+61:11 tight glyph =

341+61:12 tight glyph *

342+61:13 tight glyph ]

343+62:3 NEWLINE

344+62:3 glyph [

345+62:4 tight lit %many

332−60:10 name p

346+62:10 name p

333−60:11 tight glyph =

347+62:11 tight glyph =

334−60:12 tight glyph (

348+62:12 tight glyph (

335−60:13 tight name list

349+62:13 tight name list

336−60:18 name coin

350+62:18 name coin

337−60:22 tight glyph )

351+62:22 tight glyph )

338−60:23 tight glyph ]

352+62:23 tight glyph ]

339−62:1 DEDENT

353+64:1 DEDENT

340−62:1 NEWLINE

341−62:1 glyph +$

342−62:4 name pair

343−62:9 glyph |$

344−62:12 glyph [

345−62:13 tight tvar A

346−62:15 tvar B

347−62:16 tight glyph ]

348−62:18 glyph [

349−62:19 tight name p

350−62:20 tight glyph =

351−62:21 tight tvar A

352−62:23 name q

353−62:24 tight glyph =

354−62:25 tight tvar B

355−62:26 tight glyph ]

35664:1 NEWLINE

35464:1 NEWLINE

35764:1 glyph +$

35564:1 glyph +$

358−64:4 name trel

356+64:4 name pair

35964:9 glyph |$

35764:9 glyph |$

36064:12 glyph [

35864:12 glyph [

36164:13 tight tvar A

35964:13 tight tvar A

36264:15 tvar B

36064:15 tvar B

363−64:17 tvar C

361+64:16 tight glyph ]

364−64:18 tight glyph ]

365−64:20 glyph [

362+64:18 glyph [

366−64:21 tight name p

363+64:19 tight name p

367−64:22 tight glyph =

364+64:20 tight glyph =

368−64:23 tight tvar A

365+64:21 tight tvar A

369−64:25 name q

366+64:23 name q

370−64:26 tight glyph =

367+64:24 tight glyph =

371−64:27 tight tvar B

368+64:25 tight tvar B

372−64:29 name r

373−64:30 tight glyph =

374−64:31 tight tvar C

375−64:32 tight glyph ]

369+64:26 tight glyph ]

37666:1 NEWLINE

37066:1 NEWLINE

37766:1 glyph +$

37166:1 glyph +$

378−66:4 name qual

372+66:4 name trel

37966:9 glyph |$

37366:9 glyph |$

38066:12 glyph [

37466:12 glyph [

38166:13 tight tvar A

37566:13 tight tvar A

38266:15 tvar B

37666:15 tvar B

38366:17 tvar C

37766:17 tvar C

384−66:19 tvar D

378+66:18 tight glyph ]

385−66:20 tight glyph ]

386−66:22 glyph [

379+66:20 glyph [

380+66:21 tight name p

381+66:22 tight glyph =

387−66:23 tight name p

382+66:23 tight tvar A

388−66:24 tight glyph =

389−66:25 tight tvar A

390−66:27 name q

383+66:25 name q

391−66:28 tight glyph =

384+66:26 tight glyph =

392−66:29 tight tvar B

385+66:27 tight tvar B

393−66:31 name r

386+66:29 name r

394−66:32 tight glyph =

387+66:30 tight glyph =

395−66:33 tight tvar C

388+66:31 tight tvar C

396−66:35 name s

397−66:36 tight glyph =

398−66:37 tight tvar D

399−66:38 tight glyph ]

389+66:32 tight glyph ]

40068:1 NEWLINE

39068:1 NEWLINE

40168:1 glyph +$

39168:1 glyph +$

402−68:4 name cord

392+68:4 name qual

403−68:9 aura @t

393+68:9 glyph |$

394+68:12 glyph [

395+68:13 tight tvar A

396+68:15 tvar B

397+68:17 tvar C

398+68:19 tvar D

399+68:20 tight glyph ]

400+68:22 glyph [

401+68:23 tight name p

402+68:24 tight glyph =

403+68:25 tight tvar A

404+68:27 name q

405+68:28 tight glyph =

406+68:29 tight tvar B

407+68:31 name r

408+68:32 tight glyph =

409+68:33 tight tvar C

410+68:35 name s

411+68:36 tight glyph =

412+68:37 tight tvar D

413+68:38 tight glyph ]

40470:1 NEWLINE

41470:1 NEWLINE

40570:1 glyph +$

41570:1 glyph +$

406−70:4 name knot

416+70:4 name cord

407−70:9 aura @ta

417+70:9 aura @t

40872:1 NEWLINE

41872:1 NEWLINE

40972:1 glyph +$

41972:1 glyph +$

410−72:4 name tape

420+72:4 name knot

411−72:9 glyph (

412−72:10 tight name list

413−72:15 aura @tD

421+72:9 aura @ta

414−72:18 tight glyph )

41574:1 NEWLINE

42274:1 NEWLINE

41674:1 glyph +$

42374:1 glyph +$

417−74:4 name path

424+74:4 name tape

41874:9 glyph (

42574:9 glyph (

41974:10 tight name list

42674:10 tight name list

420−74:15 name knot

427+74:15 aura @tD

421−74:19 tight glyph )

428+74:18 tight glyph )

42276:1 NEWLINE

42976:1 NEWLINE

42376:1 glyph +$

43076:1 glyph +$

424−76:4 name tank

431+76:4 name path

432+76:9 glyph (

433+76:10 tight name list

434+76:15 name knot

435+76:19 tight glyph )

436+78:1 NEWLINE

437+78:1 glyph +$

438+78:4 name tank

425−77:3 INDENT

439+79:3 INDENT

426−77:3 name cord

440+79:3 name cord

427−78:3 NEWLINE

428−78:3 glyph [

429−78:4 tight lit %leaf

430−78:10 name p

431−78:11 tight glyph =

432−78:12 tight name tape

433−78:16 tight glyph ]

434−79:3 NEWLINE

435−79:3 glyph [

436−79:4 tight lit %palm

437−79:10 name p

438−79:11 tight glyph =

439−79:12 tight glyph (

440−79:13 tight name qual

441−79:18 name tape

442−79:23 name tape

443−79:28 name tape

444−79:33 name tape

445−79:37 tight glyph )

446−79:39 name q

447−79:40 tight glyph =

448−79:41 tight glyph (

449−79:42 tight name list

450−79:47 name tank

451−79:51 tight glyph )

452−79:52 tight glyph ]

45380:3 NEWLINE

44180:3 NEWLINE

45480:3 glyph [

44280:3 glyph [

455−80:4 tight lit %rose

443+80:4 tight lit %leaf

45680:10 name p

44480:10 name p

45780:11 tight glyph =

44580:11 tight glyph =

458−80:12 tight glyph (

446+80:12 tight name tape

447+80:16 tight glyph ]

448+81:3 NEWLINE

449+81:3 glyph [

450+81:4 tight lit %palm

451+81:10 name p

452+81:11 tight glyph =

453+81:12 tight glyph (

459−80:13 tight name trel

454+81:13 tight name qual

460−80:18 name tape

455+81:18 name tape

461−80:23 name tape

456+81:23 name tape

462−80:28 name tape

457+81:28 name tape

458+81:33 name tape

463−80:32 tight glyph )

459+81:37 tight glyph )

464−80:34 name q

460+81:39 name q

465−80:35 tight glyph =

461+81:40 tight glyph =

466−80:36 tight glyph (

462+81:41 tight glyph (

467−80:37 tight name list

463+81:42 tight name list

468−80:42 name tank

464+81:47 name tank

469−80:46 tight glyph )

470−80:47 tight glyph ]

465+81:51 tight glyph )

471−82:1 DEDENT

466+81:52 tight glyph ]

472−82:1 NEWLINE

467+82:3 NEWLINE

473−82:1 glyph +$

468+82:3 glyph [

474−82:4 name nail

469+82:4 tight lit %rose

475−82:9 glyph [

476−82:10 tight name p

470+82:10 name p

47782:11 tight glyph =

47182:11 tight glyph =

478−82:12 tight name hair

472+82:12 tight glyph (

473+82:13 tight name trel

474+82:18 name tape

475+82:23 name tape

476+82:28 name tape

477+82:32 tight glyph )

479−82:17 name q

478+82:34 name q

480−82:18 tight glyph =

479+82:35 tight glyph =

481−82:19 tight name tape

480+82:36 tight glyph (

481+82:37 tight name list

482+82:42 name tank

483+82:46 tight glyph )

482−82:23 tight glyph ]

484+82:47 tight glyph ]

485+84:1 DEDENT

48384:1 NEWLINE

48684:1 NEWLINE

48484:1 glyph +$

48784:1 glyph +$

485−84:4 name edge

488+84:4 name nail

48684:9 glyph [

48984:9 glyph [

48784:10 tight name p

49084:10 tight name p

48884:11 tight glyph =

49184:11 tight glyph =

48984:12 tight name hair

49284:12 tight name hair

49084:17 name q

49384:17 name q

49184:18 tight glyph =

49484:18 tight glyph =

492−84:19 tight glyph (

495+84:19 tight name tape

493−84:20 tight name unit

494−84:25 glyph [

495−84:26 tight name p

496−84:27 tight glyph =

497−84:28 tight glyph *

498−84:30 name q

499−84:31 tight glyph =

500−84:32 tight name nail

501−84:36 tight glyph ]

502−84:37 tight glyph )

503−84:38 tight glyph ]

496+84:23 tight glyph ]

50486:1 NEWLINE

49786:1 NEWLINE

50586:1 glyph +$

49886:1 glyph +$

506−86:4 name rule

499+86:4 name edge

507−86:9 glyph $-(

500+86:9 glyph [

501+86:10 tight name p

502+86:11 tight glyph =

503+86:12 tight name hair

504+86:17 name q

505+86:18 tight glyph =

506+86:19 tight glyph (

507+86:20 tight name unit

508+86:25 glyph [

509+86:26 tight name p

510+86:27 tight glyph =

511+86:28 tight glyph *

512+86:30 name q

513+86:31 tight glyph =

508−86:12 tight name nail

514+86:32 tight name nail

509−86:17 name edge

515+86:36 tight glyph ]

510−86:21 tight glyph )

516+86:37 tight glyph )

517+86:38 tight glyph ]

51188:1 NEWLINE

51888:1 NEWLINE

51288:1 glyph +$

51988:1 glyph +$

513−88:4 name spot

520+88:4 name rule

514−88:9 glyph [

521+88:9 glyph $-(

515−88:10 tight name p

516−88:11 tight glyph =

517−88:12 tight name path

522+88:12 tight name nail

518−88:17 name q

523+88:17 name edge

519−88:18 tight glyph =

524+88:21 tight glyph )

520−88:19 tight name pint

521−88:23 tight glyph ]

52290:1 NEWLINE

52590:1 NEWLINE

52390:1 glyph +$

52690:1 glyph +$

524−90:4 name toon

527+90:4 name spot

528+90:9 glyph [

529+90:10 tight name p

530+90:11 tight glyph =

531+90:12 tight name path

532+90:17 name q

533+90:18 tight glyph =

534+90:19 tight name pint

535+90:23 tight glyph ]

536+92:1 NEWLINE

537+92:1 glyph +$

538+92:4 name toon

525−91:3 INDENT

539+93:3 INDENT

526−91:3 glyph [

527−91:4 tight lit %0

528−91:7 name p

529−91:8 tight glyph =

530−91:9 tight glyph *

531−91:10 tight glyph ]

532−92:3 NEWLINE

533−92:3 glyph [

534−92:4 tight lit %1

535−92:7 name p

536−92:8 tight glyph =

537−92:9 tight glyph *

538−92:10 tight glyph ]

539−93:3 NEWLINE

54093:3 glyph [

541−93:4 tight lit %2

541+93:4 tight lit %0

54293:7 name p

54393:8 tight glyph =

544−93:9 tight glyph (

544+93:9 tight glyph *

545+93:10 tight glyph ]

546+94:3 NEWLINE

547+94:3 glyph [

548+94:4 tight lit %1

549+94:7 name p

550+94:8 tight glyph =

551+94:9 tight glyph *

552+94:10 tight glyph ]

553+95:3 NEWLINE

554+95:3 glyph [

555+95:4 tight lit %2

556+95:7 name p

557+95:8 tight glyph =

558+95:9 tight glyph (

545−93:10 tight name list

559+95:10 tight name list

546−93:15 name tank

560+95:15 name tank

547−93:19 tight glyph )

561+95:19 tight glyph )

548−93:20 tight glyph ]

562+95:20 tight glyph ]

549−95:1 DEDENT

563+97:1 DEDENT

550−95:1 NEWLINE

551−95:1 glyph +$

552−95:4 name like

553−95:9 glyph |$

554−95:12 glyph [

555−95:13 tight tvar A

556−95:14 tight glyph ]

557−95:16 glyph [

558−95:17 tight name p

559−95:18 tight glyph =

560−95:19 tight name hair

561−95:24 name q

562−95:25 tight glyph =

563−95:26 tight glyph (

564−95:27 tight name unit

565−95:32 glyph [

566−95:33 tight name p

567−95:34 tight glyph =

568−95:35 tight tvar A

569−95:37 name q

570−95:38 tight glyph =

571−95:39 tight name nail

572−95:43 tight glyph ]

573−95:44 tight glyph )

574−95:45 tight glyph ]

57597:1 NEWLINE

56497:1 NEWLINE

576−97:1 glyph ++

565+97:1 glyph +$

577−97:4 name wonk

566+97:4 name like

567+97:9 glyph |$

568+97:12 glyph [

569+97:13 tight tvar A

570+97:14 tight glyph ]

571+97:16 glyph [

572+97:17 tight name p

573+97:18 tight glyph =

574+97:19 tight name hair

575+97:24 name q

576+97:25 tight glyph =

577+97:26 tight glyph (

578+97:27 tight name unit

579+97:32 glyph [

580+97:33 tight name p

581+97:34 tight glyph =

582+97:35 tight tvar A

583+97:37 name q

584+97:38 tight glyph =

585+97:39 tight name nail

586+97:43 tight glyph ]

587+97:44 tight glyph )

588+97:45 tight glyph ]

589+99:1 NEWLINE

590+99:1 glyph ++

591+99:4 name like

578−97:9 glyph |=

592+99:9 glyph |=

579−97:12 name veq

593+99:12 glyph [

594+99:13 tight name f

580−97:15 tight glyph =

595+99:14 tight glyph =

581−97:16 tight glyph (

596+99:15 tight glyph $-(

582−97:17 tight name like

597+99:18 tight tvar A

583−97:22 tvar A

598+99:20 tvar B

584−97:23 tight glyph )

599+99:21 tight glyph )

600+99:23 name result

601+99:29 tight glyph =

602+99:30 tight glyph (

603+99:31 tight name like

604+99:36 tvar A

605+99:37 tight glyph )

606+99:38 tight glyph ]

585−98:3 INDENT

607+100:3 INDENT

586−98:3 glyph ?-

608+100:3 glyph ++

587−98:6 wing q.veq

609+100:6 name mapped

610+101:5 INDENT

611+101:5 glyph ^-

612+101:8 glyph (

613+101:9 tight name unit

614+101:14 glyph [

615+101:15 tight name p

616+101:16 tight glyph =

617+101:17 tight tvar B

618+101:19 name q

619+101:20 tight glyph =

620+101:21 tight name nail

621+101:25 tight glyph ]

622+101:26 tight glyph )

623+102:7 INDENT

624+102:7 glyph ?-

625+102:10 wing q.result

588−99:5 INDENT

626+103:9 INDENT

589−99:5 lit ~

627+103:9 lit ~

590−99:7 glyph !!

628+103:11 lit ~

591−100:5 NEWLINE

592−100:5 glyph [

593−100:6 tight lit ~

594−100:8 name product

595−100:15 tight glyph ]

596−100:17 wing p.product

597−102:1 DEDENT

598−102:1 DEDENT

599−102:1 NEWLINE

629+104:9 NEWLINE

600−102:1 glyph +$

601−102:4 name lone

602−102:9 glyph |$

603−102:12 glyph [

630+104:9 glyph [

604−102:13 tight tvar A

631+104:10 tight lit ~

605−102:14 tight glyph ]

632+104:12 name value

606−102:16 glyph [

607−102:17 tight name p

608−102:18 tight glyph =

609−102:19 tight tvar A

610−102:20 tight glyph ]

611−104:1 NEWLINE

612−104:1 glyph +$

613−104:4 name lest

614−104:9 glyph |$

615−104:12 glyph [

616−104:13 tight tvar A

617−104:14 tight glyph ]

633+104:17 tight glyph ]

618−104:16 glyph [

634+104:19 glyph `

619−104:17 tight name i

620−104:18 tight glyph =

635+104:20 tight glyph [

621−104:19 tight tvar A

636+104:21 tight name p

622−104:21 name t

623104:22 tight glyph =

637104:22 tight glyph =

624104:23 tight glyph (

638104:23 tight glyph (

625−104:24 tight name list

639+104:24 tight name f

626−104:29 tvar A

640+104:26 wing p.value

627−104:30 tight glyph )

641+104:33 tight glyph )

628−104:31 tight glyph ]

642+104:35 name q

629−106:1 NEWLINE

643+104:36 tight glyph =

630−106:1 glyph +$

644+104:37 tight wing q.value

631−106:4 name pole

645+104:44 tight glyph ]

632−106:9 glyph |$

646+105:3 DEDENT

633−106:12 glyph [

647+105:3 DEDENT

634−106:13 tight tvar A

648+105:3 DEDENT

635−106:14 tight glyph ]

649+105:3 NEWLINE

636−107:3 INDENT

650+105:3 glyph ^-

637−107:3 lit ~

651+105:6 glyph (

638−108:3 NEWLINE

652+105:7 tight name like

639−108:3 glyph [

653+105:12 tvar B

640−108:4 tight tvar A

641−108:6 glyph (

642−108:7 tight name pole

643−108:12 tvar A

644−108:13 tight glyph )

645−108:14 tight glyph ]

646−110:1 DEDENT

647−110:1 NEWLINE

648−110:1 glyph +$

649−110:4 name quip

650−110:9 glyph |$

651−110:12 glyph [

652−110:13 tight tvar A

653−110:15 tvar B

654−110:16 tight glyph ]

655−110:18 glyph [

656−110:19 tight glyph (

657−110:20 tight name list

658−110:25 tvar A

659−110:26 tight glyph )

654+105:13 tight glyph )

655+105:15 glyph [

656+105:16 tight name p

657+105:17 tight glyph =

658+105:18 tight wing p.result

659+105:27 name q

660+105:28 tight glyph =

661+105:29 tight name mapped

662+105:35 tight glyph ]

663+107:1 DEDENT

664+107:1 NEWLINE

665+107:1 glyph ++

666+107:4 name wonk

667+107:9 glyph |=

668+107:12 name veq

669+107:15 tight glyph =

670+107:16 tight glyph (

671+107:17 tight name like

660−110:28 tvar B

672+107:22 tvar A

673+107:23 tight glyph )

674+108:3 INDENT

675+108:3 glyph ?-

676+108:6 wing q.veq

677+109:5 INDENT

678+109:5 lit ~

679+109:7 glyph !!

680+110:5 NEWLINE

681+110:5 glyph [

682+110:6 tight lit ~

683+110:8 name product

661−110:29 tight glyph ]

684+110:15 tight glyph ]

685+110:17 wing p.product

686+112:1 DEDENT

687+112:1 DEDENT

662112:1 NEWLINE

688112:1 NEWLINE

663112:1 glyph +$

689112:1 glyph +$

664−112:4 name tree

690+112:4 name lone

665112:9 glyph |$

691112:9 glyph |$

666112:12 glyph [

692112:12 glyph [

667112:13 tight tvar A

693112:13 tight tvar A

668112:14 tight glyph ]

694112:14 tight glyph ]

669−113:3 INDENT

695+112:16 glyph [

670−113:3 lit ~

696+112:17 tight name p

697+112:18 tight glyph =

698+112:19 tight tvar A

699+112:20 tight glyph ]

671−114:3 NEWLINE

700+114:1 NEWLINE

672−114:3 glyph [

701+114:1 glyph +$

673−114:4 tight name n

702+114:4 name lest

674−114:5 tight glyph =

703+114:9 glyph |$

675−114:6 tight tvar A

676−114:8 name l

677−114:9 tight glyph =

704+114:12 glyph [

678−114:10 tight glyph (

705+114:13 tight tvar A

679−114:11 tight name tree

706+114:14 tight glyph ]

680−114:16 tvar A

707+114:16 glyph [

681−114:17 tight glyph )

708+114:17 tight name i

682−114:19 name r

709+114:18 tight glyph =

683−114:20 tight glyph =

710+114:19 tight tvar A

684−114:21 tight glyph (

711+114:21 name t

685−114:22 tight name tree

712+114:22 tight glyph =

686−114:27 tvar A

713+114:23 tight glyph (

687−114:28 tight glyph )

714+114:24 tight name list

715+114:29 tvar A

688−114:29 tight glyph ]

716+114:30 tight glyph )

689−116:1 DEDENT

717+114:31 tight glyph ]

690116:1 NEWLINE

718116:1 NEWLINE

691116:1 glyph +$

719116:1 glyph +$

692−116:4 name each

720+116:4 name pole

693116:9 glyph |$

721116:9 glyph |$

694116:12 glyph [

722116:12 glyph [

695116:13 tight tvar A

723116:13 tight tvar A

696−116:15 tvar B

697−116:16 tight glyph ]

724+116:14 tight glyph ]

698117:3 INDENT

725117:3 INDENT

699−117:3 glyph [

726+117:3 lit ~

700−117:4 tight lit %|

701−117:7 name p

702−117:8 tight glyph =

703−117:9 tight tvar B

704−117:10 tight glyph ]

705118:3 NEWLINE

727118:3 NEWLINE

706118:3 glyph [

728118:3 glyph [

707−118:4 tight lit %&

729+118:4 tight tvar A

730+118:6 glyph (

708−118:7 name p

731+118:7 tight name pole

709−118:8 tight glyph =

732+118:12 tvar A

710−118:9 tight tvar A

733+118:13 tight glyph )

711−118:10 tight glyph ]

734+118:14 tight glyph ]

712120:1 DEDENT

735120:1 DEDENT

713120:1 NEWLINE

736120:1 NEWLINE

714120:1 glyph +$

737120:1 glyph +$

715−120:4 name bloq

738+120:4 name quip

739+120:9 glyph |$

740+120:12 glyph [

741+120:13 tight tvar A

742+120:15 tvar B

743+120:16 tight glyph ]

744+120:18 glyph [

745+120:19 tight glyph (

746+120:20 tight name list

747+120:25 tvar A

748+120:26 tight glyph )

749+120:28 tvar B

750+120:29 tight glyph ]

751+122:1 NEWLINE

752+122:1 glyph +$

753+122:4 name tree

754+122:9 glyph |$

755+122:12 glyph [

756+122:13 tight tvar A

757+122:14 tight glyph ]

758+123:3 INDENT

759+123:3 lit ~

760+124:3 NEWLINE

761+124:3 glyph [

762+124:4 tight name n

763+124:5 tight glyph =

764+124:6 tight tvar A

765+124:8 name l

766+124:9 tight glyph =

767+124:10 tight glyph (

768+124:11 tight name tree

769+124:16 tvar A

770+124:17 tight glyph )

771+124:19 name r

772+124:20 tight glyph =

773+124:21 tight glyph (

774+124:22 tight name tree

775+124:27 tvar A

776+124:28 tight glyph )

777+124:29 tight glyph ]

778+126:1 DEDENT

779+126:1 NEWLINE

780+126:1 glyph +$

781+126:4 name each

782+126:9 glyph |$

783+126:12 glyph [

784+126:13 tight tvar A

785+126:15 tvar B

786+126:16 tight glyph ]

787+127:3 INDENT

788+127:3 glyph [

789+127:4 tight lit %|

790+127:7 name p

791+127:8 tight glyph =

792+127:9 tight tvar B

793+127:10 tight glyph ]

794+128:3 NEWLINE

795+128:3 glyph [

796+128:4 tight lit %&

797+128:7 name p

798+128:8 tight glyph =

799+128:9 tight tvar A

800+128:10 tight glyph ]

801+130:1 DEDENT

802+130:1 NEWLINE

803+130:1 glyph +$

804+130:4 name bloq

716−120:9 aura @

805+130:9 aura @

717−120:10 NEWLINE

806+130:10 NEWLINE

tests/golden/prelude-1c-structural/tree.txt+223−185

@@ -87,198 +87,236 @@

87 (arm 39:5

88 (cell 39:5 (bind 39:6 xs) (bind 39:9 ys))

89 (body 40:7

90− (branch 40:7

90+ (cast 40:7

91− (wing 40:10 xs)

91+ (apply 40:10 list (tvar 40:16 A))

92− (arm 41:9 (lit 41:9 ~) (wing 41:11 ys))

92+ (body 41:9

93+ (branch 41:9

94+ (wing 41:12 xs)

95+ (arm 42:11 (lit 42:11 ~) (wing 42:13 ys))

93− (arm 42:9

96+ (arm 43:11

94− (cell 42:9 (bind 42:10 item) (bind 42:15 rest))

97+ (cell 43:11 (bind 43:12 item) (bind 43:17 rest))

95− (tuple 42:21

98+ (tuple 43:23

96− (wing 42:22 item)

99+ (wing 43:24 item)

97− (group 42:27

100+ (group 43:29

98− (call 42:28 (wing 42:28 weld) (wing 42:33 rest) (wing 42:38 ys))))))))))))

101+ (call 43:30 (wing 43:30 weld) (wing 43:35 rest) (wing 43:40 ys))))))))))))))

99− (value 44:1 turn

102+ (value 45:1 turn

100− (gate 44:9

103+ (gate 45:9

101− (face 44:12 args

104+ (face 45:12 args

102− (cell 44:17

105+ (cell 45:17

103− (apply 44:18 list (tvar 44:24 A))

106+ (apply 45:18 list (tvar 45:24 A))

104− (fn 44:27 (tvar 44:30 A) (tvar 44:32 B))))

107+ (fn 45:27 (tvar 45:30 A) (tvar 45:32 B))))

105− (body 45:3

108+ (body 46:3

106− (branch 45:3

109+ (branch 46:3

107− (wing 45:6 args)

110+ (wing 46:6 args)

108− (arm 46:5

111+ (arm 47:5

109− (cell 46:5 (bind 46:6 xs) (bind 46:9 f))

112+ (cell 47:5 (bind 47:6 xs) (bind 47:9 f))

110− (body 47:7

113+ (body 48:7

111− (branch 47:7

114+ (cast 48:7

115+ (apply 48:10 list (tvar 48:16 B))

116+ (body 49:9

117+ (branch 49:9

112− (wing 47:10 xs)

118+ (wing 49:12 xs)

113− (arm 48:9 (lit 48:9 ~) (lit 48:11 ~))

119+ (arm 50:11 (lit 50:11 ~) (lit 50:13 ~))

114− (arm 49:9

120+ (arm 51:11

115− (cell 49:9 (bind 49:10 item) (bind 49:15 rest))

121+ (cell 51:11 (bind 51:12 item) (bind 51:17 rest))

116− (tuple 49:21

122+ (tuple 51:23

117− (group 49:22

123+ (group 51:24

118− (call 49:23 (wing 49:23 f) (wing 49:25 item)))

124+ (call 51:25 (wing 51:25 f) (wing 51:27 item)))

119− (group 49:31

125+ (group 51:33

120− (call 49:32 (wing 49:32 turn) (wing 49:37 rest) (wing 49:42 f))))))))))))

126+ (call 51:34 (wing 51:34 turn) (wing 51:39 rest) (wing 51:44 f))))))))))))))

121− (mold 51:1 dime

127+ (mold 53:1 dime

122− (cell 51:9

123− (face 51:10 p (aura 51:12 @ta))

124− (face 51:16 q (aura 51:18 @))))

125− (mold 53:1 hair

126 (cell 53:9

128 (cell 53:9

127− (face 53:10 p (aura 53:12 @ud))

129+ (face 53:10 p (aura 53:12 @ta))

128− (face 53:16 q (aura 53:18 @ud))))

130+ (face 53:16 q (aura 53:18 @))))

129− (mold 55:1 pint

131+ (mold 55:1 hair

130 (cell 55:9

132 (cell 55:9

131− (face 55:10 p

133+ (face 55:10 p (aura 55:12 @ud))

134+ (face 55:16 q (aura 55:18 @ud))))

135+ (mold 57:1 pint

136+ (cell 57:9

137+ (face 57:10 p

132− (cell 55:12

138+ (cell 57:12

133− (face 55:13 p (aura 55:15 @))

139+ (face 57:13 p (aura 57:15 @))

134− (face 55:17 q (aura 55:19 @))))

140+ (face 57:17 q (aura 57:19 @))))

135− (face 55:22 q

141+ (face 57:22 q

136− (cell 55:24

142+ (cell 57:24

137− (face 55:25 p (aura 55:27 @))

143+ (face 57:25 p (aura 57:27 @))

138− (face 55:29 q (aura 55:31 @))))))

144+ (face 57:29 q (aura 57:31 @))))))

139− (mold 57:1 coin

145+ (mold 59:1 coin

140− (union 58:3

146+ (union 60:3

141− (cell 58:3

142− (const 58:4 %$)

143− (face 58:7 p (ref 58:9 dime)))

144− (cell 59:3

145− (const 59:4 %blob)

146− (face 59:10 p (noun 59:12)))

147 (cell 60:3

148− (const 60:4 %many)

148+ (const 60:4 %$)

149+ (face 60:7 p (ref 60:9 dime)))

150+ (cell 61:3

151+ (const 61:4 %blob)

152+ (face 61:10 p (noun 61:12)))

153+ (cell 62:3

154+ (const 62:4 %many)

149− (face 60:10 p

155+ (face 62:10 p

150− (apply 60:12 list (ref 60:18 coin))))))

156+ (apply 62:12 list (ref 62:18 coin))))))

151− (mold 62:1 pair

157+ (mold 64:1 pair

152− (generic 62:9 A B

158+ (generic 64:9 A B

153− (cell 62:18

159+ (cell 64:18

154− (face 62:19 p (tvar 62:21 A))

160+ (face 64:19 p (tvar 64:21 A))

155− (face 62:23 q (tvar 62:25 B)))))

161+ (face 64:23 q (tvar 64:25 B)))))

156− (mold 64:1 trel

162+ (mold 66:1 trel

157− (generic 64:9 A B C

163+ (generic 66:9 A B C

158− (cell 64:20

164+ (cell 66:20

159− (face 64:21 p (tvar 64:23 A))

165+ (face 66:21 p (tvar 66:23 A))

160− (face 64:25 q (tvar 64:27 B))

166+ (face 66:25 q (tvar 66:27 B))

161− (face 64:29 r (tvar 64:31 C)))))

167+ (face 66:29 r (tvar 66:31 C)))))

162− (mold 66:1 qual

168+ (mold 68:1 qual

163− (generic 66:9 A B C D

169+ (generic 68:9 A B C D

164− (cell 66:22

170+ (cell 68:22

165− (face 66:23 p (tvar 66:25 A))

171+ (face 68:23 p (tvar 68:25 A))

166− (face 66:27 q (tvar 66:29 B))

172+ (face 68:27 q (tvar 68:29 B))

167− (face 66:31 r (tvar 66:33 C))

173+ (face 68:31 r (tvar 68:33 C))

168− (face 66:35 s (tvar 66:37 D)))))

174+ (face 68:35 s (tvar 68:37 D)))))

169− (mold 68:1 cord (aura 68:9 @t))

175+ (mold 70:1 cord (aura 70:9 @t))

170− (mold 70:1 knot (aura 70:9 @ta))

176+ (mold 72:1 knot (aura 72:9 @ta))

171− (mold 72:1 tape

177+ (mold 74:1 tape

172− (apply 72:9 list (aura 72:15 @tD)))

178+ (apply 74:9 list (aura 74:15 @tD)))

173− (mold 74:1 path

179+ (mold 76:1 path

174− (apply 74:9 list (ref 74:15 knot)))

180+ (apply 76:9 list (ref 76:15 knot)))

175− (mold 76:1 tank

181+ (mold 78:1 tank

176− (union 77:3

182+ (union 79:3

177− (ref 77:3 cord)

183+ (ref 79:3 cord)

178− (cell 78:3

179− (const 78:4 %leaf)

180− (face 78:10 p (ref 78:12 tape)))

181− (cell 79:3

182− (const 79:4 %palm)

183− (face 79:10 p

184− (apply 79:12 qual (ref 79:18 tape) (ref 79:23 tape) (ref 79:28 tape) (ref 79:33 tape)))

185− (face 79:39 q

186− (apply 79:41 list (ref 79:47 tank))))

187 (cell 80:3

184 (cell 80:3

188− (const 80:4 %rose)

185+ (const 80:4 %leaf)

186+ (face 80:10 p (ref 80:12 tape)))

187+ (cell 81:3

188+ (const 81:4 %palm)

189+ (face 81:10 p

190+ (apply 81:12 qual (ref 81:18 tape) (ref 81:23 tape) (ref 81:28 tape) (ref 81:33 tape)))

191+ (face 81:39 q

192+ (apply 81:41 list (ref 81:47 tank))))

193+ (cell 82:3

194+ (const 82:4 %rose)

189− (face 80:10 p

195+ (face 82:10 p

190− (apply 80:12 trel (ref 80:18 tape) (ref 80:23 tape) (ref 80:28 tape)))

196+ (apply 82:12 trel (ref 82:18 tape) (ref 82:23 tape) (ref 82:28 tape)))

191− (face 80:34 q

197+ (face 82:34 q

192− (apply 80:36 list (ref 80:42 tank))))))

198+ (apply 82:36 list (ref 82:42 tank))))))

193− (mold 82:1 nail

199+ (mold 84:1 nail

194− (cell 82:9

195− (face 82:10 p (ref 82:12 hair))

196− (face 82:17 q (ref 82:19 tape))))

197− (mold 84:1 edge

198 (cell 84:9

200 (cell 84:9

199 (face 84:10 p (ref 84:12 hair))

201 (face 84:10 p (ref 84:12 hair))

200− (face 84:17 q

202+ (face 84:17 q (ref 84:19 tape))))

203+ (mold 86:1 edge

204+ (cell 86:9

205+ (face 86:10 p (ref 86:12 hair))

206+ (face 86:17 q

201− (apply 84:19 unit

207+ (apply 86:19 unit

202− (cell 84:25

208+ (cell 86:25

203− (face 84:26 p (noun 84:28))

209+ (face 86:26 p (noun 86:28))

204− (face 84:30 q (ref 84:32 nail)))))))

210+ (face 86:30 q (ref 86:32 nail)))))))

205− (mold 86:1 rule

211+ (mold 88:1 rule

206− (fn 86:9 (ref 86:12 nail) (ref 86:17 edge)))

212+ (fn 88:9 (ref 88:12 nail) (ref 88:17 edge)))

207− (mold 88:1 spot

213+ (mold 90:1 spot

208− (cell 88:9

214+ (cell 90:9

209− (face 88:10 p (ref 88:12 path))

215+ (face 90:10 p (ref 90:12 path))

210− (face 88:17 q (ref 88:19 pint))))

216+ (face 90:17 q (ref 90:19 pint))))

211− (mold 90:1 toon

217+ (mold 92:1 toon

212− (union 91:3

218+ (union 93:3

213− (cell 91:3

214− (const 91:4 %0)

215− (face 91:7 p (noun 91:9)))

216− (cell 92:3

217− (const 92:4 %1)

218− (face 92:7 p (noun 92:9)))

219 (cell 93:3

220− (const 93:4 %2)

220+ (const 93:4 %0)

221+ (face 93:7 p (noun 93:9)))

222+ (cell 94:3

223+ (const 94:4 %1)

224+ (face 94:7 p (noun 94:9)))

225+ (cell 95:3

226+ (const 95:4 %2)

221− (face 93:7 p

227+ (face 95:7 p

222− (apply 93:9 list (ref 93:15 tank))))))

228+ (apply 95:9 list (ref 95:15 tank))))))

223− (mold 95:1 like

229+ (mold 97:1 like

224− (generic 95:9 A

230+ (generic 97:9 A

225− (cell 95:16

231+ (cell 97:16

226− (face 95:17 p (ref 95:19 hair))

232+ (face 97:17 p (ref 97:19 hair))

227− (face 95:24 q

233+ (face 97:24 q

228− (apply 95:26 unit

234+ (apply 97:26 unit

229− (cell 95:32

235+ (cell 97:32

230− (face 95:33 p (tvar 95:35 A))

236+ (face 97:33 p (tvar 97:35 A))

231− (face 95:37 q (ref 95:39 nail))))))))

237+ (face 97:37 q (ref 97:39 nail))))))))

232− (value 97:1 wonk

238+ (value 99:1 like

239+ (gate 99:9

240+ (cell 99:12

241+ (face 99:13 f

242+ (fn 99:15 (tvar 99:18 A) (tvar 99:20 B)))

243+ (face 99:23 result

244+ (apply 99:30 like (tvar 99:36 A))))

245+ (body 100:3

246+ (value 100:3 mapped

247+ (body 101:5

248+ (cast 101:5

249+ (apply 101:8 unit

250+ (cell 101:14

251+ (face 101:15 p (tvar 101:17 B))

252+ (face 101:19 q (ref 101:21 nail))))

253+ (body 102:7

254+ (branch 102:7

255+ (wing 102:10 q.result)

256+ (arm 103:9 (lit 103:9 ~) (lit 103:11 ~))

257+ (arm 104:9

258+ (cell 104:9 (lit 104:10 ~) (bind 104:12 value))

259+ (unit 104:19

260+ (tuple 104:20

261+ (face 104:21 p

262+ (group 104:23

263+ (call 104:24 (wing 104:24 f) (wing 104:26 p.value))))

264+ (face 104:35 q (wing 104:37 q.value))))))))))

265+ (cast 105:3

266+ (apply 105:6 like (tvar 105:12 B))

267+ (tuple 105:15

268+ (face 105:16 p (wing 105:18 p.result))

269+ (face 105:27 q (wing 105:29 mapped)))))))

270+ (value 107:1 wonk

233− (gate 97:9

271+ (gate 107:9

234− (face 97:12 veq

272+ (face 107:12 veq

235− (apply 97:16 like (tvar 97:22 A)))

273+ (apply 107:16 like (tvar 107:22 A)))

236− (body 98:3

274+ (body 108:3

237− (branch 98:3

275+ (branch 108:3

238− (wing 98:6 q.veq)

276+ (wing 108:6 q.veq)

239− (arm 99:5 (lit 99:5 ~) (crash 99:7))

277+ (arm 109:5 (lit 109:5 ~) (crash 109:7))

240− (arm 100:5

278+ (arm 110:5

241− (cell 100:5 (lit 100:6 ~) (bind 100:8 product))

279+ (cell 110:5 (lit 110:6 ~) (bind 110:8 product))

242− (wing 100:17 p.product))))))

280+ (wing 110:17 p.product))))))

243− (mold 102:1 lone

281+ (mold 112:1 lone

244− (generic 102:9 A

245− (cell 102:16

246− (face 102:17 p (tvar 102:19 A)))))

247− (mold 104:1 lest

248− (generic 104:9 A

249− (cell 104:16

250− (face 104:17 i (tvar 104:19 A))

251− (face 104:21 t

252− (apply 104:23 list (tvar 104:29 A))))))

253− (mold 106:1 pole

254− (generic 106:9 A

255− (union 107:3

256− (const 107:3 ~)

257− (cell 108:3

258− (tvar 108:4 A)

259− (apply 108:6 pole (tvar 108:12 A))))))

260− (mold 110:1 quip

261− (generic 110:9 A B

262− (cell 110:18

263− (apply 110:19 list (tvar 110:25 A))

264− (tvar 110:28 B))))

265− (mold 112:1 tree

266 (generic 112:9 A

282 (generic 112:9 A

267− (union 113:3

283+ (cell 112:16

268− (const 113:3 ~)

284+ (face 112:17 p (tvar 112:19 A)))))

269− (cell 114:3

285+ (mold 114:1 lest

270− (face 114:4 n (tvar 114:6 A))

286+ (generic 114:9 A

271− (face 114:8 l

287+ (cell 114:16

272− (apply 114:10 tree (tvar 114:16 A)))

288+ (face 114:17 i (tvar 114:19 A))

273− (face 114:19 r

289+ (face 114:21 t

274− (apply 114:21 tree (tvar 114:27 A)))))))

290+ (apply 114:23 list (tvar 114:29 A))))))

275− (mold 116:1 each

291+ (mold 116:1 pole

276− (generic 116:9 A B

292+ (generic 116:9 A

277 (union 117:3

293 (union 117:3

278− (cell 117:3

294+ (const 117:3 ~)

279− (const 117:4 %|)

280− (face 117:7 p (tvar 117:9 B)))

281 (cell 118:3

295 (cell 118:3

296+ (tvar 118:4 A)

297+ (apply 118:6 pole (tvar 118:12 A))))))

298+ (mold 120:1 quip

299+ (generic 120:9 A B

300+ (cell 120:18

301+ (apply 120:19 list (tvar 120:25 A))

302+ (tvar 120:28 B))))

303+ (mold 122:1 tree

304+ (generic 122:9 A

305+ (union 123:3

306+ (const 123:3 ~)

307+ (cell 124:3

308+ (face 124:4 n (tvar 124:6 A))

309+ (face 124:8 l

310+ (apply 124:10 tree (tvar 124:16 A)))

311+ (face 124:19 r

312+ (apply 124:21 tree (tvar 124:27 A)))))))

313+ (mold 126:1 each

314+ (generic 126:9 A B

315+ (union 127:3

316+ (cell 127:3

282− (const 118:4 %&)

317+ (const 127:4 %|)

318+ (face 127:7 p (tvar 127:9 B)))

319+ (cell 128:3

320+ (const 128:4 %&)

283− (face 118:7 p (tvar 118:9 A))))))

321+ (face 128:7 p (tvar 128:9 A))))))

284− (mold 120:1 bloq (aura 120:9 @)))

322+ (mold 130:1 bloq (aura 130:9 @)))

tests/golden/prelude-1c-structural/types.txt+3−2

@@ -5,8 +5,8 @@ partial inference; module not checked

5++ not: $-(? ?)

6+$ list: cases proven disjoint; mold not checked

7+$ unit: cases proven disjoint; mold not checked

8−++ fall: sample mold is not supported by partial inference

8+++ fall: $-([(unit A) A] A)

9−++ need: sample mold is not supported by partial inference

9+++ need: $-((unit A) A)

10++ weld: sample mold is not supported by partial inference

11++ turn: sample mold is not supported by partial inference

12+$ dime: not checked

@@ -27,6 +27,7 @@ partial inference; module not checked

27+$ spot: not checked

28+$ toon: cases proven disjoint; mold not checked

29+$ like: not checked

30+++ like: sample mold is not supported by partial inference

30++ wonk: sample mold is not supported by partial inference

31++ wonk: sample mold is not supported by partial inference

31+$ lone: not checked

32+$ lone: not checked

32+$ lest: not checked

33+$ lest: not checked

tests/golden/prelude-3g-basic/source.jibb+8−6

@@ -37,16 +37,18 @@

37++ weld |= args=[(list A) (list A)]

38 ?- args

39 [xs ys]

40+ ^- (list A)

40− ?- xs

41+ ?- xs

41− ~ ys

42+ ~ ys

42− [item rest] [item (weld rest ys)]

43+ [item rest] [item (weld rest ys)]

44++ turn |= args=[(list A) $-(A B)]

45++ turn |= args=[(list A) $-(A B)]

45 ?- args

46 ?- args

46 [xs f]

47 [xs f]

48+ ^- (list B)

47− ?- xs

49+ ?- xs

48− ~ ~

50+ ~ ~

49− [item rest] [(f item) (turn rest f)]

51+ [item rest] [(f item) (turn rest f)]

51+$ dime [p=@ta q=@]

53+$ dime [p=@ta q=@]

tests/golden/prelude-3g-basic/tokens.txt+146−132

@@ -190,151 +190,165 @@

19039:9 name ys

19139:11 tight glyph ]

19240:7 INDENT

193−40:7 glyph ?-

193+40:7 glyph ^-

194−40:10 name xs

194+40:10 glyph (

195+40:11 tight name list

196+40:16 tvar A

197+40:17 tight glyph )

19541:9 INDENT

19841:9 INDENT

196−41:9 lit ~

199+41:9 glyph ?-

200+41:12 name xs

201+42:11 INDENT

202+42:11 lit ~

197−41:11 name ys

203+42:13 name ys

198−42:9 NEWLINE

204+43:11 NEWLINE

199−42:9 glyph [

205+43:11 glyph [

200−42:10 tight name item

206+43:12 tight name item

201−42:15 name rest

207+43:17 name rest

202−42:19 tight glyph ]

208+43:21 tight glyph ]

203−42:21 glyph [

209+43:23 glyph [

204−42:22 tight name item

210+43:24 tight name item

205−42:27 glyph (

211+43:29 glyph (

206−42:28 tight name weld

212+43:30 tight name weld

207−42:33 name rest

213+43:35 name rest

208−42:38 name ys

214+43:40 name ys

209−42:40 tight glyph )

215+43:42 tight glyph )

210−42:41 tight glyph ]

216+43:43 tight glyph ]

217+45:1 DEDENT

211−44:1 DEDENT

218+45:1 DEDENT

212−44:1 DEDENT

219+45:1 DEDENT

213−44:1 DEDENT

220+45:1 DEDENT

214−44:1 DEDENT

221+45:1 DEDENT

215−44:1 NEWLINE

222+45:1 NEWLINE

216−44:1 glyph ++

223+45:1 glyph ++

217−44:4 name turn

224+45:4 name turn

218−44:9 glyph |=

225+45:9 glyph |=

219−44:12 name args

226+45:12 name args

220−44:16 tight glyph =

227+45:16 tight glyph =

221−44:17 tight glyph [

228+45:17 tight glyph [

222−44:18 tight glyph (

229+45:18 tight glyph (

223−44:19 tight name list

230+45:19 tight name list

224−44:24 tvar A

231+45:24 tvar A

225−44:25 tight glyph )

232+45:25 tight glyph )

226−44:27 glyph $-(

233+45:27 glyph $-(

227−44:30 tight tvar A

234+45:30 tight tvar A

228−44:32 tvar B

235+45:32 tvar B

229−44:33 tight glyph )

236+45:33 tight glyph )

230−44:34 tight glyph ]

237+45:34 tight glyph ]

231−45:3 INDENT

238+46:3 INDENT

232−45:3 glyph ?-

239+46:3 glyph ?-

233−45:6 name args

240+46:6 name args

234−46:5 INDENT

241+47:5 INDENT

235−46:5 glyph [

242+47:5 glyph [

236−46:6 tight name xs

243+47:6 tight name xs

237−46:9 name f

244+47:9 name f

238−46:10 tight glyph ]

245+47:10 tight glyph ]

239−47:7 INDENT

246+48:7 INDENT

240−47:7 glyph ?-

247+48:7 glyph ^-

241−47:10 name xs

248+48:10 glyph (

249+48:11 tight name list

250+48:16 tvar B

251+48:17 tight glyph )

242−48:9 INDENT

252+49:9 INDENT

253+49:9 glyph ?-

254+49:12 name xs

255+50:11 INDENT

243−48:9 lit ~

256+50:11 lit ~

244−48:11 lit ~

257+50:13 lit ~

245−49:9 NEWLINE

258+51:11 NEWLINE

246−49:9 glyph [

259+51:11 glyph [

247−49:10 tight name item

260+51:12 tight name item

248−49:15 name rest

261+51:17 name rest

249−49:19 tight glyph ]

262+51:21 tight glyph ]

250−49:21 glyph [

263+51:23 glyph [

251−49:22 tight glyph (

264+51:24 tight glyph (

252−49:23 tight name f

265+51:25 tight name f

253−49:25 name item

266+51:27 name item

254−49:29 tight glyph )

255−49:31 glyph (

267+51:31 tight glyph )

268+51:33 glyph (

256−49:32 tight name turn

269+51:34 tight name turn

257−49:37 name rest

270+51:39 name rest

258−49:42 name f

271+51:44 name f

259−49:43 tight glyph )

272+51:45 tight glyph )

260−49:44 tight glyph ]

273+51:46 tight glyph ]

261−51:1 DEDENT

274+53:1 DEDENT

262−51:1 DEDENT

275+53:1 DEDENT

263−51:1 DEDENT

276+53:1 DEDENT

264−51:1 DEDENT

277+53:1 DEDENT

265−51:1 NEWLINE

278+53:1 DEDENT

266−51:1 glyph +$

267−51:4 name dime

268−51:9 glyph [

269−51:10 tight name p

270−51:11 tight glyph =

271−51:12 tight aura @ta

272−51:16 name q

273−51:17 tight glyph =

274−51:18 tight aura @

275−51:19 tight glyph ]

27653:1 NEWLINE

27953:1 NEWLINE

27753:1 glyph +$

28053:1 glyph +$

278−53:4 name hair

281+53:4 name dime

27953:9 glyph [

28253:9 glyph [

28053:10 tight name p

28353:10 tight name p

28153:11 tight glyph =

28453:11 tight glyph =

282−53:12 tight aura @ud

285+53:12 tight aura @ta

28353:16 name q

28653:16 name q

28453:17 tight glyph =

28753:17 tight glyph =

285−53:18 tight aura @ud

288+53:18 tight aura @

286−53:21 tight glyph ]

289+53:19 tight glyph ]

28755:1 NEWLINE

29055:1 NEWLINE

28855:1 glyph +$

29155:1 glyph +$

289−55:4 name pint

292+55:4 name hair

29055:9 glyph [

29355:9 glyph [

29155:10 tight name p

29455:10 tight name p

29255:11 tight glyph =

29555:11 tight glyph =

293−55:12 tight glyph [

296+55:12 tight aura @ud

294−55:13 tight name p

297+55:16 name q

295−55:14 tight glyph =

298+55:17 tight glyph =

296−55:15 tight aura @

297−55:17 name q

298−55:18 tight glyph =

299+55:18 tight aura @ud

299−55:19 tight aura @

300−55:20 tight glyph ]

301−55:22 name q

302−55:23 tight glyph =

303−55:24 tight glyph [

304−55:25 tight name p

305−55:26 tight glyph =

306−55:27 tight aura @

307−55:29 name q

308−55:30 tight glyph =

309−55:31 tight aura @

310−55:32 tight glyph ]

311−55:33 tight glyph ]

300+55:21 tight glyph ]

31257:1 NEWLINE

30157:1 NEWLINE

31357:1 glyph +$

30257:1 glyph +$

314−57:4 name coin

303+57:4 name pint

315−58:3 INDENT

316−58:3 glyph [

317−58:4 tight lit %$

318−58:7 name p

319−58:8 tight glyph =

320−58:9 tight name dime

321−58:13 tight glyph ]

304+57:9 glyph [

322−59:3 NEWLINE

323−59:3 glyph [

324−59:4 tight lit %blob

325−59:10 name p

305+57:10 tight name p

326−59:11 tight glyph =

306+57:11 tight glyph =

327−59:12 tight glyph *

307+57:12 tight glyph [

328−59:13 tight glyph ]

308+57:13 tight name p

329−60:3 NEWLINE

309+57:14 tight glyph =

310+57:15 tight aura @

311+57:17 name q

312+57:18 tight glyph =

313+57:19 tight aura @

314+57:20 tight glyph ]

315+57:22 name q

316+57:23 tight glyph =

317+57:24 tight glyph [

318+57:25 tight name p

319+57:26 tight glyph =

320+57:27 tight aura @

321+57:29 name q

322+57:30 tight glyph =

323+57:31 tight aura @

324+57:32 tight glyph ]

325+57:33 tight glyph ]

326+59:1 NEWLINE

327+59:1 glyph +$

328+59:4 name coin

329+60:3 INDENT

33060:3 glyph [

331−60:4 tight lit %many

331+60:4 tight lit %$

332+60:7 name p

333+60:8 tight glyph =

334+60:9 tight name dime

335+60:13 tight glyph ]

336+61:3 NEWLINE

337+61:3 glyph [

338+61:4 tight lit %blob

339+61:10 name p

340+61:11 tight glyph =

341+61:12 tight glyph *

342+61:13 tight glyph ]

343+62:3 NEWLINE

344+62:3 glyph [

345+62:4 tight lit %many

332−60:10 name p

346+62:10 name p

333−60:11 tight glyph =

347+62:11 tight glyph =

334−60:12 tight glyph (

348+62:12 tight glyph (

335−60:13 tight name list

349+62:13 tight name list

336−60:18 name coin

350+62:18 name coin

337−60:22 tight glyph )

351+62:22 tight glyph )

338−60:23 tight glyph ]

352+62:23 tight glyph ]

339−60:24 DEDENT

353+62:24 DEDENT

340−60:24 NEWLINE

354+62:24 NEWLINE

tests/golden/prelude-3g-basic/tree.txt+64−58

@@ -87,64 +87,70 @@

87 (arm 39:5

88 (cell 39:5 (bind 39:6 xs) (bind 39:9 ys))

89 (body 40:7

90− (branch 40:7

90+ (cast 40:7

91− (wing 40:10 xs)

91+ (apply 40:10 list (tvar 40:16 A))

92− (arm 41:9 (lit 41:9 ~) (wing 41:11 ys))

92+ (body 41:9

93+ (branch 41:9

94+ (wing 41:12 xs)

95+ (arm 42:11 (lit 42:11 ~) (wing 42:13 ys))

93− (arm 42:9

96+ (arm 43:11

94− (cell 42:9 (bind 42:10 item) (bind 42:15 rest))

97+ (cell 43:11 (bind 43:12 item) (bind 43:17 rest))

95− (tuple 42:21

98+ (tuple 43:23

96− (wing 42:22 item)

99+ (wing 43:24 item)

97− (group 42:27

100+ (group 43:29

98− (call 42:28 (wing 42:28 weld) (wing 42:33 rest) (wing 42:38 ys))))))))))))

101+ (call 43:30 (wing 43:30 weld) (wing 43:35 rest) (wing 43:40 ys))))))))))))))

99− (value 44:1 turn

102+ (value 45:1 turn

100− (gate 44:9

103+ (gate 45:9

101− (face 44:12 args

104+ (face 45:12 args

102− (cell 44:17

105+ (cell 45:17

103− (apply 44:18 list (tvar 44:24 A))

106+ (apply 45:18 list (tvar 45:24 A))

104− (fn 44:27 (tvar 44:30 A) (tvar 44:32 B))))

107+ (fn 45:27 (tvar 45:30 A) (tvar 45:32 B))))

105− (body 45:3

108+ (body 46:3

106− (branch 45:3

109+ (branch 46:3

107− (wing 45:6 args)

110+ (wing 46:6 args)

108− (arm 46:5

111+ (arm 47:5

109− (cell 46:5 (bind 46:6 xs) (bind 46:9 f))

112+ (cell 47:5 (bind 47:6 xs) (bind 47:9 f))

110− (body 47:7

113+ (body 48:7

111− (branch 47:7

114+ (cast 48:7

115+ (apply 48:10 list (tvar 48:16 B))

116+ (body 49:9

117+ (branch 49:9

112− (wing 47:10 xs)

118+ (wing 49:12 xs)

113− (arm 48:9 (lit 48:9 ~) (lit 48:11 ~))

119+ (arm 50:11 (lit 50:11 ~) (lit 50:13 ~))

114− (arm 49:9

120+ (arm 51:11

115− (cell 49:9 (bind 49:10 item) (bind 49:15 rest))

121+ (cell 51:11 (bind 51:12 item) (bind 51:17 rest))

116− (tuple 49:21

122+ (tuple 51:23

117− (group 49:22

123+ (group 51:24

118− (call 49:23 (wing 49:23 f) (wing 49:25 item)))

124+ (call 51:25 (wing 51:25 f) (wing 51:27 item)))

119− (group 49:31

125+ (group 51:33

120− (call 49:32 (wing 49:32 turn) (wing 49:37 rest) (wing 49:42 f))))))))))))

126+ (call 51:34 (wing 51:34 turn) (wing 51:39 rest) (wing 51:44 f))))))))))))))

121− (mold 51:1 dime

127+ (mold 53:1 dime

122− (cell 51:9

123− (face 51:10 p (aura 51:12 @ta))

124− (face 51:16 q (aura 51:18 @))))

125− (mold 53:1 hair

126 (cell 53:9

128 (cell 53:9

127− (face 53:10 p (aura 53:12 @ud))

129+ (face 53:10 p (aura 53:12 @ta))

128− (face 53:16 q (aura 53:18 @ud))))

130+ (face 53:16 q (aura 53:18 @))))

129− (mold 55:1 pint

131+ (mold 55:1 hair

130 (cell 55:9

132 (cell 55:9

131− (face 55:10 p

133+ (face 55:10 p (aura 55:12 @ud))

134+ (face 55:16 q (aura 55:18 @ud))))

135+ (mold 57:1 pint

136+ (cell 57:9

137+ (face 57:10 p

132− (cell 55:12

138+ (cell 57:12

133− (face 55:13 p (aura 55:15 @))

139+ (face 57:13 p (aura 57:15 @))

134− (face 55:17 q (aura 55:19 @))))

140+ (face 57:17 q (aura 57:19 @))))

135− (face 55:22 q

141+ (face 57:22 q

136− (cell 55:24

142+ (cell 57:24

137− (face 55:25 p (aura 55:27 @))

143+ (face 57:25 p (aura 57:27 @))

138− (face 55:29 q (aura 55:31 @))))))

144+ (face 57:29 q (aura 57:31 @))))))

139− (mold 57:1 coin

145+ (mold 59:1 coin

140− (union 58:3

146+ (union 60:3

141− (cell 58:3

142− (const 58:4 %$)

143− (face 58:7 p (ref 58:9 dime)))

144− (cell 59:3

145− (const 59:4 %blob)

146− (face 59:10 p (noun 59:12)))

147 (cell 60:3

148− (const 60:4 %many)

148+ (const 60:4 %$)

149+ (face 60:7 p (ref 60:9 dime)))

150+ (cell 61:3

151+ (const 61:4 %blob)

152+ (face 61:10 p (noun 61:12)))

153+ (cell 62:3

154+ (const 62:4 %many)

149− (face 60:10 p

155+ (face 62:10 p

150− (apply 60:12 list (ref 60:18 coin)))))))

156+ (apply 62:12 list (ref 62:18 coin)))))))

tests/golden/prelude-3g-basic/types.txt+2−2

@@ -5,8 +5,8 @@ partial inference; module not checked

5++ not: $-(? ?)

6+$ list: cases proven disjoint; mold not checked

7+$ unit: cases proven disjoint; mold not checked

8−++ fall: sample mold is not supported by partial inference

8+++ fall: $-([(unit A) A] A)

9−++ need: sample mold is not supported by partial inference

9+++ need: $-((unit A) A)

10++ weld: sample mold is not supported by partial inference

11++ turn: sample mold is not supported by partial inference

12+$ dime: not checked

tests/golden/prelude-3g-like/about.txt+3−3

@@ -1,4 +1,4 @@

1−source: Overview, Prelude: "The exported inventory includes all names from the Hoon library sections listed below, excluding the groups explicitly left out"; Hoon 3g includes `like` and `wonk`.

1+source: Overview, Prelude: Hoon 3g includes `like` and `wonk`; the value `like` maps an existing result.

2−tests: The prelude's `like` generic edge mold and `wonk` extractor; the callable value form of `like` is a separate, unresolved question. The source contains the prelude definitions through `like` and `wonk`.

2+tests: The source includes the generic `like` mold, its mapping gate and `wonk`.

3expect: parses

4−expect-types: a partial inference report, not a checked module; generic molds and the `wonk` body are not fully checked yet

4+expect-types: a partial inference report, not a checked module

tests/golden/prelude-3g-like/source.jibb+16−6

@@ -37,16 +37,18 @@

37++ weld |= args=[(list A) (list A)]

38 ?- args

39 [xs ys]

40+ ^- (list A)

40− ?- xs

41+ ?- xs

41− ~ ys

42+ ~ ys

42− [item rest] [item (weld rest ys)]

43+ [item rest] [item (weld rest ys)]

44++ turn |= args=[(list A) $-(A B)]

45++ turn |= args=[(list A) $-(A B)]

45 ?- args

46 ?- args

46 [xs f]

47 [xs f]

48+ ^- (list B)

47− ?- xs

49+ ?- xs

48− ~ ~

50+ ~ ~

49− [item rest] [(f item) (turn rest f)]

51+ [item rest] [(f item) (turn rest f)]

51+$ dime [p=@ta q=@]

53+$ dime [p=@ta q=@]

@@ -94,6 +96,14 @@

95+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

97+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

99+++ like |= [f=$-(A B) result=(like A)]

100+ ++ mapped

101+ ^- (unit [p=B q=nail])

102+ ?- q.result

103+ ~ ~

104+ [~ value] `[p=(f p.value) q=q.value]

105+ ^- (like B) [p=p.result q=mapped]

106+

97++ wonk |= veq=(like A)

107++ wonk |= veq=(like A)

98 ?- q.veq

108 ?- q.veq

99 ~ !!

109 ~ !!

tests/golden/prelude-3g-like/tokens.txt+432−343

@@ -190,410 +190,499 @@

19039:9 name ys

19139:11 tight glyph ]

19240:7 INDENT

193−40:7 glyph ?-

193+40:7 glyph ^-

194−40:10 name xs

194+40:10 glyph (

195+40:11 tight name list

196+40:16 tvar A

197+40:17 tight glyph )

19541:9 INDENT

19841:9 INDENT

196−41:9 lit ~

199+41:9 glyph ?-

200+41:12 name xs

201+42:11 INDENT

202+42:11 lit ~

197−41:11 name ys

203+42:13 name ys

198−42:9 NEWLINE

204+43:11 NEWLINE

199−42:9 glyph [

205+43:11 glyph [

200−42:10 tight name item

206+43:12 tight name item

201−42:15 name rest

207+43:17 name rest

202−42:19 tight glyph ]

208+43:21 tight glyph ]

203−42:21 glyph [

209+43:23 glyph [

204−42:22 tight name item

210+43:24 tight name item

205−42:27 glyph (

211+43:29 glyph (

206−42:28 tight name weld

212+43:30 tight name weld

207−42:33 name rest

213+43:35 name rest

208−42:38 name ys

214+43:40 name ys

209−42:40 tight glyph )

215+43:42 tight glyph )

210−42:41 tight glyph ]

216+43:43 tight glyph ]

217+45:1 DEDENT

211−44:1 DEDENT

218+45:1 DEDENT

212−44:1 DEDENT

219+45:1 DEDENT

213−44:1 DEDENT

220+45:1 DEDENT

214−44:1 DEDENT

221+45:1 DEDENT

215−44:1 NEWLINE

222+45:1 NEWLINE

216−44:1 glyph ++

223+45:1 glyph ++

217−44:4 name turn

224+45:4 name turn

218−44:9 glyph |=

225+45:9 glyph |=

219−44:12 name args

226+45:12 name args

220−44:16 tight glyph =

227+45:16 tight glyph =

221−44:17 tight glyph [

228+45:17 tight glyph [

222−44:18 tight glyph (

229+45:18 tight glyph (

223−44:19 tight name list

230+45:19 tight name list

224−44:24 tvar A

231+45:24 tvar A

225−44:25 tight glyph )

232+45:25 tight glyph )

226−44:27 glyph $-(

233+45:27 glyph $-(

227−44:30 tight tvar A

234+45:30 tight tvar A

228−44:32 tvar B

235+45:32 tvar B

229−44:33 tight glyph )

236+45:33 tight glyph )

230−44:34 tight glyph ]

237+45:34 tight glyph ]

231−45:3 INDENT

238+46:3 INDENT

232−45:3 glyph ?-

239+46:3 glyph ?-

233−45:6 name args

240+46:6 name args

234−46:5 INDENT

241+47:5 INDENT

235−46:5 glyph [

242+47:5 glyph [

236−46:6 tight name xs

243+47:6 tight name xs

237−46:9 name f

244+47:9 name f

238−46:10 tight glyph ]

245+47:10 tight glyph ]

239−47:7 INDENT

246+48:7 INDENT

240−47:7 glyph ?-

247+48:7 glyph ^-

241−47:10 name xs

248+48:10 glyph (

249+48:11 tight name list

250+48:16 tvar B

251+48:17 tight glyph )

242−48:9 INDENT

252+49:9 INDENT

253+49:9 glyph ?-

254+49:12 name xs

255+50:11 INDENT

243−48:9 lit ~

256+50:11 lit ~

244−48:11 lit ~

257+50:13 lit ~

245−49:9 NEWLINE

258+51:11 NEWLINE

246−49:9 glyph [

259+51:11 glyph [

247−49:10 tight name item

260+51:12 tight name item

248−49:15 name rest

261+51:17 name rest

249−49:19 tight glyph ]

262+51:21 tight glyph ]

250−49:21 glyph [

263+51:23 glyph [

251−49:22 tight glyph (

264+51:24 tight glyph (

252−49:23 tight name f

265+51:25 tight name f

253−49:25 name item

266+51:27 name item

254−49:29 tight glyph )

255−49:31 glyph (

267+51:31 tight glyph )

268+51:33 glyph (

256−49:32 tight name turn

269+51:34 tight name turn

257−49:37 name rest

270+51:39 name rest

258−49:42 name f

271+51:44 name f

259−49:43 tight glyph )

272+51:45 tight glyph )

260−49:44 tight glyph ]

273+51:46 tight glyph ]

261−51:1 DEDENT

274+53:1 DEDENT

262−51:1 DEDENT

275+53:1 DEDENT

263−51:1 DEDENT

276+53:1 DEDENT

264−51:1 DEDENT

277+53:1 DEDENT

265−51:1 NEWLINE

278+53:1 DEDENT

266−51:1 glyph +$

267−51:4 name dime

268−51:9 glyph [

269−51:10 tight name p

270−51:11 tight glyph =

271−51:12 tight aura @ta

272−51:16 name q

273−51:17 tight glyph =

274−51:18 tight aura @

275−51:19 tight glyph ]

27653:1 NEWLINE

27953:1 NEWLINE

27753:1 glyph +$

28053:1 glyph +$

278−53:4 name hair

281+53:4 name dime

27953:9 glyph [

28253:9 glyph [

28053:10 tight name p

28353:10 tight name p

28153:11 tight glyph =

28453:11 tight glyph =

282−53:12 tight aura @ud

285+53:12 tight aura @ta

28353:16 name q

28653:16 name q

28453:17 tight glyph =

28753:17 tight glyph =

285−53:18 tight aura @ud

288+53:18 tight aura @

286−53:21 tight glyph ]

289+53:19 tight glyph ]

28755:1 NEWLINE

29055:1 NEWLINE

28855:1 glyph +$

29155:1 glyph +$

289−55:4 name pint

292+55:4 name hair

29055:9 glyph [

29355:9 glyph [

29155:10 tight name p

29455:10 tight name p

29255:11 tight glyph =

29555:11 tight glyph =

293−55:12 tight glyph [

296+55:12 tight aura @ud

294−55:13 tight name p

297+55:16 name q

295−55:14 tight glyph =

298+55:17 tight glyph =

296−55:15 tight aura @

297−55:17 name q

298−55:18 tight glyph =

299+55:18 tight aura @ud

299−55:19 tight aura @

300−55:20 tight glyph ]

301−55:22 name q

302−55:23 tight glyph =

303−55:24 tight glyph [

304−55:25 tight name p

305−55:26 tight glyph =

306−55:27 tight aura @

307−55:29 name q

308−55:30 tight glyph =

309−55:31 tight aura @

310−55:32 tight glyph ]

311−55:33 tight glyph ]

300+55:21 tight glyph ]

31257:1 NEWLINE

30157:1 NEWLINE

31357:1 glyph +$

30257:1 glyph +$

314−57:4 name coin

303+57:4 name pint

315−58:3 INDENT

316−58:3 glyph [

317−58:4 tight lit %$

318−58:7 name p

319−58:8 tight glyph =

320−58:9 tight name dime

321−58:13 tight glyph ]

304+57:9 glyph [

322−59:3 NEWLINE

323−59:3 glyph [

324−59:4 tight lit %blob

325−59:10 name p

305+57:10 tight name p

326−59:11 tight glyph =

306+57:11 tight glyph =

327−59:12 tight glyph *

307+57:12 tight glyph [

328−59:13 tight glyph ]

308+57:13 tight name p

329−60:3 NEWLINE

309+57:14 tight glyph =

310+57:15 tight aura @

311+57:17 name q

312+57:18 tight glyph =

313+57:19 tight aura @

314+57:20 tight glyph ]

315+57:22 name q

316+57:23 tight glyph =

317+57:24 tight glyph [

318+57:25 tight name p

319+57:26 tight glyph =

320+57:27 tight aura @

321+57:29 name q

322+57:30 tight glyph =

323+57:31 tight aura @

324+57:32 tight glyph ]

325+57:33 tight glyph ]

326+59:1 NEWLINE

327+59:1 glyph +$

328+59:4 name coin

329+60:3 INDENT

33060:3 glyph [

331−60:4 tight lit %many

331+60:4 tight lit %$

332+60:7 name p

333+60:8 tight glyph =

334+60:9 tight name dime

335+60:13 tight glyph ]

336+61:3 NEWLINE

337+61:3 glyph [

338+61:4 tight lit %blob

339+61:10 name p

340+61:11 tight glyph =

341+61:12 tight glyph *

342+61:13 tight glyph ]

343+62:3 NEWLINE

344+62:3 glyph [

345+62:4 tight lit %many

332−60:10 name p

346+62:10 name p

333−60:11 tight glyph =

347+62:11 tight glyph =

334−60:12 tight glyph (

348+62:12 tight glyph (

335−60:13 tight name list

349+62:13 tight name list

336−60:18 name coin

350+62:18 name coin

337−60:22 tight glyph )

351+62:22 tight glyph )

338−60:23 tight glyph ]

352+62:23 tight glyph ]

339−62:1 DEDENT

353+64:1 DEDENT

340−62:1 NEWLINE

341−62:1 glyph +$

342−62:4 name pair

343−62:9 glyph |$

344−62:12 glyph [

345−62:13 tight tvar A

346−62:15 tvar B

347−62:16 tight glyph ]

348−62:18 glyph [

349−62:19 tight name p

350−62:20 tight glyph =

351−62:21 tight tvar A

352−62:23 name q

353−62:24 tight glyph =

354−62:25 tight tvar B

355−62:26 tight glyph ]

35664:1 NEWLINE

35464:1 NEWLINE

35764:1 glyph +$

35564:1 glyph +$

358−64:4 name trel

356+64:4 name pair

35964:9 glyph |$

35764:9 glyph |$

36064:12 glyph [

35864:12 glyph [

36164:13 tight tvar A

35964:13 tight tvar A

36264:15 tvar B

36064:15 tvar B

363−64:17 tvar C

361+64:16 tight glyph ]

364−64:18 tight glyph ]

365−64:20 glyph [

362+64:18 glyph [

366−64:21 tight name p

363+64:19 tight name p

367−64:22 tight glyph =

364+64:20 tight glyph =

368−64:23 tight tvar A

365+64:21 tight tvar A

369−64:25 name q

366+64:23 name q

370−64:26 tight glyph =

367+64:24 tight glyph =

371−64:27 tight tvar B

368+64:25 tight tvar B

372−64:29 name r

373−64:30 tight glyph =

374−64:31 tight tvar C

375−64:32 tight glyph ]

369+64:26 tight glyph ]

37666:1 NEWLINE

37066:1 NEWLINE

37766:1 glyph +$

37166:1 glyph +$

378−66:4 name qual

372+66:4 name trel

37966:9 glyph |$

37366:9 glyph |$

38066:12 glyph [

37466:12 glyph [

38166:13 tight tvar A

37566:13 tight tvar A

38266:15 tvar B

37666:15 tvar B

38366:17 tvar C

37766:17 tvar C

384−66:19 tvar D

378+66:18 tight glyph ]

385−66:20 tight glyph ]

386−66:22 glyph [

379+66:20 glyph [

380+66:21 tight name p

381+66:22 tight glyph =

387−66:23 tight name p

382+66:23 tight tvar A

388−66:24 tight glyph =

389−66:25 tight tvar A

390−66:27 name q

383+66:25 name q

391−66:28 tight glyph =

384+66:26 tight glyph =

392−66:29 tight tvar B

385+66:27 tight tvar B

393−66:31 name r

386+66:29 name r

394−66:32 tight glyph =

387+66:30 tight glyph =

395−66:33 tight tvar C

388+66:31 tight tvar C

396−66:35 name s

397−66:36 tight glyph =

398−66:37 tight tvar D

399−66:38 tight glyph ]

389+66:32 tight glyph ]

40068:1 NEWLINE

39068:1 NEWLINE

40168:1 glyph +$

39168:1 glyph +$

402−68:4 name cord

392+68:4 name qual

403−68:9 aura @t

393+68:9 glyph |$

394+68:12 glyph [

395+68:13 tight tvar A

396+68:15 tvar B

397+68:17 tvar C

398+68:19 tvar D

399+68:20 tight glyph ]

400+68:22 glyph [

401+68:23 tight name p

402+68:24 tight glyph =

403+68:25 tight tvar A

404+68:27 name q

405+68:28 tight glyph =

406+68:29 tight tvar B

407+68:31 name r

408+68:32 tight glyph =

409+68:33 tight tvar C

410+68:35 name s

411+68:36 tight glyph =

412+68:37 tight tvar D

413+68:38 tight glyph ]

40470:1 NEWLINE

41470:1 NEWLINE

40570:1 glyph +$

41570:1 glyph +$

406−70:4 name knot

416+70:4 name cord

407−70:9 aura @ta

417+70:9 aura @t

40872:1 NEWLINE

41872:1 NEWLINE

40972:1 glyph +$

41972:1 glyph +$

410−72:4 name tape

420+72:4 name knot

411−72:9 glyph (

412−72:10 tight name list

413−72:15 aura @tD

421+72:9 aura @ta

414−72:18 tight glyph )

41574:1 NEWLINE

42274:1 NEWLINE

41674:1 glyph +$

42374:1 glyph +$

417−74:4 name path

424+74:4 name tape

41874:9 glyph (

42574:9 glyph (

41974:10 tight name list

42674:10 tight name list

420−74:15 name knot

427+74:15 aura @tD

421−74:19 tight glyph )

428+74:18 tight glyph )

42276:1 NEWLINE

42976:1 NEWLINE

42376:1 glyph +$

43076:1 glyph +$

424−76:4 name tank

431+76:4 name path

432+76:9 glyph (

433+76:10 tight name list

434+76:15 name knot

435+76:19 tight glyph )

436+78:1 NEWLINE

437+78:1 glyph +$

438+78:4 name tank

425−77:3 INDENT

439+79:3 INDENT

426−77:3 name cord

440+79:3 name cord

427−78:3 NEWLINE

428−78:3 glyph [

429−78:4 tight lit %leaf

430−78:10 name p

431−78:11 tight glyph =

432−78:12 tight name tape

433−78:16 tight glyph ]

434−79:3 NEWLINE

435−79:3 glyph [

436−79:4 tight lit %palm

437−79:10 name p

438−79:11 tight glyph =

439−79:12 tight glyph (

440−79:13 tight name qual

441−79:18 name tape

442−79:23 name tape

443−79:28 name tape

444−79:33 name tape

445−79:37 tight glyph )

446−79:39 name q

447−79:40 tight glyph =

448−79:41 tight glyph (

449−79:42 tight name list

450−79:47 name tank

451−79:51 tight glyph )

452−79:52 tight glyph ]

45380:3 NEWLINE

44180:3 NEWLINE

45480:3 glyph [

44280:3 glyph [

455−80:4 tight lit %rose

443+80:4 tight lit %leaf

45680:10 name p

44480:10 name p

45780:11 tight glyph =

44580:11 tight glyph =

458−80:12 tight glyph (

446+80:12 tight name tape

447+80:16 tight glyph ]

448+81:3 NEWLINE

449+81:3 glyph [

450+81:4 tight lit %palm

451+81:10 name p

452+81:11 tight glyph =

453+81:12 tight glyph (

459−80:13 tight name trel

454+81:13 tight name qual

460−80:18 name tape

455+81:18 name tape

461−80:23 name tape

456+81:23 name tape

462−80:28 name tape

457+81:28 name tape

458+81:33 name tape

463−80:32 tight glyph )

459+81:37 tight glyph )

464−80:34 name q

460+81:39 name q

465−80:35 tight glyph =

461+81:40 tight glyph =

466−80:36 tight glyph (

462+81:41 tight glyph (

467−80:37 tight name list

463+81:42 tight name list

468−80:42 name tank

464+81:47 name tank

469−80:46 tight glyph )

470−80:47 tight glyph ]

465+81:51 tight glyph )

471−82:1 DEDENT

466+81:52 tight glyph ]

472−82:1 NEWLINE

467+82:3 NEWLINE

473−82:1 glyph +$

468+82:3 glyph [

474−82:4 name nail

469+82:4 tight lit %rose

475−82:9 glyph [

476−82:10 tight name p

470+82:10 name p

47782:11 tight glyph =

47182:11 tight glyph =

478−82:12 tight name hair

472+82:12 tight glyph (

473+82:13 tight name trel

474+82:18 name tape

475+82:23 name tape

476+82:28 name tape

477+82:32 tight glyph )

479−82:17 name q

478+82:34 name q

480−82:18 tight glyph =

479+82:35 tight glyph =

481−82:19 tight name tape

480+82:36 tight glyph (

481+82:37 tight name list

482+82:42 name tank

483+82:46 tight glyph )

482−82:23 tight glyph ]

484+82:47 tight glyph ]

485+84:1 DEDENT

48384:1 NEWLINE

48684:1 NEWLINE

48484:1 glyph +$

48784:1 glyph +$

485−84:4 name edge

488+84:4 name nail

48684:9 glyph [

48984:9 glyph [

48784:10 tight name p

49084:10 tight name p

48884:11 tight glyph =

49184:11 tight glyph =

48984:12 tight name hair

49284:12 tight name hair

49084:17 name q

49384:17 name q

49184:18 tight glyph =

49484:18 tight glyph =

492−84:19 tight glyph (

495+84:19 tight name tape

493−84:20 tight name unit

494−84:25 glyph [

495−84:26 tight name p

496−84:27 tight glyph =

497−84:28 tight glyph *

498−84:30 name q

499−84:31 tight glyph =

500−84:32 tight name nail

501−84:36 tight glyph ]

502−84:37 tight glyph )

503−84:38 tight glyph ]

496+84:23 tight glyph ]

50486:1 NEWLINE

49786:1 NEWLINE

50586:1 glyph +$

49886:1 glyph +$

506−86:4 name rule

499+86:4 name edge

507−86:9 glyph $-(

500+86:9 glyph [

501+86:10 tight name p

502+86:11 tight glyph =

503+86:12 tight name hair

504+86:17 name q

505+86:18 tight glyph =

506+86:19 tight glyph (

507+86:20 tight name unit

508+86:25 glyph [

509+86:26 tight name p

510+86:27 tight glyph =

511+86:28 tight glyph *

512+86:30 name q

513+86:31 tight glyph =

508−86:12 tight name nail

514+86:32 tight name nail

509−86:17 name edge

515+86:36 tight glyph ]

510−86:21 tight glyph )

516+86:37 tight glyph )

517+86:38 tight glyph ]

51188:1 NEWLINE

51888:1 NEWLINE

51288:1 glyph +$

51988:1 glyph +$

513−88:4 name spot

520+88:4 name rule

514−88:9 glyph [

521+88:9 glyph $-(

515−88:10 tight name p

516−88:11 tight glyph =

517−88:12 tight name path

522+88:12 tight name nail

518−88:17 name q

523+88:17 name edge

519−88:18 tight glyph =

524+88:21 tight glyph )

520−88:19 tight name pint

521−88:23 tight glyph ]

52290:1 NEWLINE

52590:1 NEWLINE

52390:1 glyph +$

52690:1 glyph +$

524−90:4 name toon

527+90:4 name spot

528+90:9 glyph [

529+90:10 tight name p

530+90:11 tight glyph =

531+90:12 tight name path

532+90:17 name q

533+90:18 tight glyph =

534+90:19 tight name pint

535+90:23 tight glyph ]

536+92:1 NEWLINE

537+92:1 glyph +$

538+92:4 name toon

525−91:3 INDENT

539+93:3 INDENT

526−91:3 glyph [

527−91:4 tight lit %0

528−91:7 name p

529−91:8 tight glyph =

530−91:9 tight glyph *

531−91:10 tight glyph ]

532−92:3 NEWLINE

533−92:3 glyph [

534−92:4 tight lit %1

535−92:7 name p

536−92:8 tight glyph =

537−92:9 tight glyph *

538−92:10 tight glyph ]

539−93:3 NEWLINE

54093:3 glyph [

541−93:4 tight lit %2

541+93:4 tight lit %0

54293:7 name p

54393:8 tight glyph =

544−93:9 tight glyph (

544+93:9 tight glyph *

545+93:10 tight glyph ]

546+94:3 NEWLINE

547+94:3 glyph [

548+94:4 tight lit %1

549+94:7 name p

550+94:8 tight glyph =

551+94:9 tight glyph *

552+94:10 tight glyph ]

553+95:3 NEWLINE

554+95:3 glyph [

555+95:4 tight lit %2

556+95:7 name p

557+95:8 tight glyph =

558+95:9 tight glyph (

545−93:10 tight name list

559+95:10 tight name list

546−93:15 name tank

560+95:15 name tank

547−93:19 tight glyph )

561+95:19 tight glyph )

548−93:20 tight glyph ]

562+95:20 tight glyph ]

549−95:1 DEDENT

563+97:1 DEDENT

550−95:1 NEWLINE

551−95:1 glyph +$

552−95:4 name like

553−95:9 glyph |$

554−95:12 glyph [

555−95:13 tight tvar A

556−95:14 tight glyph ]

557−95:16 glyph [

558−95:17 tight name p

559−95:18 tight glyph =

560−95:19 tight name hair

561−95:24 name q

562−95:25 tight glyph =

563−95:26 tight glyph (

564−95:27 tight name unit

565−95:32 glyph [

566−95:33 tight name p

567−95:34 tight glyph =

568−95:35 tight tvar A

569−95:37 name q

570−95:38 tight glyph =

571−95:39 tight name nail

572−95:43 tight glyph ]

573−95:44 tight glyph )

574−95:45 tight glyph ]

57597:1 NEWLINE

56497:1 NEWLINE

576−97:1 glyph ++

565+97:1 glyph +$

577−97:4 name wonk

566+97:4 name like

567+97:9 glyph |$

568+97:12 glyph [

569+97:13 tight tvar A

570+97:14 tight glyph ]

571+97:16 glyph [

572+97:17 tight name p

573+97:18 tight glyph =

574+97:19 tight name hair

575+97:24 name q

576+97:25 tight glyph =

577+97:26 tight glyph (

578+97:27 tight name unit

579+97:32 glyph [

580+97:33 tight name p

581+97:34 tight glyph =

582+97:35 tight tvar A

583+97:37 name q

584+97:38 tight glyph =

585+97:39 tight name nail

586+97:43 tight glyph ]

587+97:44 tight glyph )

588+97:45 tight glyph ]

589+99:1 NEWLINE

590+99:1 glyph ++

591+99:4 name like

592+99:9 glyph |=

593+99:12 glyph [

594+99:13 tight name f

595+99:14 tight glyph =

596+99:15 tight glyph $-(

597+99:18 tight tvar A

598+99:20 tvar B

599+99:21 tight glyph )

600+99:23 name result

601+99:29 tight glyph =

602+99:30 tight glyph (

603+99:31 tight name like

604+99:36 tvar A

605+99:37 tight glyph )

606+99:38 tight glyph ]

607+100:3 INDENT

608+100:3 glyph ++

609+100:6 name mapped

610+101:5 INDENT

611+101:5 glyph ^-

612+101:8 glyph (

613+101:9 tight name unit

614+101:14 glyph [

615+101:15 tight name p

616+101:16 tight glyph =

617+101:17 tight tvar B

618+101:19 name q

619+101:20 tight glyph =

620+101:21 tight name nail

621+101:25 tight glyph ]

622+101:26 tight glyph )

623+102:7 INDENT

624+102:7 glyph ?-

625+102:10 wing q.result

626+103:9 INDENT

627+103:9 lit ~

628+103:11 lit ~

629+104:9 NEWLINE

630+104:9 glyph [

631+104:10 tight lit ~

632+104:12 name value

633+104:17 tight glyph ]

634+104:19 glyph `

635+104:20 tight glyph [

636+104:21 tight name p

637+104:22 tight glyph =

638+104:23 tight glyph (

639+104:24 tight name f

640+104:26 wing p.value

641+104:33 tight glyph )

642+104:35 name q

643+104:36 tight glyph =

644+104:37 tight wing q.value

645+104:44 tight glyph ]

646+105:3 DEDENT

647+105:3 DEDENT

648+105:3 DEDENT

649+105:3 NEWLINE

650+105:3 glyph ^-

651+105:6 glyph (

652+105:7 tight name like

653+105:12 tvar B

654+105:13 tight glyph )

655+105:15 glyph [

656+105:16 tight name p

657+105:17 tight glyph =

658+105:18 tight wing p.result

659+105:27 name q

660+105:28 tight glyph =

661+105:29 tight name mapped

662+105:35 tight glyph ]

663+107:1 DEDENT

664+107:1 NEWLINE

665+107:1 glyph ++

666+107:4 name wonk

578−97:9 glyph |=

667+107:9 glyph |=

579−97:12 name veq

668+107:12 name veq

580−97:15 tight glyph =

669+107:15 tight glyph =

581−97:16 tight glyph (

670+107:16 tight glyph (

582−97:17 tight name like

671+107:17 tight name like

583−97:22 tvar A

672+107:22 tvar A

584−97:23 tight glyph )

673+107:23 tight glyph )

585−98:3 INDENT

674+108:3 INDENT

586−98:3 glyph ?-

675+108:3 glyph ?-

587−98:6 wing q.veq

676+108:6 wing q.veq

588−99:5 INDENT

677+109:5 INDENT

589−99:5 lit ~

678+109:5 lit ~

590−99:7 glyph !!

679+109:7 glyph !!

591−100:5 NEWLINE

680+110:5 NEWLINE

592−100:5 glyph [

681+110:5 glyph [

593−100:6 tight lit ~

682+110:6 tight lit ~

594−100:8 name product

683+110:8 name product

595−100:15 tight glyph ]

684+110:15 tight glyph ]

596−100:17 wing p.product

685+110:17 wing p.product

597−100:26 DEDENT

686+110:26 DEDENT

598−100:26 DEDENT

687+110:26 DEDENT

599−100:26 NEWLINE

688+110:26 NEWLINE

tests/golden/prelude-3g-like/tree.txt+184−146

@@ -87,156 +87,194 @@

87 (arm 39:5

88 (cell 39:5 (bind 39:6 xs) (bind 39:9 ys))

89 (body 40:7

90− (branch 40:7

90+ (cast 40:7

91− (wing 40:10 xs)

91+ (apply 40:10 list (tvar 40:16 A))

92− (arm 41:9 (lit 41:9 ~) (wing 41:11 ys))

92+ (body 41:9

93+ (branch 41:9

94+ (wing 41:12 xs)

95+ (arm 42:11 (lit 42:11 ~) (wing 42:13 ys))

93− (arm 42:9

96+ (arm 43:11

94− (cell 42:9 (bind 42:10 item) (bind 42:15 rest))

97+ (cell 43:11 (bind 43:12 item) (bind 43:17 rest))

95− (tuple 42:21

98+ (tuple 43:23

96− (wing 42:22 item)

99+ (wing 43:24 item)

97− (group 42:27

100+ (group 43:29

98− (call 42:28 (wing 42:28 weld) (wing 42:33 rest) (wing 42:38 ys))))))))))))

101+ (call 43:30 (wing 43:30 weld) (wing 43:35 rest) (wing 43:40 ys))))))))))))))

99− (value 44:1 turn

102+ (value 45:1 turn

100− (gate 44:9

103+ (gate 45:9

101− (face 44:12 args

104+ (face 45:12 args

102− (cell 44:17

105+ (cell 45:17

103− (apply 44:18 list (tvar 44:24 A))

106+ (apply 45:18 list (tvar 45:24 A))

104− (fn 44:27 (tvar 44:30 A) (tvar 44:32 B))))

107+ (fn 45:27 (tvar 45:30 A) (tvar 45:32 B))))

105− (body 45:3

108+ (body 46:3

106− (branch 45:3

109+ (branch 46:3

107− (wing 45:6 args)

110+ (wing 46:6 args)

108− (arm 46:5

111+ (arm 47:5

109− (cell 46:5 (bind 46:6 xs) (bind 46:9 f))

112+ (cell 47:5 (bind 47:6 xs) (bind 47:9 f))

110− (body 47:7

113+ (body 48:7

111− (branch 47:7

114+ (cast 48:7

115+ (apply 48:10 list (tvar 48:16 B))

116+ (body 49:9

117+ (branch 49:9

112− (wing 47:10 xs)

118+ (wing 49:12 xs)

113− (arm 48:9 (lit 48:9 ~) (lit 48:11 ~))

119+ (arm 50:11 (lit 50:11 ~) (lit 50:13 ~))

114− (arm 49:9

120+ (arm 51:11

115− (cell 49:9 (bind 49:10 item) (bind 49:15 rest))

121+ (cell 51:11 (bind 51:12 item) (bind 51:17 rest))

116− (tuple 49:21

122+ (tuple 51:23

117− (group 49:22

123+ (group 51:24

118− (call 49:23 (wing 49:23 f) (wing 49:25 item)))

124+ (call 51:25 (wing 51:25 f) (wing 51:27 item)))

119− (group 49:31

125+ (group 51:33

120− (call 49:32 (wing 49:32 turn) (wing 49:37 rest) (wing 49:42 f))))))))))))

126+ (call 51:34 (wing 51:34 turn) (wing 51:39 rest) (wing 51:44 f))))))))))))))

121− (mold 51:1 dime

127+ (mold 53:1 dime

122− (cell 51:9

123− (face 51:10 p (aura 51:12 @ta))

124− (face 51:16 q (aura 51:18 @))))

125− (mold 53:1 hair

126 (cell 53:9

128 (cell 53:9

127− (face 53:10 p (aura 53:12 @ud))

129+ (face 53:10 p (aura 53:12 @ta))

128− (face 53:16 q (aura 53:18 @ud))))

130+ (face 53:16 q (aura 53:18 @))))

129− (mold 55:1 pint

131+ (mold 55:1 hair

130 (cell 55:9

132 (cell 55:9

131− (face 55:10 p

133+ (face 55:10 p (aura 55:12 @ud))

134+ (face 55:16 q (aura 55:18 @ud))))

135+ (mold 57:1 pint

136+ (cell 57:9

137+ (face 57:10 p

132− (cell 55:12

138+ (cell 57:12

133− (face 55:13 p (aura 55:15 @))

139+ (face 57:13 p (aura 57:15 @))

134− (face 55:17 q (aura 55:19 @))))

140+ (face 57:17 q (aura 57:19 @))))

135− (face 55:22 q

141+ (face 57:22 q

136− (cell 55:24

142+ (cell 57:24

137− (face 55:25 p (aura 55:27 @))

143+ (face 57:25 p (aura 57:27 @))

138− (face 55:29 q (aura 55:31 @))))))

144+ (face 57:29 q (aura 57:31 @))))))

139− (mold 57:1 coin

145+ (mold 59:1 coin

140− (union 58:3

146+ (union 60:3

141− (cell 58:3

142− (const 58:4 %$)

143− (face 58:7 p (ref 58:9 dime)))

144− (cell 59:3

145− (const 59:4 %blob)

146− (face 59:10 p (noun 59:12)))

147 (cell 60:3

148− (const 60:4 %many)

148+ (const 60:4 %$)

149+ (face 60:7 p (ref 60:9 dime)))

150+ (cell 61:3

151+ (const 61:4 %blob)

152+ (face 61:10 p (noun 61:12)))

153+ (cell 62:3

154+ (const 62:4 %many)

149− (face 60:10 p

155+ (face 62:10 p

150− (apply 60:12 list (ref 60:18 coin))))))

156+ (apply 62:12 list (ref 62:18 coin))))))

151− (mold 62:1 pair

157+ (mold 64:1 pair

152− (generic 62:9 A B

158+ (generic 64:9 A B

153− (cell 62:18

159+ (cell 64:18

154− (face 62:19 p (tvar 62:21 A))

160+ (face 64:19 p (tvar 64:21 A))

155− (face 62:23 q (tvar 62:25 B)))))

161+ (face 64:23 q (tvar 64:25 B)))))

156− (mold 64:1 trel

162+ (mold 66:1 trel

157− (generic 64:9 A B C

163+ (generic 66:9 A B C

158− (cell 64:20

164+ (cell 66:20

159− (face 64:21 p (tvar 64:23 A))

165+ (face 66:21 p (tvar 66:23 A))

160− (face 64:25 q (tvar 64:27 B))

166+ (face 66:25 q (tvar 66:27 B))

161− (face 64:29 r (tvar 64:31 C)))))

167+ (face 66:29 r (tvar 66:31 C)))))

162− (mold 66:1 qual

168+ (mold 68:1 qual

163− (generic 66:9 A B C D

169+ (generic 68:9 A B C D

164− (cell 66:22

170+ (cell 68:22

165− (face 66:23 p (tvar 66:25 A))

171+ (face 68:23 p (tvar 68:25 A))

166− (face 66:27 q (tvar 66:29 B))

172+ (face 68:27 q (tvar 68:29 B))

167− (face 66:31 r (tvar 66:33 C))

173+ (face 68:31 r (tvar 68:33 C))

168− (face 66:35 s (tvar 66:37 D)))))

174+ (face 68:35 s (tvar 68:37 D)))))

169− (mold 68:1 cord (aura 68:9 @t))

175+ (mold 70:1 cord (aura 70:9 @t))

170− (mold 70:1 knot (aura 70:9 @ta))

176+ (mold 72:1 knot (aura 72:9 @ta))

171− (mold 72:1 tape

177+ (mold 74:1 tape

172− (apply 72:9 list (aura 72:15 @tD)))

178+ (apply 74:9 list (aura 74:15 @tD)))

173− (mold 74:1 path

179+ (mold 76:1 path

174− (apply 74:9 list (ref 74:15 knot)))

180+ (apply 76:9 list (ref 76:15 knot)))

175− (mold 76:1 tank

181+ (mold 78:1 tank

176− (union 77:3

182+ (union 79:3

177− (ref 77:3 cord)

183+ (ref 79:3 cord)

178− (cell 78:3

179− (const 78:4 %leaf)

180− (face 78:10 p (ref 78:12 tape)))

181− (cell 79:3

182− (const 79:4 %palm)

183− (face 79:10 p

184− (apply 79:12 qual (ref 79:18 tape) (ref 79:23 tape) (ref 79:28 tape) (ref 79:33 tape)))

185− (face 79:39 q

186− (apply 79:41 list (ref 79:47 tank))))

187 (cell 80:3

184 (cell 80:3

188− (const 80:4 %rose)

185+ (const 80:4 %leaf)

186+ (face 80:10 p (ref 80:12 tape)))

187+ (cell 81:3

188+ (const 81:4 %palm)

189+ (face 81:10 p

190+ (apply 81:12 qual (ref 81:18 tape) (ref 81:23 tape) (ref 81:28 tape) (ref 81:33 tape)))

191+ (face 81:39 q

192+ (apply 81:41 list (ref 81:47 tank))))

193+ (cell 82:3

194+ (const 82:4 %rose)

189− (face 80:10 p

195+ (face 82:10 p

190− (apply 80:12 trel (ref 80:18 tape) (ref 80:23 tape) (ref 80:28 tape)))

196+ (apply 82:12 trel (ref 82:18 tape) (ref 82:23 tape) (ref 82:28 tape)))

191− (face 80:34 q

197+ (face 82:34 q

192− (apply 80:36 list (ref 80:42 tank))))))

198+ (apply 82:36 list (ref 82:42 tank))))))

193− (mold 82:1 nail

199+ (mold 84:1 nail

194− (cell 82:9

195− (face 82:10 p (ref 82:12 hair))

196− (face 82:17 q (ref 82:19 tape))))

197− (mold 84:1 edge

198 (cell 84:9

200 (cell 84:9

199 (face 84:10 p (ref 84:12 hair))

201 (face 84:10 p (ref 84:12 hair))

200− (face 84:17 q

202+ (face 84:17 q (ref 84:19 tape))))

203+ (mold 86:1 edge

204+ (cell 86:9

205+ (face 86:10 p (ref 86:12 hair))

206+ (face 86:17 q

201− (apply 84:19 unit

207+ (apply 86:19 unit

202− (cell 84:25

208+ (cell 86:25

203− (face 84:26 p (noun 84:28))

209+ (face 86:26 p (noun 86:28))

204− (face 84:30 q (ref 84:32 nail)))))))

210+ (face 86:30 q (ref 86:32 nail)))))))

205− (mold 86:1 rule

211+ (mold 88:1 rule

206− (fn 86:9 (ref 86:12 nail) (ref 86:17 edge)))

212+ (fn 88:9 (ref 88:12 nail) (ref 88:17 edge)))

207− (mold 88:1 spot

213+ (mold 90:1 spot

208− (cell 88:9

214+ (cell 90:9

209− (face 88:10 p (ref 88:12 path))

215+ (face 90:10 p (ref 90:12 path))

210− (face 88:17 q (ref 88:19 pint))))

216+ (face 90:17 q (ref 90:19 pint))))

211− (mold 90:1 toon

217+ (mold 92:1 toon

212− (union 91:3

218+ (union 93:3

213− (cell 91:3

214− (const 91:4 %0)

215− (face 91:7 p (noun 91:9)))

216− (cell 92:3

217− (const 92:4 %1)

218− (face 92:7 p (noun 92:9)))

219 (cell 93:3

220− (const 93:4 %2)

220+ (const 93:4 %0)

221+ (face 93:7 p (noun 93:9)))

222+ (cell 94:3

223+ (const 94:4 %1)

224+ (face 94:7 p (noun 94:9)))

225+ (cell 95:3

226+ (const 95:4 %2)

221− (face 93:7 p

227+ (face 95:7 p

222− (apply 93:9 list (ref 93:15 tank))))))

228+ (apply 95:9 list (ref 95:15 tank))))))

223− (mold 95:1 like

229+ (mold 97:1 like

224− (generic 95:9 A

230+ (generic 97:9 A

225− (cell 95:16

231+ (cell 97:16

226− (face 95:17 p (ref 95:19 hair))

232+ (face 97:17 p (ref 97:19 hair))

227− (face 95:24 q

233+ (face 97:24 q

228− (apply 95:26 unit

234+ (apply 97:26 unit

229− (cell 95:32

235+ (cell 97:32

230− (face 95:33 p (tvar 95:35 A))

236+ (face 97:33 p (tvar 97:35 A))

231− (face 95:37 q (ref 95:39 nail))))))))

237+ (face 97:37 q (ref 97:39 nail))))))))

232− (value 97:1 wonk

238+ (value 99:1 like

239+ (gate 99:9

240+ (cell 99:12

241+ (face 99:13 f

242+ (fn 99:15 (tvar 99:18 A) (tvar 99:20 B)))

243+ (face 99:23 result

244+ (apply 99:30 like (tvar 99:36 A))))

245+ (body 100:3

246+ (value 100:3 mapped

247+ (body 101:5

248+ (cast 101:5

249+ (apply 101:8 unit

250+ (cell 101:14

251+ (face 101:15 p (tvar 101:17 B))

252+ (face 101:19 q (ref 101:21 nail))))

253+ (body 102:7

254+ (branch 102:7

255+ (wing 102:10 q.result)

256+ (arm 103:9 (lit 103:9 ~) (lit 103:11 ~))

257+ (arm 104:9

258+ (cell 104:9 (lit 104:10 ~) (bind 104:12 value))

259+ (unit 104:19

260+ (tuple 104:20

261+ (face 104:21 p

262+ (group 104:23

263+ (call 104:24 (wing 104:24 f) (wing 104:26 p.value))))

264+ (face 104:35 q (wing 104:37 q.value))))))))))

265+ (cast 105:3

266+ (apply 105:6 like (tvar 105:12 B))

267+ (tuple 105:15

268+ (face 105:16 p (wing 105:18 p.result))

269+ (face 105:27 q (wing 105:29 mapped)))))))

270+ (value 107:1 wonk

233− (gate 97:9

271+ (gate 107:9

234− (face 97:12 veq

272+ (face 107:12 veq

235− (apply 97:16 like (tvar 97:22 A)))

273+ (apply 107:16 like (tvar 107:22 A)))

236− (body 98:3

274+ (body 108:3

237− (branch 98:3

275+ (branch 108:3

238− (wing 98:6 q.veq)

276+ (wing 108:6 q.veq)

239− (arm 99:5 (lit 99:5 ~) (crash 99:7))

277+ (arm 109:5 (lit 109:5 ~) (crash 109:7))

240− (arm 100:5

278+ (arm 110:5

241− (cell 100:5 (lit 100:6 ~) (bind 100:8 product))

279+ (cell 110:5 (lit 110:6 ~) (bind 110:8 product))

242− (wing 100:17 p.product)))))))

280+ (wing 110:17 p.product)))))))

tests/golden/prelude-3g-like/types.txt+3−2

@@ -5,8 +5,8 @@ partial inference; module not checked

5++ not: $-(? ?)

6+$ list: cases proven disjoint; mold not checked

7+$ unit: cases proven disjoint; mold not checked

8−++ fall: sample mold is not supported by partial inference

8+++ fall: $-([(unit A) A] A)

9−++ need: sample mold is not supported by partial inference

9+++ need: $-((unit A) A)

10++ weld: sample mold is not supported by partial inference

11++ turn: sample mold is not supported by partial inference

12+$ dime: not checked

@@ -27,4 +27,5 @@ partial inference; module not checked

27+$ spot: not checked

28+$ toon: cases proven disjoint; mold not checked

29+$ like: not checked

30+++ like: sample mold is not supported by partial inference

30++ wonk: sample mold is not supported by partial inference

31++ wonk: sample mold is not supported by partial inference

tests/golden/prelude-3g-structural/source.jibb+8−6

@@ -37,16 +37,18 @@

37++ weld |= args=[(list A) (list A)]

38 ?- args

39 [xs ys]

40+ ^- (list A)

40− ?- xs

41+ ?- xs

41− ~ ys

42+ ~ ys

42− [item rest] [item (weld rest ys)]

43+ [item rest] [item (weld rest ys)]

44++ turn |= args=[(list A) $-(A B)]

45++ turn |= args=[(list A) $-(A B)]

45 ?- args

46 ?- args

46 [xs f]

47 [xs f]

48+ ^- (list B)

47− ?- xs

49+ ?- xs

48− ~ ~

50+ ~ ~

49− [item rest] [(f item) (turn rest f)]

51+ [item rest] [(f item) (turn rest f)]

51+$ dime [p=@ta q=@]

53+$ dime [p=@ta q=@]

tests/golden/prelude-3g-structural/tokens.txt+309−295

@@ -190,361 +190,375 @@

19039:9 name ys

19139:11 tight glyph ]

19240:7 INDENT

193−40:7 glyph ?-

193+40:7 glyph ^-

194−40:10 name xs

194+40:10 glyph (

195+40:11 tight name list

196+40:16 tvar A

197+40:17 tight glyph )

19541:9 INDENT

19841:9 INDENT

196−41:9 lit ~

199+41:9 glyph ?-

200+41:12 name xs

201+42:11 INDENT

202+42:11 lit ~

197−41:11 name ys

203+42:13 name ys

198−42:9 NEWLINE

204+43:11 NEWLINE

199−42:9 glyph [

205+43:11 glyph [

200−42:10 tight name item

206+43:12 tight name item

201−42:15 name rest

207+43:17 name rest

202−42:19 tight glyph ]

208+43:21 tight glyph ]

203−42:21 glyph [

209+43:23 glyph [

204−42:22 tight name item

210+43:24 tight name item

205−42:27 glyph (

211+43:29 glyph (

206−42:28 tight name weld

212+43:30 tight name weld

207−42:33 name rest

213+43:35 name rest

208−42:38 name ys

214+43:40 name ys

209−42:40 tight glyph )

215+43:42 tight glyph )

210−42:41 tight glyph ]

216+43:43 tight glyph ]

217+45:1 DEDENT

211−44:1 DEDENT

218+45:1 DEDENT

212−44:1 DEDENT

219+45:1 DEDENT

213−44:1 DEDENT

220+45:1 DEDENT

214−44:1 DEDENT

221+45:1 DEDENT

215−44:1 NEWLINE

222+45:1 NEWLINE

216−44:1 glyph ++

223+45:1 glyph ++

217−44:4 name turn

224+45:4 name turn

218−44:9 glyph |=

225+45:9 glyph |=

219−44:12 name args

226+45:12 name args

220−44:16 tight glyph =

227+45:16 tight glyph =

221−44:17 tight glyph [

228+45:17 tight glyph [

222−44:18 tight glyph (

229+45:18 tight glyph (

223−44:19 tight name list

230+45:19 tight name list

224−44:24 tvar A

231+45:24 tvar A

225−44:25 tight glyph )

232+45:25 tight glyph )

226−44:27 glyph $-(

233+45:27 glyph $-(

227−44:30 tight tvar A

234+45:30 tight tvar A

228−44:32 tvar B

235+45:32 tvar B

229−44:33 tight glyph )

236+45:33 tight glyph )

230−44:34 tight glyph ]

237+45:34 tight glyph ]

231−45:3 INDENT

238+46:3 INDENT

232−45:3 glyph ?-

239+46:3 glyph ?-

233−45:6 name args

240+46:6 name args

234−46:5 INDENT

241+47:5 INDENT

235−46:5 glyph [

242+47:5 glyph [

236−46:6 tight name xs

243+47:6 tight name xs

237−46:9 name f

244+47:9 name f

238−46:10 tight glyph ]

245+47:10 tight glyph ]

239−47:7 INDENT

246+48:7 INDENT

240−47:7 glyph ?-

247+48:7 glyph ^-

241−47:10 name xs

248+48:10 glyph (

249+48:11 tight name list

250+48:16 tvar B

251+48:17 tight glyph )

242−48:9 INDENT

252+49:9 INDENT

253+49:9 glyph ?-

254+49:12 name xs

255+50:11 INDENT

243−48:9 lit ~

256+50:11 lit ~

244−48:11 lit ~

257+50:13 lit ~

245−49:9 NEWLINE

258+51:11 NEWLINE

246−49:9 glyph [

259+51:11 glyph [

247−49:10 tight name item

260+51:12 tight name item

248−49:15 name rest

261+51:17 name rest

249−49:19 tight glyph ]

262+51:21 tight glyph ]

250−49:21 glyph [

263+51:23 glyph [

251−49:22 tight glyph (

264+51:24 tight glyph (

252−49:23 tight name f

265+51:25 tight name f

253−49:25 name item

266+51:27 name item

254−49:29 tight glyph )

255−49:31 glyph (

267+51:31 tight glyph )

268+51:33 glyph (

256−49:32 tight name turn

269+51:34 tight name turn

257−49:37 name rest

270+51:39 name rest

258−49:42 name f

271+51:44 name f

259−49:43 tight glyph )

272+51:45 tight glyph )

260−49:44 tight glyph ]

273+51:46 tight glyph ]

261−51:1 DEDENT

274+53:1 DEDENT

262−51:1 DEDENT

275+53:1 DEDENT

263−51:1 DEDENT

276+53:1 DEDENT

264−51:1 DEDENT

277+53:1 DEDENT

265−51:1 NEWLINE

278+53:1 DEDENT

266−51:1 glyph +$

267−51:4 name dime

268−51:9 glyph [

269−51:10 tight name p

270−51:11 tight glyph =

271−51:12 tight aura @ta

272−51:16 name q

273−51:17 tight glyph =

274−51:18 tight aura @

275−51:19 tight glyph ]

27653:1 NEWLINE

27953:1 NEWLINE

27753:1 glyph +$

28053:1 glyph +$

278−53:4 name hair

281+53:4 name dime

27953:9 glyph [

28253:9 glyph [

28053:10 tight name p

28353:10 tight name p

28153:11 tight glyph =

28453:11 tight glyph =

282−53:12 tight aura @ud

285+53:12 tight aura @ta

28353:16 name q

28653:16 name q

28453:17 tight glyph =

28753:17 tight glyph =

285−53:18 tight aura @ud

288+53:18 tight aura @

286−53:21 tight glyph ]

289+53:19 tight glyph ]

28755:1 NEWLINE

29055:1 NEWLINE

28855:1 glyph +$

29155:1 glyph +$

289−55:4 name pint

292+55:4 name hair

29055:9 glyph [

29355:9 glyph [

29155:10 tight name p

29455:10 tight name p

29255:11 tight glyph =

29555:11 tight glyph =

293−55:12 tight glyph [

296+55:12 tight aura @ud

294−55:13 tight name p

297+55:16 name q

295−55:14 tight glyph =

298+55:17 tight glyph =

296−55:15 tight aura @

297−55:17 name q

298−55:18 tight glyph =

299+55:18 tight aura @ud

299−55:19 tight aura @

300−55:20 tight glyph ]

301−55:22 name q

302−55:23 tight glyph =

303−55:24 tight glyph [

304−55:25 tight name p

305−55:26 tight glyph =

306−55:27 tight aura @

307−55:29 name q

308−55:30 tight glyph =

309−55:31 tight aura @

310−55:32 tight glyph ]

311−55:33 tight glyph ]

300+55:21 tight glyph ]

31257:1 NEWLINE

30157:1 NEWLINE

31357:1 glyph +$

30257:1 glyph +$

314−57:4 name coin

303+57:4 name pint

315−58:3 INDENT

316−58:3 glyph [

317−58:4 tight lit %$

318−58:7 name p

319−58:8 tight glyph =

320−58:9 tight name dime

321−58:13 tight glyph ]

304+57:9 glyph [

322−59:3 NEWLINE

323−59:3 glyph [

324−59:4 tight lit %blob

325−59:10 name p

305+57:10 tight name p

326−59:11 tight glyph =

306+57:11 tight glyph =

327−59:12 tight glyph *

307+57:12 tight glyph [

328−59:13 tight glyph ]

308+57:13 tight name p

329−60:3 NEWLINE

309+57:14 tight glyph =

310+57:15 tight aura @

311+57:17 name q

312+57:18 tight glyph =

313+57:19 tight aura @

314+57:20 tight glyph ]

315+57:22 name q

316+57:23 tight glyph =

317+57:24 tight glyph [

318+57:25 tight name p

319+57:26 tight glyph =

320+57:27 tight aura @

321+57:29 name q

322+57:30 tight glyph =

323+57:31 tight aura @

324+57:32 tight glyph ]

325+57:33 tight glyph ]

326+59:1 NEWLINE

327+59:1 glyph +$

328+59:4 name coin

329+60:3 INDENT

33060:3 glyph [

331−60:4 tight lit %many

331+60:4 tight lit %$

332+60:7 name p

333+60:8 tight glyph =

334+60:9 tight name dime

335+60:13 tight glyph ]

336+61:3 NEWLINE

337+61:3 glyph [

338+61:4 tight lit %blob

339+61:10 name p

340+61:11 tight glyph =

341+61:12 tight glyph *

342+61:13 tight glyph ]

343+62:3 NEWLINE

344+62:3 glyph [

345+62:4 tight lit %many

332−60:10 name p

346+62:10 name p

333−60:11 tight glyph =

347+62:11 tight glyph =

334−60:12 tight glyph (

348+62:12 tight glyph (

335−60:13 tight name list

349+62:13 tight name list

336−60:18 name coin

350+62:18 name coin

337−60:22 tight glyph )

351+62:22 tight glyph )

338−60:23 tight glyph ]

352+62:23 tight glyph ]

339−62:1 DEDENT

353+64:1 DEDENT

340−62:1 NEWLINE

341−62:1 glyph +$

342−62:4 name pair

343−62:9 glyph |$

344−62:12 glyph [

345−62:13 tight tvar A

346−62:15 tvar B

347−62:16 tight glyph ]

348−62:18 glyph [

349−62:19 tight name p

350−62:20 tight glyph =

351−62:21 tight tvar A

352−62:23 name q

353−62:24 tight glyph =

354−62:25 tight tvar B

355−62:26 tight glyph ]

35664:1 NEWLINE

35464:1 NEWLINE

35764:1 glyph +$

35564:1 glyph +$

358−64:4 name trel

356+64:4 name pair

35964:9 glyph |$

35764:9 glyph |$

36064:12 glyph [

35864:12 glyph [

36164:13 tight tvar A

35964:13 tight tvar A

36264:15 tvar B

36064:15 tvar B

363−64:17 tvar C

361+64:16 tight glyph ]

364−64:18 tight glyph ]

365−64:20 glyph [

362+64:18 glyph [

366−64:21 tight name p

363+64:19 tight name p

367−64:22 tight glyph =

364+64:20 tight glyph =

368−64:23 tight tvar A

365+64:21 tight tvar A

369−64:25 name q

366+64:23 name q

370−64:26 tight glyph =

367+64:24 tight glyph =

371−64:27 tight tvar B

368+64:25 tight tvar B

372−64:29 name r

373−64:30 tight glyph =

374−64:31 tight tvar C

375−64:32 tight glyph ]

369+64:26 tight glyph ]

37666:1 NEWLINE

37066:1 NEWLINE

37766:1 glyph +$

37166:1 glyph +$

378−66:4 name qual

372+66:4 name trel

37966:9 glyph |$

37366:9 glyph |$

38066:12 glyph [

37466:12 glyph [

38166:13 tight tvar A

37566:13 tight tvar A

38266:15 tvar B

37666:15 tvar B

38366:17 tvar C

37766:17 tvar C

384−66:19 tvar D

378+66:18 tight glyph ]

385−66:20 tight glyph ]

386−66:22 glyph [

379+66:20 glyph [

380+66:21 tight name p

381+66:22 tight glyph =

387−66:23 tight name p

382+66:23 tight tvar A

388−66:24 tight glyph =

389−66:25 tight tvar A

390−66:27 name q

383+66:25 name q

391−66:28 tight glyph =

384+66:26 tight glyph =

392−66:29 tight tvar B

385+66:27 tight tvar B

393−66:31 name r

386+66:29 name r

394−66:32 tight glyph =

387+66:30 tight glyph =

395−66:33 tight tvar C

388+66:31 tight tvar C

396−66:35 name s

397−66:36 tight glyph =

398−66:37 tight tvar D

399−66:38 tight glyph ]

389+66:32 tight glyph ]

40068:1 NEWLINE

39068:1 NEWLINE

40168:1 glyph +$

39168:1 glyph +$

402−68:4 name cord

392+68:4 name qual

403−68:9 aura @t

393+68:9 glyph |$

394+68:12 glyph [

395+68:13 tight tvar A

396+68:15 tvar B

397+68:17 tvar C

398+68:19 tvar D

399+68:20 tight glyph ]

400+68:22 glyph [

401+68:23 tight name p

402+68:24 tight glyph =

403+68:25 tight tvar A

404+68:27 name q

405+68:28 tight glyph =

406+68:29 tight tvar B

407+68:31 name r

408+68:32 tight glyph =

409+68:33 tight tvar C

410+68:35 name s

411+68:36 tight glyph =

412+68:37 tight tvar D

413+68:38 tight glyph ]

40470:1 NEWLINE

41470:1 NEWLINE

40570:1 glyph +$

41570:1 glyph +$

406−70:4 name knot

416+70:4 name cord

407−70:9 aura @ta

417+70:9 aura @t

40872:1 NEWLINE

41872:1 NEWLINE

40972:1 glyph +$

41972:1 glyph +$

410−72:4 name tape

420+72:4 name knot

411−72:9 glyph (

412−72:10 tight name list

413−72:15 aura @tD

421+72:9 aura @ta

414−72:18 tight glyph )

41574:1 NEWLINE

42274:1 NEWLINE

41674:1 glyph +$

42374:1 glyph +$

417−74:4 name path

424+74:4 name tape

41874:9 glyph (

42574:9 glyph (

41974:10 tight name list

42674:10 tight name list

420−74:15 name knot

427+74:15 aura @tD

421−74:19 tight glyph )

428+74:18 tight glyph )

42276:1 NEWLINE

42976:1 NEWLINE

42376:1 glyph +$

43076:1 glyph +$

424−76:4 name tank

431+76:4 name path

432+76:9 glyph (

433+76:10 tight name list

434+76:15 name knot

435+76:19 tight glyph )

436+78:1 NEWLINE

437+78:1 glyph +$

438+78:4 name tank

425−77:3 INDENT

439+79:3 INDENT

426−77:3 name cord

440+79:3 name cord

427−78:3 NEWLINE

428−78:3 glyph [

429−78:4 tight lit %leaf

430−78:10 name p

431−78:11 tight glyph =

432−78:12 tight name tape

433−78:16 tight glyph ]

434−79:3 NEWLINE

435−79:3 glyph [

436−79:4 tight lit %palm

437−79:10 name p

438−79:11 tight glyph =

439−79:12 tight glyph (

440−79:13 tight name qual

441−79:18 name tape

442−79:23 name tape

443−79:28 name tape

444−79:33 name tape

445−79:37 tight glyph )

446−79:39 name q

447−79:40 tight glyph =

448−79:41 tight glyph (

449−79:42 tight name list

450−79:47 name tank

451−79:51 tight glyph )

452−79:52 tight glyph ]

45380:3 NEWLINE

44180:3 NEWLINE

45480:3 glyph [

44280:3 glyph [

455−80:4 tight lit %rose

443+80:4 tight lit %leaf

45680:10 name p

44480:10 name p

45780:11 tight glyph =

44580:11 tight glyph =

458−80:12 tight glyph (

446+80:12 tight name tape

447+80:16 tight glyph ]

448+81:3 NEWLINE

449+81:3 glyph [

450+81:4 tight lit %palm

451+81:10 name p

452+81:11 tight glyph =

453+81:12 tight glyph (

459−80:13 tight name trel

454+81:13 tight name qual

460−80:18 name tape

455+81:18 name tape

461−80:23 name tape

456+81:23 name tape

462−80:28 name tape

457+81:28 name tape

458+81:33 name tape

463−80:32 tight glyph )

459+81:37 tight glyph )

464−80:34 name q

460+81:39 name q

465−80:35 tight glyph =

461+81:40 tight glyph =

466−80:36 tight glyph (

462+81:41 tight glyph (

467−80:37 tight name list

463+81:42 tight name list

468−80:42 name tank

464+81:47 name tank

469−80:46 tight glyph )

470−80:47 tight glyph ]

465+81:51 tight glyph )

471−82:1 DEDENT

466+81:52 tight glyph ]

472−82:1 NEWLINE

467+82:3 NEWLINE

473−82:1 glyph +$

468+82:3 glyph [

474−82:4 name nail

469+82:4 tight lit %rose

475−82:9 glyph [

476−82:10 tight name p

470+82:10 name p

47782:11 tight glyph =

47182:11 tight glyph =

478−82:12 tight name hair

472+82:12 tight glyph (

473+82:13 tight name trel

474+82:18 name tape

475+82:23 name tape

476+82:28 name tape

477+82:32 tight glyph )

479−82:17 name q

478+82:34 name q

480−82:18 tight glyph =

479+82:35 tight glyph =

481−82:19 tight name tape

480+82:36 tight glyph (

481+82:37 tight name list

482+82:42 name tank

483+82:46 tight glyph )

482−82:23 tight glyph ]

484+82:47 tight glyph ]

485+84:1 DEDENT

48384:1 NEWLINE

48684:1 NEWLINE

48484:1 glyph +$

48784:1 glyph +$

485−84:4 name edge

488+84:4 name nail

48684:9 glyph [

48984:9 glyph [

48784:10 tight name p

49084:10 tight name p

48884:11 tight glyph =

49184:11 tight glyph =

48984:12 tight name hair

49284:12 tight name hair

49084:17 name q

49384:17 name q

49184:18 tight glyph =

49484:18 tight glyph =

492−84:19 tight glyph (

495+84:19 tight name tape

493−84:20 tight name unit

494−84:25 glyph [

495−84:26 tight name p

496−84:27 tight glyph =

497−84:28 tight glyph *

498−84:30 name q

499−84:31 tight glyph =

500−84:32 tight name nail

501−84:36 tight glyph ]

502−84:37 tight glyph )

503−84:38 tight glyph ]

496+84:23 tight glyph ]

50486:1 NEWLINE

49786:1 NEWLINE

50586:1 glyph +$

49886:1 glyph +$

506−86:4 name rule

499+86:4 name edge

507−86:9 glyph $-(

500+86:9 glyph [

501+86:10 tight name p

502+86:11 tight glyph =

503+86:12 tight name hair

504+86:17 name q

505+86:18 tight glyph =

506+86:19 tight glyph (

507+86:20 tight name unit

508+86:25 glyph [

509+86:26 tight name p

510+86:27 tight glyph =

511+86:28 tight glyph *

512+86:30 name q

513+86:31 tight glyph =

508−86:12 tight name nail

514+86:32 tight name nail

509−86:17 name edge

515+86:36 tight glyph ]

510−86:21 tight glyph )

516+86:37 tight glyph )

517+86:38 tight glyph ]

51188:1 NEWLINE

51888:1 NEWLINE

51288:1 glyph +$

51988:1 glyph +$

513−88:4 name spot

520+88:4 name rule

514−88:9 glyph [

521+88:9 glyph $-(

515−88:10 tight name p

516−88:11 tight glyph =

517−88:12 tight name path

522+88:12 tight name nail

518−88:17 name q

523+88:17 name edge

519−88:18 tight glyph =

524+88:21 tight glyph )

520−88:19 tight name pint

521−88:23 tight glyph ]

52290:1 NEWLINE

52590:1 NEWLINE

52390:1 glyph +$

52690:1 glyph +$

524−90:4 name toon

527+90:4 name spot

528+90:9 glyph [

529+90:10 tight name p

530+90:11 tight glyph =

531+90:12 tight name path

532+90:17 name q

533+90:18 tight glyph =

534+90:19 tight name pint

535+90:23 tight glyph ]

536+92:1 NEWLINE

537+92:1 glyph +$

538+92:4 name toon

525−91:3 INDENT

539+93:3 INDENT

526−91:3 glyph [

527−91:4 tight lit %0

528−91:7 name p

529−91:8 tight glyph =

530−91:9 tight glyph *

531−91:10 tight glyph ]

532−92:3 NEWLINE

533−92:3 glyph [

534−92:4 tight lit %1

535−92:7 name p

536−92:8 tight glyph =

537−92:9 tight glyph *

538−92:10 tight glyph ]

539−93:3 NEWLINE

54093:3 glyph [

541−93:4 tight lit %2

541+93:4 tight lit %0

54293:7 name p

54393:8 tight glyph =

544−93:9 tight glyph (

544+93:9 tight glyph *

545+93:10 tight glyph ]

546+94:3 NEWLINE

547+94:3 glyph [

548+94:4 tight lit %1

549+94:7 name p

550+94:8 tight glyph =

551+94:9 tight glyph *

552+94:10 tight glyph ]

553+95:3 NEWLINE

554+95:3 glyph [

555+95:4 tight lit %2

556+95:7 name p

557+95:8 tight glyph =

558+95:9 tight glyph (

545−93:10 tight name list

559+95:10 tight name list

546−93:15 name tank

560+95:15 name tank

547−93:19 tight glyph )

561+95:19 tight glyph )

548−93:20 tight glyph ]

562+95:20 tight glyph ]

549−93:21 DEDENT

563+95:21 DEDENT

550−93:21 NEWLINE

564+95:21 NEWLINE

tests/golden/prelude-3g-structural/tree.txt+132−126

@@ -87,136 +87,142 @@

87 (arm 39:5

88 (cell 39:5 (bind 39:6 xs) (bind 39:9 ys))

89 (body 40:7

90− (branch 40:7

90+ (cast 40:7

91− (wing 40:10 xs)

91+ (apply 40:10 list (tvar 40:16 A))

92− (arm 41:9 (lit 41:9 ~) (wing 41:11 ys))

92+ (body 41:9

93+ (branch 41:9

94+ (wing 41:12 xs)

95+ (arm 42:11 (lit 42:11 ~) (wing 42:13 ys))

93− (arm 42:9

96+ (arm 43:11

94− (cell 42:9 (bind 42:10 item) (bind 42:15 rest))

97+ (cell 43:11 (bind 43:12 item) (bind 43:17 rest))

95− (tuple 42:21

98+ (tuple 43:23

96− (wing 42:22 item)

99+ (wing 43:24 item)

97− (group 42:27

100+ (group 43:29

98− (call 42:28 (wing 42:28 weld) (wing 42:33 rest) (wing 42:38 ys))))))))))))

101+ (call 43:30 (wing 43:30 weld) (wing 43:35 rest) (wing 43:40 ys))))))))))))))

99− (value 44:1 turn

102+ (value 45:1 turn

100− (gate 44:9

103+ (gate 45:9

101− (face 44:12 args

104+ (face 45:12 args

102− (cell 44:17

105+ (cell 45:17

103− (apply 44:18 list (tvar 44:24 A))

106+ (apply 45:18 list (tvar 45:24 A))

104− (fn 44:27 (tvar 44:30 A) (tvar 44:32 B))))

107+ (fn 45:27 (tvar 45:30 A) (tvar 45:32 B))))

105− (body 45:3

108+ (body 46:3

106− (branch 45:3

109+ (branch 46:3

107− (wing 45:6 args)

110+ (wing 46:6 args)

108− (arm 46:5

111+ (arm 47:5

109− (cell 46:5 (bind 46:6 xs) (bind 46:9 f))

112+ (cell 47:5 (bind 47:6 xs) (bind 47:9 f))

110− (body 47:7

113+ (body 48:7

111− (branch 47:7

114+ (cast 48:7

115+ (apply 48:10 list (tvar 48:16 B))

116+ (body 49:9

117+ (branch 49:9

112− (wing 47:10 xs)

118+ (wing 49:12 xs)

113− (arm 48:9 (lit 48:9 ~) (lit 48:11 ~))

119+ (arm 50:11 (lit 50:11 ~) (lit 50:13 ~))

114− (arm 49:9

120+ (arm 51:11

115− (cell 49:9 (bind 49:10 item) (bind 49:15 rest))

121+ (cell 51:11 (bind 51:12 item) (bind 51:17 rest))

116− (tuple 49:21

122+ (tuple 51:23

117− (group 49:22

123+ (group 51:24

118− (call 49:23 (wing 49:23 f) (wing 49:25 item)))

124+ (call 51:25 (wing 51:25 f) (wing 51:27 item)))

119− (group 49:31

125+ (group 51:33

120− (call 49:32 (wing 49:32 turn) (wing 49:37 rest) (wing 49:42 f))))))))))))

126+ (call 51:34 (wing 51:34 turn) (wing 51:39 rest) (wing 51:44 f))))))))))))))

121− (mold 51:1 dime

127+ (mold 53:1 dime

122− (cell 51:9

123− (face 51:10 p (aura 51:12 @ta))

124− (face 51:16 q (aura 51:18 @))))

125− (mold 53:1 hair

126 (cell 53:9

128 (cell 53:9

127− (face 53:10 p (aura 53:12 @ud))

129+ (face 53:10 p (aura 53:12 @ta))

128− (face 53:16 q (aura 53:18 @ud))))

130+ (face 53:16 q (aura 53:18 @))))

129− (mold 55:1 pint

131+ (mold 55:1 hair

130 (cell 55:9

132 (cell 55:9

131− (face 55:10 p

133+ (face 55:10 p (aura 55:12 @ud))

134+ (face 55:16 q (aura 55:18 @ud))))

135+ (mold 57:1 pint

136+ (cell 57:9

137+ (face 57:10 p

132− (cell 55:12

138+ (cell 57:12

133− (face 55:13 p (aura 55:15 @))

139+ (face 57:13 p (aura 57:15 @))

134− (face 55:17 q (aura 55:19 @))))

140+ (face 57:17 q (aura 57:19 @))))

135− (face 55:22 q

141+ (face 57:22 q

136− (cell 55:24

142+ (cell 57:24

137− (face 55:25 p (aura 55:27 @))

143+ (face 57:25 p (aura 57:27 @))

138− (face 55:29 q (aura 55:31 @))))))

144+ (face 57:29 q (aura 57:31 @))))))

139− (mold 57:1 coin

145+ (mold 59:1 coin

140− (union 58:3

146+ (union 60:3

141− (cell 58:3

142− (const 58:4 %$)

143− (face 58:7 p (ref 58:9 dime)))

144− (cell 59:3

145− (const 59:4 %blob)

146− (face 59:10 p (noun 59:12)))

147 (cell 60:3

148− (const 60:4 %many)

148+ (const 60:4 %$)

149+ (face 60:7 p (ref 60:9 dime)))

150+ (cell 61:3

151+ (const 61:4 %blob)

152+ (face 61:10 p (noun 61:12)))

153+ (cell 62:3

154+ (const 62:4 %many)

149− (face 60:10 p

155+ (face 62:10 p

150− (apply 60:12 list (ref 60:18 coin))))))

156+ (apply 62:12 list (ref 62:18 coin))))))

151− (mold 62:1 pair

157+ (mold 64:1 pair

152− (generic 62:9 A B

158+ (generic 64:9 A B

153− (cell 62:18

159+ (cell 64:18

154− (face 62:19 p (tvar 62:21 A))

160+ (face 64:19 p (tvar 64:21 A))

155− (face 62:23 q (tvar 62:25 B)))))

161+ (face 64:23 q (tvar 64:25 B)))))

156− (mold 64:1 trel

162+ (mold 66:1 trel

157− (generic 64:9 A B C

163+ (generic 66:9 A B C

158− (cell 64:20

164+ (cell 66:20

159− (face 64:21 p (tvar 64:23 A))

165+ (face 66:21 p (tvar 66:23 A))

160− (face 64:25 q (tvar 64:27 B))

166+ (face 66:25 q (tvar 66:27 B))

161− (face 64:29 r (tvar 64:31 C)))))

167+ (face 66:29 r (tvar 66:31 C)))))

162− (mold 66:1 qual

168+ (mold 68:1 qual

163− (generic 66:9 A B C D

169+ (generic 68:9 A B C D

164− (cell 66:22

170+ (cell 68:22

165− (face 66:23 p (tvar 66:25 A))

171+ (face 68:23 p (tvar 68:25 A))

166− (face 66:27 q (tvar 66:29 B))

172+ (face 68:27 q (tvar 68:29 B))

167− (face 66:31 r (tvar 66:33 C))

173+ (face 68:31 r (tvar 68:33 C))

168− (face 66:35 s (tvar 66:37 D)))))

174+ (face 68:35 s (tvar 68:37 D)))))

169− (mold 68:1 cord (aura 68:9 @t))

175+ (mold 70:1 cord (aura 70:9 @t))

170− (mold 70:1 knot (aura 70:9 @ta))

176+ (mold 72:1 knot (aura 72:9 @ta))

171− (mold 72:1 tape

177+ (mold 74:1 tape

172− (apply 72:9 list (aura 72:15 @tD)))

178+ (apply 74:9 list (aura 74:15 @tD)))

173− (mold 74:1 path

179+ (mold 76:1 path

174− (apply 74:9 list (ref 74:15 knot)))

180+ (apply 76:9 list (ref 76:15 knot)))

175− (mold 76:1 tank

181+ (mold 78:1 tank

176− (union 77:3

182+ (union 79:3

177− (ref 77:3 cord)

183+ (ref 79:3 cord)

178− (cell 78:3

179− (const 78:4 %leaf)

180− (face 78:10 p (ref 78:12 tape)))

181− (cell 79:3

182− (const 79:4 %palm)

183− (face 79:10 p

184− (apply 79:12 qual (ref 79:18 tape) (ref 79:23 tape) (ref 79:28 tape) (ref 79:33 tape)))

185− (face 79:39 q

186− (apply 79:41 list (ref 79:47 tank))))

187 (cell 80:3

184 (cell 80:3

188− (const 80:4 %rose)

185+ (const 80:4 %leaf)

186+ (face 80:10 p (ref 80:12 tape)))

187+ (cell 81:3

188+ (const 81:4 %palm)

189+ (face 81:10 p

190+ (apply 81:12 qual (ref 81:18 tape) (ref 81:23 tape) (ref 81:28 tape) (ref 81:33 tape)))

191+ (face 81:39 q

192+ (apply 81:41 list (ref 81:47 tank))))

193+ (cell 82:3

194+ (const 82:4 %rose)

189− (face 80:10 p

195+ (face 82:10 p

190− (apply 80:12 trel (ref 80:18 tape) (ref 80:23 tape) (ref 80:28 tape)))

196+ (apply 82:12 trel (ref 82:18 tape) (ref 82:23 tape) (ref 82:28 tape)))

191− (face 80:34 q

197+ (face 82:34 q

192− (apply 80:36 list (ref 80:42 tank))))))

198+ (apply 82:36 list (ref 82:42 tank))))))

193− (mold 82:1 nail

199+ (mold 84:1 nail

194− (cell 82:9

195− (face 82:10 p (ref 82:12 hair))

196− (face 82:17 q (ref 82:19 tape))))

197− (mold 84:1 edge

198 (cell 84:9

200 (cell 84:9

199 (face 84:10 p (ref 84:12 hair))

201 (face 84:10 p (ref 84:12 hair))

200− (face 84:17 q

202+ (face 84:17 q (ref 84:19 tape))))

203+ (mold 86:1 edge

204+ (cell 86:9

205+ (face 86:10 p (ref 86:12 hair))

206+ (face 86:17 q

201− (apply 84:19 unit

207+ (apply 86:19 unit

202− (cell 84:25

208+ (cell 86:25

203− (face 84:26 p (noun 84:28))

209+ (face 86:26 p (noun 86:28))

204− (face 84:30 q (ref 84:32 nail)))))))

210+ (face 86:30 q (ref 86:32 nail)))))))

205− (mold 86:1 rule

211+ (mold 88:1 rule

206− (fn 86:9 (ref 86:12 nail) (ref 86:17 edge)))

212+ (fn 88:9 (ref 88:12 nail) (ref 88:17 edge)))

207− (mold 88:1 spot

213+ (mold 90:1 spot

208− (cell 88:9

214+ (cell 90:9

209− (face 88:10 p (ref 88:12 path))

215+ (face 90:10 p (ref 90:12 path))

210− (face 88:17 q (ref 88:19 pint))))

216+ (face 90:17 q (ref 90:19 pint))))

211− (mold 90:1 toon

217+ (mold 92:1 toon

212− (union 91:3

218+ (union 93:3

213− (cell 91:3

214− (const 91:4 %0)

215− (face 91:7 p (noun 91:9)))

216− (cell 92:3

217− (const 92:4 %1)

218− (face 92:7 p (noun 92:9)))

219 (cell 93:3

220− (const 93:4 %2)

220+ (const 93:4 %0)

221+ (face 93:7 p (noun 93:9)))

222+ (cell 94:3

223+ (const 94:4 %1)

224+ (face 94:7 p (noun 94:9)))

225+ (cell 95:3

226+ (const 95:4 %2)

221− (face 93:7 p

227+ (face 95:7 p

222− (apply 93:9 list (ref 93:15 tank)))))))

228+ (apply 95:9 list (ref 95:15 tank)))))))

tests/golden/prelude-3g-structural/types.txt+2−2

@@ -5,8 +5,8 @@ partial inference; module not checked

5++ not: $-(? ?)

6+$ list: cases proven disjoint; mold not checked

7+$ unit: cases proven disjoint; mold not checked

8−++ fall: sample mold is not supported by partial inference

8+++ fall: $-([(unit A) A] A)

9−++ need: sample mold is not supported by partial inference

9+++ need: $-((unit A) A)

10++ weld: sample mold is not supported by partial inference

11++ turn: sample mold is not supported by partial inference

12+$ dime: not checked

tests/golden/prelude-list-helpers/source.jibb+16−6

@@ -37,16 +37,18 @@

37++ weld |= args=[(list A) (list A)]

38 ?- args

39 [xs ys]

40+ ^- (list A)

40− ?- xs

41+ ?- xs

41− ~ ys

42+ ~ ys

42− [item rest] [item (weld rest ys)]

43+ [item rest] [item (weld rest ys)]

44++ turn |= args=[(list A) $-(A B)]

45++ turn |= args=[(list A) $-(A B)]

45 ?- args

46 ?- args

46 [xs f]

47 [xs f]

48+ ^- (list B)

47− ?- xs

49+ ?- xs

48− ~ ~

50+ ~ ~

49− [item rest] [(f item) (turn rest f)]

51+ [item rest] [(f item) (turn rest f)]

51+$ dime [p=@ta q=@]

53+$ dime [p=@ta q=@]

@@ -94,6 +96,14 @@

95+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

97+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

99+++ like |= [f=$-(A B) result=(like A)]

100+ ++ mapped

101+ ^- (unit [p=B q=nail])

102+ ?- q.result

103+ ~ ~

104+ [~ value] `[p=(f p.value) q=q.value]

105+ ^- (like B) [p=p.result q=mapped]

106+

97++ wonk |= veq=(like A)

107++ wonk |= veq=(like A)

98 ?- q.veq

108 ?- q.veq

99 ~ !!

109 ~ !!

tests/golden/prelude-list-helpers/tokens.txt+652−563

@@ -190,650 +190,739 @@

19039:9 name ys

19139:11 tight glyph ]

19240:7 INDENT

193−40:7 glyph ?-

193+40:7 glyph ^-

194−40:10 name xs

194+40:10 glyph (

195+40:11 tight name list

196+40:16 tvar A

197+40:17 tight glyph )

19541:9 INDENT

19841:9 INDENT

196−41:9 lit ~

199+41:9 glyph ?-

200+41:12 name xs

201+42:11 INDENT

202+42:11 lit ~

197−41:11 name ys

203+42:13 name ys

198−42:9 NEWLINE

204+43:11 NEWLINE

199−42:9 glyph [

205+43:11 glyph [

200−42:10 tight name item

206+43:12 tight name item

201−42:15 name rest

207+43:17 name rest

202−42:19 tight glyph ]

208+43:21 tight glyph ]

203−42:21 glyph [

209+43:23 glyph [

204−42:22 tight name item

210+43:24 tight name item

205−42:27 glyph (

211+43:29 glyph (

206−42:28 tight name weld

212+43:30 tight name weld

207−42:33 name rest

213+43:35 name rest

208−42:38 name ys

214+43:40 name ys

209−42:40 tight glyph )

215+43:42 tight glyph )

210−42:41 tight glyph ]

216+43:43 tight glyph ]

217+45:1 DEDENT

211−44:1 DEDENT

218+45:1 DEDENT

212−44:1 DEDENT

219+45:1 DEDENT

213−44:1 DEDENT

220+45:1 DEDENT

214−44:1 DEDENT

221+45:1 DEDENT

215−44:1 NEWLINE

222+45:1 NEWLINE

216−44:1 glyph ++

223+45:1 glyph ++

217−44:4 name turn

224+45:4 name turn

218−44:9 glyph |=

225+45:9 glyph |=

219−44:12 name args

226+45:12 name args

220−44:16 tight glyph =

227+45:16 tight glyph =

221−44:17 tight glyph [

228+45:17 tight glyph [

222−44:18 tight glyph (

229+45:18 tight glyph (

223−44:19 tight name list

230+45:19 tight name list

224−44:24 tvar A

231+45:24 tvar A

225−44:25 tight glyph )

232+45:25 tight glyph )

226−44:27 glyph $-(

233+45:27 glyph $-(

227−44:30 tight tvar A

234+45:30 tight tvar A

228−44:32 tvar B

235+45:32 tvar B

229−44:33 tight glyph )

236+45:33 tight glyph )

230−44:34 tight glyph ]

237+45:34 tight glyph ]

231−45:3 INDENT

238+46:3 INDENT

232−45:3 glyph ?-

239+46:3 glyph ?-

233−45:6 name args

240+46:6 name args

234−46:5 INDENT

241+47:5 INDENT

235−46:5 glyph [

242+47:5 glyph [

236−46:6 tight name xs

243+47:6 tight name xs

237−46:9 name f

244+47:9 name f

238−46:10 tight glyph ]

245+47:10 tight glyph ]

239−47:7 INDENT

246+48:7 INDENT

240−47:7 glyph ?-

247+48:7 glyph ^-

241−47:10 name xs

248+48:10 glyph (

249+48:11 tight name list

250+48:16 tvar B

251+48:17 tight glyph )

242−48:9 INDENT

252+49:9 INDENT

253+49:9 glyph ?-

254+49:12 name xs

255+50:11 INDENT

243−48:9 lit ~

256+50:11 lit ~

244−48:11 lit ~

257+50:13 lit ~

245−49:9 NEWLINE

258+51:11 NEWLINE

246−49:9 glyph [

259+51:11 glyph [

247−49:10 tight name item

260+51:12 tight name item

248−49:15 name rest

261+51:17 name rest

249−49:19 tight glyph ]

262+51:21 tight glyph ]

250−49:21 glyph [

263+51:23 glyph [

251−49:22 tight glyph (

264+51:24 tight glyph (

252−49:23 tight name f

265+51:25 tight name f

253−49:25 name item

266+51:27 name item

254−49:29 tight glyph )

255−49:31 glyph (

267+51:31 tight glyph )

268+51:33 glyph (

256−49:32 tight name turn

269+51:34 tight name turn

257−49:37 name rest

270+51:39 name rest

258−49:42 name f

271+51:44 name f

259−49:43 tight glyph )

272+51:45 tight glyph )

260−49:44 tight glyph ]

273+51:46 tight glyph ]

261−51:1 DEDENT

274+53:1 DEDENT

262−51:1 DEDENT

275+53:1 DEDENT

263−51:1 DEDENT

276+53:1 DEDENT

264−51:1 DEDENT

277+53:1 DEDENT

265−51:1 NEWLINE

278+53:1 DEDENT

266−51:1 glyph +$

267−51:4 name dime

268−51:9 glyph [

269−51:10 tight name p

270−51:11 tight glyph =

271−51:12 tight aura @ta

272−51:16 name q

273−51:17 tight glyph =

274−51:18 tight aura @

275−51:19 tight glyph ]

27653:1 NEWLINE

27953:1 NEWLINE

27753:1 glyph +$

28053:1 glyph +$

278−53:4 name hair

281+53:4 name dime

27953:9 glyph [

28253:9 glyph [

28053:10 tight name p

28353:10 tight name p

28153:11 tight glyph =

28453:11 tight glyph =

282−53:12 tight aura @ud

285+53:12 tight aura @ta

28353:16 name q

28653:16 name q

28453:17 tight glyph =

28753:17 tight glyph =

285−53:18 tight aura @ud

288+53:18 tight aura @

286−53:21 tight glyph ]

289+53:19 tight glyph ]

28755:1 NEWLINE

29055:1 NEWLINE

28855:1 glyph +$

29155:1 glyph +$

289−55:4 name pint

292+55:4 name hair

29055:9 glyph [

29355:9 glyph [

29155:10 tight name p

29455:10 tight name p

29255:11 tight glyph =

29555:11 tight glyph =

293−55:12 tight glyph [

296+55:12 tight aura @ud

294−55:13 tight name p

297+55:16 name q

295−55:14 tight glyph =

298+55:17 tight glyph =

296−55:15 tight aura @

297−55:17 name q

298−55:18 tight glyph =

299+55:18 tight aura @ud

299−55:19 tight aura @

300−55:20 tight glyph ]

301−55:22 name q

302−55:23 tight glyph =

303−55:24 tight glyph [

304−55:25 tight name p

305−55:26 tight glyph =

306−55:27 tight aura @

307−55:29 name q

308−55:30 tight glyph =

309−55:31 tight aura @

310−55:32 tight glyph ]

311−55:33 tight glyph ]

300+55:21 tight glyph ]

31257:1 NEWLINE

30157:1 NEWLINE

31357:1 glyph +$

30257:1 glyph +$

314−57:4 name coin

303+57:4 name pint

315−58:3 INDENT

316−58:3 glyph [

317−58:4 tight lit %$

318−58:7 name p

319−58:8 tight glyph =

320−58:9 tight name dime

321−58:13 tight glyph ]

304+57:9 glyph [

322−59:3 NEWLINE

323−59:3 glyph [

324−59:4 tight lit %blob

325−59:10 name p

305+57:10 tight name p

326−59:11 tight glyph =

306+57:11 tight glyph =

327−59:12 tight glyph *

307+57:12 tight glyph [

328−59:13 tight glyph ]

308+57:13 tight name p

329−60:3 NEWLINE

309+57:14 tight glyph =

310+57:15 tight aura @

311+57:17 name q

312+57:18 tight glyph =

313+57:19 tight aura @

314+57:20 tight glyph ]

315+57:22 name q

316+57:23 tight glyph =

317+57:24 tight glyph [

318+57:25 tight name p

319+57:26 tight glyph =

320+57:27 tight aura @

321+57:29 name q

322+57:30 tight glyph =

323+57:31 tight aura @

324+57:32 tight glyph ]

325+57:33 tight glyph ]

326+59:1 NEWLINE

327+59:1 glyph +$

328+59:4 name coin

329+60:3 INDENT

33060:3 glyph [

331−60:4 tight lit %many

331+60:4 tight lit %$

332+60:7 name p

333+60:8 tight glyph =

334+60:9 tight name dime

335+60:13 tight glyph ]

336+61:3 NEWLINE

337+61:3 glyph [

338+61:4 tight lit %blob

339+61:10 name p

340+61:11 tight glyph =

341+61:12 tight glyph *

342+61:13 tight glyph ]

343+62:3 NEWLINE

344+62:3 glyph [

345+62:4 tight lit %many

332−60:10 name p

346+62:10 name p

333−60:11 tight glyph =

347+62:11 tight glyph =

334−60:12 tight glyph (

348+62:12 tight glyph (

335−60:13 tight name list

349+62:13 tight name list

336−60:18 name coin

350+62:18 name coin

337−60:22 tight glyph )

351+62:22 tight glyph )

338−60:23 tight glyph ]

352+62:23 tight glyph ]

339−62:1 DEDENT

353+64:1 DEDENT

340−62:1 NEWLINE

341−62:1 glyph +$

342−62:4 name pair

343−62:9 glyph |$

344−62:12 glyph [

345−62:13 tight tvar A

346−62:15 tvar B

347−62:16 tight glyph ]

348−62:18 glyph [

349−62:19 tight name p

350−62:20 tight glyph =

351−62:21 tight tvar A

352−62:23 name q

353−62:24 tight glyph =

354−62:25 tight tvar B

355−62:26 tight glyph ]

35664:1 NEWLINE

35464:1 NEWLINE

35764:1 glyph +$

35564:1 glyph +$

358−64:4 name trel

356+64:4 name pair

35964:9 glyph |$

35764:9 glyph |$

36064:12 glyph [

35864:12 glyph [

36164:13 tight tvar A

35964:13 tight tvar A

36264:15 tvar B

36064:15 tvar B

363−64:17 tvar C

361+64:16 tight glyph ]

364−64:18 tight glyph ]

365−64:20 glyph [

362+64:18 glyph [

366−64:21 tight name p

363+64:19 tight name p

367−64:22 tight glyph =

364+64:20 tight glyph =

368−64:23 tight tvar A

365+64:21 tight tvar A

369−64:25 name q

366+64:23 name q

370−64:26 tight glyph =

367+64:24 tight glyph =

371−64:27 tight tvar B

368+64:25 tight tvar B

372−64:29 name r

373−64:30 tight glyph =

374−64:31 tight tvar C

375−64:32 tight glyph ]

369+64:26 tight glyph ]

37666:1 NEWLINE

37066:1 NEWLINE

37766:1 glyph +$

37166:1 glyph +$

378−66:4 name qual

372+66:4 name trel

37966:9 glyph |$

37366:9 glyph |$

38066:12 glyph [

37466:12 glyph [

38166:13 tight tvar A

37566:13 tight tvar A

38266:15 tvar B

37666:15 tvar B

38366:17 tvar C

37766:17 tvar C

384−66:19 tvar D

378+66:18 tight glyph ]

385−66:20 tight glyph ]

386−66:22 glyph [

379+66:20 glyph [

380+66:21 tight name p

381+66:22 tight glyph =

387−66:23 tight name p

382+66:23 tight tvar A

388−66:24 tight glyph =

389−66:25 tight tvar A

390−66:27 name q

383+66:25 name q

391−66:28 tight glyph =

384+66:26 tight glyph =

392−66:29 tight tvar B

385+66:27 tight tvar B

393−66:31 name r

386+66:29 name r

394−66:32 tight glyph =

387+66:30 tight glyph =

395−66:33 tight tvar C

388+66:31 tight tvar C

396−66:35 name s

397−66:36 tight glyph =

398−66:37 tight tvar D

399−66:38 tight glyph ]

389+66:32 tight glyph ]

40068:1 NEWLINE

39068:1 NEWLINE

40168:1 glyph +$

39168:1 glyph +$

402−68:4 name cord

392+68:4 name qual

403−68:9 aura @t

393+68:9 glyph |$

394+68:12 glyph [

395+68:13 tight tvar A

396+68:15 tvar B

397+68:17 tvar C

398+68:19 tvar D

399+68:20 tight glyph ]

400+68:22 glyph [

401+68:23 tight name p

402+68:24 tight glyph =

403+68:25 tight tvar A

404+68:27 name q

405+68:28 tight glyph =

406+68:29 tight tvar B

407+68:31 name r

408+68:32 tight glyph =

409+68:33 tight tvar C

410+68:35 name s

411+68:36 tight glyph =

412+68:37 tight tvar D

413+68:38 tight glyph ]

40470:1 NEWLINE

41470:1 NEWLINE

40570:1 glyph +$

41570:1 glyph +$

406−70:4 name knot

416+70:4 name cord

407−70:9 aura @ta

417+70:9 aura @t

40872:1 NEWLINE

41872:1 NEWLINE

40972:1 glyph +$

41972:1 glyph +$

410−72:4 name tape

420+72:4 name knot

411−72:9 glyph (

412−72:10 tight name list

413−72:15 aura @tD

421+72:9 aura @ta

414−72:18 tight glyph )

41574:1 NEWLINE

42274:1 NEWLINE

41674:1 glyph +$

42374:1 glyph +$

417−74:4 name path

424+74:4 name tape

41874:9 glyph (

42574:9 glyph (

41974:10 tight name list

42674:10 tight name list

420−74:15 name knot

427+74:15 aura @tD

421−74:19 tight glyph )

428+74:18 tight glyph )

42276:1 NEWLINE

42976:1 NEWLINE

42376:1 glyph +$

43076:1 glyph +$

424−76:4 name tank

431+76:4 name path

432+76:9 glyph (

433+76:10 tight name list

434+76:15 name knot

435+76:19 tight glyph )

436+78:1 NEWLINE

437+78:1 glyph +$

438+78:4 name tank

425−77:3 INDENT

439+79:3 INDENT

426−77:3 name cord

440+79:3 name cord

427−78:3 NEWLINE

428−78:3 glyph [

429−78:4 tight lit %leaf

430−78:10 name p

431−78:11 tight glyph =

432−78:12 tight name tape

433−78:16 tight glyph ]

434−79:3 NEWLINE

435−79:3 glyph [

436−79:4 tight lit %palm

437−79:10 name p

438−79:11 tight glyph =

439−79:12 tight glyph (

440−79:13 tight name qual

441−79:18 name tape

442−79:23 name tape

443−79:28 name tape

444−79:33 name tape

445−79:37 tight glyph )

446−79:39 name q

447−79:40 tight glyph =

448−79:41 tight glyph (

449−79:42 tight name list

450−79:47 name tank

451−79:51 tight glyph )

452−79:52 tight glyph ]

45380:3 NEWLINE

44180:3 NEWLINE

45480:3 glyph [

44280:3 glyph [

455−80:4 tight lit %rose

443+80:4 tight lit %leaf

45680:10 name p

44480:10 name p

45780:11 tight glyph =

44580:11 tight glyph =

458−80:12 tight glyph (

446+80:12 tight name tape

447+80:16 tight glyph ]

448+81:3 NEWLINE

449+81:3 glyph [

450+81:4 tight lit %palm

451+81:10 name p

452+81:11 tight glyph =

453+81:12 tight glyph (

459−80:13 tight name trel

454+81:13 tight name qual

460−80:18 name tape

455+81:18 name tape

461−80:23 name tape

456+81:23 name tape

462−80:28 name tape

457+81:28 name tape

458+81:33 name tape

463−80:32 tight glyph )

459+81:37 tight glyph )

464−80:34 name q

460+81:39 name q

465−80:35 tight glyph =

461+81:40 tight glyph =

466−80:36 tight glyph (

462+81:41 tight glyph (

467−80:37 tight name list

463+81:42 tight name list

468−80:42 name tank

464+81:47 name tank

469−80:46 tight glyph )

470−80:47 tight glyph ]

465+81:51 tight glyph )

471−82:1 DEDENT

466+81:52 tight glyph ]

472−82:1 NEWLINE

467+82:3 NEWLINE

473−82:1 glyph +$

468+82:3 glyph [

474−82:4 name nail

469+82:4 tight lit %rose

475−82:9 glyph [

476−82:10 tight name p

470+82:10 name p

47782:11 tight glyph =

47182:11 tight glyph =

478−82:12 tight name hair

472+82:12 tight glyph (

473+82:13 tight name trel

474+82:18 name tape

475+82:23 name tape

476+82:28 name tape

477+82:32 tight glyph )

479−82:17 name q

478+82:34 name q

480−82:18 tight glyph =

479+82:35 tight glyph =

481−82:19 tight name tape

480+82:36 tight glyph (

481+82:37 tight name list

482+82:42 name tank

483+82:46 tight glyph )

482−82:23 tight glyph ]

484+82:47 tight glyph ]

485+84:1 DEDENT

48384:1 NEWLINE

48684:1 NEWLINE

48484:1 glyph +$

48784:1 glyph +$

485−84:4 name edge

488+84:4 name nail

48684:9 glyph [

48984:9 glyph [

48784:10 tight name p

49084:10 tight name p

48884:11 tight glyph =

49184:11 tight glyph =

48984:12 tight name hair

49284:12 tight name hair

49084:17 name q

49384:17 name q

49184:18 tight glyph =

49484:18 tight glyph =

492−84:19 tight glyph (

495+84:19 tight name tape

493−84:20 tight name unit

494−84:25 glyph [

495−84:26 tight name p

496−84:27 tight glyph =

497−84:28 tight glyph *

498−84:30 name q

499−84:31 tight glyph =

500−84:32 tight name nail

501−84:36 tight glyph ]

502−84:37 tight glyph )

503−84:38 tight glyph ]

496+84:23 tight glyph ]

50486:1 NEWLINE

49786:1 NEWLINE

50586:1 glyph +$

49886:1 glyph +$

506−86:4 name rule

499+86:4 name edge

507−86:9 glyph $-(

500+86:9 glyph [

501+86:10 tight name p

502+86:11 tight glyph =

503+86:12 tight name hair

504+86:17 name q

505+86:18 tight glyph =

506+86:19 tight glyph (

507+86:20 tight name unit

508+86:25 glyph [

509+86:26 tight name p

510+86:27 tight glyph =

511+86:28 tight glyph *

512+86:30 name q

513+86:31 tight glyph =

508−86:12 tight name nail

514+86:32 tight name nail

509−86:17 name edge

515+86:36 tight glyph ]

510−86:21 tight glyph )

516+86:37 tight glyph )

517+86:38 tight glyph ]

51188:1 NEWLINE

51888:1 NEWLINE

51288:1 glyph +$

51988:1 glyph +$

513−88:4 name spot

520+88:4 name rule

514−88:9 glyph [

521+88:9 glyph $-(

515−88:10 tight name p

516−88:11 tight glyph =

517−88:12 tight name path

522+88:12 tight name nail

518−88:17 name q

523+88:17 name edge

519−88:18 tight glyph =

524+88:21 tight glyph )

520−88:19 tight name pint

521−88:23 tight glyph ]

52290:1 NEWLINE

52590:1 NEWLINE

52390:1 glyph +$

52690:1 glyph +$

524−90:4 name toon

527+90:4 name spot

528+90:9 glyph [

529+90:10 tight name p

530+90:11 tight glyph =

531+90:12 tight name path

532+90:17 name q

533+90:18 tight glyph =

534+90:19 tight name pint

535+90:23 tight glyph ]

536+92:1 NEWLINE

537+92:1 glyph +$

538+92:4 name toon

525−91:3 INDENT

539+93:3 INDENT

526−91:3 glyph [

527−91:4 tight lit %0

528−91:7 name p

529−91:8 tight glyph =

530−91:9 tight glyph *

531−91:10 tight glyph ]

532−92:3 NEWLINE

533−92:3 glyph [

534−92:4 tight lit %1

535−92:7 name p

536−92:8 tight glyph =

537−92:9 tight glyph *

538−92:10 tight glyph ]

539−93:3 NEWLINE

54093:3 glyph [

541−93:4 tight lit %2

541+93:4 tight lit %0

54293:7 name p

54393:8 tight glyph =

544−93:9 tight glyph (

544+93:9 tight glyph *

545+93:10 tight glyph ]

546+94:3 NEWLINE

547+94:3 glyph [

548+94:4 tight lit %1

549+94:7 name p

550+94:8 tight glyph =

551+94:9 tight glyph *

552+94:10 tight glyph ]

553+95:3 NEWLINE

554+95:3 glyph [

555+95:4 tight lit %2

556+95:7 name p

557+95:8 tight glyph =

558+95:9 tight glyph (

545−93:10 tight name list

559+95:10 tight name list

546−93:15 name tank

560+95:15 name tank

547−93:19 tight glyph )

561+95:19 tight glyph )

548−93:20 tight glyph ]

562+95:20 tight glyph ]

549−95:1 DEDENT

563+97:1 DEDENT

550−95:1 NEWLINE

551−95:1 glyph +$

552−95:4 name like

553−95:9 glyph |$

554−95:12 glyph [

555−95:13 tight tvar A

556−95:14 tight glyph ]

557−95:16 glyph [

558−95:17 tight name p

559−95:18 tight glyph =

560−95:19 tight name hair

561−95:24 name q

562−95:25 tight glyph =

563−95:26 tight glyph (

564−95:27 tight name unit

565−95:32 glyph [

566−95:33 tight name p

567−95:34 tight glyph =

568−95:35 tight tvar A

569−95:37 name q

570−95:38 tight glyph =

571−95:39 tight name nail

572−95:43 tight glyph ]

573−95:44 tight glyph )

574−95:45 tight glyph ]

57597:1 NEWLINE

56497:1 NEWLINE

576−97:1 glyph ++

565+97:1 glyph +$

577−97:4 name wonk

566+97:4 name like

567+97:9 glyph |$

568+97:12 glyph [

569+97:13 tight tvar A

570+97:14 tight glyph ]

571+97:16 glyph [

572+97:17 tight name p

573+97:18 tight glyph =

574+97:19 tight name hair

575+97:24 name q

576+97:25 tight glyph =

577+97:26 tight glyph (

578+97:27 tight name unit

579+97:32 glyph [

580+97:33 tight name p

581+97:34 tight glyph =

582+97:35 tight tvar A

583+97:37 name q

584+97:38 tight glyph =

585+97:39 tight name nail

586+97:43 tight glyph ]

587+97:44 tight glyph )

588+97:45 tight glyph ]

589+99:1 NEWLINE

590+99:1 glyph ++

591+99:4 name like

578−97:9 glyph |=

592+99:9 glyph |=

579−97:12 name veq

593+99:12 glyph [

594+99:13 tight name f

580−97:15 tight glyph =

595+99:14 tight glyph =

581−97:16 tight glyph (

596+99:15 tight glyph $-(

582−97:17 tight name like

597+99:18 tight tvar A

583−97:22 tvar A

598+99:20 tvar B

584−97:23 tight glyph )

599+99:21 tight glyph )

600+99:23 name result

601+99:29 tight glyph =

602+99:30 tight glyph (

603+99:31 tight name like

604+99:36 tvar A

605+99:37 tight glyph )

606+99:38 tight glyph ]

585−98:3 INDENT

607+100:3 INDENT

586−98:3 glyph ?-

608+100:3 glyph ++

587−98:6 wing q.veq

609+100:6 name mapped

610+101:5 INDENT

611+101:5 glyph ^-

612+101:8 glyph (

613+101:9 tight name unit

614+101:14 glyph [

615+101:15 tight name p

616+101:16 tight glyph =

617+101:17 tight tvar B

618+101:19 name q

619+101:20 tight glyph =

620+101:21 tight name nail

621+101:25 tight glyph ]

622+101:26 tight glyph )

623+102:7 INDENT

624+102:7 glyph ?-

625+102:10 wing q.result

588−99:5 INDENT

626+103:9 INDENT

589−99:5 lit ~

627+103:9 lit ~

590−99:7 glyph !!

628+103:11 lit ~

591−100:5 NEWLINE

592−100:5 glyph [

593−100:6 tight lit ~

594−100:8 name product

595−100:15 tight glyph ]

596−100:17 wing p.product

597−102:1 DEDENT

598−102:1 DEDENT

599−102:1 NEWLINE

629+104:9 NEWLINE

600−102:1 glyph +$

601−102:4 name lone

602−102:9 glyph |$

603−102:12 glyph [

630+104:9 glyph [

604−102:13 tight tvar A

631+104:10 tight lit ~

605−102:14 tight glyph ]

632+104:12 name value

606−102:16 glyph [

607−102:17 tight name p

608−102:18 tight glyph =

609−102:19 tight tvar A

610−102:20 tight glyph ]

611−104:1 NEWLINE

612−104:1 glyph +$

613−104:4 name lest

614−104:9 glyph |$

615−104:12 glyph [

616−104:13 tight tvar A

617−104:14 tight glyph ]

633+104:17 tight glyph ]

618−104:16 glyph [

634+104:19 glyph `

619−104:17 tight name i

620−104:18 tight glyph =

635+104:20 tight glyph [

621−104:19 tight tvar A

636+104:21 tight name p

622−104:21 name t

623104:22 tight glyph =

637104:22 tight glyph =

624104:23 tight glyph (

638104:23 tight glyph (

625−104:24 tight name list

639+104:24 tight name f

626−104:29 tvar A

640+104:26 wing p.value

627−104:30 tight glyph )

641+104:33 tight glyph )

628−104:31 tight glyph ]

642+104:35 name q

629−106:1 NEWLINE

643+104:36 tight glyph =

630−106:1 glyph +$

644+104:37 tight wing q.value

631−106:4 name pole

645+104:44 tight glyph ]

632−106:9 glyph |$

646+105:3 DEDENT

633−106:12 glyph [

647+105:3 DEDENT

634−106:13 tight tvar A

648+105:3 DEDENT

635−106:14 tight glyph ]

649+105:3 NEWLINE

636−107:3 INDENT

650+105:3 glyph ^-

637−107:3 lit ~

651+105:6 glyph (

638−108:3 NEWLINE

652+105:7 tight name like

639−108:3 glyph [

653+105:12 tvar B

640−108:4 tight tvar A

641−108:6 glyph (

642−108:7 tight name pole

643−108:12 tvar A

644−108:13 tight glyph )

645−108:14 tight glyph ]

646−110:1 DEDENT

647−110:1 NEWLINE

648−110:1 glyph +$

649−110:4 name quip

650−110:9 glyph |$

651−110:12 glyph [

652−110:13 tight tvar A

653−110:15 tvar B

654−110:16 tight glyph ]

655−110:18 glyph [

656−110:19 tight glyph (

657−110:20 tight name list

658−110:25 tvar A

659−110:26 tight glyph )

654+105:13 tight glyph )

655+105:15 glyph [

656+105:16 tight name p

657+105:17 tight glyph =

658+105:18 tight wing p.result

659+105:27 name q

660+105:28 tight glyph =

661+105:29 tight name mapped

662+105:35 tight glyph ]

663+107:1 DEDENT

664+107:1 NEWLINE

665+107:1 glyph ++

666+107:4 name wonk

667+107:9 glyph |=

668+107:12 name veq

669+107:15 tight glyph =

670+107:16 tight glyph (

671+107:17 tight name like

660−110:28 tvar B

672+107:22 tvar A

673+107:23 tight glyph )

674+108:3 INDENT

675+108:3 glyph ?-

676+108:6 wing q.veq

677+109:5 INDENT

678+109:5 lit ~

679+109:7 glyph !!

680+110:5 NEWLINE

681+110:5 glyph [

682+110:6 tight lit ~

683+110:8 name product

661−110:29 tight glyph ]

684+110:15 tight glyph ]

685+110:17 wing p.product

686+112:1 DEDENT

687+112:1 DEDENT

662112:1 NEWLINE

688112:1 NEWLINE

663112:1 glyph +$

689112:1 glyph +$

664−112:4 name tree

690+112:4 name lone

665112:9 glyph |$

691112:9 glyph |$

666112:12 glyph [

692112:12 glyph [

667112:13 tight tvar A

693112:13 tight tvar A

668112:14 tight glyph ]

694112:14 tight glyph ]

669−113:3 INDENT

695+112:16 glyph [

670−113:3 lit ~

696+112:17 tight name p

697+112:18 tight glyph =

698+112:19 tight tvar A

699+112:20 tight glyph ]

671−114:3 NEWLINE

700+114:1 NEWLINE

672−114:3 glyph [

701+114:1 glyph +$

673−114:4 tight name n

702+114:4 name lest

674−114:5 tight glyph =

703+114:9 glyph |$

675−114:6 tight tvar A

676−114:8 name l

677−114:9 tight glyph =

704+114:12 glyph [

678−114:10 tight glyph (

705+114:13 tight tvar A

679−114:11 tight name tree

706+114:14 tight glyph ]

680−114:16 tvar A

707+114:16 glyph [

681−114:17 tight glyph )

708+114:17 tight name i

682−114:19 name r

709+114:18 tight glyph =

683−114:20 tight glyph =

710+114:19 tight tvar A

684−114:21 tight glyph (

711+114:21 name t

685−114:22 tight name tree

712+114:22 tight glyph =

686−114:27 tvar A

713+114:23 tight glyph (

687−114:28 tight glyph )

714+114:24 tight name list

715+114:29 tvar A

688−114:29 tight glyph ]

716+114:30 tight glyph )

689−116:1 DEDENT

717+114:31 tight glyph ]

690116:1 NEWLINE

718116:1 NEWLINE

691116:1 glyph +$

719116:1 glyph +$

692−116:4 name each

720+116:4 name pole

693116:9 glyph |$

721116:9 glyph |$

694116:12 glyph [

722116:12 glyph [

695116:13 tight tvar A

723116:13 tight tvar A

696−116:15 tvar B

697−116:16 tight glyph ]

724+116:14 tight glyph ]

698117:3 INDENT

725117:3 INDENT

699−117:3 glyph [

726+117:3 lit ~

700−117:4 tight lit %|

701−117:7 name p

702−117:8 tight glyph =

703−117:9 tight tvar B

704−117:10 tight glyph ]

705118:3 NEWLINE

727118:3 NEWLINE

706118:3 glyph [

728118:3 glyph [

707−118:4 tight lit %&

729+118:4 tight tvar A

730+118:6 glyph (

708−118:7 name p

731+118:7 tight name pole

709−118:8 tight glyph =

732+118:12 tvar A

710−118:9 tight tvar A

733+118:13 tight glyph )

711−118:10 tight glyph ]

734+118:14 tight glyph ]

712120:1 DEDENT

735120:1 DEDENT

713120:1 NEWLINE

736120:1 NEWLINE

714120:1 glyph +$

737120:1 glyph +$

715−120:4 name bloq

738+120:4 name quip

716−120:9 aura @

739+120:9 glyph |$

740+120:12 glyph [

741+120:13 tight tvar A

742+120:15 tvar B

743+120:16 tight glyph ]

744+120:18 glyph [

745+120:19 tight glyph (

746+120:20 tight name list

747+120:25 tvar A

748+120:26 tight glyph )

749+120:28 tvar B

750+120:29 tight glyph ]

717122:1 NEWLINE

751122:1 NEWLINE

718−122:1 glyph ++

752+122:1 glyph +$

753+122:4 name tree

754+122:9 glyph |$

755+122:12 glyph [

756+122:13 tight tvar A

757+122:14 tight glyph ]

758+123:3 INDENT

759+123:3 lit ~

760+124:3 NEWLINE

761+124:3 glyph [

762+124:4 tight name n

763+124:5 tight glyph =

764+124:6 tight tvar A

765+124:8 name l

766+124:9 tight glyph =

767+124:10 tight glyph (

768+124:11 tight name tree

769+124:16 tvar A

770+124:17 tight glyph )

771+124:19 name r

772+124:20 tight glyph =

773+124:21 tight glyph (

774+124:22 tight name tree

775+124:27 tvar A

776+124:28 tight glyph )

777+124:29 tight glyph ]

778+126:1 DEDENT

779+126:1 NEWLINE

780+126:1 glyph +$

781+126:4 name each

782+126:9 glyph |$

783+126:12 glyph [

784+126:13 tight tvar A

785+126:15 tvar B

786+126:16 tight glyph ]

787+127:3 INDENT

788+127:3 glyph [

789+127:4 tight lit %|

790+127:7 name p

791+127:8 tight glyph =

792+127:9 tight tvar B

793+127:10 tight glyph ]

794+128:3 NEWLINE

795+128:3 glyph [

796+128:4 tight lit %&

797+128:7 name p

798+128:8 tight glyph =

799+128:9 tight tvar A

800+128:10 tight glyph ]

801+130:1 DEDENT

802+130:1 NEWLINE

803+130:1 glyph +$

804+130:4 name bloq

805+130:9 aura @

806+132:1 NEWLINE

807+132:1 glyph ++

719−122:4 name some

808+132:4 name some

720−122:9 glyph |=

809+132:9 glyph |=

721−122:12 name item

810+132:12 name item

722−122:16 tight glyph =

811+132:16 tight glyph =

723−122:17 tight tvar A

812+132:17 tight tvar A

724−122:19 glyph `

813+132:19 glyph `

725−122:20 tight name item

814+132:20 tight name item

726−124:1 NEWLINE

815+134:1 NEWLINE

727−124:1 glyph ++

816+134:1 glyph ++

728−124:4 name lure

817+134:4 name lure

729−124:9 glyph |=

818+134:9 glyph |=

730−124:12 name item

819+134:12 name item

731−124:16 tight glyph =

820+134:16 tight glyph =

732−124:17 tight tvar A

821+134:17 tight tvar A

733−125:3 INDENT

822+135:3 INDENT

734−125:3 glyph ^-

823+135:3 glyph ^-

735−125:6 glyph (

824+135:6 glyph (

736−125:7 tight name list

825+135:7 tight name list

737−125:12 tvar A

826+135:12 tvar A

738−125:13 tight glyph )

827+135:13 tight glyph )

739−125:15 glyph [

828+135:15 glyph [

740−125:16 tight name item

829+135:16 tight name item

741−125:21 lit ~

830+135:21 lit ~

742−125:22 tight glyph ]

831+135:22 tight glyph ]

743−127:1 DEDENT

832+137:1 DEDENT

744−127:1 NEWLINE

833+137:1 NEWLINE

745−127:1 glyph ++

834+137:1 glyph ++

746−127:4 name snoc

835+137:4 name snoc

747−127:9 glyph |=

836+137:9 glyph |=

748−127:12 name args

837+137:12 name args

749−127:16 tight glyph =

838+137:16 tight glyph =

750−127:17 tight glyph [

839+137:17 tight glyph [

751−127:18 tight glyph (

840+137:18 tight glyph (

752−127:19 tight name list

841+137:19 tight name list

753−127:24 tvar A

842+137:24 tvar A

754−127:25 tight glyph )

843+137:25 tight glyph )

755−127:27 tvar A

844+137:27 tvar A

756−127:28 tight glyph ]

845+137:28 tight glyph ]

757−128:3 INDENT

846+138:3 INDENT

758−128:3 glyph ?-

847+138:3 glyph ?-

759−128:6 name args

848+138:6 name args

760−129:5 INDENT

849+139:5 INDENT

761−129:5 glyph [

850+139:5 glyph [

762−129:6 tight name xs

851+139:6 tight name xs

763−129:9 name item

852+139:9 name item

764−129:13 tight glyph ]

853+139:13 tight glyph ]

765−129:15 glyph (

854+139:15 glyph (

766−129:16 tight name weld

855+139:16 tight name weld

767−129:21 name xs

856+139:21 name xs

768−129:24 glyph [

857+139:24 glyph [

769−129:25 tight name item

858+139:25 tight name item

770−129:30 lit ~

859+139:30 lit ~

771−129:31 tight glyph ]

860+139:31 tight glyph ]

772−129:32 tight glyph )

861+139:32 tight glyph )

773−131:1 DEDENT

862+141:1 DEDENT

774−131:1 DEDENT

863+141:1 DEDENT

775−131:1 NEWLINE

864+141:1 NEWLINE

776−131:1 glyph ++

865+141:1 glyph ++

777−131:4 name flop

866+141:4 name flop

778−131:9 glyph |=

867+141:9 glyph |=

779−131:12 name xs

868+141:12 name xs

780−131:14 tight glyph =

869+141:14 tight glyph =

781−131:15 tight glyph (

870+141:15 tight glyph (

782−131:16 tight name list

871+141:16 tight name list

783−131:21 tvar A

872+141:21 tvar A

784−131:22 tight glyph )

873+141:22 tight glyph )

785−132:3 INDENT

874+142:3 INDENT

786−132:3 glyph ++

875+142:3 glyph ++

787−132:6 name reverse-into

876+142:6 name reverse-into

788−132:19 glyph |=

877+142:19 glyph |=

789−132:22 name args

878+142:22 name args

790−132:26 tight glyph =

879+142:26 tight glyph =

791−132:27 tight glyph [

880+142:27 tight glyph [

792−132:28 tight glyph (

881+142:28 tight glyph (

793−132:29 tight name list

882+142:29 tight name list

794−132:34 tvar A

883+142:34 tvar A

795−132:35 tight glyph )

884+142:35 tight glyph )

796−132:37 glyph (

885+142:37 glyph (

797−132:38 tight name list

886+142:38 tight name list

798−132:43 tvar A

887+142:43 tvar A

799−132:44 tight glyph )

888+142:44 tight glyph )

800−132:45 tight glyph ]

889+142:45 tight glyph ]

801−133:5 INDENT

890+143:5 INDENT

802−133:5 glyph ?-

891+143:5 glyph ?-

803−133:8 name args

892+143:8 name args

804−134:7 INDENT

893+144:7 INDENT

805−134:7 glyph [

894+144:7 glyph [

806−134:8 tight name rest

895+144:8 tight name rest

807−134:13 name acc

896+144:13 name acc

808−134:16 tight glyph ]

897+144:16 tight glyph ]

809−135:9 INDENT

898+145:9 INDENT

810−135:9 glyph ?-

899+145:9 glyph ?-

811−135:12 name rest

900+145:12 name rest

812−136:11 INDENT

901+146:11 INDENT

813−136:11 lit ~

902+146:11 lit ~

814−136:13 name acc

903+146:13 name acc

815−137:11 NEWLINE

904+147:11 NEWLINE

816−137:11 glyph [

905+147:11 glyph [

817−137:12 tight name item

906+147:12 tight name item

818−137:17 name more

907+147:17 name more

819−137:21 tight glyph ]

908+147:21 tight glyph ]

820−137:23 glyph (

909+147:23 glyph (

821−137:24 tight name reverse-into

910+147:24 tight name reverse-into

822−137:37 name more

911+147:37 name more

823−137:42 glyph [

912+147:42 glyph [

824−137:43 tight name item

913+147:43 tight name item

825−137:48 name acc

914+147:48 name acc

826−137:51 tight glyph ]

915+147:51 tight glyph ]

827−137:52 tight glyph )

916+147:52 tight glyph )

828−138:3 DEDENT

917+148:3 DEDENT

829−138:3 DEDENT

918+148:3 DEDENT

830−138:3 DEDENT

919+148:3 DEDENT

831−138:3 DEDENT

920+148:3 DEDENT

832−138:3 NEWLINE

921+148:3 NEWLINE

833−138:3 glyph (

922+148:3 glyph (

834−138:4 tight name reverse-into

923+148:4 tight name reverse-into

835−138:17 name xs

924+148:17 name xs

836−138:20 lit ~

925+148:20 lit ~

837−138:21 tight glyph )

926+148:21 tight glyph )

838−138:22 DEDENT

927+148:22 DEDENT

839−138:22 NEWLINE

928+148:22 NEWLINE

tests/golden/prelude-list-helpers/tree.txt+279−241

@@ -87,254 +87,292 @@

87 (arm 39:5

88 (cell 39:5 (bind 39:6 xs) (bind 39:9 ys))

89 (body 40:7

90− (branch 40:7

90+ (cast 40:7

91− (wing 40:10 xs)

91+ (apply 40:10 list (tvar 40:16 A))

92− (arm 41:9 (lit 41:9 ~) (wing 41:11 ys))

92+ (body 41:9

93− (arm 42:9

93+ (branch 41:9

94− (cell 42:9 (bind 42:10 item) (bind 42:15 rest))

94+ (wing 41:12 xs)

95− (tuple 42:21

95+ (arm 42:11 (lit 42:11 ~) (wing 42:13 ys))

96− (wing 42:22 item)

96+ (arm 43:11

97− (group 42:27

97+ (cell 43:11 (bind 43:12 item) (bind 43:17 rest))

98− (call 42:28 (wing 42:28 weld) (wing 42:33 rest) (wing 42:38 ys))))))))))))

98+ (tuple 43:23

99− (value 44:1 turn

99+ (wing 43:24 item)

100− (gate 44:9

100+ (group 43:29

101− (face 44:12 args

101+ (call 43:30 (wing 43:30 weld) (wing 43:35 rest) (wing 43:40 ys))))))))))))))

102− (cell 44:17

102+ (value 45:1 turn

103− (apply 44:18 list (tvar 44:24 A))

103+ (gate 45:9

104− (fn 44:27 (tvar 44:30 A) (tvar 44:32 B))))

104+ (face 45:12 args

105− (body 45:3

105+ (cell 45:17

106− (branch 45:3

106+ (apply 45:18 list (tvar 45:24 A))

107− (wing 45:6 args)

107+ (fn 45:27 (tvar 45:30 A) (tvar 45:32 B))))

108− (arm 46:5

108+ (body 46:3

109− (cell 46:5 (bind 46:6 xs) (bind 46:9 f))

109+ (branch 46:3

110− (body 47:7

110+ (wing 46:6 args)

111− (branch 47:7

111+ (arm 47:5

112− (wing 47:10 xs)

112+ (cell 47:5 (bind 47:6 xs) (bind 47:9 f))

113− (arm 48:9 (lit 48:9 ~) (lit 48:11 ~))

113+ (body 48:7

114− (arm 49:9

114+ (cast 48:7

115− (cell 49:9 (bind 49:10 item) (bind 49:15 rest))

115+ (apply 48:10 list (tvar 48:16 B))

116− (tuple 49:21

116+ (body 49:9

117− (group 49:22

117+ (branch 49:9

118− (call 49:23 (wing 49:23 f) (wing 49:25 item)))

118+ (wing 49:12 xs)

119− (group 49:31

119+ (arm 50:11 (lit 50:11 ~) (lit 50:13 ~))

120− (call 49:32 (wing 49:32 turn) (wing 49:37 rest) (wing 49:42 f))))))))))))

120+ (arm 51:11

121− (mold 51:1 dime

121+ (cell 51:11 (bind 51:12 item) (bind 51:17 rest))

122− (cell 51:9

122+ (tuple 51:23

123− (face 51:10 p (aura 51:12 @ta))

123+ (group 51:24

124− (face 51:16 q (aura 51:18 @))))

124+ (call 51:25 (wing 51:25 f) (wing 51:27 item)))

125− (mold 53:1 hair

125+ (group 51:33

126+ (call 51:34 (wing 51:34 turn) (wing 51:39 rest) (wing 51:44 f))))))))))))))

127+ (mold 53:1 dime

126 (cell 53:9

128 (cell 53:9

127− (face 53:10 p (aura 53:12 @ud))

129+ (face 53:10 p (aura 53:12 @ta))

128− (face 53:16 q (aura 53:18 @ud))))

130+ (face 53:16 q (aura 53:18 @))))

129− (mold 55:1 pint

131+ (mold 55:1 hair

130 (cell 55:9

132 (cell 55:9

131− (face 55:10 p

133+ (face 55:10 p (aura 55:12 @ud))

132− (cell 55:12

134+ (face 55:16 q (aura 55:18 @ud))))

133− (face 55:13 p (aura 55:15 @))

135+ (mold 57:1 pint

134− (face 55:17 q (aura 55:19 @))))

136+ (cell 57:9

135− (face 55:22 q

137+ (face 57:10 p

136− (cell 55:24

138+ (cell 57:12

137− (face 55:25 p (aura 55:27 @))

139+ (face 57:13 p (aura 57:15 @))

138− (face 55:29 q (aura 55:31 @))))))

140+ (face 57:17 q (aura 57:19 @))))

139− (mold 57:1 coin

141+ (face 57:22 q

140− (union 58:3

142+ (cell 57:24

141− (cell 58:3

143+ (face 57:25 p (aura 57:27 @))

142− (const 58:4 %$)

144+ (face 57:29 q (aura 57:31 @))))))

143− (face 58:7 p (ref 58:9 dime)))

145+ (mold 59:1 coin

144− (cell 59:3

146+ (union 60:3

145− (const 59:4 %blob)

146− (face 59:10 p (noun 59:12)))

147 (cell 60:3

148− (const 60:4 %many)

148+ (const 60:4 %$)

149− (face 60:10 p

149+ (face 60:7 p (ref 60:9 dime)))

150− (apply 60:12 list (ref 60:18 coin))))))

150+ (cell 61:3

151− (mold 62:1 pair

151+ (const 61:4 %blob)

152− (generic 62:9 A B

152+ (face 61:10 p (noun 61:12)))

153− (cell 62:18

153+ (cell 62:3

154− (face 62:19 p (tvar 62:21 A))

154+ (const 62:4 %many)

155− (face 62:23 q (tvar 62:25 B)))))

155+ (face 62:10 p

156− (mold 64:1 trel

156+ (apply 62:12 list (ref 62:18 coin))))))

157− (generic 64:9 A B C

157+ (mold 64:1 pair

158− (cell 64:20

158+ (generic 64:9 A B

159− (face 64:21 p (tvar 64:23 A))

159+ (cell 64:18

160− (face 64:25 q (tvar 64:27 B))

160+ (face 64:19 p (tvar 64:21 A))

161− (face 64:29 r (tvar 64:31 C)))))

161+ (face 64:23 q (tvar 64:25 B)))))

162− (mold 66:1 qual

162+ (mold 66:1 trel

163− (generic 66:9 A B C D

163+ (generic 66:9 A B C

164− (cell 66:22

164+ (cell 66:20

165− (face 66:23 p (tvar 66:25 A))

165+ (face 66:21 p (tvar 66:23 A))

166− (face 66:27 q (tvar 66:29 B))

166+ (face 66:25 q (tvar 66:27 B))

167− (face 66:31 r (tvar 66:33 C))

167+ (face 66:29 r (tvar 66:31 C)))))

168− (face 66:35 s (tvar 66:37 D)))))

168+ (mold 68:1 qual

169− (mold 68:1 cord (aura 68:9 @t))

169+ (generic 68:9 A B C D

170− (mold 70:1 knot (aura 70:9 @ta))

170+ (cell 68:22

171− (mold 72:1 tape

171+ (face 68:23 p (tvar 68:25 A))

172− (apply 72:9 list (aura 72:15 @tD)))

172+ (face 68:27 q (tvar 68:29 B))

173− (mold 74:1 path

173+ (face 68:31 r (tvar 68:33 C))

174− (apply 74:9 list (ref 74:15 knot)))

174+ (face 68:35 s (tvar 68:37 D)))))

175− (mold 76:1 tank

175+ (mold 70:1 cord (aura 70:9 @t))

176− (union 77:3

176+ (mold 72:1 knot (aura 72:9 @ta))

177− (ref 77:3 cord)

177+ (mold 74:1 tape

178− (cell 78:3

178+ (apply 74:9 list (aura 74:15 @tD)))

179− (const 78:4 %leaf)

179+ (mold 76:1 path

180− (face 78:10 p (ref 78:12 tape)))

180+ (apply 76:9 list (ref 76:15 knot)))

181− (cell 79:3

181+ (mold 78:1 tank

182− (const 79:4 %palm)

182+ (union 79:3

183− (face 79:10 p

183+ (ref 79:3 cord)

184− (apply 79:12 qual (ref 79:18 tape) (ref 79:23 tape) (ref 79:28 tape) (ref 79:33 tape)))

185− (face 79:39 q

186− (apply 79:41 list (ref 79:47 tank))))

187 (cell 80:3

184 (cell 80:3

188− (const 80:4 %rose)

185+ (const 80:4 %leaf)

189− (face 80:10 p

186+ (face 80:10 p (ref 80:12 tape)))

190− (apply 80:12 trel (ref 80:18 tape) (ref 80:23 tape) (ref 80:28 tape)))

187+ (cell 81:3

191− (face 80:34 q

188+ (const 81:4 %palm)

192− (apply 80:36 list (ref 80:42 tank))))))

189+ (face 81:10 p

193− (mold 82:1 nail

190+ (apply 81:12 qual (ref 81:18 tape) (ref 81:23 tape) (ref 81:28 tape) (ref 81:33 tape)))

194− (cell 82:9

191+ (face 81:39 q

195− (face 82:10 p (ref 82:12 hair))

192+ (apply 81:41 list (ref 81:47 tank))))

196− (face 82:17 q (ref 82:19 tape))))

193+ (cell 82:3

197− (mold 84:1 edge

194+ (const 82:4 %rose)

195+ (face 82:10 p

196+ (apply 82:12 trel (ref 82:18 tape) (ref 82:23 tape) (ref 82:28 tape)))

197+ (face 82:34 q

198+ (apply 82:36 list (ref 82:42 tank))))))

199+ (mold 84:1 nail

198 (cell 84:9

200 (cell 84:9

199 (face 84:10 p (ref 84:12 hair))

201 (face 84:10 p (ref 84:12 hair))

200− (face 84:17 q

202+ (face 84:17 q (ref 84:19 tape))))

201− (apply 84:19 unit

203+ (mold 86:1 edge

202− (cell 84:25

204+ (cell 86:9

203− (face 84:26 p (noun 84:28))

205+ (face 86:10 p (ref 86:12 hair))

204− (face 84:30 q (ref 84:32 nail)))))))

206+ (face 86:17 q

205− (mold 86:1 rule

207+ (apply 86:19 unit

206− (fn 86:9 (ref 86:12 nail) (ref 86:17 edge)))

208+ (cell 86:25

207− (mold 88:1 spot

209+ (face 86:26 p (noun 86:28))

208− (cell 88:9

210+ (face 86:30 q (ref 86:32 nail)))))))

209− (face 88:10 p (ref 88:12 path))

211+ (mold 88:1 rule

210− (face 88:17 q (ref 88:19 pint))))

212+ (fn 88:9 (ref 88:12 nail) (ref 88:17 edge)))

211− (mold 90:1 toon

213+ (mold 90:1 spot

212− (union 91:3

214+ (cell 90:9

213− (cell 91:3

215+ (face 90:10 p (ref 90:12 path))

214− (const 91:4 %0)

216+ (face 90:17 q (ref 90:19 pint))))

215− (face 91:7 p (noun 91:9)))

217+ (mold 92:1 toon

216− (cell 92:3

218+ (union 93:3

217− (const 92:4 %1)

218− (face 92:7 p (noun 92:9)))

219 (cell 93:3

220− (const 93:4 %2)

220+ (const 93:4 %0)

221− (face 93:7 p

221+ (face 93:7 p (noun 93:9)))

222− (apply 93:9 list (ref 93:15 tank))))))

222+ (cell 94:3

223− (mold 95:1 like

223+ (const 94:4 %1)

224− (generic 95:9 A

224+ (face 94:7 p (noun 94:9)))

225− (cell 95:16

225+ (cell 95:3

226− (face 95:17 p (ref 95:19 hair))

226+ (const 95:4 %2)

227− (face 95:24 q

227+ (face 95:7 p

228− (apply 95:26 unit

228+ (apply 95:9 list (ref 95:15 tank))))))

229− (cell 95:32

229+ (mold 97:1 like

230− (face 95:33 p (tvar 95:35 A))

230+ (generic 97:9 A

231− (face 95:37 q (ref 95:39 nail))))))))

231+ (cell 97:16

232− (value 97:1 wonk

232+ (face 97:17 p (ref 97:19 hair))

233− (gate 97:9

233+ (face 97:24 q

234− (face 97:12 veq

234+ (apply 97:26 unit

235− (apply 97:16 like (tvar 97:22 A)))

235+ (cell 97:32

236− (body 98:3

236+ (face 97:33 p (tvar 97:35 A))

237− (branch 98:3

237+ (face 97:37 q (ref 97:39 nail))))))))

238− (wing 98:6 q.veq)

238+ (value 99:1 like

239− (arm 99:5 (lit 99:5 ~) (crash 99:7))

239+ (gate 99:9

240− (arm 100:5

240+ (cell 99:12

241− (cell 100:5 (lit 100:6 ~) (bind 100:8 product))

241+ (face 99:13 f

242− (wing 100:17 p.product))))))

242+ (fn 99:15 (tvar 99:18 A) (tvar 99:20 B)))

243− (mold 102:1 lone

243+ (face 99:23 result

244− (generic 102:9 A

244+ (apply 99:30 like (tvar 99:36 A))))

245− (cell 102:16

245+ (body 100:3

246− (face 102:17 p (tvar 102:19 A)))))

246+ (value 100:3 mapped

247− (mold 104:1 lest

247+ (body 101:5

248− (generic 104:9 A

248+ (cast 101:5

249− (cell 104:16

249+ (apply 101:8 unit

250− (face 104:17 i (tvar 104:19 A))

250+ (cell 101:14

251− (face 104:21 t

251+ (face 101:15 p (tvar 101:17 B))

252− (apply 104:23 list (tvar 104:29 A))))))

252+ (face 101:19 q (ref 101:21 nail))))

253− (mold 106:1 pole

253+ (body 102:7

254− (generic 106:9 A

254+ (branch 102:7

255− (union 107:3

255+ (wing 102:10 q.result)

256− (const 107:3 ~)

256+ (arm 103:9 (lit 103:9 ~) (lit 103:11 ~))

257− (cell 108:3

257+ (arm 104:9

258− (tvar 108:4 A)

258+ (cell 104:9 (lit 104:10 ~) (bind 104:12 value))

259− (apply 108:6 pole (tvar 108:12 A))))))

259+ (unit 104:19

260− (mold 110:1 quip

260+ (tuple 104:20

261− (generic 110:9 A B

261+ (face 104:21 p

262− (cell 110:18

262+ (group 104:23

263− (apply 110:19 list (tvar 110:25 A))

263+ (call 104:24 (wing 104:24 f) (wing 104:26 p.value))))

264− (tvar 110:28 B))))

264+ (face 104:35 q (wing 104:37 q.value))))))))))

265− (mold 112:1 tree

265+ (cast 105:3

266+ (apply 105:6 like (tvar 105:12 B))

267+ (tuple 105:15

268+ (face 105:16 p (wing 105:18 p.result))

269+ (face 105:27 q (wing 105:29 mapped)))))))

270+ (value 107:1 wonk

271+ (gate 107:9

272+ (face 107:12 veq

273+ (apply 107:16 like (tvar 107:22 A)))

274+ (body 108:3

275+ (branch 108:3

276+ (wing 108:6 q.veq)

277+ (arm 109:5 (lit 109:5 ~) (crash 109:7))

278+ (arm 110:5

279+ (cell 110:5 (lit 110:6 ~) (bind 110:8 product))

280+ (wing 110:17 p.product))))))

281+ (mold 112:1 lone

266 (generic 112:9 A

282 (generic 112:9 A

267− (union 113:3

283+ (cell 112:16

268− (const 113:3 ~)

284+ (face 112:17 p (tvar 112:19 A)))))

269− (cell 114:3

285+ (mold 114:1 lest

270− (face 114:4 n (tvar 114:6 A))

286+ (generic 114:9 A

271− (face 114:8 l

287+ (cell 114:16

272− (apply 114:10 tree (tvar 114:16 A)))

288+ (face 114:17 i (tvar 114:19 A))

273− (face 114:19 r

289+ (face 114:21 t

274− (apply 114:21 tree (tvar 114:27 A)))))))

290+ (apply 114:23 list (tvar 114:29 A))))))

275− (mold 116:1 each

291+ (mold 116:1 pole

276− (generic 116:9 A B

292+ (generic 116:9 A

277 (union 117:3

293 (union 117:3

278− (cell 117:3

294+ (const 117:3 ~)

279− (const 117:4 %|)

280− (face 117:7 p (tvar 117:9 B)))

281 (cell 118:3

295 (cell 118:3

282− (const 118:4 %&)

296+ (tvar 118:4 A)

283− (face 118:7 p (tvar 118:9 A))))))

297+ (apply 118:6 pole (tvar 118:12 A))))))

284− (mold 120:1 bloq (aura 120:9 @))

298+ (mold 120:1 quip

285− (value 122:1 some

299+ (generic 120:9 A B

286− (gate 122:9

300+ (cell 120:18

287− (face 122:12 item (tvar 122:17 A))

301+ (apply 120:19 list (tvar 120:25 A))

288− (unit 122:19 (wing 122:20 item))))

302+ (tvar 120:28 B))))

289− (value 124:1 lure

303+ (mold 122:1 tree

290− (gate 124:9

304+ (generic 122:9 A

291− (face 124:12 item (tvar 124:17 A))

305+ (union 123:3

292− (body 125:3

306+ (const 123:3 ~)

293− (cast 125:3

307+ (cell 124:3

294− (apply 125:6 list (tvar 125:12 A))

308+ (face 124:4 n (tvar 124:6 A))

295− (tuple 125:15 (wing 125:16 item) (lit 125:21 ~))))))

309+ (face 124:8 l

296− (value 127:1 snoc

310+ (apply 124:10 tree (tvar 124:16 A)))

297− (gate 127:9

311+ (face 124:19 r

298− (face 127:12 args

312+ (apply 124:21 tree (tvar 124:27 A)))))))

299− (cell 127:17

313+ (mold 126:1 each

300− (apply 127:18 list (tvar 127:24 A))

314+ (generic 126:9 A B

301− (tvar 127:27 A)))

315+ (union 127:3

302− (body 128:3

316+ (cell 127:3

303− (branch 128:3

317+ (const 127:4 %|)

304− (wing 128:6 args)

318+ (face 127:7 p (tvar 127:9 B)))

305− (arm 129:5

319+ (cell 128:3

306− (cell 129:5 (bind 129:6 xs) (bind 129:9 item))

320+ (const 128:4 %&)

307− (group 129:15

321+ (face 128:7 p (tvar 128:9 A))))))

308− (call 129:16

322+ (mold 130:1 bloq (aura 130:9 @))

309− (wing 129:16 weld)

323+ (value 132:1 some

310− (wing 129:21 xs)

324+ (gate 132:9

311− (tuple 129:24 (wing 129:25 item) (lit 129:30 ~)))))))))

325+ (face 132:12 item (tvar 132:17 A))

312− (value 131:1 flop

326+ (unit 132:19 (wing 132:20 item))))

313− (gate 131:9

327+ (value 134:1 lure

314− (face 131:12 xs

328+ (gate 134:9

315− (apply 131:15 list (tvar 131:21 A)))

329+ (face 134:12 item (tvar 134:17 A))

316− (body 132:3

330+ (body 135:3

317− (value 132:3 reverse-into

331+ (cast 135:3

318− (gate 132:19

332+ (apply 135:6 list (tvar 135:12 A))

319− (face 132:22 args

333+ (tuple 135:15 (wing 135:16 item) (lit 135:21 ~))))))

320− (cell 132:27

334+ (value 137:1 snoc

321− (apply 132:28 list (tvar 132:34 A))

335+ (gate 137:9

322− (apply 132:37 list (tvar 132:43 A))))

336+ (face 137:12 args

323− (body 133:5

337+ (cell 137:17

324− (branch 133:5

338+ (apply 137:18 list (tvar 137:24 A))

325− (wing 133:8 args)

339+ (tvar 137:27 A)))

326− (arm 134:7

340+ (body 138:3

327− (cell 134:7 (bind 134:8 rest) (bind 134:13 acc))

341+ (branch 138:3

328− (body 135:9

342+ (wing 138:6 args)

329− (branch 135:9

343+ (arm 139:5

330− (wing 135:12 rest)

344+ (cell 139:5 (bind 139:6 xs) (bind 139:9 item))

331− (arm 136:11 (lit 136:11 ~) (wing 136:13 acc))

345+ (group 139:15

332− (arm 137:11

346+ (call 139:16

333− (cell 137:11 (bind 137:12 item) (bind 137:17 more))

347+ (wing 139:16 weld)

334− (group 137:23

348+ (wing 139:21 xs)

335− (call 137:24

349+ (tuple 139:24 (wing 139:25 item) (lit 139:30 ~)))))))))

336− (wing 137:24 reverse-into)

350+ (value 141:1 flop

337− (wing 137:37 more)

351+ (gate 141:9

338− (tuple 137:42 (wing 137:43 item) (wing 137:48 acc))))))))))))

352+ (face 141:12 xs

339− (group 138:3

353+ (apply 141:15 list (tvar 141:21 A)))

340− (call 138:4 (wing 138:4 reverse-into) (wing 138:17 xs) (lit 138:20 ~)))))))

354+ (body 142:3

355+ (value 142:3 reverse-into

356+ (gate 142:19

357+ (face 142:22 args

358+ (cell 142:27

359+ (apply 142:28 list (tvar 142:34 A))

360+ (apply 142:37 list (tvar 142:43 A))))

361+ (body 143:5

362+ (branch 143:5

363+ (wing 143:8 args)

364+ (arm 144:7

365+ (cell 144:7 (bind 144:8 rest) (bind 144:13 acc))

366+ (body 145:9

367+ (branch 145:9

368+ (wing 145:12 rest)

369+ (arm 146:11 (lit 146:11 ~) (wing 146:13 acc))

370+ (arm 147:11

371+ (cell 147:11 (bind 147:12 item) (bind 147:17 more))

372+ (group 147:23

373+ (call 147:24

374+ (wing 147:24 reverse-into)

375+ (wing 147:37 more)

376+ (tuple 147:42 (wing 147:43 item) (wing 147:48 acc))))))))))))

377+ (group 148:3

378+ (call 148:4 (wing 148:4 reverse-into) (wing 148:17 xs) (lit 148:20 ~)))))))

tests/golden/prelude-list-helpers/types.txt+4−3

@@ -5,8 +5,8 @@ partial inference; module not checked

5++ not: $-(? ?)

6+$ list: cases proven disjoint; mold not checked

7+$ unit: cases proven disjoint; mold not checked

8−++ fall: sample mold is not supported by partial inference

8+++ fall: $-([(unit A) A] A)

9−++ need: sample mold is not supported by partial inference

9+++ need: $-((unit A) A)

10++ weld: sample mold is not supported by partial inference

11++ turn: sample mold is not supported by partial inference

12+$ dime: not checked

@@ -27,6 +27,7 @@ partial inference; module not checked

27+$ spot: not checked

28+$ toon: cases proven disjoint; mold not checked

29+$ like: not checked

30+++ like: sample mold is not supported by partial inference

30++ wonk: sample mold is not supported by partial inference

31++ wonk: sample mold is not supported by partial inference

31+$ lone: not checked

32+$ lone: not checked

32+$ lest: not checked

33+$ lest: not checked

@@ -35,7 +36,7 @@ partial inference; module not checked

35+$ tree: cases proven disjoint; mold not checked

36+$ tree: cases proven disjoint; mold not checked

36+$ each: cases proven disjoint; mold not checked

37+$ each: cases proven disjoint; mold not checked

37+$ bloq: not checked

38+$ bloq: not checked

38−++ some: expression is not supported by partial inference

39+++ some: unit construction needs the standard prelude in partial inference

39++ lure: cast mold is not supported by partial inference

40++ lure: cast mold is not supported by partial inference

40++ snoc: sample mold is not supported by partial inference

41++ snoc: sample mold is not supported by partial inference

41++ flop: sample mold is not supported by partial inference

42++ flop: sample mold is not supported by partial inference

tests/golden/prelude-list-unit/source.jibb+8−6

@@ -37,13 +37,15 @@

37++ weld |= args=[(list A) (list A)]

38 ?- args

39 [xs ys]

40− ?- xs

40+ ^- (list A)

41− ~ ys

41+ ?- xs

42− [item rest] [item (weld rest ys)]

42+ ~ ys

43+ [item rest] [item (weld rest ys)]

44++ turn |= args=[(list A) $-(A B)]

45++ turn |= args=[(list A) $-(A B)]

45 ?- args

46 ?- args

46 [xs f]

47 [xs f]

47− ?- xs

48+ ^- (list B)

48− ~ ~

49+ ?- xs

49− [item rest] [(f item) (turn rest f)]

50+ ~ ~

51+ [item rest] [(f item) (turn rest f)]

tests/golden/prelude-list-unit/tokens.txt+86−72

@@ -190,76 +190,90 @@

19039:9 name ys

19139:11 tight glyph ]

19240:7 INDENT

193−40:7 glyph ?-

193+40:7 glyph ^-

194−40:10 name xs

194+40:10 glyph (

195+40:11 tight name list

196+40:16 tvar A

197+40:17 tight glyph )

19541:9 INDENT

19841:9 INDENT

196−41:9 lit ~

199+41:9 glyph ?-

197−41:11 name ys

200+41:12 name xs

198−42:9 NEWLINE

201+42:11 INDENT

199−42:9 glyph [

202+42:11 lit ~

200−42:10 tight name item

203+42:13 name ys

201−42:15 name rest

204+43:11 NEWLINE

202−42:19 tight glyph ]

205+43:11 glyph [

203−42:21 glyph [

206+43:12 tight name item

204−42:22 tight name item

207+43:17 name rest

205−42:27 glyph (

208+43:21 tight glyph ]

206−42:28 tight name weld

209+43:23 glyph [

207−42:33 name rest

210+43:24 tight name item

208−42:38 name ys

211+43:29 glyph (

209−42:40 tight glyph )

212+43:30 tight name weld

210−42:41 tight glyph ]

213+43:35 name rest

211−44:1 DEDENT

214+43:40 name ys

212−44:1 DEDENT

215+43:42 tight glyph )

213−44:1 DEDENT

216+43:43 tight glyph ]

214−44:1 DEDENT

217+45:1 DEDENT

215−44:1 NEWLINE

218+45:1 DEDENT

216−44:1 glyph ++

219+45:1 DEDENT

217−44:4 name turn

220+45:1 DEDENT

218−44:9 glyph |=

221+45:1 DEDENT

219−44:12 name args

222+45:1 NEWLINE

220−44:16 tight glyph =

223+45:1 glyph ++

221−44:17 tight glyph [

224+45:4 name turn

222−44:18 tight glyph (

225+45:9 glyph |=

223−44:19 tight name list

226+45:12 name args

224−44:24 tvar A

227+45:16 tight glyph =

225−44:25 tight glyph )

228+45:17 tight glyph [

226−44:27 glyph $-(

229+45:18 tight glyph (

227−44:30 tight tvar A

230+45:19 tight name list

228−44:32 tvar B

231+45:24 tvar A

229−44:33 tight glyph )

232+45:25 tight glyph )

230−44:34 tight glyph ]

233+45:27 glyph $-(

231−45:3 INDENT

234+45:30 tight tvar A

232−45:3 glyph ?-

235+45:32 tvar B

233−45:6 name args

236+45:33 tight glyph )

234−46:5 INDENT

237+45:34 tight glyph ]

235−46:5 glyph [

238+46:3 INDENT

236−46:6 tight name xs

239+46:3 glyph ?-

237−46:9 name f

240+46:6 name args

238−46:10 tight glyph ]

241+47:5 INDENT

239−47:7 INDENT

242+47:5 glyph [

240−47:7 glyph ?-

243+47:6 tight name xs

241−47:10 name xs

244+47:9 name f

242−48:9 INDENT

245+47:10 tight glyph ]

243−48:9 lit ~

246+48:7 INDENT

244−48:11 lit ~

247+48:7 glyph ^-

245−49:9 NEWLINE

248+48:10 glyph (

246−49:9 glyph [

249+48:11 tight name list

247−49:10 tight name item

250+48:16 tvar B

248−49:15 name rest

251+48:17 tight glyph )

249−49:19 tight glyph ]

252+49:9 INDENT

250−49:21 glyph [

253+49:9 glyph ?-

251−49:22 tight glyph (

254+49:12 name xs

252−49:23 tight name f

255+50:11 INDENT

253−49:25 name item

256+50:11 lit ~

254−49:29 tight glyph )

257+50:13 lit ~

255−49:31 glyph (

258+51:11 NEWLINE

256−49:32 tight name turn

259+51:11 glyph [

257−49:37 name rest

260+51:12 tight name item

258−49:42 name f

261+51:17 name rest

259−49:43 tight glyph )

262+51:21 tight glyph ]

260−49:44 tight glyph ]

263+51:23 glyph [

261−49:45 DEDENT

264+51:24 tight glyph (

262−49:45 DEDENT

265+51:25 tight name f

263−49:45 DEDENT

266+51:27 name item

264−49:45 DEDENT

267+51:31 tight glyph )

265−49:45 NEWLINE

268+51:33 glyph (

269+51:34 tight name turn

270+51:39 name rest

271+51:44 name f

272+51:45 tight glyph )

273+51:46 tight glyph ]

274+51:47 DEDENT

275+51:47 DEDENT

276+51:47 DEDENT

277+51:47 DEDENT

278+51:47 DEDENT

279+51:47 NEWLINE

tests/golden/prelude-list-unit/tree.txt+37−31

@@ -87,34 +87,40 @@

87 (arm 39:5

88 (cell 39:5 (bind 39:6 xs) (bind 39:9 ys))

89 (body 40:7

90− (branch 40:7

90+ (cast 40:7

91− (wing 40:10 xs)

91+ (apply 40:10 list (tvar 40:16 A))

92− (arm 41:9 (lit 41:9 ~) (wing 41:11 ys))

92+ (body 41:9

93− (arm 42:9

93+ (branch 41:9

94− (cell 42:9 (bind 42:10 item) (bind 42:15 rest))

94+ (wing 41:12 xs)

95− (tuple 42:21

95+ (arm 42:11 (lit 42:11 ~) (wing 42:13 ys))

96− (wing 42:22 item)

96+ (arm 43:11

97− (group 42:27

97+ (cell 43:11 (bind 43:12 item) (bind 43:17 rest))

98− (call 42:28 (wing 42:28 weld) (wing 42:33 rest) (wing 42:38 ys))))))))))))

98+ (tuple 43:23

99− (value 44:1 turn

99+ (wing 43:24 item)

100− (gate 44:9

100+ (group 43:29

101− (face 44:12 args

101+ (call 43:30 (wing 43:30 weld) (wing 43:35 rest) (wing 43:40 ys))))))))))))))

102− (cell 44:17

102+ (value 45:1 turn

103− (apply 44:18 list (tvar 44:24 A))

103+ (gate 45:9

104− (fn 44:27 (tvar 44:30 A) (tvar 44:32 B))))

104+ (face 45:12 args

105− (body 45:3

105+ (cell 45:17

106− (branch 45:3

106+ (apply 45:18 list (tvar 45:24 A))

107− (wing 45:6 args)

107+ (fn 45:27 (tvar 45:30 A) (tvar 45:32 B))))

108− (arm 46:5

108+ (body 46:3

109− (cell 46:5 (bind 46:6 xs) (bind 46:9 f))

109+ (branch 46:3

110− (body 47:7

110+ (wing 46:6 args)

111− (branch 47:7

111+ (arm 47:5

112− (wing 47:10 xs)

112+ (cell 47:5 (bind 47:6 xs) (bind 47:9 f))

113− (arm 48:9 (lit 48:9 ~) (lit 48:11 ~))

113+ (body 48:7

114− (arm 49:9

114+ (cast 48:7

115− (cell 49:9 (bind 49:10 item) (bind 49:15 rest))

115+ (apply 48:10 list (tvar 48:16 B))

116− (tuple 49:21

116+ (body 49:9

117− (group 49:22

117+ (branch 49:9

118− (call 49:23 (wing 49:23 f) (wing 49:25 item)))

118+ (wing 49:12 xs)

119− (group 49:31

119+ (arm 50:11 (lit 50:11 ~) (lit 50:13 ~))

120− (call 49:32 (wing 49:32 turn) (wing 49:37 rest) (wing 49:42 f)))))))))))))

120+ (arm 51:11

121+ (cell 51:11 (bind 51:12 item) (bind 51:17 rest))

122+ (tuple 51:23

123+ (group 51:24

124+ (call 51:25 (wing 51:25 f) (wing 51:27 item)))

125+ (group 51:33

126+ (call 51:34 (wing 51:34 turn) (wing 51:39 rest) (wing 51:44 f)))))))))))))))

tests/golden/prelude-list-unit/types.txt+2−2

@@ -5,7 +5,7 @@ partial inference; module not checked

5++ not: $-(? ?)

6+$ list: cases proven disjoint; mold not checked

7+$ unit: cases proven disjoint; mold not checked

8−++ fall: sample mold is not supported by partial inference

8+++ fall: $-([(unit A) A] A)

9−++ need: sample mold is not supported by partial inference

9+++ need: $-((unit A) A)

10++ weld: sample mold is not supported by partial inference

11++ turn: sample mold is not supported by partial inference

tests/golden/prelude-unit-list-transforms/about.txt+2−2

@@ -1,4 +1,4 @@

1−source: Overview, Prelude: "The exported inventory includes all names from the Hoon library sections listed below, excluding the groups explicitly left out"; Hoon 2a includes `drop`, `bind` and `biff`, and 2b includes `skim` and `skip`.

1+source: Overview, Prelude: "The exported inventory includes all names from the Hoon library sections listed below, excluding the groups explicitly left out"; Hoon 2a includes `drop`, `bind`, `biff`, `flit`, `both`, `clap` and `clef`, and 2b includes `join`, `murn`, `rear`, `snip`, `skim`, `skip`, `levy`, `lien`, `roll` and `reel`. Folds take an explicit start.

2−tests: The complete current prelude parses, including unit-to-list conversion, unit mapping and flat mapping, and the complementary list filters. Both filters retain the order of their selected items.

2+tests: The complete current prelude parses, including unit-to-list conversion, unit mapping and flat mapping, a curried unit-producing filter, three ways to combine units, including `clap` with one shared value type, complementary list filters, present-product mapping, joining, last-item operations, all/any predicates, and left and right folds. The filters retain the order of their selected items. It also includes the source-backed `ask` re-export and `pure` gate.

3expect: parses

4expect-types: a partial inference report, not a checked module; unit and list gate typing is not complete

tests/golden/prelude-unit-list-transforms/source.jibb+186−24