a140383...master · jibb

git.iko.soy/jibb

931 files changed+47298−4170

since splitsnapshots

unifiedsplit

README.md+1−1

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

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

4343```

4444

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` and `tools/type-mark-test` check the importer/checker bridges under eval; the ship suite runs the same fixtures.

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-generic-recursion-test`, `tools/type-generic-construction-test`, `tools/type-generic-pattern-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.

4646

4747### The doc's examples

4848

docs/compiler.md+65−13

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

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

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

5858

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 two-binder cell pattern, 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. Local mutual groups, polymorphic recursion, value cycles, 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. A null-headed cell can match a union case but does not supply a `|=%$` constructor; 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. A generic union declared directly inside a body remains unsupported, as do mutually recursive local groups and recursive molds. 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. 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.

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.

60+

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 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.

6070

6171String 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.

6272

63−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. Existing tags whose shape or payload does not fit retain the ordinary mismatch; unresolved tags stay pending.

73+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.

74+

75+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.

6476

65−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. The cart-store example’s `init` and `update` infer in this fragment; store kind and declaration checking remain unfinished.

77+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.

6678

6779For 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.

6880

6981Multi-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.

7082

71−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. A known gate sample also 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. Faced or longer cells, uncontextualized construction, 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.

83+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.

84+

85+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.

7286

73−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` 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.

87+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.

7488

7589A 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.

7690

77−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; contextual union-pattern branches also remain unsupported. The Grammar’s `step` block infers in this fragment, but its module is not yet checked.

91+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.

7892

7993A 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.

8094

81−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 mark door sample, removing its outer sample face and validating its build subject. The reader checks explicit Hoon `$%`, `$?` and `$^` unions against the Grammar’s disjointness rule, as @iko confirmed on 2026-10-30. 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, 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/clay-fixtures` also passes Clay-built `/sur` molds and mark samples through the Clay-built importer and partial checker.

95+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.

96+

97+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. Two-arm matches over explicit source tags and flat binder or wildcard fields use that same one-layer view and existing binder, coverage and branch checks; a single-arm match on a direct in-scope wing can report its missing case. 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, catch-all and nested patterns, 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.

98+

99+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.

100+

101+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.

102+

103+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.

104+

105+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.

106+

107+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.

82108

83−Self-recursive `/sur` molds can cross the bridge as opaque module-and-name identities when their supported source-aware graph passes validation. Aliases, foreign references, recursive marks, unfolding, construction and field access remain unsupported; the partial printer declines recursive names that are not in scope.

109+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.

84110

85−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` aura and core 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 or core 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.

111+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.

86112

87−`+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.

113+`+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.

88114

89−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`, `same`, `fall`, `need`, `lure`, `weld`, `snoc` and `turn`; unsupported entries, such as most list helpers, 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. List-dependent prelude mold aliases remain unsupported because their templates are prepared before this injection. 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. Prelude imports, including the planned private internal module, are not supported by preparation. 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.

115+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.

90116

91−`+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, duplicate-name or import-bearing prelude sources fail closed. `+golden-types-with-prelude` remains the source-taking wrapper. 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.

117+`+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.

118+

119+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.

120+

121+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.

122+

123+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.

124+

125+`+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.

126+

127+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.

128+

129+`+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.

130+

131+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` and `curr`; 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 and arithmetic schemes for the Jibb-written `gth`, `add` and `dec` 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. 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.

132+

133+`+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.

92134

93135And the design notes:

94136

@@ -99,16 +141,26 @@ And the design notes:

99141| 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 |

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

101143

144+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.

145+

146+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.

147+

148+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.

149+

150+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.

151+

102152## The tree

103153

104154Every 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:

105155

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

107157- **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.

108−- **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.

158+- **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.

109159- **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`.

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

111161

162+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.

163+

112164The 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.

113165

114166## Positions and errors

docs/development.md+63−3

@@ -60,9 +60,37 @@ git clone https://github.com/urbit/tools /root/src/tools

6060| --- | --- |

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

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

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

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

65+| `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 |

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

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

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

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

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

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

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

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

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

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

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

77+| `tools/type-generic-pattern-test` | Checks source-backed recursive patterns, coverage and fuel under eval and on the ship |

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

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

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

81+| `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 |

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

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

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

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

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

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

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

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

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

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

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

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

6694| `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 |

6795| `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 |

6896| `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 |

@@ -70,6 +98,7 @@ git clone https://github.com/urbit/tools /root/src/tools

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

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

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

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

73102

74103`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.

75104

@@ -78,21 +107,52 @@ git clone https://github.com/urbit/tools /root/src/tools

78107```

79108tools/golden # all cases pass

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

86145tools/testdata/selftest # 22 checks, 0 failed

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

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

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

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

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

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

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

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

93153```

94154

95−`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 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-module-scope.hoon` and `tools/type-module-scope-test` compare the prelude scope report on the ship and under eval.

155+`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.

96156

97157## Golden cases

98158

@@ -106,7 +166,7 @@ A case is a folder `tests/golden/<name>/` holding:

106166- 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.

107167- 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.

108168

109−The runners prepare the trusted vendored prelude once for their generated test core and share its partial interface. Preparation reserves all names present in that source and supplies the molds and values the fragment can infer; an unsupported declaration remains reserved but unavailable. The source and the 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` accepts source directly; callers using `+golden-types-with-prepared-prelude` must pass the unchanged result of `+prepare-prelude`. Missing, malformed or conflicting source fails closed, and prelude imports are not supported yet.

169+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.

110170

111171A 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.

112172

docs/open-questions.md+23−3

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

1818

1919## Questions milestone 2 raises

2020

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. Questions 3, 18 and 24 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.

2222

23231. **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.

24242. **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.

@@ -37,14 +37,34 @@ Found while writing [prompts/milestone-2.md](prompts/milestone-2.md), checking i

373715. **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`.

383816. **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.

393917. **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.

414119. **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.

424220. **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.

434321. **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.

444422. **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.

454523. **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.

4646

47−24. **How the internal prelude provides opaque types.** The public prelude needs an opaque `poke` type, but Jibb has no syntax to declare an opaque type in its private internal module. Should the internal module instead be a compiler-provided private interface that the prelude imports and re-exports, or should Jibb gain syntax for private opaque declarations? @iko has been asked; the answer is pending. The separate internal module and private primitives were already agreed in questions 2 and 14.

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.

4868

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

5070

docs/prelude-inventory.md+14−6

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

55The 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+

711Hoon `+$` 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.

812

913## 1a

1014

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

1216

17+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.

18+

1319## 1c

1420

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

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

2026

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

2228

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

29+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. `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.

2430

2531| Name | Hoon behavior | Jibb status |

2632| --- | --- | --- |

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

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

29−| `bond` | Calls a fallback trap for an absent unit, otherwise returns its value. | Missing |

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

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

3137| `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 |

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

33−| `drop` | Converts an absent unit to an empty list and a present unit to a singleton. | Written |

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

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

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

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

@@ -43,7 +49,7 @@ The following is an audit of the Hoon 135 bodies, not a completed Jibb interface

4349

4450`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`.

4551

46−The current prelude writes `snoc`, `lure`, `flop`, `join`, `levy`, `lien`, `murn`, `rear`, `reel`, `roll`, `skim`, `skip`, `snip`, `turn` and `weld`. `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` and `turn` using the validated prelude `list` mold; most other list helpers remain unsupported by that fragment. Backend validation remains outstanding for all of them.

52+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. Backend validation remains outstanding for all of them.

4753

4854## 2c

4955

@@ -93,6 +99,8 @@ The current prelude writes `snoc`, `lure`, `flop`, `join`, `levy`, `lien`, `murn

9399

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

95101

102+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. The partial checker infers their polymorphic types. Their runtime implementations remain to be validated by a backend.

103+

96104## 2o

97105

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

@@ -115,7 +123,7 @@ Hoon 135's `3g` section has exactly 12 exports: ten `+$` molds (`coin`, `dime`,

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

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

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

118−| `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. |

126+| `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. |

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

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

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

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

144152 [%2 p=(list tank)]

145153```

146154

147−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.

155+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.

148156

149157## 4a

150158

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

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

4949

5050## First steps

5151

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. How that module supplies opaque types such as `poke` is still awaiting @iko’s answer: question 24 records the alternatives of a compiler-provided private interface or syntax for private opaque declarations.

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`.

5353

5454 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.

55552. **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,8 +59,9 @@ And from the plan's Risks:

5959The 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.

6060

6161**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.

6363- `@` 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`.

6465- 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.

6566- 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.

6667- 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`.

@@ -68,12 +69,13 @@ The rules are scattered across the tabs. This is a map of them, not a replacemen

6869- 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 ~)`.

6970- 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]`.

7071- `!!` 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−- `poke`, `ask` and `qath` are opaque, built only by derived gates, `pure` and application-path literals.

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.

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`.

7274- 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`.

7375

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

7577- 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."

7779- 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.

7880- "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.

7981- 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.

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

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

108110

109111**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.

111113- 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)`.

112114- 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.

113115

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

115117- 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: `clap` takes two units of one value type and a combining gate over that type; 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)`.

117119- 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".

118120- 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.

119121- 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."

120122

121123**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 `$%`, `$?` 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.

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.

123125- 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.

124126- "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.

125127- 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 *)

7171

7272## Lowering from Jibb

7373

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.

7575

7676| Jibb | Core language |

7777| --- | --- |

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

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

8383| `/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 |

8484| `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 |

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

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

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

docs/spec/decisions.md+11−5

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

2424| 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 |

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

2626| 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 |

2828| 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 |

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

3131| 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 |

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

3333| 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 |

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 |

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 |

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 |

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

3738| 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 |

3839| 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 |

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

4043| 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 |

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

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

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

4447| 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 |

4548| 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 |

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

4751| Defaults | None | Decided |

4852| 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

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

5256| 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 |

5357| 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 |

5459| 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 |

5560| Refinement types | None | Decided |

5661| 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

6772| 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 |

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

6974| 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 |

7176| 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 |

7277| 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 |

7378| 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 |

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

7782| 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 |

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

7984| 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 |

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

8187| 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 |

8288| 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+15−13

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

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

9292```

9393

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 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.

9595

9696## Modules

9797

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

102102- 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.

103103- `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.

104104- 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.

106106

107107Names the host reads, by file:

108108

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

118118

119119## Molds

120120

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.

122122

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.

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.

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 `?`.

124125- **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.

126127- **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.

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

128129- **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.

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

131132- **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`.

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

134136

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.

136138

137139## Tag resolution

138140

139141A 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".

140142

141143- 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.

143145- 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.

144146- 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)`.

145147- 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:

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

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

212214 [t %draft] t

213− [t %sent at] t

215+ [t %sent sent-at] t

214216 %stop "stop"

215217```

216218

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

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

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

262264

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

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

264266 | pathmold

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

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

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

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

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

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

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

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

273275

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

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

339341 button "Add" %add

340342```

341343

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+5−3

@@ -78,7 +78,7 @@ Unused molds are skipped, so unsupported constructs elsewhere in a `/sur` file a

7878

7979## Prelude

8080

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.

8282

8383| Group | Hoon | Jibb |

8484| --- | --- | --- |

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

9797| 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` |

9898| 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 |

9999

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+

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

101103

102104## The Elm architecture on Urbit

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

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

151153```

152154

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.

154156- 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.

156158- 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.

157159

158160Inputs 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+109−8

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

1919

2020## Milestone 2: in progress

2121

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, term singletons, 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 cross as opaque module-and-name identities; aliases, foreign references, recursive marks, unfolding and construction remain unsupported. The reader handles mark samples, recursive molds whose origins can be verified through Ford imports, nested collections, direct ordered maps, 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. 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, and detects missing sources and cycles. It does not yet check API or kind semantics, and 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. 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. Local mutual groups, polymorphic recursion, value cycles, 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. 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, some complex two-arm subjects and contextual union-pattern branches 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. 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. The cart-store example’s `init` and `update` now infer, while its kind, declarations and full module remain unchecked. 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` 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. Contextual null-headed cells fit their cases, but do not supply a `|=%$` constructor; 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. Uncontextualized list construction, 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; mutually recursive local groups and 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 newly agreed shared-type `clap`, parsed but still awaiting checker and backend validation, 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.

2323

24−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`, `lure`, `weld`, `snoc` and `turn`. 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. List-dependent prelude mold aliases remain unsupported because their templates are prepared before injection. 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. Preparation rejects empty, malformed, conflicting or import-bearing source; the prepared value is trusted and must come unchanged from `+prepare-prelude`. 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.

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 two explicit tags also work for these source-proven trees, as does a missing-case diagnostic for a supported single-arm match. 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+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 island watch checking remain unimplemented.

31+

32+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.

33+

34+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.

35+

36+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.

37+

38+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. It does not yet prove the provenance of request values or check island subscriptions. Prepared artifacts and reader results remain trusted host inputs.

39+

40+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.

41+

42+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.

43+

44+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.

45+

46+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.

47+

48+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.

49+

50+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.

51+

52+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.

53+

54+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.

55+

56+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.

57+

58+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.

59+

60+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.

2561

2662## Milestone 1: parser and mark

2763

@@ -39,9 +75,9 @@ What the plan asks for, and where it is:

3975

4076Besides the plan's list:

4177

42−- 539 golden cases: 323 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.

43−- The 539-case corpus passed under `urbit eval` in 63.0 s. The fake ship passed all 545 tests, including the importer, importer/checker and mark/checker bridges, module scope and unification checks, with 37.7 s for sync and 18.5 s for tests. The importer golden compares 149 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.

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

78+- 653 golden cases: 433 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.

79+- The 653-case corpus passed under `urbit eval` in 94.1 s while other checks were running. The fake ship passed all 690 tests, including the source-overlap, structural-overlap, generic-recursion, generic-construction and generic-pattern 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 80.9 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.

80+- `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.

4581- 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.

4682- 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).

4783

@@ -99,25 +135,90 @@ Besides the plan's list:

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

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

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

102−| This change | 2026-10-31 | Report missing union tags and infer prelude unit helpers |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

182+| c96597d | 2026-10-31 | Track source-proven generic recursive identities |

183+| 190a9d5 | 2026-10-31 | Add source-backed list flattening |

184+| d9d51e6 | 2026-10-31 | Check source-proven recursive tree construction |

185+| This change | 2026-10-31 | Match source-proven recursive tree cases |

103186

104187## Checking it

105188

106189On a machine set up as [development.md](development.md) says:

107190

108191```

109−tools/golden # 539 cases under urbit eval

192+tools/golden # 653 cases under urbit eval

110193tools/importer-test # the Hoon importer fixture projection

194+tools/type-import-default-test # default-wrapped source proof golden

111195tools/type-import-test # the importer/checker bridge fixture

196+tools/type-import-overlap-test # source-aware Hoon overlap and provenance fixture

197+tools/type-import-structural-test # structural overlap and multi-case source fixture

198+tools/type-tlon-test # the real Tlon reader/checker fixture

112199tools/type-mark-test # the mark/checker bridge fixture

200+tools/type-poke-test # the source-backed poke/API fixture

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

202+tools/type-api-paths-test # partial API path metadata fixture

203+tools/type-hole-guards-test # hole defaulting and API interface guards

204+tools/type-list-alias-test # prelude list-alias guards

205+tools/type-generic-alias-test # generic union alias guards

206+tools/type-generic-recursion-test # source-proven generic recursion guards

207+tools/type-generic-construction-test # source-proven recursive construction guards

208+tools/type-generic-pattern-test # source-proven recursive pattern guards

209+tools/type-positional-face-guards-test # positional sample face guards

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

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

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

113213tools/type-module-scope-test # module and prelude scope fixture

114214tools/hoon check-spans-test # prints <<>> when the span checker works

115215tools/testdata/selftest # the tools themselves

116216tools/doc-blocks docs/spec # the doc's examples are golden cases

117217tools/ship start

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

119−tools/ship test # the same 539 cases as -test arms on the ship

219+tools/ship test # the same 653 cases as -test arms on the ship

120220tools/testdata/ship-selftest

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

121222tools/ship check-commit # |commit stores .jibb files

122223tools/clay-fixtures # example /sur files and marks build through Clay

123224```

jibb-dev/lib/jibb-import.hoon+791−21

@@ -8,7 +8,8 @@

88:: Hoon's %hold nodes retain the generator's Hoon and its bound arguments.

99:: Comparing that Hoon to the standard generators identifies collections

1010:: 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.

1213::

1314:: A direct $^ is read from its original branches and accepted only when

1415:: their imported shapes prove disjoint. A single nested $^ in a

@@ -24,9 +25,10 @@

2425:: the other fields are fixed atoms or collections of static atoms;

2526:: other source shapes fail closed.

2627::

27−:: The checker has a small bridge for successful unfaced atom and cell

28−:: results; it rejects other importer shapes. Failures return %|; no

29−:: partial tree is returned as success.

28+:: The partial checker bridges supported nouns, atoms, cells, faces,

29+:: proven forks and collections, and keeps proven recursive roots nominal.

30+:: Unsupported shapes fail closed. Reader failures return %|; no partial

31+:: tree is returned as success.

3032::

3133|%

3234+$ imported

@@ -37,6 +39,7 @@

3739 [%cell head=imported tail=imported]

3840 [%face name=term body=imported]

3941 [%fork cases=(list imported)]

42+ [%named module=term name=term body=imported]

4043 [%apply name=term args=(list imported)]

4144 [%ref module=term name=term]

4245 [%bad reason=@t]

@@ -44,7 +47,7 @@

4447 ==

4548+$ import-diagnostic

4649 $% [%ok value=imported]

47− [%invalid code=?(%aura %core) message=@t]

50+ [%invalid code=?(%aura %core %overlap) message=@t]

4851 [%unsupported message=@t]

4952 ==

5053+$ signatures (list [name=term code=hoon])

@@ -76,6 +79,445 @@

7679 ^- (each imported @t)

7780 (read-with module name typ ~)

7881::

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+::

79521:: +read-mold-in: accept the /sur core as provenance. The core must be

80522:: built against zuse or validated Ford imports, and its selected arm

81523:: must be this type. Unknown subject shapes fail closed.

@@ -90,9 +532,15 @@

90532 [%| (crip "Hoon mold `{(trip name)}` is not declared")]

91533 ?. =(typ (~(play ut cor) (ream (cat 3 '*' name))))

92534 [%| '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']

93537 =/ result (read-with module name typ [~ cor])

94− ?. ?=([%& *] result) result

95− result

538+ ?: ?=([%& *] result) result

539+ =/ fallback=(each (unit (each imported @t)) tang)

540+ (mule |.((tagged-union-fallback module name cor)))

541+ ?: ?=(%| -.fallback) result

542+ ?~ p.fallback result

543+ u.p.fallback

96544::

97545:: +read-named is the source-aware entry point for callers that have

98546:: not selected a Hoon type yet. Check the core and the local arm

@@ -121,6 +569,41 @@

121569:: A mark door's payload is [sample build-subject]. Its outer sample

122570:: face names the door sample, not the imported mark type. Collection

123571:: 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+::

124607++ read-mark

125608 |= [name=term cor=type]

126609 ^- (each imported @t)

@@ -131,8 +614,12 @@

131614 =/ sample=type p.p.cor

132615 =/ raw=type ?:(?=([%face *] sample) q.sample sample)

133616 =/ result (read-with name name raw [~ q.p.cor])

134− ?. ?=([%& *] result) result

135− result

617+ ?: ?=([%& *] result) result

618+ =/ fallback=(each (unit (each imported @t)) tang)

619+ (mule |.((mark-union-fallback raw q.p.cor)))

620+ ?: ?=(%| -.fallback) result

621+ ?~ p.fallback result

622+ u.p.fallback

136623::

137624++ read-named-diagnostic

138625 |= [module=term name=term cor=type]

@@ -147,6 +634,8 @@

147634 [%unsupported p.result]

148635 =/ selected=(each type tang) (mule |.((~(play ut cor) (ream (cat 3 '*' name)))))

149636 ?. ?=(%& -.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']

150639 =/ again=(each imported tang) (mule |.((walk module p.selected catalog ~ [~ cor])))

151640 ?. ?=(%& -.again) [%unsupported p.result]

152641 =/ evidence=(unit import-diagnostic) (first-invalid p.again)

@@ -609,6 +1098,8 @@

6091098 ^- ?

6101099 ?: ?=([%face *] a) $(a body.a)

6111100 ?: ?=([%face *] b) $(b body.b)

1101+ ?: ?=([%named *] a) $(a body.a)

1102+ ?: ?=([%named *] b) $(b body.b)

6121103 ?: ?=([%fork *] a)

6131104 (levy cases.a |=(item=imported (disjoint item b)))

6141105 ?: ?=([%fork *] b)

@@ -663,6 +1154,32 @@

6631154 ?. (arm-map-valid +.chapter) ~

6641155 [~ (arm-map-has +.chapter target)]

6651156::

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+::

6661183++ chapter-unsafe

6671184 |= [chapter=* target=term]

6681185 ^- ?

@@ -705,17 +1222,46 @@

7051222 ?@ src |

7061223 |($(src -.src) $(src +.src))

7071224::

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+::

7081242++ mop-specs-raw

7091243 |= body=hoon

7101244 ^- (unit [key=spec value=spec])

1245+ =. body (mop-source-code body)

7111246 ?. ?=([%cncl *] body) ~

7121247 ?. ?=([%tsgr *] p.body) ~

713− =/ b=hoon q.p.body

1248+ =/ b=hoon (mop-source-code q.p.body)

7141249 ?. ?=([%cncl *] b) ~

715− ?. ?=([%cncl *] p.b) ~

716− ?. ?=([%wing *] p.p.b) ~

717− ?. =(p.p.p.b ~[%mop]) ~

718− =/ specs=(list spec) ;;((list spec) q.p.b)

1250+ =/ call=hoon (mop-source-code p.b)

1251+ ?. ?=([%cncl *] call) ~

1252+ =/ w=(unit term) (source-single-wing p.call)

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

1264+ =/ specs=(list spec) ;;((list spec) raw)

7191265 ?. ?=([* [* ~]] specs) ~

7201266 [~ [i.specs i.t.specs]]

7211267::

@@ -925,6 +1471,49 @@

9251471 ?~ args [%bad unsupported]

9261472 [%apply name.out u.args]

9271473::

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+::

9281517++ walk

9291518 |= [module=term typ=type sig=signatures seen=visiting context=(unit type)]

9301519 ^- imported

@@ -949,6 +1538,19 @@

9491538 [%fork (sort cases |=(pair=[imported imported] (dor -.pair +.pair)))]

9501539 [%hint *] $(typ q.typ)

9511540 [%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]

9521554 ?: &(?=([%tsls [%note * *] *] q.typ) |((has-spec-cell-union q.typ) (has-spec-general-union q.typ)))

9531555 =/ nm (hold-name q.typ)

9541556 (collection-union typ module sig [[typ nm] seen] context)

@@ -965,12 +1567,6 @@

9651567 =/ second=type (~(play ut p.typ) (ream '*value'))

9661568 [%apply name ~[first-import $(typ second)]]

9671569 [%apply name ~[first-import]]

968− =/ prior=(unit (unit term)) (find-seen typ seen)

969− ?^ prior

970− ?~ u.prior [%bad 'an anonymous recursive Hoon mold cannot be named']

971− =/ origin (ref-origin module u.u.prior typ context)

972− ?~ origin [%bad 'a recursive Hoon mold needs unambiguous source provenance']

973− [%ref u.origin u.u.prior]

9741570 =/ nm (hold-name q.typ)

9751571 ?: =(nm [~ %vase]) [%bad 'a Hoon type named vase needs source provenance']

9761572 ?: &((source-uses q.typ %jar) !(alias-safe context %jar))

@@ -981,7 +1577,8 @@

9811577 [%bad 'Hoon collection provenance is unavailable or shadowed']

9821578 =/ mop (mop-arguments typ)

9831579 ?^ mop

984− [%apply %mop ~[$(typ key.u.mop) $(typ value.u.mop)]]

1580+ :: An exact revisit fails closed without guessing a name.

1581+ [%apply %mop ~[$(typ key.u.mop, seen [[typ ~] seen]) $(typ value.u.mop, seen [[typ ~] seen])]]

9851582 ?: (source-uses q.typ %mop)

9861583 =/ checked-names=(list term) ~[%map %set %qeu %list %unit]

9871584 ?: (lien checked-names |=(n=term &((source-uses q.typ n) !(alias-safe context n))))

@@ -1075,6 +1672,7 @@

10751672 [%bad *] [~ reason.out]

10761673 [%invalid *] [~ reason.out]

10771674 [%face *] $(out body.out)

1675+ [%named *] $(out body.out)

10781676 [%cell *]

10791677 =/ err $(out head.out)

10801678 ?~ err $(out tail.out)

@@ -1102,6 +1700,7 @@

11021700 [%bad *] `[%unsupported reason.out]

11031701 [%invalid *] `[%invalid code.out reason.out]

11041702 [%face *] $(out body.out)

1703+ [%named *] $(out body.out)

11051704 [%cell *]

11061705 =/ first $(out head.out)

11071706 ?~ first $(out tail.out)

@@ -1254,6 +1853,7 @@

12541853 [%cell *] "[{(show-import head.out)} {(show-import tail.out)}]"

12551854 [%face *] "{(trip name.out)}={(show-import body.out)}"

12561855 [%fork *] "(union {(show-imports cases.out)})"

1856+ [%named *] "(named {(trip name.out)}.{(trip module.out)} {(show-import body.out)})"

12571857 [%apply *] "({(trip name.out)} {(show-imports args.out)})"

12581858 [%ref *] "{(trip name.out)}.{(trip module.out)}"

12591859 [%bad *] "error: {(trip reason.out)}"

@@ -1307,6 +1907,67 @@

13071907 =/ source=hoon original(q.p (decorate-union-source q.p.original))

13081908 (read-mold %small name typ(q source))

13091909::

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+::

13101971:: Synthetic nodes test each part of the direct collection-call proof.

13111972++ collection-wrapper-fixture

13121973 ^- tape

@@ -1352,6 +2013,19 @@

13522013 =/ mark-rec-core=type -:(ride fp mark-rec)

13532014 =/ mark-gate-core=type -:(ride -:!>(..zuse) mark-gate)

13542015 =/ 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'))

13552029 =/ fake-vase=type -:(ride -:!>(..zuse) '|%\0a+$ vase @ud\0a--\0a')

13562030 =/ spoof=(unit import-diagnostic)

13572031 (first-invalid [%bad 'signed and float auras cannot be imported'])

@@ -1366,6 +2040,30 @@

13662040 =/ distinct=type -:(ride distinct-parent origin-first)

13672041 =/ trans-amb-parent=type [%cell [%face %intermediate fc] [%cell [%face %second sc] -:!>(..zuse)]]

13682042 =/ 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')

13692067 =/ sample

13702068 |= name=term

13712069 (read-mold-in %small name (~(play ut sc) (ream (cat 3 '*' name))) sc)

@@ -1403,6 +2101,15 @@

14032101 (crip "nested-static-mop: {(show-result (sample %nested-static-mop))}")

14042102 (crip "collection-siblings: {(show-result (sample %collection-siblings))}")

14052103 (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")}")

14062113 (crip "mark-record: {(show-result (read-mark %todo-item mark-core))}")

14072114 (crip "mark-recursive: {(show-result (read-mark %recursive mark-rec-core))}")

14082115 (crip "mark-gate: {(show-result (read-mark %bad mark-gate-core))}")

@@ -1427,11 +2134,22 @@

14272134 (crip "shadow-list-mop: {(show-result (read-mold-in %shadow-static %bad (~(play ut xc) (ream '*bad')) xc))}")

14282135 (crip "named-mop: {(show-result (sample %named-mop))}")

14292136 (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)}")

14302147 (crip "signed: {(show-result (sample %signed))}")

14312148 (crip "float: {(show-result (sample %float))}")

14322149 (crip "gate: {(show-result (sample %gate-test))}")

14332150 (crip "vase: {(show-result vase)}")

14342151 (crip "failed-branch: {(show-result (read-mold %external %bad bad-branch-fixture))}")

2152+ (crip "debug-spec: {debug-spec-fixture}")

14352153 (crip "debug-union: {(show-result (debug-union-fixture sc %action))}")

14362154 (crip "debug-union-overlap: {(show-result (debug-union-fixture sc %explicit-wut-overlap))}")

14372155 (crip "debug-nested-cell: {(show-result (debug-union-fixture sc %nested-valid-cell))}")

@@ -1526,6 +2244,58 @@

15262244 (crip "missing-arm: {(show-result (read-mold-in %small %missing [%atom %ud ~] sc))}")

15272245 (crip "wrong-provenance: {(show-result (read-mold-in %small %action (~(play ut sc) (ream '*items')) sc))}")

15282246 (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))}")

15292299 (crip "presence-topic: {(show-result (present %topic))}")

15302300 (crip "presence-timing: {(show-result (present %timing))}")

15312301 (crip "presence-places: {(show-result (present %places))}")

jibb-dev/lib/jibb.hoon+3823−208

@@ -874,7 +874,7 @@

874874 %'~[' %'|=(' %'$-(' :: openers

875875 %'%/' %'/' :: paths

876876 %'+' %'`' %'=' :: pair, unit, face

877− %'*' %'?' :: noun, loobean mold

877+ %'*' %'?' %'_' :: noun, loobean, type hole

878878 %'++' %'+$' %'|=' %'|$' :: runes

879879 %'^-' %'~&' %'?-' %'!!' :: runes

880880 %'/-' %'/%' %'/=' :: imports

@@ -1016,6 +1016,7 @@

10161016 [%const at=span =lit] :: ~ %add %.y

10171017 [%ref at=span names=(list term)] :: state item.todo

10181018 [%tvar at=span name=@t] :: M

1019+ [%hole at=span ~] :: _

10191020 [%path at=span segs=(list pseg)] :: / /todos /todo/[id=@ud]

10201021 [%apply at=span ref=(list term) args=(list shape)] :: (list @t)

10211022 [%cell at=span fields=(list field)] :: [text=@t done=?]

@@ -1024,9 +1025,9 @@

10241025 [%generic at=span vars=(list @t) body=shape] :: +$ name |$ [M] …

10251026 ==

10261027::

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=_]

10281029::

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])

10301031::

10311032+| %api

10321033::

@@ -1295,6 +1296,7 @@

12951296 (emit 1 %'=')

12961297 ?: =('`' a) (emit 1 %'`')

12971298 ?: =('*' a) (emit 1 %'*')

1299+ ?: =('_' a) (emit 1 %'_')

12981300 ?: =('~' a)

12991301 ?: =('[' b) (emit 2 %'~[')

13001302 ?: =('&' b) (emit 2 %'~&')

@@ -1670,14 +1672,14 @@

16701672:: What may begin each place the parser reads (section 3, Errors):

16711673:: an expression a-z 0-9 " ( [ ~ % / ` | ^ ? !

16721674:: an operand a-z 0-9 " ( [ ~ % / ` | !

1673−:: a mold a-z A-Z @ * ! ? ~ % / ( [ $

1675+:: a mold a-z A-Z @ * ! ? ~ % / ( [ $ _

16741676:: a pattern a-z 0-9 " ~ % * [

16751677:: and what may go tight after an operand: . ( + = after a name, a

16761678:: closer ) ] }, or the : of a comment

16771679::

16781680++ expr-mask 0x57ff.ffff.4800.0000.83ff.8126.0000.0000

16791681++ 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

16811683++ bar-mask 0x1000.0000.0000.0000.0000.0000.0000.0000

16821684++ pattern-mask 0x47ff.fffe.0800.0000.03ff.0424.0000.0000

16831685++ after-mask 0x2000.0000.2000.0000.2400.4b00.0000.0000

@@ -2107,6 +2109,7 @@

21072109 ?- -.s

21082110 %knot (weld "/" (trip p.s))

21092111 %typed "/[{(trip name.s)}=@{(trip aura.s)}]"

2112+ %inferred "/[{(trip name.s)}=_]"

21102113 ==

21112114::

21122115++ show-tvars

@@ -2318,6 +2321,7 @@

23182321 %const (nod "const" at.s (show-lit lit.s) ~)

23192322 %ref (nod "ref" at.s (show-names names.s) ~)

23202323 %tvar (nod "tvar" at.s (trip name.s) ~)

2324+ %hole (nod "hole" at.s "" ~)

23212325 %path (nod "path" at.s (show-psegs segs.s) ~)

23222326 %apply (nod "apply" at.s (show-names ref.s) (turn args.s sexp-shape))

23232327 %cell (nod "cell" at.s "" (turn fields.s sexp-field))

@@ -3842,6 +3846,7 @@

38423846 %'*' [%& [%noun at.t ~] t.ts]

38433847 %'!!' [%& [%void at.t ~] t.ts]

38443848 %'?' [%& [%flag at.t ~] t.ts]

3849+ %'_' [%& [%hole at.t ~] t.ts]

38453850 [%name *] [%& [%ref at.t ~[p.lex.t]] t.ts]

38463851 [%wing *] [%& [%ref at.t p.lex.t] t.ts]

38473852 [%tvar *] [%& [%tvar at.t p.lex.t] t.ts]

@@ -4058,7 +4063,7 @@

40584063 ?: &(?=(^ nex) tight.i.nex) (bad nex "a path segment")

40594064 (bad-space i.after nex "a path segment")

40604065 ::

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

40624067 :: spaces, and where it ends

40634068 ::

40644069 ++ read-pseg

@@ -4075,13 +4080,16 @@

40754080 ?: |(?=(~ r2) !tight.i.r2) (bad-space i.r1 r2 "`=`")

40764081 ?. ?=([[* * %'='] *] r2) (bad-in r2 "`=`" tis-mask)

40774082 =/ r3=(list token) t.r2

4078− ?: |(?=(~ r3) !tight.i.r3) (bad-space i.r2 r3 "an aura")

4079− ?. ?=([[* * [%aura *]] *] r3) (bad-in r3 "an aura" pat-mask)

4083+ ?: |(?=(~ r3) !tight.i.r3) (bad-space i.r2 r3 "an aura or type hole")

4084+ ?. ?=([[* * ?([%aura *] %'_')] *] r3) (bad-in r3 "an aura or type hole" (con pat-mask (bex 95)))

40804085 =/ r4=(list token) t.r3

40814086 ?: |(?=(~ r4) !tight.i.r4) (bad-space i.r3 r4 "`]`")

40824087 ?. ?=([[* * %']'] *] r4) (bad-in r4 "`]`" ser-mask)

40834088 =/ at=span [beg.at.op end.at.i.r4]

4084− [%& [[%typed at p.lex.i.r1 p.lex.i.r3] end.at.i.r4] t.r4]

4089+ =/ seg=pseg

4090+ ?: ?=(%'_' lex.i.r3) [%inferred at p.lex.i.r1 at.i.r3]

4091+ [%typed at p.lex.i.r1 p.lex.i.r3]

4092+ [%& [seg end.at.i.r4] t.r4]

40854093 --

40864094::

40874095+| %span-check

@@ -4465,6 +4473,7 @@

44654473 %const [%const at.s ~[%lit] %one ~]

44664474 %ref [%ref at.s ~[%name %wing] %one ~]

44674475 %tvar [%tvar at.s ~[%tvar] %one ~]

4476+ %hole [%hole at.s ~[%'_'] %one ~]

44684477 %apply [%apply at.s ~[%'('] %shut (turn args.s outline-shape)]

44694478 %cell [%cell at.s ~[%'['] %shut (turn fields.s outline-sample)]

44704479 ::

@@ -4473,8 +4482,11 @@

44734482 %+ murn segs.s

44744483 |= g=pseg

44754484 ^- (unit outline)

4476− ?. ?=(%typed -.g) ~

4477− `[%typed at.g ~[%'['] %shut ~]

4485+ ?- -.g

4486+ %knot ~

4487+ %typed `[%typed at.g ~[%'['] %shut ~]

4488+ %inferred `[%typed at.g ~[%'['] %shut ~[[%hole hole-at.g ~[%'_'] %one ~]]]

4489+ ==

44784490 [%path at.s ~[%'/'] %run ks]

44794491 ::

44804492 %union

@@ -4534,6 +4546,8 @@

45344546 [%path [1 9] [1 9] [1 21]]

45354547 [%face [1 7] [1 7] [1 21]]

45364548 ==

4549+ :: an inferred path aura's hole spanning its = as well

4550+ ['+$ x /a/[id=_]' ~[[%hole [1 13] [1 12] [1 14]]]]

45374551 :: an import's path cut short

45384552 ['/= c /ui/c' ~[[%jibb [1 1] [1 1] [1 11]]]]

45394553 :: brackets that close with the deeper lines, cut at their line's

@@ -4593,6 +4607,8 @@

45934607:: Atom constraints tied to an explicit capital or an inferred sample

45944608:: are generalized and printed. Other aura variables remain unsupported until

45954609:: 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.

45964612:: Bare @ is a separate unrestricted atom type. A directional fit check

45974613:: permits concrete atoms to widen to it, never the reverse. A fit that

45984614:: needs a not-yet-implemented constraint remains unsupported. Named unions

@@ -4600,18 +4616,63 @@

46004616:: from their display name. Generic cases must be disjoint for all arguments.

46014617:: Unnamed union printing is informational; it is not Jibb syntax.

46024618::

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.

4658+::

46034659+$ itype

46044660 $~ [%var 0]

46054661 $% [%var id=@ud]

46064662 [%avar id=@ud]

4663+ [%rvar id=@ud]

46074664 [%nvar id=@ud]

4665+ [%rnvar id=@ud]

46084666 [%atom aura=@ta]

46094667 [%any-atom ~]

46104668 [%flag ~]

4669+ [%noun ~]

46114670 [%tag id=@ud literal=lit constructor=?]

46124671 [%const literal=lit]

46134672 [%collection name=term args=(list itype)]

46144673 [%recursive module=term name=term label=(unit @t)]

4674+ [%jrec at=path name=term label=(unit @t) head=term aura=@ta tail=term]

4675+ [%grec at=path name=term label=(unit @t) proof=shape args=(list itype)]

46154676 [%union cases=(list itype) origin=(unit [at=path name=term]) label=(unit @t) args=(list itype)]

46164677 [%face name=term body=itype]

46174678 [%fn sample=itype product=itype]

@@ -4635,18 +4696,32 @@

46354696 %var

46364697 =/ found=(unit itype) (itype-lookup id.t sub)

46374698 ?~ found t

4699+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

46384700 $(t u.found)

46394701 %avar

46404702 =/ found=(unit itype) (itype-lookup id.t sub)

46414703 ?~ found t

4704+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

4705+ $(t u.found)

4706+ %rvar

4707+ =/ found=(unit itype) (itype-lookup id.t sub)

4708+ ?~ found t

4709+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

46424710 $(t u.found)

46434711 %nvar

46444712 =/ found=(unit itype) (itype-lookup id.t sub)

46454713 ?~ found t

4714+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

4715+ $(t u.found)

4716+ %rnvar

4717+ =/ found=(unit itype) (itype-lookup id.t sub)

4718+ ?~ found t

4719+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

46464720 $(t u.found)

46474721 %tag

46484722 =/ found=(unit itype) (itype-lookup id.t sub)

46494723 ?~ found t

4724+ ?: &(|(?=(%rvar -.u.found) ?=(%rnvar -.u.found)) =(id.t +.u.found)) u.found

46504725 $(t u.found)

46514726 ==

46524727::

@@ -4657,14 +4732,19 @@

46574732 ?- -.t

46584733 %var =(n id.t)

46594734 %avar =(n id.t)

4735+ %rvar =(n id.t)

46604736 %nvar =(n id.t)

4737+ %rnvar =(n id.t)

46614738 %atom |

46624739 %any-atom |

46634740 %flag |

4741+ %noun |

46644742 %tag =(n id.t)

46654743 %const |

46664744 %union |((lien cases.t |=(c=itype (itype-occurs n c sub))) (lien args.t |=(c=itype (itype-occurs n c sub))))

46674745 %recursive |

4746+ %jrec |

4747+ %grec (lien args.t |=(c=itype (itype-occurs n c sub)))

46684748 %collection (lien args.t |=(c=itype (itype-occurs n c sub)))

46694749 %face $(t body.t)

46704750 %fn |($(t sample.t) $(t product.t))

@@ -4683,6 +4763,11 @@

46834763 =. a (itype-walk a sub)

46844764 =. b (itype-walk b sub)

46854765 ?: =(a b) `sub

4766+ ?: &(?=(%grec -.a) ?=(%grec -.b))

4767+ ?. &(=(at.a at.b) =(name.a name.b)) ~

4768+ (itype-unify-args args.a args.b sub)

4769+ ?: &(?=(%jrec -.a) ?=(%jrec -.b))

4770+ ?:(&(=(at.a at.b) =(name.a name.b) =(head.a head.b) =(aura.a aura.b) =(tail.a tail.b)) `sub ~)

46864771 ?: &(?=(%recursive -.a) ?=(%recursive -.b))

46874772 ?:(&(=(module.a module.b) =(name.a name.b)) `sub ~)

46884773 ?: &(?=(%union -.a) ?=(%union -.b))

@@ -4699,6 +4784,32 @@

46994784 ?: ?=(%var -.b)

47004785 ?: (itype-occurs id.b a sub) ~

47014786 `[[id.b a] sub]

4787+ :: Arithmetic's aura variable excludes loobeans; decimal literals

4788+ :: remain defaultable until a later constraint makes them concrete.

4789+ ?: &(?=(%nvar -.a) ?=(%rvar -.b))

4790+ `[[id.b [%rnvar id.a]] [id.a [%rnvar id.a]] sub]

4791+ ?: &(?=(%rvar -.a) ?=(%nvar -.b))

4792+ `[[id.a [%rnvar id.b]] [id.b [%rnvar id.b]] sub]

4793+ ?: &(?=(%rnvar -.a) ?=(%rvar -.b)) `[[id.b a] sub]

4794+ ?: &(?=(%rvar -.a) ?=(%rnvar -.b)) `[[id.a b] sub]

4795+ ?: &(?=(%rnvar -.a) ?=(%nvar -.b)) `[[id.b a] sub]

4796+ ?: &(?=(%nvar -.a) ?=(%rnvar -.b)) `[[id.a b] sub]

4797+ ?: &(?=(%rnvar -.a) ?=(%avar -.b)) `[[id.b a] sub]

4798+ ?: &(?=(%avar -.a) ?=(%rnvar -.b)) `[[id.a b] sub]

4799+ ?: ?=(%rnvar -.a)

4800+ ?. |(?=(%rnvar -.b) ?=(%atom -.b)) ~

4801+ `[[id.a b] sub]

4802+ ?: ?=(%rnvar -.b)

4803+ ?. ?=(%atom -.a) ~

4804+ `[[id.b a] sub]

4805+ ?: &(?=(%avar -.a) ?=(%rvar -.b)) `[[id.a b] sub]

4806+ ?: &(?=(%rvar -.a) ?=(%avar -.b)) `[[id.b a] sub]

4807+ ?: ?=(%rvar -.a)

4808+ ?. |(?=(%rvar -.b) ?=(%atom -.b)) ~

4809+ `[[id.a b] sub]

4810+ ?: ?=(%rvar -.b)

4811+ ?. ?=(%atom -.a) ~

4812+ `[[id.b a] sub]

47024813 :: The narrower decimal constraint survives a match with an atom

47034814 :: variable; decimal syntax alone does not make it a loobean.

47044815 ?: &(?=(%nvar -.a) ?=(%avar -.b)) `[[id.b a] sub]

@@ -4753,14 +4864,19 @@

47534864 ?- -.t

47544865 %var |

47554866 %avar |

4867+ %rvar |

47564868 %nvar |

4869+ %rnvar |

47574870 %atom |

47584871 %any-atom &

47594872 %flag |

4873+ %noun |

47604874 %tag |

47614875 %const |

47624876 %union |((lien cases.t |=(c=itype (itype-has-any-atom c sub))) (lien args.t |=(c=itype (itype-has-any-atom c sub))))

47634877 %recursive |

4878+ %jrec |

4879+ %grec (lien args.t |=(c=itype (itype-has-any-atom c sub)))

47644880 %collection (lien args.t |=(c=itype (itype-has-any-atom c sub)))

47654881 %face $(t body.t)

47664882 %fn |($(t sample.t) $(t product.t))

@@ -4823,14 +4939,19 @@

48234939 ?- -.typ

48244940 %var |

48254941 %avar |

4942+ %rvar |

48264943 %nvar |

4944+ %rnvar |

48274945 %atom &

48284946 %any-atom &

48294947 %flag &

4948+ %noun |

48304949 %tag &

48314950 %const &

48324951 %union |((lien cases.typ |=(c=itype (itype-has-fixed-atom c))) (lien args.typ |=(c=itype (itype-has-fixed-atom c))))

48334952 %recursive |

4953+ %jrec |

4954+ %grec (lien args.typ |=(c=itype (itype-has-fixed-atom c)))

48344955 %collection (lien args.typ |=(c=itype (itype-has-fixed-atom c)))

48354956 %face $(typ body.typ)

48364957 %fn |($(typ sample.typ) $(typ product.typ))

@@ -4859,6 +4980,7 @@

48594980 ^- ?

48604981 =. t (itype-walk t sub)

48614982 ?- -.t

4983+ %grec (lien args.t |=(c=itype (itype-has-face c sub)))

48624984 %collection (lien args.t |=(c=itype (itype-has-face c sub)))

48634985 %face &

48644986 %cell |($(t hed.t) $(t tal.t))

@@ -4866,6 +4988,42 @@

48664988 * |

48674989 ==

48684990::

4991+:: Closed function samples may omit a slot face, but a known name must

4992+:: match another known name. Keep nested value faces and require exact

4993+:: invariant compatibility; a faced tail against a cell is ambiguous.

4994+++ itype-closed-slot-match

4995+ |= [a=itype b=itype]

4996+ ^- ?

4997+ ?: &(?=(%face -.a) ?=(%face -.b))

4998+ ?. =(name.a name.b) |

4999+ ?=(^ (itype-unify body.a body.b ~))

5000+ ?: ?=(%face -.a) ?=(^ (itype-unify body.a b ~))

5001+ ?: ?=(%face -.b) ?=(^ (itype-unify a body.b ~))

5002+ ?=(^ (itype-unify a b ~))

5003+++ itype-closed-sample-match

5004+ |= [a=itype b=itype fuel=@ud]

5005+ ^- ?

5006+ ?: =(0 fuel) |

5007+ ?. &(?=(%cell -.a) ?=(%cell -.b)) |

5008+ ?. (itype-closed-slot-match hed.a hed.b) |

5009+ =/ x=itype tal.a

5010+ =/ y=itype tal.b

5011+ ?: &(?=(%cell -.x) ?=(%cell -.y))

5012+ ?=(^ (itype-unify x y ~))

5013+ ?: |(&(?=(%face -.x) ?=(%cell -.y)) &(?=(%cell -.x) ?=(%face -.y))) |

5014+ (itype-closed-slot-match x y)

5015+++ itype-closed-gates-match

5016+ |= [a=itype b=itype]

5017+ ^- ?

5018+ ?. &(?=(%fn -.a) ?=(%fn -.b)) |

5019+ ?. &(?=(%cell -.sample.a) ?=(%cell -.sample.b)) |

5020+ ?. =(product.a product.b) |

5021+ ?^ (itype-vars a) |

5022+ ?^ (itype-vars b) |

5023+ ?: |((itype-has-tag a) (itype-has-tag b)) |

5024+ ?. (itype-closed-sample-match sample.a sample.b 1.024) |

5025+ ?=(^ (itype-unify product.a product.b ~))

5026+::

48695027++ itype-face-asym-collection-args

48705028 |= [as=(list itype) bs=(list itype) sub=isub]

48715029 ^- ?

@@ -4879,12 +5037,15 @@

48795037 ^- ?

48805038 =. a (itype-walk a sub)

48815039 =. b (itype-walk b sub)

5040+ ?: &(?=(%grec -.a) ?=(%grec -.b))

5041+ ?. &(=(at.a at.b) =(name.a name.b)) |

5042+ (itype-face-asym-collection-args args.a args.b sub)

48825043 ?: &(?=(%collection -.a) ?=(%collection -.b))

48835044 ?. =(name.a name.b) |

48845045 (itype-face-asym-collection-args args.a args.b sub)

48855046 ?: &(?=(%face -.a) ?=(%face -.b)) $(a body.a, b body.b)

4886− ?: ?=(%face -.a) !|(?=(%var -.b) ?=(%avar -.b) ?=(%nvar -.b))

4887− ?: ?=(%face -.b) !|(?=(%var -.a) ?=(%avar -.a) ?=(%nvar -.a))

5047+ ?: ?=(%face -.a) !|(?=(%var -.b) ?=(%avar -.b) ?=(%rvar -.b) |(?=(%nvar -.b) ?=(%rnvar -.b)))

5048+ ?: ?=(%face -.b) !|(?=(%var -.a) ?=(%avar -.a) ?=(%rvar -.a) |(?=(%nvar -.a) ?=(%rnvar -.a)))

48885049 ?: &(?=(%cell -.a) ?=(%cell -.b)) |($(a hed.a, b hed.b) $(a tal.a, b tal.b))

48895050 ?: &(?=(%fn -.a) ?=(%fn -.b)) |($(a sample.a, b sample.b) $(a product.a, b product.b))

48905051 |

@@ -4907,6 +5068,30 @@

49075068 [%cell $(actual hed.actual, expected hed.expected) $(actual tal.actual, expected tal.expected)]

49085069 expected

49095070::

5071+:: Positional call arguments do not write the sample's enclosing field

5072+:: labels. Ignore one raw sample-slot face per written argument while

5073+:: checking value faces as usual. An unknown or variable-bound cell spine

5074+:: cannot justify this distinction, so keep the existing conservative guard.

5075+++ itype-positional-slot-face-asym

5076+ |= [actual=itype expected=itype sub=isub]

5077+ ^- ?

5078+ ?: &(?=(%fn -.actual) ?=(%fn -.expected) (itype-closed-gates-match actual expected)) |

5079+ (itype-face-asym actual expected sub)

5080+::

5081+++ itype-positional-face-asym

5082+ |= [args=(list expr) actual=itype expected=itype sub=isub]

5083+ ^- ?

5084+ ?~ args &

5085+ ?~ t.args

5086+ =/ slot=itype expected

5087+ =? slot ?=(%face -.slot) body.slot

5088+ (itype-positional-slot-face-asym actual slot sub)

5089+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) &

5090+ =/ slot=itype hed.expected

5091+ =? slot ?=(%face -.slot) body.slot

5092+ ?: (itype-positional-slot-face-asym hed.actual slot sub) &

5093+ $(args t.args, actual tal.actual, expected tal.expected)

5094+::

49105095++ itype-output-may-be-cell

49115096 |= [t=itype sub=isub]

49125097 ^- ?

@@ -4916,6 +5101,9 @@

49165101 %cell &

49175102 %union &

49185103 %recursive &

5104+ %jrec &

5105+ %grec &

5106+ %noun &

49195107 %collection &

49205108 %face $(t body.t)

49215109 %fn |($(t sample.t) $(t product.t))

@@ -4944,6 +5132,7 @@

49445132 ^- ?

49455133 ?- -.t

49465134 %tag &

5135+ %grec (lien args.t |=(c=itype (itype-has-tag c)))

49475136 %collection (lien args.t |=(c=itype (itype-has-tag c)))

49485137 %face $(t body.t)

49495138 %fn |($(t sample.t) $(t product.t))

@@ -4957,6 +5146,7 @@

49575146 ^- ?

49585147 ?- -.t

49595148 %union &

5149+ %grec (lien args.t |=(c=itype (itype-has-union c)))

49605150 %collection (lien args.t |=(c=itype (itype-has-union c)))

49615151 %face $(t body.t)

49625152 %fn |($(t sample.t) $(t product.t))

@@ -4975,6 +5165,7 @@

49755165 %union

49765166 ?: &(?=(~ label.t) ?=(^ args.t)) &

49775167 (lien (weld args.t cases.t) |=(c=itype (itype-has-hidden-generic c)))

5168+ %grec |(?=(~ label.t) (lien args.t |=(c=itype (itype-has-hidden-generic c))))

49785169 %collection (lien args.t |=(c=itype (itype-has-hidden-generic c)))

49795170 %face $(t body.t)

49805171 %fn |($(t sample.t) $(t product.t))

@@ -4987,6 +5178,8 @@

49875178 ^- ?

49885179 ?- -.t

49895180 %recursive &

5181+ %jrec &

5182+ %grec &

49905183 %collection (lien args.t |=(c=itype (itype-has-recursive c)))

49915184 %union (lien (weld args.t cases.t) |=(c=itype (itype-has-recursive c)))

49925185 %face $(t body.t)

@@ -5000,6 +5193,8 @@

50005193 ^- ?

50015194 ?- -.t

50025195 %recursive ?=(~ label.t)

5196+ %jrec ?=(~ label.t)

5197+ %grec |(?=(~ label.t) (lien args.t |=(c=itype (itype-has-hidden-recursive c))))

50035198 %collection (lien args.t |=(c=itype (itype-has-hidden-recursive c)))

50045199 %union (lien (weld args.t cases.t) |=(c=itype (itype-has-hidden-recursive c)))

50055200 %face $(t body.t)

@@ -5027,34 +5222,99 @@

50275222 $(cases t.cases, good `trial)

50285223 ==

50295224::

5030−:: A constructor needs a case with its tag at the head and a payload

5031−:: compatible with the expected gate sample. Other case forms do not

5032−:: identify a constructor.

5225+:: A constructor needs a case whose head has the same literal noun as its

5226+:: tag. An unresolved or opaque case may reveal one later, so it cannot

5227+:: prove a mismatch or a unique match. A broad atom mold is not a case.

50335228::

50345229++ itype-fit-ctor-cases

50355230 |= [tag=lit sample=itype cases=(list itype) sub=isub next=@ud]

50365231 ^- ifit

50375232 =/ found=(unit ifit) ~

5233+ =/ pending=? |

50385234 |-

5039− ?~ cases ?~(found [%bad ~] u.found)

5040− =/ c=itype (itype-walk i.cases sub)

5235+ ?~ cases

5236+ ?: pending [%unknown ~]

5237+ ?~ found [%bad ~]

5238+ u.found

5239+ =/ raw=itype i.cases

5240+ ?: ?=(%var -.raw)

5241+ $(cases t.cases, pending &)

5242+ =/ c=itype (itype-walk raw sub)

5243+ ?: ?=(?(%var %tag %recursive %jrec %grec %union %face) -.c)

5244+ $(cases t.cases, pending &)

50415245 ?. ?=(%cell -.c) $(cases t.cases)

5042− =/ head=itype (itype-walk hed.c sub)

5246+ =/ raw-head=itype hed.c

5247+ ?: ?=(%var -.raw-head)

5248+ $(cases t.cases, pending &)

5249+ =/ head=itype (itype-walk raw-head sub)

5250+ :: A single faced, explicitly atom-only head cannot be the tag case.

5251+ :: Do not follow variables or peel nested faces for this negative proof.

5252+ ?: ?=(%face -.head)

5253+ ?: ?=(?(%atom %any-atom %flag %avar %rvar %nvar %rnvar) -.body.head)

5254+ $(cases t.cases)

5255+ $(cases t.cases, pending &)

5256+ ?: ?=(?(%var %tag %recursive %jrec %grec %union) -.head)

5257+ $(cases t.cases, pending &)

50435258 ?. ?=(%const -.head) $(cases t.cases)

5044− ?. =(%term form.literal.head) $(cases t.cases)

50455259 ?. =(val.literal.head val.tag) $(cases t.cases)

5046− ?^ found [%unknown ~]

5260+ :: Equal heads can have disjoint payloads. Test each from the original

5261+ :: substitution; a unique success is usable only with no unknown rival.

50475262 =/ trial=ifit (itype-fit sample tal.c sub next)

5048− $(cases t.cases, found `trial)

5263+ ?- -.trial

5264+ %bad $(cases t.cases)

5265+ %unknown $(cases t.cases, pending &)

5266+ %ok

5267+ ?^ found [%unknown ~]

5268+ $(cases t.cases, found `trial)

5269+ ==

50495270::

50505271++ itype-fit

50515272 |= [actual=itype expected=itype sub=isub next=@ud]

50525273 ^- ifit

5274+ (itype-fit-inner actual expected sub next | |)

5275+++ itype-fit-inner

5276+ |= [actual=itype expected=itype sub=isub next=@ud skip-width=? spine-proof=?]

5277+ ^- ifit

5278+ ?: &(!skip-width ?=(%cell -.actual) ?=(%cell -.expected) |((width-spine-exhausted actual 1.024) (width-spine-exhausted expected 1.024)))

5279+ [%unknown ~]

5280+ =/ known=(unit [source=iwfields target=iwfields])

5281+ ?: skip-width ~

5282+ (width-known-shape actual expected sub)

5283+ =/ too-wide=? ?~(known | (gth (lent order.source.u.known) (lent order.target.u.known)))

5284+ ?: too-wide [%unknown ~]

5285+ =/ spine-checked=? |(spine-proof ?=(^ known))

50535286 =/ uncertain=?

5054− |(?=(%var -.actual) ?=(%avar -.actual) ?=(%nvar -.actual) ?=(%var -.expected) ?=(%avar -.expected) ?=(%nvar -.expected))

5287+ |(?=(%var -.actual) ?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)) ?=(%var -.expected) ?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected)))

5288+ =/ actual-open=?

5289+ |(?=(%var -.actual) ?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)))

50555290 =. actual (itype-walk actual sub)

50565291 =. expected (itype-walk expected sub)

50575292 ?: =(actual expected) [%ok sub next]

5293+ :: The relation of the source loobean mold to explicit @f is not yet

5294+ :: established. Keep it unsupported rather than asserting a mismatch.

5295+ ?: &(?=(%flag -.actual) ?=(%atom -.expected) =(%f aura.expected)) [%unknown ~]

5296+ :: Any value can be used where a noun is expected. An unresolved

5297+ :: bare tag is fixed as a constant; a constructor still needs a gate.

5298+ ?: ?=(%noun -.expected)

5299+ ?: ?=(%tag -.actual)

5300+ ?: constructor.actual [%unknown ~]

5301+ [%ok [[id.actual expected] sub] next]

5302+ [%ok sub next]

5303+ :: An arbitrary noun is not known to fit a narrower type.

5304+ ?: &(?=(%noun -.actual) !?=(%var -.expected)) [%unknown ~]

5305+ ?: &(!uncertain ?=(%grec -.actual) ?=(%face -.expected)) $(expected body.expected)

5306+ ?: &(!uncertain ?=(%face -.actual) ?=(%grec -.expected)) $(actual body.actual)

5307+ ?: &(?=(%grec -.actual) ?=(%grec -.expected))

5308+ ?. &(=(at.actual at.expected) =(name.actual name.expected)) [%unknown ~]

5309+ =/ matched=(unit isub) (itype-unify-args args.actual args.expected sub)

5310+ ?~ matched [%unknown ~]

5311+ [%ok u.matched next]

5312+ ?: &(|(?=(%grec -.actual) ?=(%grec -.expected)) !|(?=(%var -.actual) ?=(%var -.expected))) [%unknown ~]

5313+ ?: &(!uncertain ?=(%jrec -.actual) ?=(%face -.expected)) $(expected body.expected)

5314+ ?: &(!uncertain ?=(%face -.actual) ?=(%jrec -.expected)) $(actual body.actual)

5315+ ?: &(?=(%jrec -.actual) ?=(%jrec -.expected))

5316+ ?:(&(=(at.actual at.expected) =(name.actual name.expected) =(head.actual head.expected) =(aura.actual aura.expected) =(tail.actual tail.expected)) [%ok sub next] [%bad ~])

5317+ ?: &(|(?=(%jrec -.actual) ?=(%jrec -.expected)) !|(?=(%var -.actual) ?=(%var -.expected))) [%unknown ~]

50585318 ?: &(?=(%recursive -.actual) ?=(%recursive -.expected))

50595319 ?:(&(=(module.actual module.expected) =(name.actual name.expected)) [%ok sub next] [%bad ~])

50605320 ?: &(|(?=(%recursive -.actual) ?=(%recursive -.expected)) !|(?=(%var -.actual) ?=(%var -.expected))) [%unknown ~]

@@ -5066,12 +5326,21 @@

50665326 =/ unified=(unit isub) (itype-unify-args args.actual args.expected sub)

50675327 ?^ unified [%ok u.unified next]

50685328 [%unknown ~]

5329+ :: A known union can instantiate an unconstrained sample directly;

5330+ :: preserve unknown results for variable-bound union origins.

5331+ ?: &(!actual-open ?=(%union -.actual) ?=(%var -.expected))

5332+ ?~ origin.actual [%unknown ~]

5333+ =/ normalized=itype (itype-normalize actual sub)

5334+ ?: |((itype-has-tag normalized) (itype-has-recursive normalized) (itype-has-any-atom actual sub)) [%unknown ~]

5335+ =/ unified=(unit isub) (itype-unify actual expected sub)

5336+ ?~ unified [%unknown ~]

5337+ [%ok u.unified next]

50695338 :: A concrete union value in a tuple may acquire the expected field's

50705339 :: face. A variable-bound union still needs face propagation support.

50715340 ?: &(!uncertain ?=(%union -.actual) ?=(%face -.expected))

50725341 $(expected body.expected)

50735342 ?: ?=(%union -.actual) [%unknown ~]

5074− ?: &(?=(%union -.expected) |(?=(%avar -.actual) ?=(%nvar -.actual))) [%unknown ~]

5343+ ?: &(?=(%union -.expected) |(?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)))) [%unknown ~]

50755344 ?: &(?=(%union -.expected) !?=(%var -.actual))

50765345 (itype-fit-cases actual cases.expected sub next)

50775346 ?: ?=(%tag -.actual)

@@ -5079,7 +5348,7 @@

50795348 =/ u=(unit isub) (itype-unify actual expected sub)

50805349 ?~ u [%bad ~]

50815350 [%ok u.u next]

5082− ?: |(?=(%avar -.expected) ?=(%nvar -.expected)) [%unknown ~]

5351+ ?: |(?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected))) [%unknown ~]

50835352 ?: ?=(%face -.expected) $(expected body.expected)

50845353 ?: constructor.actual

50855354 ?. ?=(%fn -.expected) [%bad ~]

@@ -5107,13 +5376,17 @@

51075376 =/ u=(unit isub) (itype-unify actual expected sub)

51085377 ?~ u [%bad ~]

51095378 [%ok u.u next]

5110− ?: |(?=(%avar -.expected) ?=(%nvar -.expected)) [%unknown ~]

5379+ ?: |(?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected))) [%unknown ~]

51115380 ?: ?=(%face -.expected) $(expected body.expected)

51125381 ?: &(?=(%collection -.expected) =(%list name.expected) =(0 val.literal.actual))

51135382 [%unknown ~]

51145383 ?: ?=(%const -.expected)

51155384 ?:(=(val.literal.actual val.literal.expected) [%ok sub next] [%bad ~])

51165385 ?: ?=(%atom -.expected)

5386+ :: A loobean singleton must not silently widen into another aura.

5387+ ?: =(%loobean form.literal.actual)

5388+ ?: =(%f aura.expected) [%unknown ~]

5389+ [%bad ~]

51175390 ?: |(=(%tas aura.expected) =(%ta aura.expected)) [%ok sub next]

51185391 [%bad ~]

51195392 ?: ?=(%flag -.expected)

@@ -5121,8 +5394,14 @@

51215394 ?: ?=(%any-atom -.expected) [%ok sub next]

51225395 [%bad ~]

51235396 ?: &(uncertain (itype-face-asym actual expected sub)) [%unknown ~]

5397+ :: A known face labels the same noun. Peel it before applying the

5398+ :: directional unrestricted-atom rule, preserving raw-variable guards.

5399+ ?: &(!uncertain ?=(%any-atom -.actual) ?=(%face -.expected))

5400+ $(expected body.expected, skip-width |, spine-proof |)

5401+ ?: &(!uncertain ?=(%any-atom -.expected) ?=(%face -.actual))

5402+ $(actual body.actual, skip-width |, spine-proof |)

51245403 ?: ?=(%any-atom -.expected)

5125− ?: |(?=(%atom -.actual) ?=(%avar -.actual) ?=(%nvar -.actual) ?=(%flag -.actual)) [%ok sub next]

5404+ ?: |(?=(%atom -.actual) ?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)) ?=(%flag -.actual)) [%ok sub next]

51265405 ?: ?=(%var -.actual)

51275406 =/ unified=(unit isub) (itype-unify actual [%avar next] sub)

51285407 ?~ unified [%bad ~]

@@ -5133,16 +5412,16 @@

51335412 =/ unified=(unit isub) (itype-unify actual expected sub)

51345413 ?~ unified [%bad ~]

51355414 [%ok u.unified next]

5136− ?: |(?=(%avar -.expected) ?=(%nvar -.expected)) [%unknown ~]

5415+ ?: |(?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected))) [%unknown ~]

51375416 [%bad ~]

51385417 ?: &(?=(%atom -.actual) ?=(%atom -.expected))

51395418 ?: (aura-prefix aura.expected aura.actual) [%ok sub next]

51405419 ?: &((aura-prefix aura.actual aura.expected) uncertain) [%unknown ~]

51415420 [%bad ~]

51425421 ?: &(?=(%cell -.actual) ?=(%cell -.expected))

5143− =/ first=ifit $(actual hed.actual, expected hed.expected)

5422+ =/ first=ifit $(actual hed.actual, expected hed.expected, skip-width |, spine-proof |)

51445423 ?. ?=(%ok -.first) first

5145− $(actual tal.actual, expected tal.expected, sub sub.first, next next.first)

5424+ $(actual tal.actual, expected tal.expected, sub sub.first, next next.first, skip-width spine-checked, spine-proof spine-checked)

51465425 :: A field may add a face to an occurrence of the very same type

51475426 :: variable. Binding that variable to a face around itself would fail

51485427 :: the occurs check, but its underlying type has already matched.

@@ -5164,9 +5443,10 @@

51645443 [%ok u.unified next]

51655444 ?: &(?=(%face -.actual) ?=(%face -.expected))

51665445 ?. =(name.actual name.expected) [%bad ~]

5167− $(actual body.actual, expected body.expected)

5168− ?: ?=(%face -.actual) $(actual body.actual)

5169− ?: ?=(%face -.expected) $(expected body.expected)

5446+ $(actual body.actual, expected body.expected, skip-width |, spine-proof |)

5447+ ?: ?=(%face -.actual) $(actual body.actual, skip-width |, spine-proof |)

5448+ ?: ?=(%face -.expected) $(expected body.expected, skip-width |, spine-proof |)

5449+ ?: &(!uncertain (itype-closed-gates-match actual expected)) [%ok sub next]

51705450 ?: (itype-face-asym actual expected sub) [%unknown ~]

51715451 ?: |((itype-has-any-atom actual sub) (itype-has-any-atom expected sub))

51725452 [%unknown ~]

@@ -5242,7 +5522,18 @@

52425522+$ ischeme [typ=itype vars=(list @ud)]

52435523+$ ienv (list [name=term scheme=ischeme])

52445524+$ imold-types (list [name=term template=ischeme])

5245−+$ ifile [values=ienv molds=imold-types at=path]

5525++$ iderived [name=term agent=term mark=term]

5526++$ iwidth-definition [name=term original=expr typ=itype sub=isub projections=(list iwprojection)]

5527++$ iwidth-dependency [at=path source=(unit @t) definitions=(list iwidth-definition)]

5528+:: Nonrecursive request evidence is compiler-owned metadata, not a property

5529+:: of an arbitrary ask value. Reader graphs and source inputs are trusted.

5530++$ irequest-evidence

5531+ [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]

5532+:: A unit distinguishes a verified empty closure from a detached legacy file.

5533+:: The opaque prelude is an exact trusted input, not a recursive interface mold.

5534++$ irequest-graph

5535+ [paths=(set path) requests=(list irequest-evidence) bundle-input=* prelude-input=* prelude-values=(list term) prelude-molds=(list term) externals=iexternals marks=imark-externals]

5536++$ 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)]

52465537+$ ijimports (list [face=term interface=ifile])

52475538+$ icap [name=@t id=@ud at=span]

52485539+$ icaps (list icap)

@@ -5252,7 +5543,167 @@

52525543:: This core has no Ford dependencies; unrecognized payloads fail closed.

52535544+$ iexternals (list [module=term name=term result=*])

52545545+$ imark-externals (list [mark=term result=*])

5255−+$ 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)]

5546+:: Hole obligations survive discarded expressions until their owning

5547+:: definition has inferred; their source spans support unresolved reports.

5548++$ ihole [id=@ud at=span]

5549+:: Recursive-mold unfolding spends fuel in the threaded inference state.

5550+:: Retries can restart from an earlier state, so this bounds an attempt,

5551+:: not all parsing or module-checking work.

5552+:: Experimental: only closed, uniquely faced records have known axes.

5553++$ iwfield [name=term axis=@ud typ=itype]

5554++$ iwfields [order=(list iwfield) index=(map term iwfield)]

5555++$ iwstep [name=term axis=@ud]

5556++$ iwidth-result [steps=(list iwstep) sub=isub next=@ud]

5557++$ iwprojection [at=span original=expr source=itype target=itype steps=(list iwstep)]

5558+++ width-scan

5559+ |= [typ=itype sub=isub axis=@ud fuel=@ud]

5560+ ^- (unit iwfields)

5561+ =/ order=(list iwfield) ~

5562+ =/ index=(map term iwfield) *(map term iwfield)

5563+ |-

5564+ ?: =(0 fuel) ~

5565+ ?: |(?=(%var -.typ) ?=(%avar -.typ) ?=(%rvar -.typ) ?=(%nvar -.typ) ?=(%rnvar -.typ)) ~

5566+ ?: ?=(%face -.typ)

5567+ =/ entry=iwfield [name.typ axis body.typ]

5568+ ?: ?=(^ (~(get by index) name.entry)) ~

5569+ `[(flop [entry order]) (~(put by index) name.entry entry)]

5570+ ?. ?=(%cell -.typ) ~

5571+ =/ head=itype hed.typ

5572+ ?: |(?=(%var -.head) ?=(%avar -.head) ?=(%rvar -.head) ?=(%nvar -.head) ?=(%rnvar -.head)) ~

5573+ ?. ?=(%face -.head) ~

5574+ =/ entry=iwfield [name.head (mul 2 axis) body.head]

5575+ ?: ?=(^ (~(get by index) name.entry)) ~

5576+ $(typ tal.typ, axis +((mul 2 axis)), fuel (dec fuel), order [entry order], index (~(put by index) name.entry entry))

5577+++ width-in-order

5578+ |= [source=(list iwfield) target=(list iwfield)]

5579+ ^- ?

5580+ ?~ target &

5581+ ?~ source |

5582+ ?: =(name.i.source name.i.target) $(source t.source, target t.target)

5583+ $(source t.source)

5584+++ width-fit-fields

5585+ |= [source=(map term iwfield) target=(list iwfield) sub=isub next=@ud]

5586+ ^- (unit iwidth-result)

5587+ ?~ target `[~ sub next]

5588+ =/ found=(unit iwfield) (~(get by source) name.i.target)

5589+ ?~ found ~

5590+ =/ fit=ifit (itype-fit typ.u.found typ.i.target sub next)

5591+ ?. ?=(%ok -.fit) ~

5592+ =/ rest=(unit iwidth-result) $(target t.target, sub sub.fit, next next.fit)

5593+ ?~ rest ~

5594+ `[[[name.i.target axis.u.found] steps.u.rest] sub.u.rest next.u.rest]

5595+++ width-spine-exhausted

5596+ |= [t=itype fuel=@ud]

5597+ ^- ?

5598+ ?: =(0 fuel) &

5599+ ?. ?=(%cell -.t) |

5600+ ?. ?=(%face -.hed.t) |

5601+ $(t tal.t, fuel (dec fuel))

5602+++ width-known-shape

5603+ |= [actual=itype expected=itype sub=isub]

5604+ ^- (unit [source=iwfields target=iwfields])

5605+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

5606+ =/ source=(unit iwfields) (width-scan actual sub 1 1.024)

5607+ =/ target=(unit iwfields) (width-scan expected sub 1 1.024)

5608+ ?~ source ~

5609+ ?~ target ~

5610+ `[u.source u.target]

5611+::

5612+++ width-shape

5613+ |= [actual=itype expected=itype sub=isub]

5614+ ^- (unit [source=iwfields target=iwfields])

5615+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

5616+ =/ source=(unit iwfields) (width-scan actual sub 1 4.096)

5617+ =/ target=(unit iwfields) (width-scan expected sub 1 4.096)

5618+ ?~ source ~

5619+ ?~ target ~

5620+ ?. (gth (lent order.u.source) (lent order.u.target)) ~

5621+ `[u.source u.target]

5622+++ width-proj-shape

5623+ |= [actual=itype expected=itype sub=isub]

5624+ ^- (unit [source=iwfields target=iwfields])

5625+ ?. &(|(?=(%cell -.actual) ?=(%face -.actual)) |(?=(%cell -.expected) ?=(%face -.expected))) ~

5626+ =/ source=(unit iwfields) (width-scan actual sub 1 4.096)

5627+ =/ target=(unit iwfields) (width-scan expected sub 1 4.096)

5628+ ?~ source ~

5629+ ?~ target ~

5630+ ?: (lth (lent order.u.source) (lent order.u.target)) ~

5631+ `[u.source u.target]

5632+::

5633+++ width-project

5634+ |= [shape=[source=iwfields target=iwfields] sub=isub next=@ud]

5635+ ^- (unit iwidth-result)

5636+ ?. (width-in-order order.source.shape order.target.shape) ~

5637+ (width-fit-fields index.source.shape order.target.shape sub next)

5638+::

5639+:: Provisional, globally budgeted gate-free proof. %no includes a

5640+:: gate-bearing witness; an uninhabited sibling could invalidate it.

5641+:: Input types must be resolved and normalized under valid substitutions,

5642+:: from trusted source-backed interfaces and reader results. Collection

5643+:: list/unit names rely on their existing identity invariant; this arm

5644+:: does not validate fabricated internal types.

5645++$ igf-segment

5646+ $% [%field name=term]

5647+ [%head ~]

5648+ [%tail ~]

5649+ [%item ~]

5650+ [%case index=@ud]

5651+ ==

5652++$ igate-free [verdict=?(%yes %no %unknown) inhabited=? left=@ud path=(unit (list igf-segment))]

5653+++ gate-free-types

5654+ |= [types=(list itype) fuel=@ud path=(list igf-segment) index=@ud]

5655+ ^- igate-free

5656+ ?~ types [%yes | fuel ~]

5657+ ?: =(0 fuel) [%unknown | 0 ~]

5658+ =/ first=igate-free (gate-free-type i.types fuel [[%case index] path])

5659+ ?: =(%no verdict.first) first

5660+ =/ rest=igate-free $(types t.types, fuel left.first, index +(index))

5661+ ?: =(%no verdict.rest) rest

5662+ =/ inhabited=? |(inhabited.first inhabited.rest)

5663+ ?: |(=(%unknown verdict.first) =(%unknown verdict.rest)) [%unknown inhabited left.rest ~]

5664+ [%yes inhabited left.rest ~]

5665+++ gate-free-type

5666+ |= [typ=itype fuel=@ud path=(list igf-segment)]

5667+ ^- igate-free

5668+ ?: =(0 fuel) [%unknown | 0 ~]

5669+ =. fuel (dec fuel)

5670+ ?- -.typ

5671+ %fn [%no & fuel `(flop path)]

5672+ %atom [%yes & fuel ~]

5673+ %any-atom [%yes & fuel ~]

5674+ %flag [%yes & fuel ~]

5675+ %const [%yes & fuel ~]

5676+ %face $(typ body.typ, path [[%field name.typ] path])

5677+ %cell

5678+ =/ head=igate-free $(typ hed.typ, path [[%head ~] path])

5679+ =/ tail=igate-free $(typ tal.typ, fuel left.head, path [[%tail ~] path])

5680+ =/ inhabited=? &(inhabited.head inhabited.tail)

5681+ ?: &(=(%no verdict.head) inhabited.tail) head(left left.tail)

5682+ ?: &(=(%no verdict.tail) inhabited.head) tail

5683+ ?: |(!=(%yes verdict.head) !=(%yes verdict.tail)) [%unknown inhabited left.tail ~]

5684+ [%yes inhabited left.tail ~]

5685+ %collection

5686+ ?. |(=(%list name.typ) =(%unit name.typ)) [%unknown | fuel ~]

5687+ ?. ?=([* ~] args.typ) [%unknown | fuel ~]

5688+ =/ item=igate-free $(typ i.args.typ, path [[%item ~] path])

5689+ item(inhabited &)

5690+ %union

5691+ ?~ cases.typ [%unknown | fuel ~]

5692+ (gate-free-types cases.typ fuel path 0)

5693+ %noun [%unknown & fuel ~]

5694+ %var [%unknown | fuel ~]

5695+ %avar [%yes & fuel ~]

5696+ %rvar [%yes & fuel ~]

5697+ %nvar [%yes & fuel ~]

5698+ %rnvar [%yes & fuel ~]

5699+ %tag [%unknown | fuel ~]

5700+ %recursive [%unknown | fuel ~]

5701+ %jrec [%yes & fuel ~]

5702+ %grec [%unknown | fuel ~]

5703+ ==

5704+::

5705++$ igate-prelude-evidence [iface=ifile gates=(map term def)]

5706++$ 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)])]

52565707+$ idiag [msg=tape sites=(list [at=span note=tape])]

52575708+$ iresult (each [typ=itype state=istate] idiag)

52585709+$ isample-result (each [typ=itype env=ienv state=istate] tape)

@@ -5272,6 +5723,7 @@

52725723 |= [t=itype sub=isub]

52735724 ^- itype

52745725 =. t (itype-walk t sub)

5726+ ?: ?=(%grec -.t) t(args (turn args.t |=(c=itype (itype-normalize c sub))))

52755727 ?: ?=(%collection -.t) [%collection name.t (turn args.t |=(c=itype (itype-normalize c sub)))]

52765728 ?: ?=(%union -.t)

52775729 [%union (turn cases.t |=(c=itype (itype-normalize c sub))) origin.t label.t (turn args.t |=(c=itype (itype-normalize c sub)))]

@@ -5288,6 +5740,8 @@

52885740:: generalize an aura from its sample, which requires constraint analysis

52895741:: beyond this fragment; leave those cases unresolved.

52905742::

5743+:: This helper only controls decimal defaulting in visible types. A noun

5744+:: may contain gates and is not proof of a gate-free value.

52915745++ itype-has-gate

52925746 |= t=itype

52935747 ^- ?

@@ -5295,6 +5749,8 @@

52955749 %fn &

52965750 %cell |($(t hed.t) $(t tal.t))

52975751 %recursive |

5752+ %jrec |

5753+ %grec &

52985754 %collection (lien args.t |=(c=itype (itype-has-gate c)))

52995755 %face $(t body.t)

53005756 %union (lien cases.t |=(c=itype (itype-has-gate c)))

@@ -5302,10 +5758,13 @@

53025758 %const |

53035759 %var |

53045760 %avar |

5761+ %rvar |

53055762 %nvar |

5763+ %rnvar |

53065764 %atom |

53075765 %any-atom |

53085766 %flag |

5767+ %noun |

53095768 ==

53105769::

53115770++ default-decimals

@@ -5314,26 +5773,135 @@

53145773 ?: (itype-has-gate t) t

53155774 ?- -.t

53165775 %nvar [%atom %ud]

5776+ %rnvar [%atom %ud]

5777+ %grec t(args (turn args.t |=(c=itype (default-decimals c))))

53175778 %collection [%collection name.t (turn args.t |=(c=itype (default-decimals c)))]

53185779 %face [%face name.t $(t body.t)]

53195780 %cell [%cell $(t hed.t) $(t tal.t)]

53205781 * t

53215782 ==

53225783::

5784+:: A hole is solved only by a fully determined type or a written

5785+:: in-scope type variable. Ordinary fresh variables are not evidence.

5786+:: Compare representatives after substitution, since unification can

5787+:: orient a written capital toward the hole rather than the reverse.

5788+++ hole-variable-id

5789+ |= t=itype

5790+ ^- (unit @ud)

5791+ ?- -.t

5792+ %var `id.t

5793+ %avar `id.t

5794+ %rvar `id.t

5795+ %nvar `id.t

5796+ %rnvar `id.t

5797+ %tag `id.t

5798+ * ~

5799+ ==

5800+++ hole-same-variable

5801+ |= [a=itype b=itype]

5802+ ^- ?

5803+ =/ x=(unit @ud) (hole-variable-id a)

5804+ ?~ x |

5805+ =/ y=(unit @ud) (hole-variable-id b)

5806+ ?~ y |

5807+ =(u.x u.y)

5808+++ hole-known

5809+ |= [t=itype state=istate]

5810+ ^- ?

5811+ =. t (itype-walk t sub.state)

5812+ ?- -.t

5813+ ?(%var %avar %rvar %nvar %rnvar)

5814+ ?: (lien caps.state |=(c=icap (hole-same-variable t (itype-walk [%var id.c] sub.state)))) &

5815+ (lien params.state |=(p=[name=@t typ=itype] (hole-same-variable t (itype-walk typ.p sub.state))))

5816+ %tag |

5817+ %any-atom &

5818+ %union &((levy cases.t |=(c=itype (hole-known c state))) (levy args.t |=(c=itype (hole-known c state))))

5819+ %grec (levy args.t |=(c=itype (hole-known c state)))

5820+ %collection (levy args.t |=(c=itype (hole-known c state)))

5821+ %face $(t body.t)

5822+ %fn &($(t sample.t) $(t product.t))

5823+ %cell &($(t hed.t) $(t tal.t))

5824+ * &

5825+ ==

5826+++ promote-restricted-numbers

5827+ |= [state=istate env=ienv]

5828+ ^- istate

5829+ :: With no written capitals, there is nothing to promote.

5830+ ?~ caps.state state

5831+ =/ ids=(list @ud) (turn caps.state |=(c=icap id.c))

5832+ =/ free=(list @ud) (free-env-vars env sub.state)

5833+ |-

5834+ ?~ ids state

5835+ =/ t=itype (itype-walk [%var i.ids] sub.state)

5836+ ?: &(?=(%rnvar -.t) !(lien free |=(n=@ud =(n +.t))))

5837+ $(ids t.ids, state state(sub [[+.t [%rvar +.t]] sub.state]))

5838+ $(ids t.ids)

5839+::

5840+++ default-hole-numbers

5841+ |= [all=(list ihole) prior=(list ihole) state=istate env=ienv permit=?]

5842+ ^- istate

5843+ :: Do not default a named capital or a variable captured from env.

5844+ ?. permit state

5845+ ?: =(all prior) state

5846+ ?~ all state

5847+ =/ t=itype (itype-walk [%var id.i.all] sub.state)

5848+ =/ free=(list @ud) (free-env-vars env sub.state)

5849+ =? state &(?=(?(%nvar %rnvar) -.t) !(hole-known t state) !(lien free |=(id=@ud =(id id.t))))

5850+ state(sub [[id.t [%atom %ud]] sub.state])

5851+ $(all t.all)

5852+::

5853+:: Only obligations created inside this definition belong to it.

5854+++ holes-created

5855+ |= [all=(list ihole) prior=(list ihole)]

5856+ ^- (list ihole)

5857+ ?: =(all prior) ~

5858+ ?~ all ~

5859+ [i.all $(all t.all)]

5860+++ hole-uncertain

5861+ |= [t=itype state=istate]

5862+ ^- ?

5863+ =. t (itype-walk t sub.state)

5864+ ?- -.t

5865+ ?(%tag %nvar %rnvar %avar %rvar) !(hole-known t state)

5866+ %union |((lien cases.t |=(c=itype (hole-uncertain c state))) (lien args.t |=(c=itype (hole-uncertain c state))))

5867+ %grec (lien args.t |=(c=itype (hole-uncertain c state)))

5868+ %collection (lien args.t |=(c=itype (hole-uncertain c state)))

5869+ %face $(t body.t)

5870+ %fn |($(t sample.t) $(t product.t))

5871+ %cell |($(t hed.t) $(t tal.t))

5872+ * |

5873+ ==

5874+::

5875+++ unresolved-hole

5876+ |= [all=(list ihole) prior=(list ihole) state=istate]

5877+ ^- (unit idiag)

5878+ =/ work=(list ihole) (flop (holes-created all prior))

5879+ |-

5880+ ?~ work ~

5881+ ?: (hole-known [%var id.i.work] state) $(work t.work)

5882+ ?: (hole-uncertain [%var id.i.work] state)

5883+ `["type hole needs unsupported inference" ~[[at.i.work "type hole"]]]

5884+ `["type hole needs a determined type" ~[[at.i.work "unresolved type hole"]]]

5885+::

53235886++ itype-vars

53245887 |= t=itype

53255888 ^- (list @ud)

53265889 ?- -.t

53275890 %var ~[id.t]

53285891 %avar ~[id.t]

5892+ %rvar ~[id.t]

53295893 %nvar ~[id.t]

5894+ %rnvar ~[id.t]

53305895 %atom ~

53315896 %any-atom ~

53325897 %flag ~

5898+ %noun ~

53335899 %tag ~

53345900 %const ~

53355901 %union (zing (turn (weld args.t cases.t) |=(c=itype (itype-vars c))))

53365902 %recursive ~

5903+ %jrec ~

5904+ %grec (zing (turn args.t |=(c=itype (itype-vars c))))

53375905 %collection (zing (turn args.t |=(c=itype (itype-vars c))))

53385906 %face $(t body.t)

53395907 %fn (weld $(t sample.t) $(t product.t))

@@ -5361,17 +5929,28 @@

53615929 =/ found=(unit itype) (itype-lookup id.t ren)

53625930 ?~ found t

53635931 u.found

5932+ %rvar

5933+ =/ found=(unit itype) (itype-lookup id.t ren)

5934+ ?~ found t

5935+ u.found

53645936 %nvar

53655937 =/ found=(unit itype) (itype-lookup id.t ren)

53665938 ?~ found t

53675939 u.found

5940+ %rnvar

5941+ =/ found=(unit itype) (itype-lookup id.t ren)

5942+ ?~ found t

5943+ u.found

53685944 %atom t

53695945 %any-atom t

53705946 %flag t

5947+ %noun t

53715948 %tag t

53725949 %const t

53735950 %union [%union (turn cases.t |=(c=itype (itype-rename c ren))) origin.t label.t (turn args.t |=(c=itype (itype-rename c ren)))]

53745951 %recursive t

5952+ %jrec t

5953+ %grec t(args (turn args.t |=(c=itype (itype-rename c ren))))

53755954 %collection [%collection name.t (turn args.t |=(c=itype (itype-rename c ren)))]

53765955 %face [%face name.t $(t body.t)]

53775956 %fn [%fn $(t sample.t) $(t product.t)]

@@ -5387,19 +5966,48 @@

53875966 ?- -.t

53885967 %var |

53895968 %avar =(n id.t)

5969+ %rvar =(n id.t)

53905970 %nvar =(n id.t)

5971+ %rnvar =(n id.t)

53915972 %atom |

53925973 %any-atom |

53935974 %flag |

5975+ %noun |

53945976 %tag |

53955977 %const |

53965978 %union |((lien cases.t |=(c=itype (itype-var-is-atom n c))) (lien args.t |=(c=itype (itype-var-is-atom n c))))

53975979 %recursive |

5980+ %jrec |

5981+ %grec (lien args.t |=(c=itype (itype-var-is-atom n c)))

53985982 %collection (lien args.t |=(c=itype (itype-var-is-atom n c)))

53995983 %face $(t body.t)

54005984 %fn |($(t sample.t) $(t product.t))

54015985 %cell |($(t hed.t) $(t tal.t))

54025986 ==

5987+++ itype-var-is-restricted

5988+ |= [n=@ud t=itype]

5989+ ^- ?

5990+ ?- -.t

5991+ %var |

5992+ %avar |

5993+ %rvar =(n id.t)

5994+ %nvar |

5995+ %rnvar |

5996+ %atom |

5997+ %any-atom |

5998+ %flag |

5999+ %noun |

6000+ %tag |

6001+ %const |

6002+ %union |((lien cases.t |=(c=itype (itype-var-is-restricted n c))) (lien args.t |=(c=itype (itype-var-is-restricted n c))))

6003+ %recursive |

6004+ %jrec |

6005+ %grec (lien args.t |=(c=itype (itype-var-is-restricted n c)))

6006+ %collection (lien args.t |=(c=itype (itype-var-is-restricted n c)))

6007+ %face $(t body.t)

6008+ %fn |($(t sample.t) $(t product.t))

6009+ %cell |($(t hed.t) $(t tal.t))

6010+ ==

54036011::

54046012:: Canonical numbering makes printed variables independent of the order

54056013:: the unifier happened to allocate intermediates.

@@ -5411,7 +6019,7 @@

54116019 =/ n=@ud 0

54126020 |-

54136021 ?~ vars (itype-rename t ren)

5414− =/ replacement=itype ?:((itype-var-is-atom i.vars t) [%avar n] [%var n])

6022+ =/ replacement=itype ?:((itype-var-is-restricted i.vars t) [%rvar n] ?:((itype-var-is-atom i.vars t) [%avar n] [%var n]))

54156023 $(vars t.vars, ren [[i.vars replacement] ren], n +(n))

54166024::

54176025++ instantiate-scheme

@@ -5422,11 +6030,11 @@

54226030 |-

54236031 ?~ vars [(itype-rename typ.scheme ren) state]

54246032 =/ replacement=itype

5425− ?:((itype-var-is-atom i.vars typ.scheme) [%avar next.state] [%var next.state])

6033+ ?:((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]))

54266034 :: A generalized atom variable is a valid origin for re-generalizing

54276035 :: an alias, just as a sample binder is.

54286036 =/ st=istate state(next +(next.state))

5429− =? binders.st ?=(%avar -.replacement) [next.state binders.state]

6037+ =? binders.st |(?=(%avar -.replacement) ?=(%rvar -.replacement)) [next.state binders.state]

54306038 $(vars t.vars, ren [[i.vars replacement] ren], state st)

54316039::

54326040++ icap-lookup

@@ -5497,6 +6105,11 @@

54976105 ?. ?=([%ref @ @] node) ~

54986106 ?. &(=(module +<.node) =(name +>.node)) ~

54996107 `[[%unknown ~] &]

6108+ %apply

6109+ ?. ?=([%apply %list [* ~]] node) ~

6110+ =/ item $(node -.+>.node)

6111+ ?~ item ~

6112+ `[[%or ~[[%atom `0] [%cell pat.u.item [%unknown ~]]]] has.u.item]

55006113 %face

55016114 ?. ?=([%face @ *] node) ~

55026115 ?. (jibb-face-name +<.node) ~

@@ -5551,6 +6164,10 @@

55516164 %cell ?:(?=([%cell * *] node) (imported-record-faces-valid node ~) |)

55526165 %fork (imported-faces-valid-list +.node)

55536166 %apply ?:(?=([%apply @ *] node) (imported-faces-valid-list +>.node) |)

6167+ %named

6168+ ?. ?=([%named @ @ *] node) |

6169+ =/ n=[%named module=@ name=@ body=*] ;;([%named module=@ name=@ body=*] node)

6170+ (imported-faces-valid body.n)

55546171 ==

55556172::

55566173++ imported-faces-valid-list

@@ -5582,7 +6199,19 @@

55826199 ^- (unit itype)

55836200 ?@ node ~

55846201 ?+ -.node ~

6202+ %noun ?:(=(node [%noun ~]) `[%noun ~] ~)

55856203 %atom

6204+ :: A Hoon loobean singleton is one of the two Jibb loobeans.

6205+ ?: ?=([%atom %f [~ @]] node)

6206+ =/ value=@ +>+.node

6207+ ?. |(=(value 0) =(value 1)) ~

6208+ =/ printed=@t ?:(=(value 0) '%.y' '%.n')

6209+ `[%const [%loobean %f value printed]]

6210+ :: Hoon's null singleton is the same noun as Jibb's `~` mold.

6211+ :: Other non-term singleton atoms remain unsupported here.

6212+ ?: ?=([%atom %n [~ @]] node)

6213+ ?. =(0 +>+.node) ~

6214+ `[%const [%null %n 0 '~']]

55866215 ?: ?=([%atom %tas [~ @]] node)

55876216 =/ value=@ +>+.node

55886217 ?. |(=(value 0) (jibb-face-name value)) ~

@@ -5592,6 +6221,15 @@

55926221 =/ aura=@ta (@ta +<.node)

55936222 ?. |(?=(?(%u %ud %ux %uv %t %ta %tas %p %da %dr) aura) =('tD' aura)) ~

55946223 `[%atom aura]

6224+ %named

6225+ ?. ?=([%named @ @ *] node) ~

6226+ =/ n=[%named module=@ name=@ body=*] ;;([%named module=@ name=@ body=*] node)

6227+ ?. &((jibb-face-name module.n) (jibb-face-name name.n)) ~

6228+ ?. ?=([%fork *] body.n) ~

6229+ =/ proof=(unit irec-pattern) (rec-pattern body.n (@tas module.n) (@tas name.n))

6230+ ?~ proof ~

6231+ ?. has.u.proof ~

6232+ `[%recursive (@tas module.n) (@tas name.n) `(crip "{(trip name.n)}.{(trip module.n)}")]

55956233 %apply

55966234 ?. ?=([%apply @ *] node) ~

55976235 =/ name=term (@tas +<.node)

@@ -5605,10 +6243,15 @@

56056243 ?. =(arity (lent u.args)) ~

56066244 `[%collection name u.args]

56076245 %fork

5608− =/ cases=(unit (list itype)) (import-to-itypes +.node)

6246+ :: Hoon's ordinary ? mold is the fork of its two %f singletons.

6247+ =/ raw=* +.node

6248+ ?: |(=(raw ~[[%atom %f `0] [%atom %f `1]]) =(raw ~[[%atom %f `1] [%atom %f `0]]))

6249+ `[%flag ~]

6250+ =/ cases=(unit (list itype)) (import-to-itypes raw)

56096251 ?~ cases ~

56106252 ?~ u.cases ~

56116253 ?~ t.u.cases ~

6254+ ?: (import-has-loobean-singleton u.cases) ~

56126255 ?. (import-cases-disjoint u.cases) ~

56136256 `[%union u.cases ~ ~ ~]

56146257 %face

@@ -5627,6 +6270,20 @@

56276270 `[%cell u.left u.right]

56286271 ==

56296272::

6273+++ import-direct-loobean

6274+ |= t=itype

6275+ ^- ?

6276+ ?: ?=(%face -.t) $(t body.t)

6277+ ?: ?=(%union -.t) (import-has-loobean-singleton cases.t)

6278+ ?=([%const [%loobean *]] t)

6279+::

6280+++ import-has-loobean-singleton

6281+ |= cases=(list itype)

6282+ ^- ?

6283+ ?~ cases |

6284+ ?: (import-direct-loobean i.cases) &

6285+ $(cases t.cases)

6286+::

56306287++ import-to-itypes

56316288 |= nodes=*

56326289 ^- (unit (list itype))

@@ -5641,7 +6298,9 @@

56416298 |= typ=itype

56426299 ^- upat

56436300 ?- -.typ

6301+ %noun [%all ~]

56446302 %atom [%atom ~]

6303+ %flag [%or ~[[%atom `0] [%atom `1]]]

56456304 %const [%atom `val.literal.typ]

56466305 %face $(typ body.typ)

56476306 %cell [%cell $(typ hed.typ) $(typ tal.typ)]

@@ -5736,25 +6395,85 @@

57366395 ?:(=(`origin origin.typ.template) `name.i.molds $(molds t.molds))

57376396 $(molds t.molds)

57386397::

5739−:: Only names exported by this directly imported module are visible through

5740−:: its face. Other origins retain identity but print as unnamed unions.

6398+:: A prelude union alias is a display name, not a new union identity. An

6399+:: identity-generic alias can carry the origin's arguments only when the

6400+:: origin, arity and ordered parameters match. Swapped, repeated, fixed

6401+:: or phantom parameters cannot be printed that way and remain unsupported

6402+:: when their only available name is private. A nongeneric alias of a

6403+:: generic instantiation cannot be printed with the origin's arguments.

6404+++ identity-union-parameters

6405+ |= [vars=(list @ud) args=(list itype)]

6406+ ^- ?

6407+ ?~ vars ?=(~ args)

6408+ ?~ args |

6409+ ?. =([%var i.vars] i.args) |

6410+ $(vars t.vars, args t.args)

6411+++ prelude-union-alias

6412+ |= [origin=[at=path name=term] args=(list itype) molds=imold-types]

6413+ ^- (unit term)

6414+ ?~ molds ~

6415+ =/ template=ischeme template.i.molds

6416+ ?. ?=(%union -.typ.template) $(molds t.molds)

6417+ ?. =(`origin origin.typ.template) $(molds t.molds)

6418+ ?~ vars.template

6419+ ?^ args $(molds t.molds)

6420+ ?:(=(args args.typ.template) `name.i.molds $(molds t.molds))

6421+ ?: &((identity-union-parameters vars.template args.typ.template) =((lent vars.template) (lent args)))

6422+ `name.i.molds

6423+ $(molds t.molds)

6424+::

6425+:: Names exported by the directly imported module are visible through its

6426+:: face; a matching prelude alias is also visible without a qualifier.

6427+::

6428+++ jrec-alias

6429+ |= [origin=path name=term molds=imold-types]

6430+ ^- (unit term)

6431+ ?~ molds ~

6432+ =/ template=ischeme template.i.molds

6433+ ?: &(?=(~ vars.template) ?=(%jrec -.typ.template) =(at.typ.template origin) =(name.typ.template name)) `name.i.molds

6434+ $(molds t.molds)

6435+::

6436+++ grec-visible-alias

6437+ |= [origin=path name=term proof=shape args=(list itype) molds=imold-types]

6438+ ^- (unit term)

6439+ ?~ molds ~

6440+ =/ template=ischeme template.i.molds

6441+ ?. ?=(%grec -.typ.template) $(molds t.molds)

6442+ ?. &(=(at.typ.template origin) =(name.typ.template name) =(proof.typ.template proof)) $(molds t.molds)

6443+ ?. &((identity-union-parameters vars.template args.typ.template) =((lent vars.template) (lent args))) $(molds t.molds)

6444+ `name.i.molds

57416445::

57426446++ itype-in-import

5743− |= [t=itype iface=ifile face=term]

6447+ |= [t=itype iface=ifile face=term prelude=(unit ifile)]

57446448 ^- itype

57456449 ?- -.t

57466450 %union

57476451 =/ label=(unit @t)

57486452 ?~ origin.t ~

57496453 ?: =(at.u.origin.t /lib/jibb/prelude/jibb) `name.u.origin.t

6454+ =/ public=(unit term)

6455+ ?~ prelude ~

6456+ (prelude-union-alias u.origin.t args.t molds.u.prelude)

6457+ ?^ public `u.public

57506458 =/ alias=(unit term) ~

57516459 =? alias &(=(at.u.origin.t at.iface) ?=(^ (find-jibb-mold name.u.origin.t iface))) `name.u.origin.t

57526460 =? alias ?=(~ alias) (imported-union-alias u.origin.t molds.iface)

57536461 ?~ alias ~

57546462 `(crip "{(trip u.alias)}.{(trip face)}")

5755− [%union (turn cases.t |=(c=itype (itype-in-import c iface face))) origin.t label (turn args.t |=(c=itype (itype-in-import c iface face)))]

6463+ [%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)))]

57566464 %recursive [%recursive module.t name.t ~]

5757− %collection [%collection name.t (turn args.t |=(c=itype (itype-in-import c iface face)))]

6465+ %grec

6466+ =/ public=(unit term) ?~(prelude ~ (grec-visible-alias at.t name.t proof.t args.t molds.u.prelude))

6467+ =/ alias=(unit term) ?~(public (grec-visible-alias at.t name.t proof.t args.t molds.iface) public)

6468+ =/ label=(unit @t) ?~(alias ~ ?~(public `(crip "{(trip u.alias)}.{(trip face)}") `u.alias))

6469+ t(label label, args (turn args.t |=(c=itype (itype-in-import c iface face prelude))))

6470+ %jrec

6471+ =/ public=(unit term) ?~(prelude ~ (jrec-alias at.t name.t molds.u.prelude))

6472+ ?^ public t(label `u.public)

6473+ =/ alias=(unit term) (jrec-alias at.t name.t molds.iface)

6474+ ?~ alias t(label ~)

6475+ t(label `(crip "{(trip u.alias)}.{(trip face)}"))

6476+ %collection [%collection name.t (turn args.t |=(c=itype (itype-in-import c iface face prelude)))]

57586477 %face [%face name.t $(t body.t)]

57596478 %fn [%fn $(t sample.t) $(t product.t)]

57606479 %cell [%cell $(t hed.t) $(t tal.t)]

@@ -5827,9 +6546,66 @@

58276546 =/ rest=[params=iparams vars=(list @ud) next=@ud] $(names t.names, next +(next))

58286547 [[[i.names [%var next]] params.rest] [next vars.rest] next.rest]

58296548::

6549+:: Recognize a unique top-level source mold with exactly a null case and a

6550+:: faced atom-headed cell whose faced tail names that same mold. Its Jibb

6551+:: path and name provide nominal identity. Other recursive shapes fail closed;

6552+:: construction and matching expose the proven shape one layer at a time.

6553+++ simple-source-recursive

6554+ |= [name=term sh=shape state=istate]

6555+ ^- (unit itype)

6556+ ?. (lien top-molds.state |=(n=term =(n name))) ~

6557+ =/ original=(unit shape) (find-simple-mold name molds.state)

6558+ ?~ original ~

6559+ ?. =(u.original sh) ~

6560+ ?. ?=(%union -.sh) ~

6561+ =/ cs=(list shape) cases.sh

6562+ ?~ cs ~

6563+ ?~ t.cs ~

6564+ ?^ t.t.cs ~

6565+ ?. ?=(%const -.i.cs) ~

6566+ ?. =(%null form.lit.i.cs) ~

6567+ ?. ?=(%cell -.i.t.cs) ~

6568+ =/ fs=(list field) fields.i.t.cs

6569+ ?~ fs ~

6570+ ?~ t.fs ~

6571+ ?^ t.t.fs ~

6572+ ?. ?=(%face -.i.fs) ~

6573+ ?. ?=(%aura -.shape.i.fs) ~

6574+ ?. !=(0 aura.shape.i.fs) ~

6575+ ?. ?=(%face -.i.t.fs) ~

6576+ ?. !=(name.i.fs name.i.t.fs) ~

6577+ =/ tail=shape shape.i.t.fs

6578+ ?. ?=(%ref -.tail) ~

6579+ ?. =(names.tail ~[name]) ~

6580+ `[%jrec at.state name `name name.i.fs aura.shape.i.fs name.i.t.fs]

6581+::

6582+++ simple-source-generic-recursive

6583+ |= [name=term sh=shape args=(list itype) state=istate]

6584+ ^- (unit itype)

6585+ ?. ?=(%generic -.sh) ~

6586+ ?. ?=([@ ~] vars.sh) ~

6587+ ?. ?=([* ~] args) ~

6588+ ?~ grec-index.state ~

6589+ ?. =(at.u.grec-index.state at.state) ~

6590+ ?~ prelude.state ~

6591+ ?. =(prelude.u.grec-index.state u.prelude.state) ~

6592+ =/ proof=(unit shape) (~(get by shapes.u.grec-index.state) name)

6593+ ?~ proof ~

6594+ ?. =(u.proof sh) ~

6595+ `[%grec at.state name `name sh args]

6596+::

6597+

58306598++ infer-mold-template

58316599 |= [sh=shape state=istate]

58326600 ^- (unit [template=ischeme state=istate])

6601+ =/ generic=(unit itype)

6602+ ?. ?=([@ ~] active.state) ~

6603+ (simple-source-generic-recursive i.active.state sh ~[[%var next.state]] state)

6604+ ?^ generic `[[u.generic ~[next.state]] state(next +(next.state))]

6605+ =/ direct=(unit itype)

6606+ ?. ?=([@ ~] active.state) ~

6607+ (simple-source-recursive i.active.state sh state)

6608+ ?^ direct `[[u.direct ~] state]

58336609 ?: ?=(%generic -.sh)

58346610 ?~ vars.sh ~

58356611 ?. (distinct-params vars.sh) ~

@@ -5837,17 +6613,19 @@

58376613 =/ out=(unit [typ=itype state=istate])

58386614 (infer-simple-shape body.sh state(next next.fresh, params params.fresh, in-mold &))

58396615 ?~ out ~

6616+ ?^ (unresolved-hole holes.state.u.out holes.state state.u.out) ~

58406617 ?: &(?=(%union -.typ.u.out) !?=(%union -.body.sh) ?=(~ origin.typ.u.out)) ~

58416618 =? typ.u.out &(?=(%union -.typ.u.out) ?=(%union -.body.sh))

58426619 typ.u.out(args (turn vars.fresh |=(n=@ud `itype`[%var n])))

58436620 =/ used=(list @ud) (itype-vars typ.u.out)

58446621 ?. (levy used |=(n=@ud (lien vars.fresh |=(p=@ud =(p n))))) ~

5845− `[[typ.u.out vars.fresh] state.u.out(params params.state, in-mold in-mold.state)]

6622+ `[[typ.u.out vars.fresh] state.u.out(params params.state, in-mold in-mold.state, holes holes.state)]

58466623 =/ out=(unit [typ=itype state=istate])

58476624 (infer-simple-shape sh state(params ~, in-mold &))

58486625 ?~ out ~

6626+ ?^ (unresolved-hole holes.state.u.out holes.state state.u.out) ~

58496627 ?: ?=(^ (itype-vars typ.u.out)) ~

5850− `[[typ.u.out ~] state.u.out(params params.state, in-mold in-mold.state)]

6628+ `[[typ.u.out ~] state.u.out(params params.state, in-mold in-mold.state, holes holes.state)]

58516629::

58526630:: A direct imported reference may carry definite reader evidence. Only

58536631:: uniquely supplied, declared inputs are used; unsupported data stay generic.

@@ -5881,7 +6659,7 @@

58816659 ?~ found ~

58826660 ?^ t.found ~

58836661 result.i.found

5884− ?. ?=([%invalid ?(%aura %core) @] raw) ~

6662+ ?. ?=([%invalid ?(%aura %core %overlap) @] raw) ~

58856663 `["{(trip +>.raw)}" ~[[at.sh "invalid imported mold"]]]

58866664::

58876665:: Replay only the shape branches whose evaluation order we can prove.

@@ -5950,12 +6728,15 @@

59506728 |= [sh=shape state=istate]

59516729 ^- (unit [typ=itype state=istate])

59526730 ?- -.sh

6731+ %hole `[[%var next.state] state(next +(next.state), holes [[next.state at.sh] holes.state])]

59536732 %aura

59546733 ?: =(0 aura.sh) `[[%any-atom ~] state]

59556734 `[[%atom aura.sh] state]

59566735 %flag `[[%flag ~] state]

6736+ %noun `[[%noun ~] state]

59576737 %const

5958− ?. |(=(%term form.lit.sh) =(%null form.lit.sh)) ~

6738+ ?. |(=(%term form.lit.sh) =(%null form.lit.sh) =(%loobean form.lit.sh)) ~

6739+ ?: &(=(%loobean form.lit.sh) !|(=(0 val.lit.sh) =(1 val.lit.sh))) ~

59596740 `[[%const lit.sh] state]

59606741 %union

59616742 =/ pairs=(list upair) (union-pairs cases.sh molds.state)

@@ -5980,7 +6761,7 @@

59806761 =/ found=(unit ischeme) (find-jibb-mold n u.iface)

59816762 ?~ found ~

59826763 ?^ vars.u.found ~

5983− `[(itype-in-import typ.u.found u.iface i.t.names.sh) state]

6764+ `[(itype-in-import typ.u.found u.iface i.t.names.sh prelude.state) state]

59846765 =/ found=(unit itype)

59856766 (find-imported-mold i.t.names.sh n externals.state surs.state)

59866767 ?~ found ~

@@ -5999,10 +6780,13 @@

59996780 ?~ prelude-entry ~

60006781 ?^ vars.u.prelude-entry ~

60016782 `[typ.u.prelude-entry state]

6783+ =/ direct=(unit itype) (simple-source-recursive n u.found state)

6784+ ?^ direct `[u.direct state]

60026785 =/ out=(unit [typ=itype state=istate])

60036786 $(sh u.found, state state(active [n active.state], in-mold &, params ~))

60046787 ?~ out ~

6005− `[(label-direct-union typ.u.out u.found n state) state.u.out(active active.state, in-mold in-mold.state, params params.state)]

6788+ ?^ (unresolved-hole holes.state.u.out holes.state state.u.out) ~

6789+ `[(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)]

60066790 %apply

60076791 ?~ ref.sh ~

60086792 =/ args=(unit [types=(list itype) state=istate]) (infer-shape-args args.sh state)

@@ -6017,7 +6801,7 @@

60176801 ?~ vars.u.template ~

60186802 =/ applied=(unit itype) (template-apply u.template types.u.args)

60196803 ?~ applied ~

6020− `[(itype-in-import u.applied u.iface i.t.ref.sh) state.u.args]

6804+ `[(itype-in-import u.applied u.iface i.t.ref.sh prelude.state.u.args) state.u.args]

60216805 ?: (lien active.state.u.args |=(x=term =(x n))) ~

60226806 =/ found=(unit shape) (find-simple-mold n molds.state.u.args)

60236807 ?~ found

@@ -6030,17 +6814,20 @@

60306814 ?~ applied ~

60316815 `[u.applied state.u.args]

60326816 ?. ?=(%generic -.u.found) ~

6817+ =/ grec=(unit itype) (simple-source-generic-recursive n u.found types.u.args state.u.args)

6818+ ?^ grec `[u.grec state.u.args]

60336819 ?. (distinct-params vars.u.found) ~

60346820 =/ params=(unit iparams) (bind-params vars.u.found types.u.args)

60356821 ?~ params ~

60366822 =/ out=(unit [typ=itype state=istate])

60376823 $(sh body.u.found, state state.u.args(active [n active.state.u.args], in-mold &, params u.params))

60386824 ?~ out ~

6825+ ?^ (unresolved-hole holes.state.u.out holes.state.u.args state.u.out) ~

60396826 ?: &(?=(%union -.typ.u.out) !?=(%union -.body.u.found) ?=(~ origin.typ.u.out)) ~

60406827 ?: &(?=(%union -.typ.u.out) ?=(%union -.body.u.found) !(lien top-molds.state.u.args |=(x=term =(x n)))) ~

60416828 =? typ.u.out &(?=(%union -.typ.u.out) ?=(%union -.body.u.found))

60426829 (label-direct-union typ.u.out(args types.u.args) u.found n state.u.args)

6043− `[typ.u.out state.u.out(active active.state.u.args, in-mold in-mold.state.u.args, params params.state.u.args)]

6830+ `[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)]

60446831 %tvar

60456832 =/ param=(unit itype) (iparam-lookup name.sh params.state)

60466833 ?^ param `[u.param state]

@@ -6080,12 +6867,12 @@

60806867 ^- isample-result

60816868 ?- -.s

60826869 %bind

6083− ?: |(?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

6870+ ?: |(=(name.s %proj) ?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

60846871 [%| "sample shadows a name"]

60856872 =/ t=itype [%var next.state]

60866873 [%& t [[name.s [t ~]] env] state(next +(next.state), binders [next.state binders.state])]

60876874 %face

6088− ?: |(?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

6875+ ?: |(=(name.s %proj) ?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

60896876 [%| "sample shadows a name"]

60906877 =/ t=(unit [typ=itype state=istate]) (infer-simple-shape shape.s state)

60916878 ?~ t [%| "sample mold is not supported by partial inference"]

@@ -6123,8 +6910,8 @@

61236910 [%& [%cell ht typ.p.tail] env.p.tail state.p.tail]

61246911::

61256912:: Local definitions generalize only variables outside their enclosing

6126−:: environment and explicit-capital scope. Single self-recursive gates

6127−:: use a monomorphic placeholder; mutually recursive groups stay unsupported.

6913+:: environment and explicit-capital scope. Recursive gate groups use

6914+:: monomorphic placeholders while their bodies are checked.

61286915::

61296916+$ ilocal-result (each [env=ienv state=istate] idiag)

61306917++ free-env-vars

@@ -6153,6 +6940,7 @@

61536940 |-

61546941 ?~ ds &

61556942 ?: ?=(%mold -.i.ds) $(ds t.ds)

6943+ ?: =(name.i.ds %proj) |

61566944 ?. (unique-value-name name.i.ds names) |

61576945 ?: ?=(^ (ienv-lookup name.i.ds env)) |

61586946 ?: (lien globals.state |=(n=term =(n name.i.ds))) |

@@ -6176,6 +6964,7 @@

61766964 |-

61776965 ?~ locals &

61786966 =/ n=term name.i.locals

6967+ ?: =(n %proj) |

61796968 ?. (unique-value-name n names) |

61806969 ?: (lien molds.state |=(m=[name=term body=shape] =(n name.m))) |

61816970 ?: (lien marks.state |=(m=term =(n m))) |

@@ -6340,7 +7129,13 @@

63407129 |-

63417130 ?~ ds

63427131 ?~ remaining [%& env state]

6343− ?. progressed [%| ["local definitions need unsupported inference" ~]]

7132+ ?. progressed

7133+ =/ pending=(list def) (flop remaining)

7134+ =/ groups=icomponents (graph-components pending (global-value-names pending))

7135+ =/ grouped=(unit [rest=(list def) env=ienv state=istate])

7136+ (try-local-group pending groups env state)

7137+ ?~ grouped [%| ["local definitions need unsupported inference" ~]]

7138+ $(ds rest.u.grouped, remaining ~, env env.u.grouped, state state.u.grouped, progressed |)

63447139 $(ds (flop remaining), remaining ~, progressed |)

63457140 =/ d=def i.ds

63467141 ?> ?=(%value -.d)

@@ -6349,6 +7144,10 @@

63497144 =/ retried=? ?=(%| -.inferred)

63507145 =? inferred retried (infer-recursive-gate d env local-state)

63517146 ?: ?=(%| -.inferred) $(ds t.ds, remaining [d remaining])

7147+ =. state.p.inferred (promote-restricted-numbers state.p.inferred env)

7148+ =. 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)))

7149+ =/ hole=(unit idiag) (unresolved-hole holes.state.p.inferred holes.state state.p.inferred)

7150+ ?^ hole [%| u.hole]

63527151 =/ merged=(unit [first=icap second=icap])

63537152 (merged-capitals caps.state.p.inferred sub.state.p.inferred)

63547153 ?^ merged

@@ -6364,7 +7163,28 @@

63647163 (weld (free-env-vars env sub.state.p.inferred) (free-cap-vars caps.state sub.state.p.inferred))

63657164 =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

63667165 =. vars (skim vars |=(n=@ud !(lien free |=(f=@ud =(f n)))))

6367− $(ds t.ds, env [[name.d [typ vars]] env], state state.p.inferred(caps caps.state), progressed &)

7166+ $(ds t.ds, env [[name.d [typ vars]] env], state state.p.inferred(caps caps.state, holes holes.state), progressed &)

7167+::

7168+:: Try complete cyclic local groups after individual definitions stall.

7169+:: Components with non-gates or unresolved constraints stay unavailable.

7170+::

7171+++ try-local-group

7172+ |= [ds=(list def) groups=icomponents env=ienv state=istate]

7173+ ^- (unit [rest=(list def) env=ienv state=istate])

7174+ ?~ groups ~

7175+ =/ names=(list term) i.groups

7176+ ?. (gth (lent names) 1) $(groups t.groups)

7177+ =/ members=(list def)

7178+ (skim ds |=(d=def &(?=(%value -.d) (lien names |=(n=term =(n name.d))))))

7179+ ?. =((lent members) (lent names)) $(groups t.groups)

7180+ =/ result=ilocal-result (infer-gate-group members env state)

7181+ ?: ?=(%| -.result) $(groups t.groups)

7182+ =/ rest=(list def)

7183+ (skim ds |=(d=def !(lien names |=(n=term =(n name.d)))))

7184+ =/ more=(unit [rest=(list def) env=ienv state=istate])

7185+ $(ds rest, groups t.groups, env env.p.result, state state.p.result)

7186+ ?^ more more

7187+ `[rest env.p.result state.p.result]

63687188::

63697189:: Read only fields of a known record. Unresolved field constraints and

63707190:: ambiguous repeated faces are outside this fragment. Imported record

@@ -6387,17 +7207,29 @@

63877207 ^- iresult

63887208 =/ reverse=(list term) (flop names)

63897209 ?~ reverse [%| ["empty wing" ~]]

6390− =/ scheme=(unit ischeme) (ienv-lookup i.reverse env)

6391− ?~ scheme [%| ["field access is not supported by partial inference" ~]]

6392− =/ inst=[typ=itype state=istate] (instantiate-scheme u.scheme state)

7210+ =/ iface=(unit ifile) (find-jibb-interface i.reverse jimports.state)

63937211 =/ fields=(list term) t.reverse

7212+ ?~ fields [%| ["field access is not supported by partial inference" ~]]

7213+ =/ scheme=(unit ischeme)

7214+ ?~ iface

7215+ (ienv-lookup i.reverse env)

7216+ (ienv-lookup i.fields values.u.iface)

7217+ ?~ scheme

7218+ ?^ iface [%| ["module member is not available to partial inference" ~]]

7219+ [%| ["field access is not supported by partial inference" ~]]

7220+ =/ inst=[typ=itype state=istate]

7221+ ?~ iface (instantiate-scheme u.scheme state)

7222+ =/ imported=ischeme u.scheme

7223+ =. typ.imported (itype-in-import typ.imported u.iface i.reverse prelude.state)

7224+ (instantiate-scheme imported state)

7225+ =/ remaining=(list term) ?~(iface fields t.fields)

63947226 =/ typ=itype typ.inst

63957227 |-

6396− ?~ fields [%& typ state.inst]

6397− =/ found=(list itype) (record-fields-named i.fields typ sub.state.inst)

7228+ ?~ remaining [%& typ state.inst]

7229+ =/ found=(list itype) (record-fields-named i.remaining typ sub.state.inst)

63987230 ?~ found [%| ["field is not available to partial inference" ~]]

63997231 ?^ t.found [%| ["field name is ambiguous in partial inference" ~]]

6400− $(fields t.fields, typ i.found)

7232+ $(remaining t.remaining, typ i.found)

64017233::

64027234:: Propagate a known union or list through supported loobean, unit and list

64037235:: branches. Empty bodies and groups are transparent; bodies with definitions

@@ -6452,12 +7284,17 @@

64527284 ?: ?=(%unknown -.fit)

64537285 ?: &(?=(%collection -.expected) =(%list name.expected))

64547286 [%| ["branch list constraint is not supported by partial inference" ~]]

7287+ ?: ?=(%flag -.expected) [%| ["branch loobean constraint is not supported by partial inference" ~]]

64557288 [%| ["branch union constraint is not supported by partial inference" ~]]

64567289 ?: ?=(%bad -.fit)

64577290 =/ missing=(unit idiag) (missing-union-tag e expected sub.state.p.value context)

64587291 ?^ missing [%| u.missing]

7292+ =/ nested=(unit idiag) (nested-missing-tag e typ.p.value expected sub.state.p.value next.state.p.value context)

7293+ ?^ nested [%| u.nested]

64597294 ?: &(?=(%collection -.expected) =(%list name.expected))

64607295 [%| ["branch arm does not fit its expected list" ~[[context "expected list"] [(span-of e) "branch arm"]]]]

7296+ ?: ?=(%flag -.expected)

7297+ [%| ["branch arm does not fit its expected loobean" ~[[context "expected loobean"] [(span-of e) "branch arm"]]]]

64617298 [%| ["branch arm does not fit its expected union" ~[[context "expected union"] [(span-of e) "branch arm"]]]]

64627299 [%& expected state.p.value(sub sub.fit, next next.fit)]

64637300::

@@ -6522,6 +7359,23 @@

65227359 [%| ["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)]]]]

65237360 [%& target state.p.tail(sub sub.fit, next next.fit)]

65247361::

7362+++ infer-open-list-items

7363+ |= [items=(list expr) expected=itype env=ienv state=istate context=span]

7364+ ^- iresult

7365+ ?~ items [%& expected state]

7366+ =/ target=itype (itype-walk expected sub.state)

7367+ =/ value=iresult (infer-call-context-arg i.items target env state context)

7368+ ?: ?=(%| -.value) value

7369+ =/ fit=ifit (itype-fit typ.p.value target sub.state.p.value next.state.p.value)

7370+ ?: ?=(%unknown -.fit) [%| ["list item constraint is not supported by partial inference" ~]]

7371+ ?: ?=(%bad -.fit)

7372+ ?: |((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))

7373+ [%| ["list item widening is not supported by partial inference" ~]]

7374+ [%| ["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)]]]]

7375+ ?: (itype-has-tag (itype-normalize expected sub.fit))

7376+ [%| ["list item needs context in partial inference" ~]]

7377+ $(items t.items, state state.p.value(sub sub.fit, next next.fit))

7378+::

65257379++ infer-list-items

65267380 |= [items=(list expr) expected=itype env=ienv state=istate context=span]

65277381 ^- iresult

@@ -6534,6 +7388,8 @@

65347388 ?: ?=(%bad -.fit)

65357389 =/ missing=(unit idiag) (missing-union-tag i.items target sub.state.p.value context)

65367390 ?^ missing [%| u.missing]

7391+ =/ nested=(unit idiag) (nested-missing-tag i.items typ.p.value target sub.state.p.value next.state.p.value context)

7392+ ?^ nested [%| u.nested]

65377393 [%| ["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)]]]]

65387394 $(items t.items, state state.p.value(sub sub.fit, next next.fit))

65397395::

@@ -6626,7 +7482,7 @@

66267482 [%| ["list branch pattern is not supported by partial inference" ~]]

66277483 =/ binder=(unit [head=term tail=term]) ?:(first-empty second-name first-name)

66287484 ?~ binder [%| ["list branch pattern is not supported by partial inference" ~]]

6629− ?: |(=(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)))))

7485+ ?: |(=(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)))))

66307486 [%| ["pattern binder shadows a name" ~]]

66317487 =/ extended=ienv [[head.u.binder [i.args.typ ~]] [tail.u.binder [typ ~]] env]

66327488 =/ left=iresult

@@ -6663,7 +7519,7 @@

66637519 [%| ["unit branch pattern is not supported by partial inference" ~]]

66647520 =/ binder=(unit term) ?:(first-empty second-name first-name)

66657521 ?~ binder [%| ["unit branch pattern is not supported by partial inference" ~]]

6666− ?: |(?=(^ (ienv-lookup u.binder env)) (lien globals.state |=(n=term =(n u.binder))))

7522+ ?: |(=(u.binder %proj) ?=(^ (ienv-lookup u.binder env)) (lien globals.state |=(n=term =(n u.binder))))

66677523 [%| ["pattern binder shadows a name" ~]]

66687524 =/ payload=(unit itype) (unit-union-payload typ)

66697525 ?~ payload [%| ["unit branch subject is not supported by partial inference" ~]]

@@ -6695,12 +7551,14 @@

66957551 =/ t=itype (itype-normalize typ.p.item sub.state.p.item)

66967552 ?: |(?=(%atom -.t) ?=(%any-atom -.t))

66977553 $(ps t.ps, state state.p.item)

6698− ?: &(?=(%nvar -.t) ?=(%lit -.p.i.ps) =(%number form.lit.p.i.ps))

7554+ ?: &(|(?=(%nvar -.t) ?=(%rnvar -.t)) ?=(%lit -.p.i.ps) =(%number form.lit.p.i.ps))

66997555 $(ps t.ps, state state.p.item)

67007556 ?: &(?=(%collection -.t) =(%list name.t) =(~[[%atom 'tD']] args.t))

67017557 $(ps t.ps, state state.p.item)

67027558 ?: &(?=(%avar -.t) (atom-var-from-cap id.t caps.state.p.item sub.state.p.item))

67037559 [%| ["a generic atom in interpolation needs an aura" ~[[(span-of p.i.ps) "atom with a generic aura"]]]]

7560+ ?: &(?=(%rvar -.t) (atom-var-from-cap id.t caps.state.p.item sub.state.p.item))

7561+ [%| ["a generic atom in interpolation needs an aura" ~[[(span-of p.i.ps) "atom with a generic aura"]]]]

67047562 ?: ?=(%cell -.t)

67057563 [%| ["a cell in interpolation needs a printer" ~[[(span-of p.i.ps) "cell without a printer"]]]]

67067564 [%| ["interpolation type needs unsupported inference" ~]]

@@ -6763,7 +7621,7 @@

67637621 ^- (unit ienv)

67647622 =. t ?:(?=(%face -.t) body.t t)

67657623 ?: ?=(%bind -.p)

6766− ?: |(?=(^ (ienv-lookup name.p env)) (lien globals |=(n=term =(n name.p)))) ~

7624+ ?: |(=(name.p %proj) ?=(^ (ienv-lookup name.p env)) (lien globals |=(n=term =(n name.p)))) ~

67677625 `[[name.p [t ~]] env]

67687626 ?: ?=(%cell -.p) (union-pattern-bind-items items.p t env globals)

67697627 `env

@@ -6811,10 +7669,9 @@

68117669 $(xs t.xs, out (weld out rows), origin +(origin))

68127670::

68137671++ infer-known-union-whole

6814− |= [e=expr env=ienv state=istate]

7672+ |= [e=expr env=ienv subject=iresult]

68157673 ^- (unit iresult)

68167674 ?> ?=(%branch -.e)

6817− =/ subject=iresult (infer-fragment subject.e env state)

68187675 ?: ?=(%| -.subject) `subject

68197676 =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

68207677 ?. ?=(%union -.typ) `[%| ["branch is not supported by partial inference" ~]]

@@ -6848,11 +7705,54 @@

68487705 ?: mismatch `[%| ["union branch result matching needs unsupported inference" ~]]

68497706 $(arms t.arms, remaining (skim remaining |=(c=itype !=(%full (union-pattern pat.a c)))), st state.p.body, answer `result)

68507707::

7708+++ infer-known-union-context-whole

7709+ |= [e=expr expected=itype env=ienv subject=iresult context=span]

7710+ ^- (unit iresult)

7711+ ?> ?=(%branch -.e)

7712+ ?: ?=(%| -.subject) `subject

7713+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

7714+ ?. ?=(%union -.typ) `[%| ["branch is not supported by partial inference" ~]]

7715+ =/ cases=(list itype) cases.typ

7716+ =/ remaining=(list itype) cases

7717+ =/ arms=(list arm) arms.e

7718+ =/ st=istate state.p.subject

7719+ =/ answer=(unit itype) ~

7720+ |-

7721+ ?~ arms

7722+ ?^ remaining

7723+ `[%| ["missing union case {(show-itype i.remaining sub.st)}" ~]]

7724+ ?~ answer `[%| ["empty union branch is not supported by partial inference" ~]]

7725+ `[%& expected st]

7726+ =/ a=arm i.arms

7727+ ?: (lien remaining |=(c=itype =(%unknown (union-pattern pat.a c))))

7728+ ~

7729+ =/ matching=(list itype) (skim remaining |=(c=itype =(%full (union-pattern pat.a c))))

7730+ ?~ matching

7731+ ?: (lien cases |=(c=itype =(%full (union-pattern pat.a c))))

7732+ `[%| ["branch arm is covered by earlier arms" ~[[at.pat.a "covered arm"]]]]

7733+ `[%| ["union pattern is not supported by partial inference" ~]]

7734+ ?: &(?=(^ t.matching) (union-pattern-has-bind pat.a))

7735+ `[%| ["a union pattern binding several cases is not supported by partial inference" ~]]

7736+ =/ bound=(unit ienv) (union-pattern-bind pat.a i.matching env globals.st)

7737+ ?~ bound `[%| ["pattern binder shadows a name" ~]]

7738+ =/ body=iresult (infer-call-context-arg val.a expected u.bound st context)

7739+ ?: ?=(%| -.body) `body

7740+ =/ fit=ifit (itype-fit typ.p.body expected sub.state.p.body next.state.p.body)

7741+ ?: ?=(%unknown -.fit) `[%| ["union branch result constraint is not supported by partial inference" ~]]

7742+ ?: ?=(%bad -.fit)

7743+ =/ missing=(unit idiag) (missing-union-tag val.a expected sub.state.p.body context)

7744+ ?^ missing `[%| u.missing]

7745+ =/ nested=(unit idiag) (nested-missing-tag val.a typ.p.body expected sub.state.p.body next.state.p.body context)

7746+ ?^ nested `[%| u.nested]

7747+ `[%| ["union branch arm does not fit its expected type" ~[[context "expected type"] [(span-of val.a) "branch arm"]]]]

7748+ ?: (itype-has-tag (itype-normalize expected sub.fit))

7749+ `[%| ["union branch result needs context in partial inference" ~]]

7750+ $(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)

7751+::

68517752++ infer-known-union-finite

6852− |= [e=expr env=ienv state=istate]

7753+ |= [e=expr env=ienv subject=iresult expected=(unit [typ=itype context=span])]

68537754 ^- iresult

68547755 ?> ?=(%branch -.e)

6855− =/ subject=iresult (infer-fragment subject.e env state)

68567756 ?: ?=(%| -.subject) subject

68577757 =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

68587758 ?. ?=(%union -.typ) [%| ["branch is not supported by partial inference" ~]]

@@ -6868,7 +7768,8 @@

68687768 ?^ remaining

68697769 [%| ["missing union case {(show-itype part.i.remaining sub.st)}" ~]]

68707770 ?~ answer [%| ["empty union branch is not supported by partial inference" ~]]

6871− [%& u.answer st]

7771+ ?~ expected [%& u.answer st]

7772+ [%& typ.u.expected st]

68727773 =/ a=arm i.arms

68737774 ?: (lien remaining |=(c=ifinite =(%unknown (union-pattern pat.a part.c))))

68747775 [%| ["partial union pattern is not supported by partial inference" ~]]

@@ -6881,29 +7782,222 @@

68817782 [%| ["a union pattern binding several cases is not supported by partial inference" ~]]

68827783 =/ bound=(unit ienv) (union-pattern-bind pat.a base.i.matching env globals.st)

68837784 ?~ bound [%| ["pattern binder shadows a name" ~]]

6884− =/ body=iresult (infer-fragment val.a u.bound st)

7785+ =/ body=iresult

7786+ ?~ expected (infer-fragment val.a u.bound st)

7787+ (infer-call-context-arg val.a typ.u.expected u.bound st context.u.expected)

68857788 ?: ?=(%| -.body) body

7789+ ?^ expected

7790+ =/ fit=ifit (itype-fit typ.p.body typ.u.expected sub.state.p.body next.state.p.body)

7791+ ?: ?=(%unknown -.fit) [%| ["union branch result constraint is not supported by partial inference" ~]]

7792+ ?: ?=(%bad -.fit)

7793+ =/ missing=(unit idiag) (missing-union-tag val.a typ.u.expected sub.state.p.body context.u.expected)

7794+ ?^ missing [%| u.missing]

7795+ =/ 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)

7796+ ?^ nested [%| u.nested]

7797+ [%| ["union branch arm does not fit its expected type" ~[[context.u.expected "expected type"] [(span-of val.a) "branch arm"]]]]

7798+ ?: (itype-has-tag (itype-normalize typ.u.expected sub.fit))

7799+ [%| ["union branch result needs context in partial inference" ~]]

7800+ $(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)

68867801 =/ result=itype (itype-normalize typ.p.body sub.state.p.body)

68877802 =/ mismatch=? ?~(answer | !=((itype-normalize u.answer sub.state.p.body) result))

68887803 ?: mismatch [%| ["union branch result matching needs unsupported inference" ~]]

68897804 $(arms t.arms, remaining (skim remaining |=(c=ifinite !=(%full (union-pattern pat.a part.c)))), st state.p.body, answer `result)

68907805::

7806+:: Prove a one-arm record pattern covers a known, non-union subject.

7807+:: Variable or partial matches stay unsupported; binding uses the same

7808+:: scope and original payload types as the existing union matcher.

7809+++ single-structured-pattern

7810+ |= e=expr

7811+ ^- ?

7812+ ?. ?=(%branch -.e) |

7813+ ?~ arms.e |

7814+ ?^ t.arms.e |

7815+ =/ p=pattern pat.i.arms.e

7816+ ?. ?=(%cell -.p) |

7817+ !(levy items.p |=(x=pattern ?=(%bind -.x)))

7818+::

7819+++ infer-single-case-branch

7820+ |= [e=expr env=ienv state=istate expected=(unit [typ=itype context=span])]

7821+ ^- iresult

7822+ ?> (single-structured-pattern e)

7823+ ?> ?=(%branch -.e)

7824+ ?> ?=(^ arms.e)

7825+ =/ a=arm i.arms.e

7826+ =/ subject=iresult (infer-fragment subject.e env state)

7827+ ?: ?=(%| -.subject) subject

7828+ =/ st=istate state.p.subject

7829+ =/ typ=itype (itype-normalize typ.p.subject sub.st)

7830+ ?: ?=(%union -.typ) [%| ["single-case pattern needs unsupported inference" ~]]

7831+ ?. =(%full (union-pattern pat.a typ))

7832+ [%| ["single-case pattern needs unsupported inference" ~]]

7833+ =/ bound=(unit ienv) (union-pattern-bind pat.a typ env globals.st)

7834+ ?~ bound [%| ["pattern binder shadows a name" ~]]

7835+ ?~ expected (infer-fragment val.a u.bound st)

7836+ =/ body=iresult (infer-call-context-arg val.a typ.u.expected u.bound st context.u.expected)

7837+ ?: ?=(%| -.body) body

7838+ =/ fit=ifit (itype-fit typ.p.body typ.u.expected sub.state.p.body next.state.p.body)

7839+ ?: ?=(%unknown -.fit) [%| ["single-case branch result constraint is not supported by partial inference" ~]]

7840+ ?: ?=(%bad -.fit)

7841+ =/ missing=(unit idiag) (missing-union-tag val.a typ.u.expected sub.state.p.body context.u.expected)

7842+ ?^ missing [%| u.missing]

7843+ =/ 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)

7844+ ?^ nested [%| u.nested]

7845+ [%| ["single-case branch arm does not fit its expected type" ~[[context.u.expected "expected type"] [(span-of val.a) "branch arm"]]]]

7846+ ?: (itype-has-tag (itype-normalize typ.u.expected sub.fit))

7847+ [%| ["single-case branch result needs context in partial inference" ~]]

7848+ [%& typ.u.expected state.p.body(sub sub.fit, next next.fit)]

7849+::

7850+:: This view is used only by pattern analysis, never exported or bound as

7851+:: the subject. Only null plus a two-binder/wildcard cell is supported; its

7852+:: tail keeps the original recursive type. Other patterns fail closed.

7853+++ jrec-match-view

7854+ |= [e=expr subject=iresult]

7855+ ^- iresult

7856+ ?: ?=(%| -.subject) subject

7857+ ?. ?=(%branch -.e) subject

7858+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

7859+ ?. ?=(%jrec -.typ) subject

7860+ ?~ arms.e subject

7861+ ?~ t.arms.e subject

7862+ ?^ t.t.arms.e subject

7863+ =/ x=pattern pat.i.arms.e

7864+ =/ y=pattern pat.i.t.arms.e

7865+ =/ empty=? &(?=(%lit -.x) =(%null form.lit.x))

7866+ =/ full=pattern ?:(empty y x)

7867+ ?. |(empty &(?=(%lit -.y) =(%null form.lit.y))) subject

7868+ ?. ?=(%cell -.full) subject

7869+ ?~ items.full subject

7870+ ?~ t.items.full subject

7871+ ?^ t.t.items.full subject

7872+ ?. |(?=(%bind -.i.items.full) ?=(%any -.i.items.full)) subject

7873+ ?. |(?=(%bind -.i.t.items.full) ?=(%any -.i.t.items.full)) subject

7874+ ?: =(0 jrec-fuel.state.p.subject)

7875+ [%| ["recursive mold unfolding needs unsupported inference" ~]]

7876+ =/ nil=itype [%const [%null %n 0 '~']]

7877+ =/ cell=itype [%cell [%face head.typ [%atom aura.typ]] [%face tail.typ typ]]

7878+ [%& [%union ~[nil cell] ~ ~ ~] state.p.subject(jrec-fuel (dec jrec-fuel.state.p.subject))]

7879+::

7880+:: Experimental bounded, source-proven tree match. Only two explicit

7881+:: flat tag/binder patterns may consume the view: a whole-case binder

7882+:: must not leak the temporary structural representation.

7883+++ grec-simple-pattern

7884+ |= [pat=pattern view=itype]

7885+ ^- ?

7886+ ?. ?=(%cell -.pat) |

7887+ ?~ items.pat |

7888+ =/ first=pattern i.items.pat

7889+ ?. ?=(%lit -.first) |

7890+ ?. =(%term form.lit.first) |

7891+ =/ chosen=(unit itype) (contextual-tagged-case view val.lit.first ~)

7892+ ?~ chosen |

7893+ ?> ?=(%cell -.u.chosen)

7894+ =/ rest=(list pattern) t.items.pat

7895+ ?. (levy rest |=(p=pattern |(?=(%bind -.p) ?=(%any -.p)))) |

7896+ ?: ?=(%cell -.tal.u.chosen) ?=([* [* ~]] rest)

7897+ ?=([* ~] rest)

7898+++ grec-match-view

7899+ |= [e=expr subject=iresult]

7900+ ^- iresult

7901+ ?: ?=(%| -.subject) subject

7902+ ?. ?=(%branch -.e) subject

7903+ ?. (grec-direct-context typ.p.subject sub.state.p.subject) subject

7904+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

7905+ ?. ?=(%grec -.typ) subject

7906+ ?~ arms.e subject

7907+ ?. |(?=(~ t.arms.e) ?=([* ~] t.arms.e)) subject

7908+ =/ view=(unit [view=itype left=@ud]) (grec-unfold-view typ jrec-fuel.state.p.subject)

7909+ ?~ view [%| ["recursive mold unfolding needs unsupported inference" ~]]

7910+ ?. (grec-simple-pattern pat.i.arms.e view.u.view) subject

7911+ =/ rest-ok=? ?~(t.arms.e & (grec-simple-pattern pat.i.t.arms.e view.u.view))

7912+ ?. rest-ok subject

7913+ [%& view.u.view state.p.subject(jrec-fuel left.u.view)]

7914+::

7915+:: A single-arm diagnostic only probes a direct, source-typed in-scope wing;

7916+:: other subjects retain the prior single-pattern inference path.

7917+++ grec-single-wing-subject

7918+ |= [e=expr env=ienv state=istate]

7919+ ^- (unit iresult)

7920+ ?. ?=(%wing -.e) ~

7921+ ?. ?=([@ ~] names.e) ~

7922+ =/ scheme=(unit ischeme) (ienv-lookup i.names.e env)

7923+ ?~ scheme ~

7924+ ?. (grec-direct-context typ.u.scheme sub.state) ~

7925+ `(infer-fragment e env state)

7926+::

7927+++ infer-known-union-branch-subject

7928+ |= [e=expr env=ienv subject=iresult]

7929+ ^- iresult

7930+ =. subject (grec-match-view e subject)

7931+ =. subject (jrec-match-view e subject)

7932+ =/ whole=(unit iresult) (infer-known-union-whole e env subject)

7933+ ?~ whole (infer-known-union-finite e env subject ~)

7934+ u.whole

7935+::

68917936++ infer-known-union-branch

68927937 |= [e=expr env=ienv state=istate]

68937938 ^- iresult

6894− =/ whole=(unit iresult) (infer-known-union-whole e env state)

6895− ?~ whole (infer-known-union-finite e env state)

7939+ ?> ?=(%branch -.e)

7940+ (infer-known-union-branch-subject e env (infer-fragment subject.e env state))

7941+::

7942+++ infer-known-union-context-subject

7943+ |= [e=expr expected=itype env=ienv subject=iresult context=span]

7944+ ^- iresult

7945+ =. subject (grec-match-view e subject)

7946+ =. subject (jrec-match-view e subject)

7947+ =/ whole=(unit iresult) (infer-known-union-context-whole e expected env subject context)

7948+ ?~ whole (infer-known-union-finite e env subject `[expected context])

68967949 u.whole

68977950::

7951+:: Limit speculative subject inference to wings and shallow calls;

7952+:: grouping is peeled linearly and cannot introduce a nested branch.

7953+++ simple-union-subject-arg

7954+ |= e=expr

7955+ ^- ?

7956+ ?- -.e

7957+ %wing &

7958+ %lit &

7959+ %str !(lien pieces.e |=(p=piece ?=(%expr -.p)))

7960+ * |

7961+ ==

7962+::

7963+++ safe-union-subject

7964+ |= e=expr

7965+ ^- ?

7966+ ?: ?=(%group -.e) $(e inner.e)

7967+ ?: ?=(%wing -.e) &

7968+ ?. ?=(%call -.e) |

7969+ ?. ?=(%wing -.head.e) |

7970+ (levy args.e simple-union-subject-arg)

7971+::

7972+++ duplicate-loobean-arms

7973+ |= e=expr

7974+ ^- ?

7975+ ?. ?=(%branch -.e) |

7976+ ?~ arms.e |

7977+ ?~ t.arms.e |

7978+ ?^ t.t.arms.e |

7979+ =/ x=pattern pat.i.arms.e

7980+ =/ y=pattern pat.i.t.arms.e

7981+ ?. &(?=(%lit -.x) ?=(%lit -.y)) |

7982+ ?. &(=(%loobean form.lit.x) =(%loobean form.lit.y)) |

7983+ =(val.lit.x val.lit.y)

7984+::

7985+++ union-subject-call

7986+ |= e=expr

7987+ ^- ?

7988+ ?: ?=(%group -.e) $(e inner.e)

7989+ ?=(%call -.e)

7990+::

68987991++ known-union-subject

68997992 |= [e=expr env=ienv state=istate]

6900− ^- (unit itype)

6901− ?. ?=(%wing -.e) ~

7993+ ^- (unit iresult)

7994+ ?. (safe-union-subject e) ~

69027995 =/ subject=iresult (infer-fragment e env state)

6903− ?: ?=(%| -.subject) ~

7996+ ?: ?=(%| -.subject) ?:((union-subject-call e) `subject ~)

69047997 =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

6905− ?. ?=(%union -.typ) ~

6906− `typ

7998+ ?. |(?=(%union -.typ) ?=(%jrec -.typ) &(?=(%grec -.typ) (grec-direct-context typ.p.subject sub.state.p.subject))) ~

7999+ `subject

8000+::

69078001::

69088002:: Infer changes only against a fully known record spine. Retain the

69098003:: target type; unknown spines and repeated edits remain unsupported.

@@ -7003,13 +8097,71 @@

70038097 (show-itype expected sub)

70048098 `["{label} has no case `{(trip txt.lit.e)}`" ~[[context "expected union"] [(span-of e) "tag"]]]

70058099::

7006−++ infer-fragment

7007− |= [e=expr env=ienv state=istate]

7008− ^- iresult

7009− ?- -.e

7010− %lit

7011− ?- form.lit.e

7012− %number ?: =(%ud aura.lit.e)

8100+:: Locate a missing tag inside a syntactic tuple only by replaying the

8101+:: directional fit in source order. Uncertain or earlier failures stop

8102+:: the walk, preserving the generic diagnostic rather than guessing.

8103+++ nested-missing-tag

8104+ |= [e=expr actual=itype expected=itype sub=isub next=@ud context=span]

8105+ ^- (unit idiag)

8106+ =/ original=[left=itype right=itype] [actual expected]

8107+ ?: |(?=(%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))) ~

8108+ =/ fit=ifit (itype-fit actual expected sub next)

8109+ ?. ?=(%bad -.fit) ~

8110+ =. actual (itype-walk actual sub)

8111+ =. expected (itype-walk expected sub)

8112+ ?: &(?=(%face -.actual) ?=(%face -.expected))

8113+ ?. =(name.actual name.expected) ~

8114+ $(actual body.actual, expected body.expected)

8115+ ?: ?=(%face -.actual) $(actual body.actual)

8116+ ?: ?=(%face -.expected) $(expected body.expected)

8117+ =/ direct=(unit idiag) (missing-union-tag e expected sub context)

8118+ ?^ direct direct

8119+ ?. ?=(%tuple -.e) ~

8120+ (nested-missing-items items.e actual expected sub next context)

8121+::

8122+++ nested-missing-items

8123+ |= [items=(list item) actual=itype expected=itype sub=isub next=@ud context=span]

8124+ ^- (unit idiag)

8125+ ?~ items ~

8126+ ?~ t.items (nested-missing-tag val.i.items actual expected sub next context)

8127+ =/ original=[left=itype right=itype] [actual expected]

8128+ ?: |(?=(%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))) ~

8129+ =. actual (itype-walk actual sub)

8130+ =. expected (itype-walk expected sub)

8131+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

8132+ =/ first=ifit (itype-fit hed.actual hed.expected sub next)

8133+ ?: ?=(%bad -.first)

8134+ (nested-missing-tag val.i.items hed.actual hed.expected sub next context)

8135+ ?. ?=(%ok -.first) ~

8136+ $(items t.items, actual tal.actual, expected tal.expected, sub sub.first, next next.first)

8137+::

8138+:: A term-headed pair is the same noun as a two-item cell. Preserve the

8139+:: whole pair span for the synthetic head and the value's own span for

8140+:: the payload; unresolved term constraints follow ordinary cell inference.

8141+++ pair-as-cell

8142+ |= e=expr

8143+ ^- expr

8144+ ?> ?=(%pair -.e)

8145+ =/ head=expr [%lit at.e [%term %tas tag.e (crip ['%' (trip tag.e)])]]

8146+ [%tuple at.e ~[[at.e ~ head] [(span-of val.e) ~ val.e]]]

8147+::

8148+:: A segment costs one shared step; dynamic segments are not handled yet.

8149+++ qath-static-fuel

8150+ |= [segs=(list qseg) fuel=@ud]

8151+ ^- (unit @ud)

8152+ ?~ segs `fuel

8153+ ?: =(0 fuel) ~

8154+ ?. ?=(%knot -.i.segs) ~

8155+ $(segs t.segs, fuel (dec fuel))

8156+::

8157+++ infer-fragment

8158+ |= [e=expr env=ienv state=istate]

8159+ ^- iresult

8160+ ?- -.e

8161+ %pair $(e (pair-as-cell e))

8162+ %lit

8163+ ?- form.lit.e

8164+ %number ?: =(%ud aura.lit.e)

70138165 [%& [%nvar next.state] state(next +(next.state))]

70148166 [%& [%atom aura.lit.e] state]

70158167 %ship [%& [%atom %p] state]

@@ -7031,7 +8183,34 @@

70318183 =/ result=(unit itype) (template-apply u.standard ~[typ.p.value])

70328184 ?~ result [%| ["unit construction is not supported by partial inference" ~]]

70338185 [%& u.result state.p.value]

8186+ %list

8187+ ?~ prelude.state [%| ["list literal needs the standard prelude in partial inference" ~]]

8188+ ?. =(at.u.prelude.state /lib/jibb/prelude/jibb)

8189+ [%| ["list literal needs the standard prelude in partial inference" ~]]

8190+ =/ standard=(unit ischeme) (find-jibb-mold %list u.prelude.state)

8191+ ?~ standard [%| ["list literal needs the standard prelude in partial inference" ~]]

8192+ ?. =(u.standard [[%collection %list ~[[%var 0]]] ~[0]])

8193+ [%| ["list literal needs the standard prelude in partial inference" ~]]

8194+ =/ element=itype [%var next.state]

8195+ =/ result=iresult (infer-open-list-items items.e element env state(next +(next.state)) at.e)

8196+ ?: ?=(%| -.result) result

8197+ [%& [%collection %list ~[element]] state.p.result]

70348198 %str (infer-string-pieces pieces.e env state)

8199+ %qath

8200+ ?~ prelude.state [%| ["application path needs the standard prelude in partial inference" ~]]

8201+ ?. =(at.u.prelude.state /lib/jibb/prelude/jibb)

8202+ [%| ["application path needs the standard prelude in partial inference" ~]]

8203+ =/ standard=(unit ischeme) (find-jibb-mold %qath u.prelude.state)

8204+ ?~ standard [%| ["application path needs the standard prelude in partial inference" ~]]

8205+ ?. ?=(~ vars.u.standard) [%| ["application path mold needs unsupported inference" ~]]

8206+ =/ typ=itype typ.u.standard

8207+ ?. ?=(%jrec -.typ) [%| ["application path mold needs unsupported inference" ~]]

8208+ ?. &(=(at.typ /lib/jibb/internal/jibb) =(%qath name.typ) =(%i head.typ) =(%ta aura.typ) =(%t tail.typ))

8209+ [%| ["application path mold needs unsupported inference" ~]]

8210+ ?: =(0 jrec-fuel.state) [%| ["recursive mold unfolding needs unsupported inference" ~]]

8211+ =/ remain=(unit @ud) (qath-static-fuel segs.e (dec jrec-fuel.state))

8212+ ?~ remain [%| ["application path segments need unsupported inference" ~]]

8213+ [%& typ state(jrec-fuel u.remain)]

70358214 %wing

70368215 ?~ names.e [%| ["empty wing" ~]]

70378216 ?^ t.names.e

@@ -7040,7 +8219,7 @@

70408219 ?~ iface (infer-field-wing names.e env state)

70418220 =/ member=(unit ischeme) (ienv-lookup i.names.e values.u.iface)

70428221 ?~ member [%| ["module member is not available to partial inference" ~]]

7043− =. typ.u.member (itype-in-import typ.u.member u.iface i.t.names.e)

8222+ =. typ.u.member (itype-in-import typ.u.member u.iface i.t.names.e prelude.state)

70448223 =/ instance=[typ=itype state=istate] (instantiate-scheme u.member state)

70458224 [%& typ.instance state.instance]

70468225 =/ scheme=(unit ischeme) (ienv-lookup i.names.e env)

@@ -7074,6 +8253,9 @@

70748253 [%| ["local molds shadow a name" ~]]

70758254 =/ local-state=istate

70768255 state(globals (weld local-names globals.state), molds (weld local-molds molds.state))

8256+ =/ mold-hole=(unit span) (simple-local-mold-hole defs.e)

8257+ ?^ mold-hole

8258+ [%| ["type hole needs a determined type" ~[[u.mold-hole "unresolved type hole"]]]]

70778259 ?. (local-molds-supported local-molds local-state)

70788260 [%| ["local molds need unsupported inference" ~]]

70798261 =/ values=(list def) (local-value-defs defs.e)

@@ -7084,11 +8266,16 @@

70848266 [%& typ.p.result state.p.result(globals globals.state, molds molds.state)]

70858267 %branch

70868268 ?~ arms.e [%| ["branch is not supported by partial inference" ~]]

7087− ?~ t.arms.e (infer-cell-branch e env state)

8269+ ?~ t.arms.e

8270+ =/ single=(unit iresult) (grec-single-wing-subject subject.e env state)

8271+ ?^ single (infer-known-union-branch-subject e env u.single)

8272+ ?: (single-structured-pattern e) (infer-single-case-branch e env state ~)

8273+ (infer-cell-branch e env state ~)

70888274 ?^ t.t.arms.e (infer-known-union-branch e env state)

7089− =/ known=(unit itype) (known-union-subject subject.e env state)

7090− ?: &(?=(^ known) ?=(~ (unit-union-payload u.known)))

7091− (infer-known-union-branch e env state)

8275+ =/ known=(unit iresult) (known-union-subject subject.e env state)

8276+ ?: &(?=(^ known) ?=(%| -.u.known) !(duplicate-loobean-arms e)) u.known

8277+ ?: &(?=(^ known) ?=(%& -.u.known) ?=(~ (unit-union-payload (itype-normalize typ.p.u.known sub.state.p.u.known))))

8278+ (infer-known-union-branch-subject e env u.known)

70928279 =/ x=arm i.arms.e

70938280 =/ y=arm i.t.arms.e

70948281 ?: |((unit-empty-pattern pat.x) (unit-empty-pattern pat.y))

@@ -7097,7 +8284,7 @@

70978284 ?. ?=(%lit -.pat.y) (infer-known-union-branch e env state)

70988285 ?. &(=(%loobean form.lit.pat.x) =(%loobean form.lit.pat.y))

70998286 (infer-known-union-branch e env state)

7100− ?^ known (infer-known-union-branch e env state)

8287+ ?: &(?=(^ known) ?=(%& -.u.known)) (infer-known-union-branch-subject e env u.known)

71018288 ?: =(val.lit.pat.x val.lit.pat.y)

71028289 [%| ["branch does not cover both loobeans" ~]]

71038290 =/ subject=iresult $(e subject.e)

@@ -7138,11 +8325,16 @@

71388325 =/ value=iresult

71398326 (infer-call-context-arg val.e typ.u.target env state.u.target at.shape.e)

71408327 ?: ?=(%| -.value) value

8328+ =/ shape=(unit [source=iwfields target=iwfields])

8329+ (width-shape typ.p.value typ.u.target sub.state.p.value)

8330+ ?^ shape [%| ["record width constraint needs unsupported inference" ~]]

71418331 =/ fit=ifit (itype-fit typ.p.value typ.u.target sub.state.p.value next.state.p.value)

71428332 ?: ?=(%unknown -.fit) [%| ["cast constraint is not supported by partial inference" ~]]

71438333 ?: ?=(%bad -.fit)

71448334 =/ missing=(unit idiag) (missing-union-tag val.e typ.u.target sub.state.p.value at.shape.e)

71458335 ?^ missing [%| u.missing]

8336+ =/ 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)

8337+ ?^ nested [%| u.nested]

71468338 [%| ["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)]]]]

71478339 =/ merged=itype (itype-merge-faces typ.p.value typ.u.target sub.fit)

71488340 [%& merged state.p.value(sub sub.fit, next next.fit)]

@@ -7167,43 +8359,9 @@

71678359 [%& [%fn typ.p.sam typ.p.body] state.p.body]

71688360 %call

71698361 ?~ args.e [%| ["call has no argument" ~]]

7170− =/ head=iresult $(e head.e)

7171− ?: ?=(%| -.head) head

7172− =/ head-type=itype (itype-walk typ.p.head sub.state.p.head)

7173− =/ arg=iresult

7174− ?^ t.args.e

7175− ?: ?=(%fn -.head-type)

7176− (infer-call-context-args args.e sample.head-type env state.p.head (span-of head.e))

7177− (infer-simple-items (turn args.e |=(a=expr [(span-of a) ~ a])) env state.p.head)

7178− ?: ?=(%fn -.head-type)

7179− (infer-call-context-arg i.args.e sample.head-type env state.p.head (span-of head.e))

7180− $(e i.args.e, state state.p.head)

7181− ?: ?=(%| -.arg) arg

7182− =/ st=istate state.p.arg

7183− =/ ht=itype (itype-walk typ.p.head sub.st)

7184− ?: ?=(%fn -.ht)

7185− =/ fit=ifit (itype-fit typ.p.arg sample.ht sub.st next.st)

7186− ?: ?=(%unknown -.fit) [%| ["call constraint is not supported by partial inference" ~]]

7187− ?: ?=(%bad -.fit)

7188− ?~ t.args.e

7189− =/ missing=(unit idiag) (missing-union-tag i.args.e sample.ht sub.st (span-of head.e))

7190− ?^ missing [%| u.missing]

7191− [%| ["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)]]]]

7192− =/ bad=(unit [at=span typ=itype])

7193− (call-error-site args.e typ.p.arg sample.ht sub.st next.st)

7194− =/ whole-args=span

7195− [beg:(span-of i.args.e) end:(span-of (rear args.e))]

7196− =/ arg-at=span ?~(bad whole-args at.u.bad)

7197− =/ arg-type=itype ?~(bad typ.p.arg typ.u.bad)

7198− [%| ["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)]]]]

7199− ?: &((itype-has-face typ.p.arg sub.fit) (itype-face-asym typ.p.arg sample.ht sub.fit) (itype-output-may-be-cell product.ht sub.fit))

7200− [%| ["call result face propagation is not supported by partial inference" ~]]

7201− [%& product.ht st(sub sub.fit, next next.fit)]

7202− =/ result=itype [%var next.st]

7203− =/ uni=(unit isub) (itype-unify ht [%fn typ.p.arg result] sub.st)

7204− ?~ uni

7205− [%| ["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)]]]]

7206− [%& result st(next +(next.st), sub u.uni)]

8362+ ?: (explicit-proj-call e env state)

8363+ [%| ["proj needs an expected record type" ~]]

8364+ (infer-call-with-head e env state (infer-fragment head.e env state))

72078365 * [%| ["expression is not supported by partial inference" ~]]

72088366 ==

72098367::

@@ -7211,12 +8369,314 @@

72118369:: failed. If an intermediate fit is uncertain, retain the whole argument

72128370:: span rather than assigning blame to a particular argument.

72138371::

8372+:: Check a call using the head already inferred in this state. Keeping

8373+:: this shared avoids evaluating or instantiating a contextual head twice.

8374+++ width-has-projections

8375+ |= ps=(list iwprojection)

8376+ ^- ?

8377+ ?~ ps |

8378+ &

8379+::

8380++$ iwidth-elaboration [original=expr typ=itype sub=isub projections=(list iwprojection)]

8381+++ infer-width-elaboration

8382+ |= [e=expr env=ienv state=istate]

8383+ ^- (each iwidth-elaboration idiag)

8384+ =/ out=iresult (infer-fragment e env state)

8385+ ?: ?=(%| -.out) [%| p.out]

8386+ [%& [e typ.p.out sub.state.p.out (flop projections.state.p.out)]]

8387+::

8388+:: Source-bound gate-layout evidence, confined to checked root gate

8389+:: definitions and direct unshadowed prelude calls. The prepared prelude

8390+:: interface and its retained source are trusted as a matching artifact.

8391+:: Layouts identify sample binder faces; they do not change call arity or

8392+:: authorize stripping nested value faces. Unknown origins use ordinary fit.

8393+++ direct-written-gates

8394+ |= [ds=(list def) out=ivisited]

8395+ ^- ivisited

8396+ ?~ ds out

8397+ ?: ?=(%mold -.i.ds) $(ds t.ds)

8398+ ?. |(?=(%gate -.val.i.ds) ?=(%gate-wide -.val.i.ds)) $(ds t.ds)

8399+ $(ds t.ds, out (~(put by out) name.i.ds &))

8400+++ direct-may-use-prelude

8401+ |= [ds=(list def) root=ivisited heads=ivisited]

8402+ ^- ?

8403+ ?~ ds |

8404+ ?: ?=(%mold -.i.ds) $(ds t.ds)

8405+ =/ refs=(list term) (dependency-expr val.i.ds)

8406+ =/ has-root=? (lien refs |=(n=term ?=(^ (~(get by root) n))))

8407+ =/ has-head=? (lien refs |=(n=term ?=(^ (~(get by heads) n))))

8408+ ?: &(has-root has-head) &

8409+ $(ds t.ds)

8410+++ direct-unique-names

8411+ |= [names=(list term) seen=ivisited]

8412+ ^- ?

8413+ ?~ names &

8414+ ?: ?=(^ (~(get by seen) i.names)) |

8415+ $(names t.names, seen (~(put by seen) i.names &))

8416+++ direct-prelude-evidence

8417+ |= [ds=(list def) prelude=(unit ifile)]

8418+ ^- (unit igate-prelude-evidence)

8419+ ?~ prelude ~

8420+ ?~ source.u.prelude ~

8421+ =/ root=ivisited (direct-written-gates ds ~)

8422+ =/ names=(list term) (turn values.u.prelude |=(e=[name=term scheme=ischeme] name.e))

8423+ =/ heads=ivisited (graph-nameset names ~)

8424+ ?. (direct-may-use-prelude ds root heads) ~

8425+ =/ parsed (parse at.u.prelude u.source.u.prelude)

8426+ ?: ?=(%| -.parsed) ~

8427+ ?^ (duplicate-defs defs.p.parsed) ~

8428+ ?. (direct-unique-names (global-value-names defs.p.parsed) ~) ~

8429+ =/ gates=(map term def) (direct-checked-gates defs.p.parsed values.u.prelude)

8430+ `[u.prelude gates]

8431+++ direct-checked-gates

8432+ |= [ds=(list def) env=ienv]

8433+ ^- (map term def)

8434+ =/ names=(list term) (turn env |=(e=[name=term scheme=ischeme] name.e))

8435+ =/ known=ivisited (graph-nameset names ~)

8436+ =/ out=(map term def) ~

8437+ |-

8438+ ?~ ds out

8439+ =/ d=def i.ds

8440+ ?: ?=(%mold -.d) $(ds t.ds)

8441+ ?. ?=(^ (~(get by known) name.d)) $(ds t.ds)

8442+ ?. |(?=(%gate -.val.d) ?=(%gate-wide -.val.d)) $(ds t.ds)

8443+ $(ds t.ds, out (~(put by out) name.d d))

8444+++ direct-find-gate

8445+ |= [n=term ds=(list def)]

8446+ ^- (unit def)

8447+ ?~ ds ~

8448+ ?: &(?=(%value -.i.ds) =(n name.i.ds)) `i.ds

8449+ $(ds t.ds)

8450+++ direct-gate-sample

8451+ |= d=def

8452+ ^- (unit sample)

8453+ ?. ?=(%value -.d) ~

8454+ ?- -.val.d

8455+ %gate `sample.val.d

8456+ %gate-wide `sample.val.d

8457+ * ~

8458+ ==

8459+++ direct-sample-name

8460+ |= sam=sample

8461+ ^- (unit term)

8462+ ?- -.sam

8463+ %bind `name.sam

8464+ %face `name.sam

8465+ %pun `name.sam

8466+ * ~

8467+ ==

8468+++ direct-field-name

8469+ |= f=field

8470+ ^- (unit term)

8471+ ?- -.f

8472+ %face `name.f

8473+ %pun `name.f

8474+ * ~

8475+ ==

8476+++ direct-slot-body

8477+ |= [typ=itype name=(unit term)]

8478+ ^- (unit itype)

8479+ ?~ name `typ

8480+ ?. ?=(%face -.typ) ~

8481+ ?. =(name.typ u.name) ~

8482+ `body.typ

8483+++ direct-invariant

8484+ |= [a=itype b=itype sub=isub next=@ud]

8485+ ^- ifit

8486+ ?: (itype-face-asym a b sub) [%unknown ~]

8487+ =/ forward=ifit (itype-fit a b sub next)

8488+ ?. ?=(%ok -.forward) [%unknown ~]

8489+ ?: (itype-face-asym a b sub.forward) [%unknown ~]

8490+ =/ reverse=ifit (itype-fit b a sub.forward next.forward)

8491+ ?. ?=(%ok -.reverse) [%unknown ~]

8492+ reverse

8493+++ direct-function-fit

8494+ |= [a=itype b=itype sam=sample sh=shape sub=isub next=@ud]

8495+ ^- ifit

8496+ ?. &(?=(%fn -.a) ?=(%fn -.b) ?=(%cell -.sam) ?=(%fn -.sh)) [%unknown ~]

8497+ ?. ?=(%cell -.sample.sh) [%unknown ~]

8498+ =/ as=(list sample) items.sam

8499+ =/ bs=(list field) fields.sample.sh

8500+ ?~ as [%unknown ~]

8501+ ?~ t.as [%unknown ~]

8502+ ?^ t.t.as [%unknown ~]

8503+ ?~ bs [%unknown ~]

8504+ ?~ t.bs [%unknown ~]

8505+ ?^ t.t.bs [%unknown ~]

8506+ ?. &(?=(%cell -.sample.a) ?=(%cell -.sample.b)) [%unknown ~]

8507+ =/ an=(unit term) (direct-sample-name i.as)

8508+ =/ bn=(unit term) (direct-field-name i.bs)

8509+ ?: &(?=(^ an) ?=(^ bn) !=(u.an u.bn)) [%unknown ~]

8510+ =/ x=(unit itype) (direct-slot-body hed.sample.a an)

8511+ =/ y=(unit itype) (direct-slot-body hed.sample.b bn)

8512+ ?~ x [%unknown ~]

8513+ ?~ y [%unknown ~]

8514+ =/ first=ifit (direct-invariant u.x u.y sub next)

8515+ ?. ?=(%ok -.first) [%unknown ~]

8516+ =. an (direct-sample-name i.t.as)

8517+ =. bn (direct-field-name i.t.bs)

8518+ ?: &(?=(^ an) ?=(^ bn) !=(u.an u.bn)) [%unknown ~]

8519+ =/ x2=(unit itype) (direct-slot-body tal.sample.a an)

8520+ =/ y2=(unit itype) (direct-slot-body tal.sample.b bn)

8521+ ?~ x2 [%unknown ~]

8522+ ?~ y2 [%unknown ~]

8523+ =/ second=ifit (direct-invariant u.x2 u.y2 sub.first next.first)

8524+ ?. ?=(%ok -.second) [%unknown ~]

8525+ (direct-invariant product.a product.b sub.second next.second)

8526+:: This is a tentative proof: its caller must require closed call samples

8527+:: and repeat every positional check under the stable final substitution.

8528+++ direct-positional-fit

8529+ |= [args=(list expr) slots=(list sample) actual=itype expected=itype env=ienv state=istate sub=isub next=@ud]

8530+ ^- ifit

8531+ ?~ args [%unknown ~]

8532+ ?~ slots [%unknown ~]

8533+ =/ last=? ?=(~ t.args)

8534+ ?: !=(last ?=(~ t.slots)) [%unknown ~]

8535+ =/ split=(unit [left=itype right=itype])

8536+ ?: last `[actual expected]

8537+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

8538+ `[hed.actual hed.expected]

8539+ ?~ split [%unknown ~]

8540+ =/ x=itype left.u.split

8541+ =/ y=itype right.u.split

8542+ =/ expected-name=(unit term) (direct-sample-name i.slots)

8543+ =/ expected-body=(unit itype) (direct-slot-body y expected-name)

8544+ ?~ expected-body [%unknown ~]

8545+ =. y u.expected-body

8546+ =/ fit=ifit (itype-fit x y sub next)

8547+ =/ accepted=? &(?=(%ok -.fit) !(itype-positional-slot-face-asym x y sub.fit))

8548+ =/ result=(unit ifit)

8549+ ?: accepted `fit

8550+ ?. &(?=(%face -.i.slots) ?=(%fn -.shape.i.slots)) ~

8551+ ?. ?=(%wing -.i.args) ~

8552+ ?. ?=([@ ~] names.i.args) ~

8553+ ?. (unique-value-name i.names.i.args globals.state) ~

8554+ =/ source=(unit def) (~(get by gate-defs.state) i.names.i.args)

8555+ ?~ source ~

8556+ =/ sample=(unit sample) (direct-gate-sample u.source)

8557+ ?~ sample ~

8558+ =/ trial=ifit (direct-function-fit x y u.sample shape.i.slots sub next)

8559+ ?. ?=(%ok -.trial) ~

8560+ `trial

8561+ ?~ result [%unknown ~]

8562+ =. fit u.result

8563+ ?: last fit

8564+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) [%unknown ~]

8565+ ?. ?=(%ok -.fit) [%unknown ~]

8566+ $(args t.args, slots t.slots, actual tal.actual, expected tal.expected, sub sub.fit, next next.fit)

8567+++ direct-any-gate-arg

8568+ |= [args=(list expr) defs=(map term def)]

8569+ ^- ?

8570+ ?~ args |

8571+ =/ found=?

8572+ ?. ?=(%wing -.i.args) |

8573+ ?. ?=([@ ~] names.i.args) |

8574+ ?=(^ (~(get by defs) i.names.i.args))

8575+ ?: found &

8576+ $(args t.args)

8577+++ direct-gate-call-fit

8578+ |= [e=expr actual=itype expected=itype env=ienv state=istate]

8579+ ^- (unit ifit)

8580+ ?. ?=(%call -.e) ~

8581+ ?~ args.e ~

8582+ ?~ t.args.e ~

8583+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

8584+ ?. ?=(%wing -.head.e) ~

8585+ ?. ?=([@ ~] names.head.e) ~

8586+ ?. ?=(~ (ienv-lookup i.names.head.e env)) ~

8587+ ?. (unique-value-name i.names.head.e globals.state) ~

8588+ ?. (direct-any-gate-arg args.e gate-defs.state) ~

8589+ ?~ prelude.state ~

8590+ ?~ source.u.prelude.state ~

8591+ ?~ head-evidence.state ~

8592+ ?. =(u.prelude.state iface.u.head-evidence.state) ~

8593+ ?. ?=(^ (ienv-lookup i.names.head.e values.u.prelude.state)) ~

8594+ =/ head=(unit def) (~(get by gates.u.head-evidence.state) i.names.head.e)

8595+ ?~ head ~

8596+ =/ sam=(unit sample) (direct-gate-sample u.head)

8597+ ?~ sam ~

8598+ ?. ?=(%cell -.u.sam) ~

8599+ =/ fit=ifit (direct-positional-fit args.e items.u.sam actual expected env state sub.state next.state)

8600+ ?. ?=(%ok -.fit) ~

8601+ :: Enclosing inference may add constraints after this call. Only a

8602+ :: closed call-sample proof can remain stable under those later bindings.

8603+ =/ actual-final=itype (itype-normalize actual sub.fit)

8604+ =/ expected-final=itype (itype-normalize expected sub.fit)

8605+ ?^ (itype-vars actual-final) ~

8606+ ?^ (itype-vars expected-final) ~

8607+ ?: |((itype-has-tag actual-final) (itype-has-tag expected-final)) ~

8608+ :: A later argument may resolve a variable used by an earlier slot.

8609+ :: Recheck every fit and face against the completed substitution; no

8610+ :: additional binding or fresh variable is permitted in the second pass.

8611+ =/ verified=ifit (direct-positional-fit args.e items.u.sam actual expected env state sub.fit next.fit)

8612+ ?. ?=(%ok -.verified) ~

8613+ ?. &(=(sub.fit sub.verified) =(next.fit next.verified)) ~

8614+ `fit

8615+::

8616+++ infer-call-with-head

8617+ |= [e=expr env=ienv state=istate head=iresult]

8618+ ^- iresult

8619+ ?> ?=(%call -.e)

8620+ ?~ args.e [%| ["call has no argument" ~]]

8621+ ?: ?=(%| -.head) head

8622+ =/ head-type=itype (itype-walk typ.p.head sub.state.p.head)

8623+ =/ arg=iresult

8624+ ?^ t.args.e

8625+ ?: ?=(%fn -.head-type)

8626+ (infer-call-context-args args.e sample.head-type env state.p.head (span-of head.e))

8627+ (infer-simple-items (turn args.e |=(a=expr [(span-of a) ~ a])) env state.p.head)

8628+ ?: ?=(%fn -.head-type)

8629+ (infer-call-context-arg i.args.e sample.head-type env state.p.head (span-of head.e))

8630+ (infer-fragment i.args.e env state.p.head)

8631+ ?: ?=(%| -.arg) arg

8632+ =/ st=istate state.p.arg

8633+ =/ ht=itype (itype-walk typ.p.head sub.st)

8634+ ?: ?=(%fn -.ht)

8635+ =/ shape=(unit [source=iwfields target=iwfields])

8636+ ?^ t.args.e ~

8637+ (width-shape typ.p.arg sample.ht sub.st)

8638+ ?^ shape [%| ["record width constraint needs unsupported inference" ~]]

8639+ =/ fit=ifit

8640+ ?^ t.args.e (itype-fit-inner typ.p.arg sample.ht sub.st next.st & |)

8641+ (itype-fit typ.p.arg sample.ht sub.st next.st)

8642+ =/ direct=(unit ifit)

8643+ ?: ?=(%ok -.fit) ~

8644+ (direct-gate-call-fit e typ.p.arg sample.ht env st)

8645+ =. fit ?~(direct fit u.direct)

8646+ ?: ?=(%unknown -.fit) [%| ["call constraint is not supported by partial inference" ~]]

8647+ ?: ?=(%bad -.fit)

8648+ ?~ t.args.e

8649+ =/ missing=(unit idiag) (missing-union-tag i.args.e sample.ht sub.st (span-of head.e))

8650+ ?^ missing [%| u.missing]

8651+ =/ nested=(unit idiag) (nested-missing-tag i.args.e typ.p.arg sample.ht sub.st next.st (span-of head.e))

8652+ ?^ nested [%| u.nested]

8653+ [%| ["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)]]]]

8654+ =/ bad=(unit [at=span typ=itype])

8655+ (call-error-site args.e typ.p.arg sample.ht sub.st next.st)

8656+ =/ whole-args=span

8657+ [beg:(span-of i.args.e) end:(span-of (rear args.e))]

8658+ =/ arg-at=span ?~(bad whole-args at.u.bad)

8659+ =/ arg-type=itype ?~(bad typ.p.arg typ.u.bad)

8660+ [%| ["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)]]]]

8661+ =/ face-asym=?

8662+ ?^ direct |

8663+ ?^ t.args.e (itype-positional-face-asym args.e typ.p.arg sample.ht sub.fit)

8664+ (itype-face-asym typ.p.arg sample.ht sub.fit)

8665+ ?: &((itype-has-face typ.p.arg sub.fit) face-asym (itype-output-may-be-cell product.ht sub.fit))

8666+ [%| ["call result face propagation is not supported by partial inference" ~]]

8667+ [%& product.ht st(sub sub.fit, next next.fit)]

8668+ =/ result=itype [%var next.st]

8669+ =/ uni=(unit isub) (itype-unify ht [%fn typ.p.arg result] sub.st)

8670+ ?~ uni

8671+ [%| ["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)]]]]

8672+ [%& result st(next +(next.st), sub u.uni)]

8673+::

72148674++ call-error-site

72158675 |= [args=(list expr) actual=itype expected=itype sub=isub next=@ud]

72168676 ^- (unit [at=span typ=itype])

72178677 ?~ args ~

72188678 =/ original=[left=itype right=itype] [actual expected]

7219− ?: |(?=(%var -.left.original) ?=(%avar -.left.original) ?=(%nvar -.left.original) ?=(%var -.right.original) ?=(%avar -.right.original) ?=(%nvar -.right.original)) ~

8679+ ?: |(?=(%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))) ~

72208680 =. actual (itype-walk actual sub)

72218681 =. expected (itype-walk expected sub)

72228682 ?: &(?=(%face -.expected) !?=(%face -.actual))

@@ -7261,34 +8721,341 @@

72618721 ?: ?=(%bad -.fit)

72628722 =/ missing=(unit idiag) (missing-union-tag val.e payload sub.state.p.value context)

72638723 ?^ missing [%| u.missing]

8724+ =/ nested=(unit idiag) (nested-missing-tag val.e typ.p.value payload sub.state.p.value next.state.p.value context)

8725+ ?^ nested [%| u.nested]

72648726 [%| ["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)]]]]

72658727 [%& expected state.p.value(sub sub.fit, next next.fit)]

72668728::

8729+:: A known gate may receive an enclosing target before its argument is

8730+:: inferred when its result is open or a direct, matching named generic

8731+:: union. Opaque, recursive, tag-constrained and variable-bound union

8732+:: results keep the existing directional path.

8733+++ infer-contextual-call

8734+ |= [e=expr expected=itype env=ienv state=istate]

8735+ ^- iresult

8736+ ?> ?=(%call -.e)

8737+ ?~ args.e [%| ["call has no argument" ~]]

8738+ =/ head=iresult (infer-fragment head.e env state)

8739+ ?: ?=(%| -.head) head

8740+ =/ ht=itype (itype-walk typ.p.head sub.state.p.head)

8741+ ?. ?=(%fn -.ht) (infer-call-with-head e env state head)

8742+ =/ result=itype (itype-walk product.ht sub.state.p.head)

8743+ =/ eligible=?

8744+ ?: ?=(%var -.result) &

8745+ :: A direct known generic union may receive the same nominal result

8746+ :: context before its arguments are checked. Variable-bound origins,

8747+ :: pending tags, recursive identities and unknown atoms stay open.

8748+ ?. &(?=(%union -.product.ht) ?=(%union -.result) ?=(%union -.expected)) |

8749+ ?~ origin.result |

8750+ ?. =(origin.result origin.expected) |

8751+ ?~ args.result |

8752+ ?. =((lent args.result) (lent args.expected)) |

8753+ ?: |((itype-has-tag (itype-normalize result sub.state.p.head)) (itype-has-tag (itype-normalize expected sub.state.p.head))) |

8754+ ?: |((itype-has-recursive (itype-normalize result sub.state.p.head)) (itype-has-recursive (itype-normalize expected sub.state.p.head))) |

8755+ ?: |((itype-has-any-atom result sub.state.p.head) (itype-has-any-atom expected sub.state.p.head)) |

8756+ &

8757+ ?. eligible (infer-call-with-head e env state head)

8758+ ?: |(?=(%var -.expected) ?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected)) (itype-has-tag (itype-normalize expected sub.state.p.head)))

8759+ (infer-call-with-head e env state head)

8760+ =/ sub=(unit isub) (itype-unify result expected sub.state.p.head)

8761+ ?~ sub (infer-call-with-head e env state head)

8762+ (infer-call-with-head e env state [%& typ.p.head state.p.head(sub u.sub)])

8763+::

8764+:: An eligible fully faced literal receives context by name, in source order.

8765+++ width-literal-fields

8766+ |= [items=(list item) axis=@ud fuel=@ud]

8767+ ^- (unit iwfields)

8768+ =/ order=(list iwfield) ~

8769+ =/ index=(map term iwfield) *(map term iwfield)

8770+ |-

8771+ ?~ items ~

8772+ ?: =(0 fuel) ~

8773+ ?~ face.i.items ~

8774+ =/ at-axis=@ud ?~(t.items axis (mul 2 axis))

8775+ =/ entry=iwfield [u.face.i.items at-axis [%noun ~]]

8776+ ?: ?=(^ (~(get by index) name.entry)) ~

8777+ =. index (~(put by index) name.entry entry)

8778+ =. order [entry order]

8779+ ?~ t.items `[(flop order) index]

8780+ $(items t.items, axis +((mul 2 axis)), fuel (dec fuel))

8781+++ width-infer-items

8782+ |= [items=(list item) expected=(map term iwfield) env=ienv state=istate context=span]

8783+ ^- iresult

8784+ ?~ items [%| ["empty record is not supported" ~]]

8785+ ?~ face.i.items [%| ["record face needs unsupported inference" ~]]

8786+ =/ field=(unit iwfield) (~(get by expected) u.face.i.items)

8787+ =/ head=iresult

8788+ ?~ field (infer-fragment val.i.items env state)

8789+ (infer-call-context-arg val.i.items typ.u.field env state context)

8790+ ?: ?=(%| -.head) head

8791+ =/ typ=itype [%face u.face.i.items typ.p.head]

8792+ ?~ t.items [%& typ state.p.head]

8793+ =/ tail=iresult $(items t.items, state state.p.head)

8794+ ?: ?=(%| -.tail) tail

8795+ [%& [%cell typ typ.p.tail] state.p.tail]

8796+++ width-infer-literal

8797+ |= [e=expr expected=itype env=ienv state=istate context=span]

8798+ ^- (unit iresult)

8799+ ?. ?=(%tuple -.e) ~

8800+ ?. |(?=(%cell -.expected) ?=(%face -.expected)) ~

8801+ =/ source=(unit iwfields) (width-literal-fields items.e 1 4.096)

8802+ =/ target=(unit iwfields) (width-scan expected sub.state 1 4.096)

8803+ ?~ source ~

8804+ ?~ target ~

8805+ ?: (lth (lent order.u.source) (lent order.u.target)) ~

8806+ ?. (width-in-order order.u.source order.u.target)

8807+ `(infer-simple-items items.e env state)

8808+ `(width-infer-items items.e index.u.target env state context)

8809+::

8810+:: Experimental intrinsic recognition; real bindings retain normal calls.

8811+++ explicit-proj-call

8812+ |= [e=expr env=ienv state=istate]

8813+ ^- ?

8814+ ?. ?=(%call -.e) |

8815+ ?. ?=([* ~] args.e) |

8816+ ?. ?=(%wing -.head.e) |

8817+ ?. =(names.head.e ~[%proj]) |

8818+ ?: ?=(^ (ienv-lookup %proj env)) |

8819+ ?: (lien globals.state |=(n=term =(n %proj))) |

8820+ ?~ prelude.state &

8821+ ?:(?=(^ (ienv-lookup %proj values.u.prelude.state)) | &)

8822+++ infer-proj-source

8823+ |= [e=expr expected=itype env=ienv state=istate context=span]

8824+ ^- iresult

8825+ ?: ?=(%group -.e) $(e inner.e)

8826+ =/ literal=(unit iresult) (width-infer-literal e expected env state context)

8827+ ?^ literal u.literal

8828+ (infer-fragment e env state)

8829+++ infer-proj-context

8830+ |= [e=expr expected=itype env=ienv state=istate context=span]

8831+ ^- iresult

8832+ ?> ?=(%call -.e)

8833+ ?~ args.e [%| ["proj needs one record" ~]]

8834+ ?. |(?=(%cell -.expected) ?=(%face -.expected)) [%| ["proj needs an expected record type" ~]]

8835+ =/ value=iresult (infer-proj-source i.args.e expected env state context)

8836+ ?: ?=(%| -.value) value

8837+ =/ shape=(unit [source=iwfields target=iwfields])

8838+ (width-proj-shape typ.p.value expected sub.state.p.value)

8839+ ?~ shape [%| ["proj needs a known record containing its expected fields" ~]]

8840+ =/ project=(unit iwidth-result) (width-project u.shape sub.state.p.value next.state.p.value)

8841+ ?~ project [%| ["proj constraint needs unsupported inference" ~]]

8842+ =/ st=istate state.p.value(sub sub.u.project, next next.u.project)

8843+ [%& expected st(projections [[at.e e typ.p.value expected steps.u.project] projections.st])]

8844+::

8845+:: A known literal singleton in a direct union can contextualize a

8846+:: loobean literal of the same noun. Only explicit singleton and cell

8847+:: competitors are considered; opaque or variable cases stay unknown.

8848+++ explicit-singleton-in-union

8849+ |= [t=itype noun=@]

8850+ ^- ?

8851+ ?. ?=(%union -.t) |

8852+ =/ cases=(list itype) cases.t

8853+ =/ found=? |

8854+ |-

8855+ ?~ cases found

8856+ =/ c=itype i.cases

8857+ ?: ?=(%cell -.c) $(cases t.cases)

8858+ ?. ?=(%const -.c) |

8859+ ?: =(noun val.literal.c)

8860+ ?: found |

8861+ $(cases t.cases, found &)

8862+ $(cases t.cases)

8863+::

8864+:: Select a written literal-headed case only when every competing case is

8865+:: also an explicit singleton-headed cell and exactly one matches. Opaque,

8866+:: variable-bound and differently shaped cases keep inference unchanged.

8867+:: This first slice supplies context to a directly called payload. Plain

8868+:: literal data and other expressions retain their existing inference path.

8869+++ contextual-atomic-arguments

8870+ |= args=(list expr)

8871+ ^- ?

8872+ ?~ args &

8873+ ?. ?=(?(%lit %wing %ctor) -.i.args) |

8874+ $(args t.args)

8875+++ contextual-direct-payload-call

8876+ |= e=expr

8877+ ^- ?

8878+ ?: ?=(%group -.e) $(e inner.e)

8879+ ?. ?=(%call -.e) |

8880+ ?. ?=(%wing -.head.e) |

8881+ ?~ args.e |

8882+ (contextual-atomic-arguments args.e)

8883+::

8884+:: A walked variable may have concealed a union inside a substituted

8885+:: structure before this arm was called. Decline in that case rather than

8886+:: deriving provenance from the already-walked type.

8887+++ contextual-simple-sub

8888+ |= sub=isub

8889+ ^- ?

8890+ ?~ sub &

8891+ ?: ?=(?(%cell %face %fn %union %collection) -.val.i.sub) |

8892+ $(sub t.sub)

8893+::

8894+:: Check the syntactic root before scanning; scan substitutions once.

8895+++ grec-direct-context

8896+ |= [expected=itype sub=isub]

8897+ ^- ?

8898+ =/ left=@ud 4.096

8899+ |-

8900+ ?: ?=(%face -.expected)

8901+ ?: =(0 left) |

8902+ $(expected body.expected, left (dec left))

8903+ ?. ?=(%grec -.expected) |

8904+ ?~ sub &

8905+ ?: =(0 left) |

8906+ ?: ?=(?(%cell %face %fn %union %collection %grec) -.val.i.sub) |

8907+ $(sub t.sub, left (dec left))

8908+++ contextual-direct-union

8909+ |= target=itype

8910+ ^- ?

8911+ ?: ?=(%face -.target) $(target body.target)

8912+ ?=(%union -.target)

8913+++ contextual-tagged-case

8914+ |= [target=itype tag=@ sub=isub]

8915+ ^- (unit itype)

8916+ ?. ?=(%union -.target) ~

8917+ =/ remaining=(list itype) cases.target

8918+ =/ found=(unit itype) ~

8919+ =/ seen=(set @) *(set @)

8920+ |-

8921+ ?~ remaining found

8922+ =/ c=itype i.remaining

8923+ ?. ?=(%cell -.c) ~

8924+ =/ head=itype hed.c

8925+ ?. ?=(%const -.head) ~

8926+ ?: (~(has in:..zuse seen) val.literal.head) ~

8927+ =. seen (~(put in:..zuse seen) val.literal.head)

8928+ ?: =(tag val.literal.head)

8929+ $(remaining t.remaining, found `c)

8930+ $(remaining t.remaining)

8931+::

72678932++ infer-call-context-arg

72688933 |= [e=expr expected=itype env=ienv state=istate context=span]

72698934 ^- iresult

8935+ ?: ?=(%pair -.e) $(e (pair-as-cell e))

8936+ ?: ?=(%group -.e) $(e inner.e)

8937+ ?: &(?=(%body -.e) ?=(~ defs.e)) $(e final.e)

8938+ ?: ?=(%trace -.e)

8939+ =/ traced=iresult (infer-fragment val.e env state)

8940+ ?: ?=(%| -.traced) traced

8941+ $(e then.e, state state.p.traced)

72708942 =/ target=itype (itype-walk expected sub.state)

72718943 |-

72728944 ?: ?=(%face -.target) $(target (itype-walk body.target sub.state))

8945+ ?: (explicit-proj-call e env state)

8946+ (infer-proj-context e expected env state context)

8947+ :: Experimental construction only for a source-proven direct target.

8948+ :: Decline any walked structural binding to retain raw-variable provenance.

8949+ ?: &(?=(%grec -.target) ?=(%tuple -.e) (grec-direct-context expected sub.state))

8950+ =/ unfolded=(unit [view=itype left=@ud]) (grec-unfold-view target jrec-fuel.state)

8951+ ?~ unfolded [%| ["recursive mold unfolding needs unsupported inference" ~]]

8952+ ?~ items.e [%| ["recursive mold constructor needs unsupported inference" ~]]

8953+ =/ first=item i.items.e

8954+ ?. &(?=(~ face.first) ?=(%lit -.val.first) =(%term form.lit.val.first))

8955+ [%| ["recursive mold constructor needs unsupported inference" ~]]

8956+ =/ chosen=(unit itype) (contextual-tagged-case view.u.unfolded val.lit.val.first sub.state)

8957+ ?~ chosen [%| ["recursive mold constructor has no matching case" ~]]

8958+ =/ value=iresult (infer-call-context-items items.e u.chosen env state(jrec-fuel left.u.unfolded) context)

8959+ ?: ?=(%| -.value) value

8960+ =/ fit=ifit (itype-fit typ.p.value u.chosen sub.state.p.value next.state.p.value)

8961+ ?: ?=(%unknown -.fit) [%| ["recursive mold case needs unsupported inference" ~]]

8962+ ?: ?=(%bad -.fit) [%| ["recursive mold case does not fit its source shape" ~]]

8963+ [%& target state.p.value(sub sub.fit, next next.fit)]

8964+ :: Only the source-proven one-layer cell is exposed. Each recursive

8965+ :: descent consumes one written tuple; named values use ordinary fit.

8966+ ?: &(?=(%jrec -.target) ?=(%lit -.e) =(%null form.lit.e))

8967+ ?: =(0 jrec-fuel.state) [%| ["recursive mold unfolding needs unsupported inference" ~]]

8968+ [%& target state(jrec-fuel (dec jrec-fuel.state))]

8969+ ?: &(?=(%jrec -.target) ?=(%tuple -.e))

8970+ ?: =(0 jrec-fuel.state) [%| ["recursive mold unfolding needs unsupported inference" ~]]

8971+ =. state state(jrec-fuel (dec jrec-fuel.state))

8972+ =/ shape=itype

8973+ [%cell [%face head.target [%atom aura.target]] [%face tail.target target]]

8974+ =/ value=iresult (infer-call-context-items items.e shape env state context)

8975+ ?: ?=(%| -.value) value

8976+ =/ fit=ifit (itype-fit typ.p.value shape sub.state.p.value next.state.p.value)

8977+ ?: ?=(%unknown -.fit) [%| ["recursive mold cell constraint needs unsupported inference" ~]]

8978+ ?: ?=(%bad -.fit) [%| ["recursive mold cell does not fit its source shape" ~]]

8979+ [%& target state.p.value(sub sub.fit, next next.fit)]

8980+ ?: ?=(%call -.e) (infer-contextual-call e target env state)

8981+ ?: (single-structured-pattern e)

8982+ ?> ?=(%branch -.e)

8983+ =/ single=(unit iresult) (grec-single-wing-subject subject.e env state)

8984+ ?^ single (infer-known-union-context-subject e target env u.single context)

8985+ (infer-single-case-branch e env state `[target context])

8986+ ?: (cell-binder-pattern e)

8987+ (infer-cell-branch e env state `[target context])

8988+ :: In an explicit singleton context retain the written loobean noun;

8989+ :: the ordinary singleton fit compares its noun, not its spelling.

8990+ =/ singleton=(unit itype)

8991+ ?. ?=(%lit -.e) ~

8992+ ?. =(%loobean form.lit.e) ~

8993+ ?. |(?=(%const -.target) &(?=(%union -.expected) (explicit-singleton-in-union expected val.lit.e))) ~

8994+ `[%const lit.e]

8995+ ?^ singleton [%& u.singleton state]

8996+ =/ known=(unit iresult)

8997+ ?: ?=(%branch -.e) (known-union-subject subject.e env state)

8998+ ~

8999+ ?: &(?=(^ known) ?=(%| -.u.known) !(duplicate-loobean-arms e)) u.known

9000+ ?: &(?=(^ known) ?=(%& -.u.known) ?=(~ (unit-union-payload (itype-normalize typ.p.u.known sub.state.p.u.known))))

9001+ (infer-known-union-context-subject e target env u.known context)

72739002 ?: &(?=(%union -.target) ?=(%unit -.e))

72749003 (infer-unit-context e target env state context)

9004+ ?: &(?=(%flag -.target) (context-union-branch e))

9005+ (infer-union-context e target env state context)

72759006 ?: &(?=(%union -.target) (context-union-branch e))

72769007 (infer-union-context e target env state context)

72779008 ?: &(?=(%collection -.target) =(%list name.target) (context-union-branch e))

72789009 (infer-union-context e target env state context)

72799010 ?: &(?=(%collection -.target) =(%list name.target) (context-list-expression e))

72809011 (infer-list-context e target env state context)

9012+ :: A literal-headed tuple can receive the unique case's payload

9013+ :: context. The ordinary final fit still checks the complete union.

9014+ =/ selected=(unit itype)

9015+ ?. &((contextual-simple-sub sub.state) (contextual-direct-union expected) ?=(%union -.target) ?=(%tuple -.e) ?=(^ items.e)) ~

9016+ ?~ t.items.e ~

9017+ ?^ t.t.items.e ~

9018+ ?. (contextual-direct-payload-call val.i.t.items.e) ~

9019+ =/ first=item i.items.e

9020+ ?. &(?=(~ face.first) ?=(%lit -.val.first) |(=(%term form.lit.val.first) =(%null form.lit.val.first) =(%loobean form.lit.val.first))) ~

9021+ (contextual-tagged-case target val.lit.val.first sub.state)

9022+ ?^ selected

9023+ ?> ?=(%tuple -.e)

9024+ :: On this bounded shallow-call shape, preserve any inference that

9025+ :: already fits before trying the new contextual path. Neither pass

9026+ :: can recursively select a nested tuple from the atomic arguments.

9027+ =/ ordinary=(unit iresult)

9028+ =/ initial=iresult (infer-fragment e env state)

9029+ ?: ?=(%| -.initial) ~

9030+ =/ fit=ifit (itype-fit typ.p.initial target sub.state.p.initial next.state.p.initial)

9031+ ?. ?=(%ok -.fit) ~

9032+ `initial

9033+ ?^ ordinary u.ordinary

9034+ =/ value=iresult (infer-call-context-items items.e u.selected env state context)

9035+ ?: ?=(%| -.value) value

9036+ =/ fit=ifit (itype-fit typ.p.value u.selected sub.state.p.value next.state.p.value)

9037+ ?: ?=(%unknown -.fit) [%| ["tagged case needs unsupported inference" ~]]

9038+ ?: ?=(%bad -.fit) [%| ["tagged case does not fit its expected type" ~[[context "expected union case"] [(span-of e) "value"]]]]

9039+ [%& typ.p.value state.p.value(sub sub.fit, next next.fit)]

72819040 ?: &(?=(%cell -.target) ?=(%tuple -.e))

72829041 (infer-call-context-items items.e target env state context)

72839042 (infer-fragment e env state)

72849043::

72859044:: Preserve each written face; the final complete sample fit checks faces.

9045+:: A tuple or positional field face belongs to the enclosing sample,

9046+:: not to the expression at that position. A second face, if present,

9047+:: is part of the value's own expected type.

9048+++ projection-field-target

9049+ |= expected=itype

9050+ ^- itype

9051+ ?:(?=(%face -.expected) body.expected expected)

9052+::

72869053++ infer-call-context-items

72879054 |= [items=(list item) expected=itype env=ienv state=istate context=span]

72889055 ^- iresult

72899056 ?~ items [%| ["empty cell is not supported by partial inference" ~]]

72909057 ?~ t.items

7291− =/ last=iresult (infer-call-context-arg val.i.items expected env state context)

9058+ =/ last=iresult (infer-call-context-arg val.i.items (projection-field-target expected) env state context)

72929059 ?: ?=(%| -.last) last

72939060 =/ typ=itype typ.p.last

72949061 =. typ ?~(face.i.items typ [%face u.face.i.items typ])

@@ -7297,7 +9064,7 @@

72979064 |-

72989065 ?: ?=(%face -.target) $(target (itype-walk body.target sub.state))

72999066 ?. ?=(%cell -.target) (infer-simple-items items env state)

7300− =/ head=iresult (infer-call-context-arg val.i.items hed.target env state context)

9067+ =/ head=iresult (infer-call-context-arg val.i.items (projection-field-target hed.target) env state context)

73019068 ?: ?=(%| -.head) head

73029069 =/ typ=itype typ.p.head

73039070 =. typ ?~(face.i.items typ [%face u.face.i.items typ])

@@ -7309,13 +9076,13 @@

73099076 |= [args=(list expr) expected=itype env=ienv state=istate context=span]

73109077 ^- iresult

73119078 ?~ args [%| ["call has no argument" ~]]

7312− ?~ t.args (infer-call-context-arg i.args expected env state context)

9079+ ?~ t.args (infer-call-context-arg i.args (projection-field-target expected) env state context)

73139080 =/ target=itype (itype-walk expected sub.state)

73149081 |-

73159082 ?: ?=(%face -.target) $(target (itype-walk body.target sub.state))

73169083 ?. ?=(%cell -.target)

73179084 (infer-simple-items (turn args |=(a=expr [(span-of a) ~ a])) env state)

7318− =/ head=iresult (infer-call-context-arg i.args hed.target env state context)

9085+ =/ head=iresult (infer-call-context-arg i.args (projection-field-target hed.target) env state context)

73199086 ?: ?=(%| -.head) head

73209087 =/ tail=iresult (infer-call-context-args t.args tal.target env state.p.head context)

73219088 ?: ?=(%| -.tail) tail

@@ -7336,11 +9103,55 @@

73369103 ?: ?=(%| -.tail) tail

73379104 [%& [%cell ht typ.p.tail] state.p.tail]

73389105::

7339−:: A single two-binder cell pattern covers every value of a cell type.

7340−:: No other pattern matrix is implemented here.

9106+:: A single all-binder cell pattern covers a known cell spine; the final

9107+:: binder captures the remaining noun. Other pattern matrices stay partial.

9108+::

9109+:: Validate binders before reading the subject, preserving shadow-error

9110+:: precedence. The last binder receives the entire remaining tail.

9111+++ cell-pattern-names

9112+ |= [pats=(list pattern) env=ienv globals=(list term) seen=(list term)]

9113+ ^- (each (list term) @t)

9114+ ?~ pats [%& ~]

9115+ ?. ?=(%bind -.i.pats) [%| 'branch pattern is not supported by partial inference']

9116+ =/ name=term name.i.pats

9117+ ?: |(=(name %proj) ?=(^ (ienv-lookup name env)) (lien globals |=(n=term =(n name))) (lien seen |=(n=term =(n name))))

9118+ [%| 'pattern shadows a name']

9119+ =/ rest=(each (list term) @t) $(pats t.pats, seen [name seen])

9120+ ?: ?=(%| -.rest) rest

9121+ [%& [name p.rest]]

9122+::

9123+++ cell-pattern-types

9124+ |= [names=(list term) env=ienv next=@ud]

9125+ ^- [typ=itype env=ienv next=@ud]

9126+ ?~ names !!

9127+ =/ head=itype [%var next]

9128+ =/ scope=ienv [[i.names [head ~]] env]

9129+ ?~ t.names [head scope +(next)]

9130+ =/ tail=[typ=itype env=ienv next=@ud] $(names t.names, env scope, next +(next))

9131+ [[%cell head typ.tail] env.tail next.tail]

9132+::

9133+:: At every position that must be a cell, opaque or sum types may still

9134+:: contain cells. Do not report a definite mismatch without unfolding them.

9135+++ cell-pattern-spine-unknown

9136+ |= [typ=itype names=(list term) sub=isub]

9137+ ^- ?

9138+ ?~ names |

9139+ ?~ t.names |

9140+ =. typ (itype-walk typ sub)

9141+ ?: ?=(%cell -.typ) $(typ tal.typ, names t.names)

9142+ |(?=(%union -.typ) ?=(%collection -.typ) ?=(%recursive -.typ) ?=(%jrec -.typ) ?=(%grec -.typ) ?=(%noun -.typ) ?=(%fn -.typ) ?=(%tag -.typ))

9143+::

9144+++ cell-binder-pattern

9145+ |= e=expr

9146+ ^- ?

9147+ ?. ?=(%branch -.e) |

9148+ ?~ arms.e |

9149+ ?^ t.arms.e |

9150+ ?. ?=(%cell -.pat.i.arms.e) |

9151+ !(single-structured-pattern e)

73419152::

73429153++ infer-cell-branch

7343− |= [e=expr env=ienv state=istate]

9154+ |= [e=expr env=ienv state=istate expected=(unit [typ=itype context=span])]

73449155 ^- iresult

73459156 ?> ?=(%branch -.e)

73469157 ?~ arms.e [%| ["branch is not supported by partial inference" ~]]

@@ -7349,25 +9160,31 @@

73499160 =/ pats=(list pattern) items.pat.arm

73509161 ?~ pats [%| ["branch pattern is not supported by partial inference" ~]]

73519162 ?~ t.pats [%| ["branch pattern is not supported by partial inference" ~]]

7352− ?^ t.t.pats [%| ["branch pattern is not supported by partial inference" ~]]

7353− ?. ?=(%bind -.i.pats) [%| ["branch pattern is not supported by partial inference" ~]]

7354− ?. ?=(%bind -.i.t.pats) [%| ["branch pattern is not supported by partial inference" ~]]

7355− =/ one=term name.i.pats

7356− =/ two=term name.i.t.pats

7357− ?: |(=(one two) ?=(^ (ienv-lookup one env)) ?=(^ (ienv-lookup two env)) (lien globals.state |=(x=term |(=(x one) =(x two)))))

7358− [%| ["pattern shadows a name" ~]]

9163+ =/ names=(each (list term) @t) (cell-pattern-names pats env globals.state ~)

9164+ ?: ?=(%| -.names) [%| [(trip p.names) ~]]

73599165 =/ subject=iresult (infer-fragment subject.e env state)

73609166 ?: ?=(%| -.subject) subject

73619167 =/ st=istate state.p.subject

7362− ?: (itype-has-recursive (itype-normalize typ.p.subject sub.st))

9168+ =/ subject-type=itype (itype-normalize typ.p.subject sub.st)

9169+ ?: (itype-has-recursive subject-type)

73639170 [%| ["recursive pattern is not supported by partial inference" ~]]

73649171 ?: (itype-has-face typ.p.subject sub.st)

73659172 [%| ["record patterns are not supported by partial inference" ~]]

7366− =/ head=itype [%var next.st]

7367− =/ tail=itype [%var +(next.st)]

7368− =/ sub=(unit isub) (itype-unify typ.p.subject [%cell head tail] sub.st)

9173+ ?: (cell-pattern-spine-unknown subject-type p.names sub.st)

9174+ [%| ["cell pattern subject is not supported by partial inference" ~]]

9175+ =/ binders=[typ=itype env=ienv next=@ud] (cell-pattern-types p.names env next.st)

9176+ =/ sub=(unit isub) (itype-unify typ.p.subject typ.binders sub.st)

73699177 ?~ sub [%| ["cell pattern does not match the subject type" ~]]

7370− (infer-fragment val.arm [[one [head ~]] [two [tail ~]] env] st(next (add 2 next.st), sub u.sub))

9178+ =. st st(next next.binders, sub u.sub)

9179+ ?~ expected (infer-fragment val.arm env.binders st)

9180+ =/ body=iresult (infer-call-context-arg val.arm typ.u.expected env.binders st context.u.expected)

9181+ ?: ?=(%| -.body) body

9182+ =/ fit=ifit (itype-fit typ.p.body typ.u.expected sub.state.p.body next.state.p.body)

9183+ ?: ?=(%unknown -.fit) [%| ["cell branch result constraint is not supported by partial inference" ~]]

9184+ ?: ?=(%bad -.fit) [%| ["cell branch arm does not fit its expected type" ~[[context.u.expected "expected type"] [(span-of val.arm) "branch arm"]]]]

9185+ ?: (itype-has-tag (itype-normalize typ.u.expected sub.fit))

9186+ [%| ["cell branch result needs context in partial inference" ~]]

9187+ [%& typ.u.expected state.p.body(sub sub.fit, next next.fit)]

73719188::

73729189++ show-itype

73739190 |= [t=itype sub=isub]

@@ -7380,12 +9197,19 @@

73809197 %avar

73819198 ?: (lth id.t 26) [(add 65 id.t) ~]

73829199 "T{<id.t>}"

9200+ %rvar

9201+ ?: (lth id.t 26) [(add 65 id.t) ~]

9202+ "T{<id.t>}"

73839203 %nvar

73849204 ?: (lth id.t 26) [(add 65 id.t) ~]

73859205 "T{<id.t>}"

9206+ %rnvar

9207+ ?: (lth id.t 26) [(add 65 id.t) ~]

9208+ "T{<id.t>}"

73869209 %atom "@{(trip aura.t)}"

73879210 %any-atom "@"

73889211 %flag "?"

9212+ %noun "*"

73899213 %tag (trip txt.literal.t)

73909214 %const (trip txt.literal.t)

73919215 %union

@@ -7393,6 +9217,8 @@

73939217 ?~ args.t (trip u.label.t)

73949218 "({(trip u.label.t)} {(show-itype-cases args.t sub)})"

73959219 %recursive ?~(label.t "recursive mold" (trip u.label.t))

9220+ %jrec ?~(label.t "recursive mold" (trip u.label.t))

9221+ %grec ?~(label.t "recursive mold" "({(trip u.label.t)} {(show-itype-cases args.t sub)})")

73969222 %collection "({(trip name.t)} {(show-itype-cases args.t sub)})"

73979223 %face "[{(trip name.t)}={(show-itype-context body.t sub)}]"

73989224 %fn "$-({(show-itype-context sample.t sub)} {(show-itype-context product.t sub)})"

@@ -7428,15 +9254,20 @@

74289254 ^- ?

74299255 ?- -.typ

74309256 %nvar &

9257+ %rnvar &

74319258 %var |

74329259 %avar |

9260+ %rvar |

74339261 %atom |

74349262 %any-atom |

74359263 %flag |

9264+ %noun |

74369265 %tag |

74379266 %const |

74389267 %union |((lien cases.typ |=(c=itype (itype-has-nvar c))) (lien args.typ |=(c=itype (itype-has-nvar c))))

74399268 %recursive |

9269+ %jrec |

9270+ %grec (lien args.typ |=(c=itype (itype-has-nvar c)))

74409271 %collection (lien args.typ |=(c=itype (itype-has-nvar c)))

74419272 %face $(typ body.typ)

74429273 %fn |($(typ sample.typ) $(typ product.typ))

@@ -7447,7 +9278,7 @@

74479278 |= [label=tape typ=itype sub=isub]

74489279 ^- tape

74499280 =/ normalized=itype (itype-normalize typ sub)

7450− ?: |(?=(%var -.normalized) ?=(%avar -.normalized) (itype-has-nvar normalized) (itype-has-tag normalized) (itype-has-union normalized)) label

9281+ ?: |(?=(%var -.normalized) ?=(%avar -.normalized) ?=(%rvar -.normalized) (itype-has-nvar normalized) (itype-has-tag normalized) (itype-has-union normalized)) label

74519282 ?: (itype-has-hidden-recursive normalized) label

74529283 =/ vars=(list @ud) (unique-type-vars (itype-vars normalized))

74539284 ?: (gth (lent vars) 26) label

@@ -7469,6 +9300,7 @@

74699300 ?+ -.resolved ~

74709301 %var `id.resolved

74719302 %avar `id.resolved

9303+ %rvar `id.resolved

74729304 ==

74739305 ?~ ident $(caps t.caps)

74749306 ?: =(n u.ident) &

@@ -7483,6 +9315,7 @@

74839315 ?+ -.resolved ~

74849316 %var `id.resolved

74859317 %avar `id.resolved

9318+ %rvar `id.resolved

74869319 ==

74879320 ?~ ident $(caps t.caps)

74889321 ?: =(n u.ident) `i.caps

@@ -7497,6 +9330,7 @@

74979330 ?+ -.resolved ~

74989331 %var `id.resolved

74999332 %avar `id.resolved

9333+ %rvar `id.resolved

75009334 ==

75019335 ?~ ident $(caps t.caps)

75029336 =/ found=(unit icap) (cap-with-id u.ident t.caps sub)

@@ -7512,6 +9346,7 @@

75129346 ?+ -.resolved ~

75139347 %var `id.resolved

75149348 %avar `id.resolved

9349+ %rvar `id.resolved

75159350 ==

75169351 ?~ ident &

75179352 ?: (cap-id-in u.ident t.caps sub) &

@@ -7526,8 +9361,8 @@

75269361 ^- ?

75279362 ?~ caps |

75289363 =/ resolved=itype (itype-walk [%var id.i.caps] sub)

7529− ?: ?=(%avar -.resolved)

7530− ?: =(n id.resolved) &

9364+ ?: |(?=(%avar -.resolved) ?=(%rvar -.resolved))

9365+ ?: =(n +.resolved) &

75319366 $(caps t.caps)

75329367 $(caps t.caps)

75339368::

@@ -7537,14 +9372,19 @@

75379372 ?- -.t

75389373 %var |

75399374 %avar =(n id.t)

9375+ %rvar =(n id.t)

75409376 %nvar |

9377+ %rnvar |

75419378 %atom |

75429379 %any-atom |

75439380 %flag |

9381+ %noun |

75449382 %tag |

75459383 %const |

75469384 %union |((lien cases.t |=(c=itype (has-atom-var n c))) (lien args.t |=(c=itype (has-atom-var n c))))

75479385 %recursive |

9386+ %jrec |

9387+ %grec (lien args.t |=(c=itype (has-atom-var n c)))

75489388 %collection (lien args.t |=(c=itype (has-atom-var n c)))

75499389 %face $(t body.t)

75509390 %fn |($(t sample.t) $(t product.t))

@@ -7584,6 +9424,10 @@

75849424 =/ out=tape ""

75859425 |-

75869426 ?~ vars out

9427+ ?: (itype-var-is-restricted i.vars t)

9428+ =/ sep=tape ?:(printed ", " " where ")

9429+ =/ clause=tape "{sep}{(show-itype [%rvar i.vars] ~)} is an atom other than ?"

9430+ $(vars t.vars, printed &, out (weld out clause))

75879431 ?: (itype-var-is-atom i.vars t)

75889432 =/ sep=tape ?:(printed ", " " where ")

75899433 =/ clause=tape "{sep}{(show-itype [%avar i.vars] ~)} is an atom"

@@ -7592,9 +9436,9 @@

75929436::

75939437:: Build the supported part of the value environment in dependency order.

75949438:: Each pass adds successful definitions. Forward references become

7595−:: available on a later pass; mutually recursive groups and unsupported

7596−:: syntax do not enter the environment. Generalized definitions are closed, so a

7597−:: use instantiates its variables afresh.

9439+:: available on a later pass; unsupported syntax does not enter the

9440+:: environment. Generalized definitions are closed, so a use instantiates

9441+:: its variables afresh.

75989442::

75999443++ global-value-names

76009444 |= ds=(list def)

@@ -7684,6 +9528,7 @@

76849528++ infer-recursive-gate

76859529 |= [d=def env=ienv state=istate]

76869530 ^- iresult

9531+ =. gate-defs.state ~

76879532 ?. ?=(%value -.d) [%| ["recursive definition is not a gate" ~]]

76889533 ?. |(?=(%gate -.val.d) ?=(%gate-wide -.val.d))

76899534 [%| ["recursive definition is not a gate" ~]]

@@ -7824,9 +9669,9 @@

78249669 * ~

78259670 ==

78269671::

7827−:: Infer a cyclic top-level component with one monomorphic seed per gate.

7828−:: All members must succeed before any scheme is available; local cyclic

7829−:: groups, pending constraints and unresolved branch joins remain partial.

9672+:: Infer a cyclic component with one monomorphic seed per gate. All members

9673+:: must succeed before any scheme is available; pending constraints and

9674+:: unresolved branch joins remain partial.

78309675+$ igate-entry [name=term typ=itype body=expr env=ienv caps=icaps]

78319676+$ igate-seeds (each [entries=(list igate-entry) state=istate] idiag)

78329677++ seed-gate-group

@@ -7893,6 +9738,7 @@

78939738 ?: (constrained-capitals caps.entry sub.state)

78949739 [%| ["explicit capital constraints are not supported by partial inference" ~]]

78959740 =/ typ=itype (itype-normalize typ.entry sub.state)

9741+ ?: (itype-has-nvar typ) [%| ["recursive group needs unsupported inference" ~]]

78969742 ?: |((itype-has-tag typ) (itype-has-hidden-generic typ) (itype-has-hidden-recursive typ) (unsupported-atom-vars typ caps.entry binders.state sub.state))

78979743 [%| ["recursive group needs unsupported inference" ~]]

78989744 =/ free=(list @ud) (weld (free-env-vars env sub.state) (free-cap-vars caps.outer sub.state))

@@ -7911,41 +9757,46 @@

79119757 [%| ["recursive group contains duplicate names" ~]]

79129758 ?: (lien names |=(n=term ?=(^ (ienv-lookup n env))))

79139759 [%| ["recursive group shadows a name" ~]]

7914− =/ scoped=istate state(globals (weld names globals.state))

9760+ =/ scoped=istate state(globals (weld names globals.state), gate-defs ~)

79159761 =/ seeded=igate-seeds (seed-gate-group ds env scoped)

79169762 ?: ?=(%| -.seeded) seeded

79179763 =/ seeds=ienv (group-seed-env entries.p.seeded ~)

79189764 =/ body=igate-seeds (infer-gate-group-bodies entries.p.seeded seeds state.p.seeded)

79199765 ?: ?=(%| -.body) body

9766+ :: Per-member ownership through mutual recursion is not implemented.

9767+ ?: !=(projections.state.p.body projections.state)

9768+ [%| ["record projection in recursive groups needs unsupported inference" ~]]

9769+ ?: !=(holes.state.p.body holes.state)

9770+ [%| ["holes in recursive groups need unsupported inference" ~]]

79209771 ?: (pending-tags tags.state.p.body sub.state.p.body)

79219772 [%| ["recursive group has unresolved literal constraints" ~]]

79229773 =/ schemes=(each ienv idiag) (group-schemes entries.p.body env state state.p.body)

79239774 ?: ?=(%| -.schemes) schemes

79249775 [%& [(weld p.schemes env) state.p.body(globals globals.state)]]

79259776::

9777+++ width-finalize

9778+ |= [ps=(list iwprojection) sub=isub visible=(list @ud)]

9779+ ^- (unit (list iwprojection))

9780+ ?~ ps `~

9781+ ?: (lien t.ps |=(p=iwprojection =(at.p at.i.ps))) ~

9782+ =/ src=itype (default-decimals (itype-normalize source.i.ps sub))

9783+ =/ dst=itype (default-decimals (itype-normalize target.i.ps sub))

9784+ ?: |((itype-has-nvar src) (itype-has-nvar dst) (itype-has-tag src) (itype-has-tag dst)) ~

9785+ =/ vars=(list @ud) (weld (itype-vars src) (itype-vars dst))

9786+ ?. (levy vars |=(n=@ud (lien visible |=(v=@ud =(n v))))) ~

9787+ =/ rest=(unit (list iwprojection)) $(ps t.ps)

9788+ ?~ rest ~

9789+ =/ entry=iwprojection i.ps

9790+ =. entry entry(source src, target dst)

9791+ `[entry u.rest]

9792+::

79269793++ add-supported-defs

7927− |= [ds=(list def) 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)]

7928− ^- ienv

7929− ?~ ds env

7930− =/ d=def i.ds

7931− ?: ?=(%mold -.d) $(ds t.ds)

7932− ?. (unique-value-name name.d globals) $(ds t.ds)

7933− ?^ (ienv-lookup name.d env) $(ds t.ds)

7934− =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

7935− =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | at top prelude]

7936− =. initial (reserve-def-caps val.d initial)

7937− =/ result=iresult (infer-fragment val.d env initial)

7938− =? result ?=(%| -.result) (infer-recursive-gate d env initial)

7939− ?: ?=(%| -.result) $(ds t.ds)

7940− ?: (constrained-capitals caps.state.p.result sub.state.p.result) $(ds t.ds)

7941− =/ typ=itype (default-decimals (itype-normalize typ.p.result sub.state.p.result))

7942− ?: |((pending-tags tags.state.p.result sub.state.p.result) (itype-has-tag typ)) $(ds t.ds)

7943− ?: (unsupported-atom-vars typ caps.state.p.result binders.state.p.result sub.state.p.result) $(ds t.ds)

7944− =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

7945− ?: (gth (lent vars) 26) $(ds t.ds)

7946− $(ds t.ds, env [[name.d [typ vars]] env])

9794+ |= [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)]

9795+ ^- [env=ienv artifacts=(list iwidth-definition)]

9796+ (add-supported-defs-core ds all-defs checked heads env molds globals externals surs mark-externals marks jimports reserved-molds at prelude artifacts ~)

79479797::

7948−+$ iresolved [env=ienv grouped=(list term)]

9798+

9799++$ iresolved [env=ienv grouped=(list term) artifacts=(list iwidth-definition)]

79499800+$ iadj (map term (list term))

79509801+$ ivisited (map term ?)

79519802+$ iwork (list [name=term done=?])

@@ -8039,9 +9890,9 @@

80399890 (lien (graph-edges i.component graph) |=(x=term =(x i.component)))

80409891::

80419892++ add-groups

8042− |= [ds=(list def) components=icomponents graph=iadj env=ienv grouped=(list term) state=istate]

9893+ |= [ds=(list def) components=icomponents graph=iadj env=ienv grouped=(list term) artifacts=(list iwidth-definition) state=istate]

80439894 ^- iresolved

8044− ?~ components [env grouped]

9895+ ?~ components [env grouped artifacts]

80459896 =/ component=(list term) i.components

80469897 ?. (graph-cycle component graph) $(components t.components)

80479898 ?: (lien component |=(n=term ?=(^ (ienv-lookup n env)))) $(components t.components)

@@ -8058,25 +9909,186 @@

80589909++ resolve-groups

80599910 |= [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)]

80609911 ^- iresolved

9912+ (resolve-groups-core ds molds globals externals surs mark-externals marks jimports reserved-molds at prelude ~)

9913+::

9914+

9915+++ add-supported-defs-core

9916+ |= [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)])]

9917+ ^- [env=ienv artifacts=(list iwidth-definition)]

9918+ ?~ ds [env artifacts]

9919+ =/ d=def i.ds

9920+ ?: ?=(%mold -.d) $(ds t.ds)

9921+ ?. (unique-value-name name.d globals) $(ds t.ds)

9922+ ?^ (ienv-lookup name.d env) $(ds t.ds)

9923+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

9924+ =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | at top prelude ~ 256 ~ ~ ~ ~]

9925+ =. grec-index.initial index

9926+ =. gate-defs.initial checked

9927+ =. head-evidence.initial heads

9928+ =. initial (reserve-def-caps val.d initial)

9929+ =/ result=iresult (infer-fragment val.d env initial)

9930+ =? result ?=(%| -.result) (infer-recursive-gate d env initial)

9931+ ?: ?=(%| -.result) $(ds t.ds)

9932+ =. state.p.result (promote-restricted-numbers state.p.result env)

9933+ =. 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)))

9934+ ?^ (unresolved-hole holes.state.p.result holes.initial state.p.result) $(ds t.ds)

9935+ ?: (constrained-capitals caps.state.p.result sub.state.p.result) $(ds t.ds)

9936+ =/ typ=itype (default-decimals (itype-normalize typ.p.result sub.state.p.result))

9937+ ?: |((pending-tags tags.state.p.result sub.state.p.result) (itype-has-tag typ)) $(ds t.ds)

9938+ ?: (unsupported-atom-vars typ caps.state.p.result binders.state.p.result sub.state.p.result) $(ds t.ds)

9939+ =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

9940+ ?: (gth (lent vars) 26) $(ds t.ds)

9941+ =/ finalized=(unit (list iwprojection))

9942+ (width-finalize projections.state.p.result sub.state.p.result vars)

9943+ ?~ finalized $(ds t.ds)

9944+ =? artifacts ?=(^ u.finalized)

9945+ [[name.d val.d typ sub.state.p.result (flop u.finalized)] artifacts]

9946+ =? checked |(?=(%gate -.val.d) ?=(%gate-wide -.val.d)) (~(put by checked) name.d d)

9947+ $(ds t.ds, env [[name.d [typ vars]] env], checked checked)

9948+::

9949+++ resolve-groups-core

9950+ |= [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)])]

9951+ ^- iresolved

80619952 =/ env=ienv ~

80629953 =/ grouped=(list term) ~

9954+ =/ artifacts=(list iwidth-definition) ~

80639955 =/ names=(list term) (global-value-names ds)

80649956 =/ nameset=ivisited (graph-nameset names ~)

80659957 =/ graph=iadj (graph-make-forward ds nameset ~)

80669958 =/ components=icomponents (graph-components ds names)

80679959 =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

9960+ =/ heads=(unit igate-prelude-evidence) (direct-prelude-evidence ds prelude)

80689961 |-

8069− =/ next=ienv (add-supported-defs ds env molds globals externals surs mark-externals marks jimports reserved-molds at prelude)

8070− =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | at top prelude]

8071− =/ out=iresolved (add-groups ds components graph next grouped initial)

9962+ =/ next=[env=ienv artifacts=(list iwidth-definition)]

9963+ (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)

9964+ =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | at top prelude ~ 256 ~ ~ ~ ~]

9965+ =. grec-index.initial index

9966+ =/ out=iresolved (add-groups ds components graph env.next grouped artifacts.next initial)

80729967 ?: =(env env.out) out

8073− $(env env.out, grouped grouped.out)

9968+ $(env env.out, grouped grouped.out, artifacts artifacts.out)

80749969::

80759970++ resolve-supported-defs

80769971 |= [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)]

80779972 ^- ienv

80789973 env:(resolve-groups ds molds globals externals surs mark-externals marks jimports reserved-molds at prelude)

80799974::

9975+:: A diagnostic-only proof for a narrow syntactic value cycle. Every

9976+:: edge is an unqualified wing in a supported expression, and samples

9977+:: may not shadow global bindings. Unknown forms yield no conclusion.

9978++$ icyclesite [name=term at=span]

9979++$ icycle [name=term first=span next=span]

9980+++ cycle-sites-list

9981+ |= [xs=(list expr) globals=(list term) locals=(list term)]

9982+ ^- (unit (list icyclesite))

9983+ ?~ xs `~

9984+ =/ first=(unit (list icyclesite)) (cycle-sites i.xs globals locals)

9985+ ?~ first ~

9986+ =/ tail=(unit (list icyclesite)) $(xs t.xs)

9987+ ?~ tail ~

9988+ `(weld u.first u.tail)

9989+::

9990+++ cycle-sample-name

9991+ |= [sam=sample globals=(list term) locals=(list term)]

9992+ ^- (unit (unit term))

9993+ ?- -.sam

9994+ %bind

9995+ ?: (lien (weld globals locals) |=(n=term =(n name.sam))) ~

9996+ ``name.sam

9997+ %face

9998+ ?: (lien (weld globals locals) |=(n=term =(n name.sam))) ~

9999+ ``name.sam

10000+ %bare `~

10001+ * ~

10002+ ==

10003+::

10004+++ cycle-sites

10005+ |= [e=expr globals=(list term) locals=(list term)]

10006+ ^- (unit (list icyclesite))

10007+ ?- -.e

10008+ %wing

10009+ ?. ?=([@ ~] names.e) ~

10010+ `~[[i.names.e at.e]]

10011+ %lit `~

10012+ %str

10013+ ?: (lien pieces.e |=(p=piece ?=(%expr -.p))) ~

10014+ `~

10015+ %group $(e inner.e)

10016+ %body ?~(defs.e $(e final.e) ~)

10017+ %cast $(e val.e)

10018+ %gate

10019+ =/ binder=(unit (unit term)) (cycle-sample-name sample.e globals locals)

10020+ ?~ binder ~

10021+ =/ nested=(list term) ?~(u.binder locals [u.u.binder locals])

10022+ $(e body.e, locals nested)

10023+ %gate-wide

10024+ =/ binder=(unit (unit term)) (cycle-sample-name sample.e globals locals)

10025+ ?~ binder ~

10026+ =/ nested=(list term) ?~(u.binder locals [u.u.binder locals])

10027+ $(e body.e, locals nested)

10028+ %call

10029+ =/ first=(unit (list icyclesite)) $(e head.e)

10030+ ?~ first ~

10031+ =/ tail=(unit (list icyclesite)) (cycle-sites-list args.e globals locals)

10032+ ?~ tail ~

10033+ `(weld u.first u.tail)

10034+ * ~

10035+ ==

10036+::

10037+++ cycle-definitely-atom

10038+ |= e=expr

10039+ ^- ?

10040+ ?: ?=(%group -.e) $(e inner.e)

10041+ ?: &(?=(%body -.e) ?=(~ defs.e)) $(e final.e)

10042+ ?. ?=(%cast -.e) |

10043+ |(?=(%aura -.shape.e) ?=(%flag -.shape.e))

10044+::

10045+++ cycle-proof-group

10046+ |= [members=(list def) globals=(list term)]

10047+ ^- ?

10048+ ?~ members &

10049+ ?. ?=(%value -.i.members) |

10050+ ?. (unique-value-name name.i.members globals) |

10051+ ?. ?=(^ (cycle-sites val.i.members globals ~)) |

10052+ $(members t.members)

10053+::

10054+++ cycle-find-site

10055+ |= [sites=(list icyclesite) component=(list term)]

10056+ ^- (unit span)

10057+ ?~ sites ~

10058+ ?: (lien component |=(n=term =(n name.i.sites))) `at.i.sites

10059+ $(sites t.sites)

10060+::

10061+++ cycle-group-errors

10062+ |= [members=(list def) component=(list term) globals=(list term)]

10063+ ^- (list icycle)

10064+ ?~ members ~

10065+ =/ d=def i.members

10066+ ?> ?=(%value -.d)

10067+ =/ tail=(list icycle) $(members t.members)

10068+ ?. (cycle-definitely-atom val.d) tail

10069+ =/ sites=(unit (list icyclesite)) (cycle-sites val.d globals ~)

10070+ ?~ sites tail

10071+ =/ found=(unit span) (cycle-find-site u.sites component)

10072+ ?~ found tail

10073+ [[name.d at.d u.found] tail]

10074+::

10075+++ definite-value-cycles

10076+ |= [ds=(list def) globals=(list term)]

10077+ ^- (list icycle)

10078+ =/ names=(list term) (global-value-names ds)

10079+ =/ graph=iadj (graph-make-forward ds (graph-nameset names ~) ~)

10080+ =/ components=icomponents (graph-components ds names)

10081+ =/ out=(list icycle) ~

10082+ |-

10083+ ?~ components out

10084+ =/ component=(list term) i.components

10085+ ?. (graph-cycle component graph) $(components t.components)

10086+ =/ members=(list def)

10087+ (skim ds |=(d=def &(?=(%value -.d) (lien component |=(n=term =(n name.d))))))

10088+ ?. =((lent members) (lent component)) $(components t.components)

10089+ ?. (cycle-proof-group members globals) $(components t.components)

10090+ $(components t.components, out (weld (cycle-group-errors members component globals) out))

10091+::

808010092+| %union-analysis

808110093::

808210094:: A conservative projection of written molds onto noun shapes. The

@@ -8212,11 +10224,142 @@

821210224 [at.first at.second (union-relate a (project-union-mold second molds ~))]

821310225 (weld pairs $(cases t.cases))

821410226::

10227+:: A closed structural mold supplies no equation to determine a hole.

10228+:: Applications, references, unbound capitals and unions are unproved.

10229+++ simple-mold-hole

10230+ |= sh=shape

10231+ ^- (unit (unit span))

10232+ ?: ?=(%generic -.sh)

10233+ ?~ vars.sh ~

10234+ ?. (distinct-params vars.sh) ~

10235+ (simple-mold-hole-in body.sh vars.sh)

10236+ (simple-mold-hole-in sh ~)

10237+++ simple-mold-hole-in

10238+ |= [sh=shape vars=(list @t)]

10239+ ^- (unit (unit span))

10240+ ?- -.sh

10241+ %hole ``at.sh

10242+ ?(%aura %noun %void %flag %const) `~

10243+ %tvar ?:((lien vars |=(v=@t =(v name.sh))) `~ ~)

10244+ %cell (simple-mold-field-holes fields.sh vars)

10245+ %fn

10246+ =/ a=(unit (unit span)) $(sh sample.sh)

10247+ ?~ a ~

10248+ =/ b=(unit (unit span)) $(sh product.sh)

10249+ ?~ b ~

10250+ `?~(u.a u.b u.a)

10251+ %generic ~

10252+ * ~

10253+ ==

10254+++ simple-mold-field-holes

10255+ |= [fields=(list field) vars=(list @t)]

10256+ ^- (unit (unit span))

10257+ ?~ fields `~

10258+ =/ f=field i.fields

10259+ =/ first=(unit (unit span))

10260+ ?- -.f

10261+ %face (simple-mold-hole-in shape.f vars)

10262+ %bare (simple-mold-hole-in shape.f vars)

10263+ %pun ~

10264+ ==

10265+ ?~ first ~

10266+ =/ rest=(unit (unit span)) $(fields t.fields)

10267+ ?~ rest ~

10268+ `?~(u.first u.rest u.first)

10269+++ simple-local-mold-hole

10270+ |= defs=(list def)

10271+ ^- (unit span)

10272+ ?~ defs ~

10273+ ?. ?=(%mold -.i.defs) $(defs t.defs)

10274+ =/ found=(unit (unit span)) (simple-mold-hole shape.i.defs)

10275+ ?~ found $(defs t.defs)

10276+ ?^ u.found u.found

10277+ $(defs t.defs)

10278+::

10279+:: A partial prelude may omit unsupported declarations, but may not

10280+:: publish an interface while a named mold's hole remains unchecked.

10281+++ shape-has-hole

10282+ |= sh=shape

10283+ ^- ?

10284+ ?- -.sh

10285+ %hole &

10286+ %path (lien segs.sh |=(s=pseg ?=(%inferred -.s)))

10287+ %apply (lien args.sh shape-has-hole)

10288+ %union (lien cases.sh shape-has-hole)

10289+ %cell (lien fields.sh field-has-hole)

10290+ %fn |($(sh sample.sh) $(sh product.sh))

10291+ %generic $(sh body.sh)

10292+ * |

10293+ ==

10294+++ field-has-hole

10295+ |= f=field

10296+ ^- ?

10297+ ?- -.f

10298+ %face (shape-has-hole shape.f)

10299+ %bare (shape-has-hole shape.f)

10300+ %pun |

10301+ ==

10302+++ named-mold-has-hole

10303+ |= ds=(list def)

10304+ ^- ?

10305+ ?~ ds |

10306+ ?: &(?=(%mold -.i.ds) (shape-has-hole shape.i.ds)) &

10307+ $(ds t.ds)

10308+::

10309+++ sample-has-hole

10310+ |= sam=sample

10311+ ^- ?

10312+ ?- -.sam

10313+ %face (shape-has-hole shape.sam)

10314+ %bare (shape-has-hole shape.sam)

10315+ %cell (lien items.sam sample-has-hole)

10316+ * |

10317+ ==

10318+++ def-has-hole

10319+ |= d=def

10320+ ^- ?

10321+ ?- -.d

10322+ %mold (shape-has-hole shape.d)

10323+ %value (expr-has-hole val.d)

10324+ ==

10325+++ expr-has-hole

10326+ |= e=expr

10327+ ^- ?

10328+ ?- -.e

10329+ %str (lien pieces.e |=(p=piece ?:(?=(%expr -.p) (expr-has-hole p.p) |)))

10330+ %qath (lien segs.e |=(p=qseg ?:(?=(%expr -.p) (expr-has-hole p.p) |)))

10331+ %change (lien edits.e |=(p=edit (expr-has-hole val.p)))

10332+ %pair $(e val.e)

10333+ %unit $(e val.e)

10334+ %group $(e inner.e)

10335+ %list (lien items.e expr-has-hole)

10336+ %tuple (lien items.e |=(i=item (expr-has-hole val.i)))

10337+ ?(%gate %gate-wide) |((sample-has-hole sample.e) $(e body.e))

10338+ %cast |((shape-has-hole shape.e) $(e val.e))

10339+ %call |($(e head.e) (lien args.e expr-has-hole))

10340+ %trace |($(e val.e) $(e then.e))

10341+ %branch |($(e subject.e) (lien arms.e |=(a=arm (expr-has-hole val.a))))

10342+ %body |((lien defs.e def-has-hole) $(e final.e))

10343+ * |

10344+ ==

10345+++ hole-values-present

10346+ |= [ds=(list def) env=ienv]

10347+ ^- ?

10348+ ?~ ds &

10349+ ?. ?=(%value -.i.ds) $(ds t.ds)

10350+ ?: (expr-has-hole val.i.ds)

10351+ ?. ?=(^ (ienv-lookup name.i.ds env)) |

10352+ $(ds t.ds)

10353+ $(ds t.ds)

821510354++ show-partial-mold

821610355 |= [file=path src=@t d=def molds=imolds]

821710356 ^- @t

821810357 ?> ?=(%mold -.d)

821910358 =/ sh=shape shape.d

10359+ =/ hole=(unit (unit span)) (simple-mold-hole sh)

10360+ ?: &(?=(^ hole) ?=(^ u.hole))

10361+ =/ text=@t (show-error src [file line.beg.u.u.hole col.beg.u.u.hole "unresolved type hole"])

10362+ (of-wain:format ~[(crip "+$ {(trip name.d)}: type hole needs a determined type") text])

822010363 =? sh ?=(%generic -.sh) body.sh

822110364 ?. ?=(%union -.sh) (crip "+$ {(trip name.d)}: not checked")

822210365 =/ pairs=(list upair) (union-pairs cases.sh molds)

@@ -8243,6 +10386,21 @@

824310386 (show-error src [file line.beg.at.site col.beg.at.site note.site])

824410387 (of-wain:format [summary excerpts])

824510388::

10389+:: Both written field sites are shown in the source that declares them.

10390+++ show-duplicate-fields

10391+ |= [file=path src=@t diagnostic=idiag]

10392+ ^- @t

10393+ =/ excerpts=(list @t)

10394+ %+ turn sites.diagnostic

10395+ |= site=[at=span note=tape]

10396+ (show-error src [file line.beg.at.site col.beg.at.site note.site])

10397+ (of-wain:format [(crip msg.diagnostic) excerpts])

10398+::

10399+++ duplicate-fields-report

10400+ |= [file=path src=@t diagnostic=idiag]

10401+ ^- @t

10402+ (of-wain:format ~['partial inference; module not checked' (show-duplicate-fields file src diagnostic)])

10403+::

824610404:: +golden-types: a partial report; it does not claim the module checks

824710405::

824810406++ golden-types

@@ -8272,6 +10430,180 @@

827210430+$ jfile-result (each [iface=ifile cache=jcache] @t)

827310431+$ jimports-result (each [resolved=ijimports cache=jcache] @t)

827410432::

10433+:: Written record fields each have their own lexical record scope.

10434++$ written-fields (map term span)

10435+++ duplicate-written-field

10436+ |= [name=term at=span seen=written-fields]

10437+ ^- (unit idiag)

10438+ =/ prior=(unit span) (~(get by seen) name)

10439+ ?~ prior ~

10440+ `["record field `{(trip name)}` is repeated" ~[[u.prior "first field"] [at "repeated field"]]]

10441+++ duplicate-shapes

10442+ |= xs=(list shape)

10443+ ^- (unit idiag)

10444+ ?~ xs ~

10445+ =/ first (duplicate-shape i.xs)

10446+ ?^ first first

10447+ $(xs t.xs)

10448+++ duplicate-fields

10449+ |= [fields=(list field) seen=written-fields]

10450+ ^- (unit idiag)

10451+ ?~ fields ~

10452+ =/ f=field i.fields

10453+ =/ n=(unit term)

10454+ ?- -.f

10455+ %face `name.f

10456+ %pun `name.f

10457+ %bare ~

10458+ ==

10459+ =/ dup=(unit idiag) ?~(n ~ (duplicate-written-field u.n at.f seen))

10460+ ?^ dup dup

10461+ =/ inner=(unit idiag)

10462+ ?- -.f

10463+ %face (duplicate-shape shape.f)

10464+ %pun ~

10465+ %bare (duplicate-shape shape.f)

10466+ ==

10467+ ?^ inner inner

10468+ $(fields t.fields, seen ?~(n seen (~(put by seen) u.n at.f)))

10469+++ duplicate-shape

10470+ |= s=shape

10471+ ^- (unit idiag)

10472+ ?- -.s

10473+ %cell (duplicate-fields fields.s ~)

10474+ %apply (duplicate-shapes args.s)

10475+ %union (duplicate-shapes cases.s)

10476+ %fn

10477+ =/ left (duplicate-shape sample.s)

10478+ ?^ left left

10479+ (duplicate-shape product.s)

10480+ %generic (duplicate-shape body.s)

10481+ * ~

10482+ ==

10483+++ duplicate-samples

10484+ |= [items=(list sample) seen=written-fields]

10485+ ^- (unit idiag)

10486+ ?~ items ~

10487+ =/ a=sample i.items

10488+ =/ n=(unit term)

10489+ ?- -.a

10490+ %bind `name.a

10491+ %face `name.a

10492+ %pun `name.a

10493+ * ~

10494+ ==

10495+ =/ dup=(unit idiag) ?~(n ~ (duplicate-written-field u.n at.a seen))

10496+ ?^ dup dup

10497+ =/ inner (duplicate-sample a)

10498+ ?^ inner inner

10499+ $(items t.items, seen ?~(n seen (~(put by seen) u.n at.a)))

10500+++ duplicate-sample

10501+ |= s=sample

10502+ ^- (unit idiag)

10503+ ?- -.s

10504+ %cell (duplicate-samples items.s ~)

10505+ %face (duplicate-shape shape.s)

10506+ %bare (duplicate-shape shape.s)

10507+ * ~

10508+ ==

10509+++ duplicate-exprs

10510+ |= xs=(list expr)

10511+ ^- (unit idiag)

10512+ ?~ xs ~

10513+ =/ first (duplicate-expr i.xs)

10514+ ?^ first first

10515+ $(xs t.xs)

10516+++ duplicate-items

10517+ |= [items=(list item) seen=written-fields]

10518+ ^- (unit idiag)

10519+ ?~ items ~

10520+ =/ a=item i.items

10521+ =/ dup=(unit idiag) ?~(face.a ~ (duplicate-written-field u.face.a at.a seen))

10522+ ?^ dup dup

10523+ =/ inner (duplicate-expr val.a)

10524+ ?^ inner inner

10525+ $(items t.items, seen ?~(face.a seen (~(put by seen) u.face.a at.a)))

10526+++ duplicate-pieces

10527+ |= pieces=(list piece)

10528+ ^- (unit idiag)

10529+ ?~ pieces ~

10530+ =/ first=(unit idiag) ?:(?=(%expr -.i.pieces) (duplicate-expr p.i.pieces) ~)

10531+ ?^ first first

10532+ $(pieces t.pieces)

10533+++ duplicate-qsegs

10534+ |= segs=(list qseg)

10535+ ^- (unit idiag)

10536+ ?~ segs ~

10537+ =/ first=(unit idiag) ?:(?=(%expr -.i.segs) (duplicate-expr p.i.segs) ~)

10538+ ?^ first first

10539+ $(segs t.segs)

10540+++ duplicate-edits

10541+ |= edits=(list edit)

10542+ ^- (unit idiag)

10543+ ?~ edits ~

10544+ =/ first (duplicate-expr val.i.edits)

10545+ ?^ first first

10546+ $(edits t.edits)

10547+++ duplicate-arms

10548+ |= arms=(list arm)

10549+ ^- (unit idiag)

10550+ ?~ arms ~

10551+ =/ first (duplicate-expr val.i.arms)

10552+ ?^ first first

10553+ $(arms t.arms)

10554+++ duplicate-defs

10555+ |= defs=(list def)

10556+ ^- (unit idiag)

10557+ ?~ defs ~

10558+ =/ first=(unit idiag)

10559+ ?- -.i.defs

10560+ %mold (duplicate-shape shape.i.defs)

10561+ %value (duplicate-expr val.i.defs)

10562+ ==

10563+ ?^ first first

10564+ $(defs t.defs)

10565+++ duplicate-expr

10566+ |= e=expr

10567+ ^- (unit idiag)

10568+ ?- -.e

10569+ %str (duplicate-pieces pieces.e)

10570+ %qath (duplicate-qsegs segs.e)

10571+ %change (duplicate-edits edits.e)

10572+ %pair (duplicate-expr val.e)

10573+ %unit (duplicate-expr val.e)

10574+ %group (duplicate-expr inner.e)

10575+ %list (duplicate-exprs items.e)

10576+ %tuple (duplicate-items items.e ~)

10577+ %gate-wide

10578+ =/ first (duplicate-sample sample.e)

10579+ ?^ first first

10580+ (duplicate-expr body.e)

10581+ %gate

10582+ =/ first (duplicate-sample sample.e)

10583+ ?^ first first

10584+ (duplicate-expr body.e)

10585+ %cast

10586+ =/ first (duplicate-shape shape.e)

10587+ ?^ first first

10588+ (duplicate-expr val.e)

10589+ %call

10590+ =/ first (duplicate-expr head.e)

10591+ ?^ first first

10592+ (duplicate-exprs args.e)

10593+ %trace

10594+ =/ first (duplicate-expr val.e)

10595+ ?^ first first

10596+ (duplicate-expr then.e)

10597+ %branch

10598+ =/ first (duplicate-expr subject.e)

10599+ ?^ first first

10600+ (duplicate-arms arms.e)

10601+ %body

10602+ =/ first (duplicate-defs defs.e)

10603+ ?^ first first

10604+ (duplicate-expr final.e)

10605+ * ~

10606+ ==

827510607++ import-binding-names

827610608 |= imports=(list import)

827710609 ^- (list term)

@@ -8284,6 +10616,60 @@

828410616 ==

828510617 [n $(imports t.imports)]

828610618::

10619+++ reserved-proj-sample

10620+ |= sam=sample

10621+ ^- ?

10622+ ?- -.sam

10623+ %bind =(name.sam %proj)

10624+ %face =(name.sam %proj)

10625+ %pun =(name.sam %proj)

10626+ %cell (lien items.sam reserved-proj-sample)

10627+ * |

10628+ ==

10629+++ reserved-proj-pattern

10630+ |= p=pattern

10631+ ^- ?

10632+ ?- -.p

10633+ %bind =(name.p %proj)

10634+ %cell (lien items.p reserved-proj-pattern)

10635+ * |

10636+ ==

10637+++ reserved-proj-def

10638+ |= d=def

10639+ ^- ?

10640+ ?: =(name.d %proj) &

10641+ ?: ?=(%value -.d) (reserved-proj-expr val.d)

10642+ |

10643+++ reserved-proj-expr

10644+ |= e=expr

10645+ ^- ?

10646+ ?- -.e

10647+ %str (lien pieces.e |=(p=piece ?:(?=(%expr -.p) (reserved-proj-expr p.p) |)))

10648+ %qath (lien segs.e |=(p=qseg ?:(?=(%expr -.p) (reserved-proj-expr p.p) |)))

10649+ %change (lien edits.e |=(p=edit (reserved-proj-expr val.p)))

10650+ %pair $(e val.e)

10651+ %unit $(e val.e)

10652+ %group $(e inner.e)

10653+ %list (lien items.e reserved-proj-expr)

10654+ %tuple (lien items.e |=(i=item (reserved-proj-expr val.i)))

10655+ ?(%gate %gate-wide) |((reserved-proj-sample sample.e) $(e body.e))

10656+ %cast $(e val.e)

10657+ %call |($(e head.e) (lien args.e reserved-proj-expr))

10658+ %trace |($(e val.e) $(e then.e))

10659+ %branch |($(e subject.e) (lien arms.e |=(a=arm |((reserved-proj-pattern pat.a) (reserved-proj-expr val.a)))))

10660+ %body |((lien defs.e reserved-proj-def) $(e final.e))

10661+ * |

10662+ ==

10663+::

10664+++ module-has-reserved-proj

10665+ |= mod=module

10666+ ^- ?

10667+ =/ imported=(list term) (import-binding-names imports.mod)

10668+ =/ vals=(list term) (global-value-names defs.mod)

10669+ =/ molds=imolds (collect-simple-molds defs.mod)

10670+ =/ mold-names=(list term) (turn molds |=(m=[name=term body=shape] name.m))

10671+ |((lien (weld imported (weld vals mold-names)) |=(n=term =(n %proj))) (lien defs.mod reserved-proj-def))

10672+::

828710673++ module-scope-valid

828810674 |= [mod=module prelude-values=(list term) prelude-molds=(list term)]

828910675 ^- ?

@@ -8291,6 +10677,7 @@

829110677 =/ vals=(list term) (global-value-names defs.mod)

829210678 =/ molds=imolds (collect-simple-molds defs.mod)

829310679 =/ mold-names=(list term) (turn molds |=(m=[name=term body=shape] name.m))

10680+ ?: (module-has-reserved-proj mod) |

829410681 ?. %+ levy imported

829510682 |= n=term

829610683 &((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))))

@@ -8298,6 +10685,22 @@

829810685 ?. (levy vals |=(n=term &((unique-value-name n vals) !(lien prelude-values |=(v=term =(n v)))))) |

829910686 (levy mold-names |=(n=term &((unique-value-name n mold-names) !(lien prelude-molds |=(m=term =(n m))))))

830010687::

10688+:: In an API file or before main's kind is known, a lone `+$ poke`

10689+:: may be a declaration rather than a mold that shadows the prelude. Do not call

10690+:: that one collision definite, and do not hide unrelated scope errors.

10691+++ pending-declared-poke

10692+ |= [at=path mod=module prelude-values=(list term) prelude-molds=(list term)]

10693+ ^- ?

10694+ ?. (lien prelude-molds |=(n=term =(%poke n))) |

10695+ ?. |(?=([%ui %api @ %jibb ~] at) (lien defs.mod |=(d=def &(?=(%value -.d) =(%main name.d))))) |

10696+ =/ pokes=(list def)

10697+ (skim defs.mod |=(d=def &(?=(%mold -.d) =(%poke name.d))))

10698+ ?~ pokes |

10699+ ?^ t.pokes |

10700+ =/ remaining=(list def)

10701+ (skim defs.mod |=(d=def !&(?=(%mold -.d) =(%poke name.d))))

10702+ (module-scope-valid mod(defs remaining) prelude-values prelude-molds)

10703+::

830110704++ module-mold-types

830210705 |= [molds=imolds state=istate]

830310706 ^- (each imold-types @t)

@@ -8313,9 +10716,9 @@

831310716::

831410717:: Prepare a provisional interface from the trusted vendored source.

831510718:: Every declared name remains reserved, but only molds and values this

8316−:: fragment can infer are usable. Unsupported bodies are not validated,

8317−:: and imports into the prelude are not supported yet. The fixed origin

8318−:: gives its named unions the same identity in every importing module.

10719+:: fragment can infer are usable. Unsupported bodies are not validated.

10720+:: An optional internal source supplies the prelude's one supported import;

10721+:: clients cannot import that path directly. Named unions retain their origin.

831910722::

832010723:: Recognize only the complete standard prelude list shape. Its recursive

832110724:: tail uses the same parameter and the unqualified list name. The reader

@@ -8355,6 +10758,20 @@

835510758 ?. ?=(%tvar -.i.args.tail) |

835610759 =(var name.i.args.tail)

835710760::

10761+++ prelude-label

10762+ |= [typ=itype name=term vars=(list @ud)]

10763+ ^- itype

10764+ ?: ?=(%jrec -.typ) typ(label `name)

10765+ ?: ?=(%grec -.typ)

10766+ ?. (identity-union-parameters vars args.typ) typ(label ~)

10767+ typ(label `name)

10768+ ?. ?=(%union -.typ) typ

10769+ ?. (identity-union-parameters vars args.typ)

10770+ ?~ origin.typ typ

10771+ ?: =(at.u.origin.typ /lib/jibb/internal/jibb) typ(label ~)

10772+ typ

10773+ typ(label `name)

10774+::

835810775++ partial-prelude-molds

835910776 |= [molds=imolds state=istate]

836010777 ^- imold-types

@@ -8367,22 +10784,124 @@

836710784 (infer-mold-template body.m state(active [name.m active.state], in-mold &))

836810785 ?~ out $(molds t.molds)

836910786 =. typ.template.u.out (label-direct-union typ.template.u.out body.m name.m state)

10787+ =. typ.template.u.out (prelude-label typ.template.u.out name.m vars.template.u.out)

837010788 [[name.m template.u.out] $(molds t.molds)]

837110789::

8372−++ partial-prelude-interface

8373− |= src=@t

10790+:: A compiler-owned interface available only to the dedicated

10791+:: internal-prelude preparation path, never the ordinary module resolver.

10792+++ private-primitive-interface

10793+ ^- ifile

10794+ =/ a=itype [%avar 0]

10795+ =/ pair=itype [%cell a a]

10796+ =/ b=itype [%rvar 0]

10797+ =/ plus=ischeme [[%fn [%cell b b] b] ~[0]]

10798+ =/ minus=ischeme [[%fn b b] ~[0]]

10799+ =/ greater=ischeme [[%fn pair [%flag ~]] ~[0]]

10800+ [~[[%raw-add plus] [%raw-dec minus] [%raw-gth greater]] ~ /lib/jibb/primitives/jibb ~ ~ ~ ~ ~]

10801+::

10802+++ infer-private-internal

10803+ |= [src=@t public-source=@t]

10804+ ^- (unit ifile)

10805+ =/ at=path /lib/jibb/internal/jibb

10806+ =/ parsed (parse at src)

10807+ ?: ?=(%| -.parsed) ~

10808+ =/ mod=module p.parsed

10809+ ?^ (duplicate-defs defs.mod) ~

10810+ ?~ imports.mod

10811+ =/ built=jfile-result (infer-jibb-file at src ~ ~ ~ ~[at] ~ ~ ~ ~)

10812+ ?: ?=(%| -.built) ~

10813+ `iface.p.built

10814+ ?. ?=([[%jibb *] ~] imports.mod) ~

10815+ ?. =(path.i.imports.mod /lib/jibb/primitives) ~

10816+ ?. (module-scope-valid mod ~ ~) ~

10817+ =/ vals=(list term) (global-value-names defs.mod)

10818+ ?: (lien vals |=(n=term =(n %main))) ~

10819+ =/ molds=imolds (collect-simple-molds defs.mod)

10820+ =/ globals=(list term) (weld (import-binding-names imports.mod) vals)

10821+ :: The private source can use the public list and unit molds before the

10822+ :: prelude is otherwise prepared. Re-read the trusted public source here

10823+ :: and admit only its validated canonical templates; do not accept schemes

10824+ :: supplied independently by the caller.

10825+ =/ public=(each module error) (parse /lib/jibb/prelude/jibb public-source)

10826+ ?: ?=(%| -.public) ~

10827+ ?^ (duplicate-defs defs.p.public) ~

10828+ ?. (module-scope-valid p.public ~ ~) ~

10829+ =/ source-molds=imolds (collect-simple-molds defs.p.public)

10830+ =/ written-list=(unit shape) (find-simple-mold %list source-molds)

10831+ =/ source-list=(unit ischeme)

10832+ ?~ written-list ~

10833+ ?. (standard-prelude-list u.written-list) ~

10834+ `[[%collection %list ~[[%var 0]]] ~[0]]

10835+ :: Derive the public unit template from its actual source, then compare

10836+ :: the complete nominal template before making it available privately.

10837+ =/ unit-decl=(unit shape) (find-simple-mold %unit source-molds)

10838+ =/ source-unit=(unit ischeme)

10839+ ?~ unit-decl ~

10840+ =/ unit-molds=imolds ~[[%unit u.unit-decl]]

10841+ =/ unit-state=istate [0 ~ ~ ~ unit-molds ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ | /lib/jibb/prelude/jibb ~[%unit] ~ ~ 256 ~ ~ ~ ~]

10842+ =/ unit-types=imold-types (partial-prelude-molds unit-molds unit-state)

10843+ =/ unit-iface=ifile [~ unit-types /lib/jibb/prelude/jibb ~ ~ ~ ~ ~]

10844+ =/ found=(unit ischeme) (find-jibb-mold %unit unit-iface)

10845+ ?~ found ~

10846+ ?. (standard-unit-template u.found /lib/jibb/prelude/jibb) ~

10847+ found

10848+ =/ primitive=ifile private-primitive-interface

10849+ =? primitive ?=(^ source-list)

10850+ primitive(molds [[%list u.source-list] molds.primitive])

10851+ =? primitive ?=(^ source-unit)

10852+ primitive(molds [[%unit u.source-unit] molds.primitive])

10853+ =/ js=ijimports ~[[face.i.imports.mod primitive]]

10854+ =/ reserved=(list term) ~[face.i.imports.mod]

10855+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

10856+ =/ state=istate [0 ~ ~ ~ molds globals ~ ~ ~ ~ js reserved ~ ~ ~ | at top ~ ~ 256 ~ ~ ~ ~]

10857+ =/ mts=(each imold-types @t) (module-mold-types molds state)

10858+ =/ usable=(unit imold-types)

10859+ ?: ?=(%& -.mts) `p.mts

10860+ :: Missing public templates may make an unrelated internal mold

10861+ :: unavailable. Validate all molds once with isolated canonical

10862+ :: templates before admitting only those inferred using the actual

10863+ :: source-backed templates. The proof interface is never exported.

10864+ ?. |(?=(~ source-list) ?=(~ source-unit)) ~

10865+ =/ nil=itype [%const [%null %n 0 '~']]

10866+ =/ canonical-unit=ischeme

10867+ [[%union ~[nil [%cell nil [%face %u [%var 0]]]] `[/lib/jibb/prelude/jibb %unit] `%unit ~[[%var 0]]] ~[0]]

10868+ =/ canonical-list=ischeme [[%collection %list ~[[%var 0]]] ~[0]]

10869+ =/ proof-primitive=ifile private-primitive-interface

10870+ =. molds.proof-primitive ~[[%list canonical-list] [%unit canonical-unit]]

10871+ =/ proof-imports=ijimports ~[[face.i.imports.mod proof-primitive]]

10872+ =/ proof=(each imold-types @t) (module-mold-types molds state(jimports proof-imports))

10873+ ?: ?=(%| -.proof) ~

10874+ `(partial-prelude-molds molds state)

10875+ ?~ usable ~

10876+ =/ resolution=iresolved (resolve-groups defs.mod molds globals ~ ~ ~ ~ js reserved at ~)

10877+ =/ env=ienv env.resolution

10878+ ?. (module-values-complete defs.mod env) ~

10879+ `[env u.usable at ~ artifacts.resolution ~ `src ~]

10880+::

10881+++ partial-prelude-interface-with-internal

10882+ |= [src=@t internal-source=(unit @t)]

837410883 ^- (unit ifile)

837510884 ?: =(0 src) ~

837610885 =/ at=path /lib/jibb/prelude/jibb

837710886 =/ parsed (parse at src)

837810887 ?: ?=(%| -.parsed) ~

8379− ?^ imports.p.parsed ~

10888+ ?: (named-mold-has-hole defs.p.parsed) ~

10889+ ?^ (duplicate-defs defs.p.parsed) ~

10890+ =/ private=(unit ijimports)

10891+ ?~ imports.p.parsed `~

10892+ ?. ?=([[%jibb *] ~] imports.p.parsed) ~

10893+ ?. =(path.i.imports.p.parsed /lib/jibb/internal) ~

10894+ ?~ internal-source ~

10895+ =/ built=(unit ifile) (infer-private-internal u.internal-source src)

10896+ ?~ built ~

10897+ `~[[face.i.imports.p.parsed u.built]]

10898+ ?~ private ~

838010899 ?~ defs.p.parsed ~

838110900 ?. (module-scope-valid p.parsed ~ ~) ~

838210901 =/ ds=(list def) defs.p.parsed

838310902 =/ molds=imolds (collect-simple-molds ds)

838410903 =/ names=(list term) (turn molds |=(m=[name=term body=shape] name.m))

8385− =/ globals=(list term) (global-value-names ds)

10904+ =/ globals=(list term) (weld (import-binding-names imports.p.parsed) (global-value-names ds))

838610905 :: Remove raw list before inferring any template, so an altered list

838710906 :: cannot leak through an alias. Its name remains reserved either way.

838810907 =/ declared=? (lien names |=(name=term =(%list name)))

@@ -8390,11 +10909,38 @@

839010909 =? env-molds declared

839110910 (skim molds |=(m=[name=term body=shape] !=(%list name.m)))

839210911 =/ reserved=(list term) ?:(declared ~[%list] ~)

8393− =/ state=istate [0 ~ ~ ~ env-molds globals ~ ~ ~ ~ ~ reserved ~ ~ ~ | at names ~]

8394− =/ mt=imold-types (partial-prelude-molds molds state)

8395− =/ partial=ifile [~ mt at]

8396− =/ env=ienv (resolve-supported-defs ds env-molds globals ~ ~ ~ ~ ~ reserved at `partial)

8397− `[env mt at]

10912+ =/ state=istate [0 ~ ~ ~ env-molds globals ~ ~ ~ ~ u.private reserved ~ ~ ~ | at names ~ ~ 256 ~ ~ ~ ~]

10913+ :: Other prelude molds may use list only after its source has passed

10914+ :: the standard-list check. The raw declaration remains removed.

10915+ =/ declared-list=(unit shape) (find-simple-mold %list molds)

10916+ =/ mold-prelude=(unit ifile)

10917+ ?~ declared-list ~

10918+ ?. (standard-prelude-list u.declared-list) ~

10919+ `[~ ~[[%list [[%collection %list ~[[%var 0]]] ~[0]]]] at ~ ~ ~ ~ ~]

10920+ =/ mt=imold-types (partial-prelude-molds molds state(prelude mold-prelude))

10921+ =/ partial=ifile [~ mt at ~ ~ ~ ~ ~]

10922+ :: An explicitly qualified re-export must resolve. Other unsupported

10923+ :: prelude declarations remain reserved but absent from the interface.

10924+ =/ required=imolds

10925+ %+ skim molds

10926+ |= m=[name=term body=shape]

10927+ =/ sh=shape body.m

10928+ ?. ?=(%ref -.sh) |

10929+ ?~ names.sh |

10930+ ?=(^ t.names.sh)

10931+ ?. (levy required |=(m=[name=term body=shape] ?=(^ (find-jibb-mold name.m partial)))) ~

10932+ =/ resolution=iresolved (resolve-groups ds env-molds globals ~ ~ ~ ~ u.private reserved at `partial)

10933+ =/ env=ienv env.resolution

10934+ ?. (hole-values-present ds env) ~

10935+ =/ deps=(list iwidth-dependency)

10936+ ?~ u.private ~

10937+ ~[[at.interface.i.u.private source.interface.i.u.private elaborations.interface.i.u.private]]

10938+ `[env mt at ~ artifacts.resolution deps `src ~]

10939+::

10940+++ partial-prelude-interface

10941+ |= src=@t

10942+ ^- (unit ifile)

10943+ (partial-prelude-interface-with-internal src ~)

839810944::

839910945+$ iprelude [iface=ifile values=(list term) molds=(list term)]

840010946::

@@ -8409,6 +10955,17 @@

840910955 =/ ms=(list term) (turn (collect-simple-molds defs.p.parsed) |=(m=[name=term body=shape] name.m))

841010956 `[u.iface vals ms]

841110957::

10958+++ prepare-prelude-with-internal

10959+ |= [src=@t internal-source=@t]

10960+ ^- (unit iprelude)

10961+ =/ iface=(unit ifile) (partial-prelude-interface-with-internal src `internal-source)

10962+ ?~ iface ~

10963+ =/ parsed (parse /lib/jibb/prelude/jibb src)

10964+ ?: ?=(%| -.parsed) ~

10965+ =/ vals=(list term) (global-value-names defs.p.parsed)

10966+ =/ ms=(list term) (turn (collect-simple-molds defs.p.parsed) |=(m=[name=term body=shape] name.m))

10967+ `[u.iface vals ms]

10968+::

841210969++ module-values-complete

841310970 |= [ds=(list def) env=ienv]

841410971 ^- ?

@@ -8429,12 +10986,76 @@

842910986 ?: =(at at.i.cache) `iface.i.cache

843010987 $(cache t.cache)

843110988::

10989+:: These certificates retain the complete checked source closure. The

10990+:: trusted host must supply the identical prepared prelude and reader nouns.

10991+:: Exact bundle equality binds all source paths and versions; the set

10992+:: retains transitive paths for active-cycle checks. Request-bearing graphs

10993+:: alone have a size limit; incompatible diamond evidence fails closed.

10994+++ request-graph-requests-add

10995+ |= [pending=(list irequest-evidence) acc=(list irequest-evidence) fuel=@ud]

10996+ ^- (unit (list irequest-evidence))

10997+ ?~ pending `acc

10998+ ?: =(0 fuel) ~

10999+ =/ hit=(list irequest-evidence)

11000+ (skim acc |=(x=irequest-evidence &(=(api-at.x api-at.i.pending) =(name.x name.i.pending))))

11001+ ?^ hit

11002+ ?. ?=([* ~] hit) ~

11003+ ?. =(i.hit i.pending) ~

11004+ $(pending t.pending, fuel (dec fuel))

11005+ $(pending t.pending, acc [i.pending acc], fuel (dec fuel))

11006+++ request-graph-inputs-match

11007+ |= [g=irequest-graph externals=iexternals marks=imark-externals modules=jbundle values=(list term) molds=(list term) prelude=(unit ifile)]

11008+ ^- ?

11009+ ?& =(bundle-input.g modules)

11010+ =(prelude-input.g prelude)

11011+ =(prelude-values.g values)

11012+ =(prelude-molds.g molds)

11013+ =(externals.g externals)

11014+ =(marks.g marks)

11015+ ==

11016+++ request-graph-merge

11017+ |= [imports=ijimports g=irequest-graph fuel=@ud]

11018+ ^- (unit irequest-graph)

11019+ ?~ imports `g

11020+ ?: =(0 fuel) ~

11021+ =/ child=ifile interface.i.imports

11022+ ?~ graph.child ~

11023+ =/ cg=irequest-graph u.graph.child

11024+ ?. ?& =(bundle-input.g bundle-input.cg)

11025+ =(prelude-input.g prelude-input.cg)

11026+ =(prelude-values.g prelude-values.cg)

11027+ =(prelude-molds.g prelude-molds.cg)

11028+ =(externals.g externals.cg)

11029+ =(marks.g marks.cg)

11030+ ==

11031+ ~

11032+ =/ merged=(set path) (~(uni in:..zuse paths.g) paths.cg)

11033+ =/ rs=(unit (list irequest-evidence))

11034+ (request-graph-requests-add requests.cg requests.g (add 1 (lent requests.cg)))

11035+ ?~ rs ~

11036+ ?: &(?=(^ u.rs) |((gth (lent ~(tap in:..zuse merged)) 256) (gth (lent u.rs) 256))) ~

11037+ $(imports t.imports, g g(paths merged, requests u.rs), fuel (dec fuel))

11038+++ request-graph-reusable

11039+ |= [f=ifile src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) values=(list term) molds=(list term) prelude=(unit ifile)]

11040+ ^- ?

11041+ ?~ source.f |

11042+ ?. =(u.source.f src) |

11043+ ?~ graph.f |

11044+ =/ g=irequest-graph u.graph.f

11045+ ?. (request-graph-inputs-match g externals marks modules values molds prelude) |

11046+ ?. (~(has in:..zuse paths.g) at.f) |

11047+ !(lien active |=(p=path (~(has in:..zuse paths.g) p)))

11048+::

843211049++ resolve-jibb-imports

843311050 |= [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)]

843411051 ^- jimports-result

843511052 ?~ imports [%& [~ cache]]

843611053 ?. ?=(%jibb -.i.imports) $(imports t.imports)

843711054 =/ at=path (weld path.i.imports `path`~[%jibb])

11055+ ?: =(at /lib/jibb/internal/jibb)

11056+ [%| 'the prelude internal module is private']

11057+ ?: =(at /lib/jibb/primitives/jibb)

11058+ [%| 'the prelude primitive interface is private']

843811059 ?: (lien active |=(p=path =(p at)))

843911060 [%| (crip "import cycle at {(spud at)}")]

844011061 =/ found=jbundle (skim modules |=(m=jsource =(at at.m)))

@@ -8442,39 +11063,882 @@

844211063 ?^ t.found [%| (crip "duplicate module sources: {(spud at)}")]

844311064 =/ cached=(unit ifile) (find-jibb-cache at cache)

844411065 =/ iface=jfile-result

8445− ?^ cached [%& [u.cached cache]]

11066+ ?^ cached

11067+ ?. =(at.u.cached at) [%| 'cached module identity needs unsupported inference']

11068+ ?~ graph.u.cached

11069+ :: A detached legacy interface has unknown evidence. Rebuild it

11070+ :: against the current graph, without retaining any stale entry.

11071+ =/ clean=jcache (skim cache |=(x=[at=path iface=ifile] !=(at.x at)))

11072+ (infer-jibb-file at source.i.found externals mark-externals modules [at active] prelude-values prelude-molds clean prelude)

11073+ ?. (request-graph-reusable u.cached source.i.found externals mark-externals modules active prelude-values prelude-molds prelude)

11074+ [%| 'cached module evidence needs unsupported inference']

11075+ [%& [u.cached cache]]

844611076 (infer-jibb-file at source.i.found externals mark-externals modules [at active] prelude-values prelude-molds cache prelude)

844711077 ?: ?=(%| -.iface) [%| p.iface]

844811078 =/ rest=jimports-result $(imports t.imports, cache cache.p.iface)

844911079 ?: ?=(%| -.rest) rest

845011080 [%& [[[face.i.imports iface.p.iface] resolved.p.rest] cache.p.rest]]

845111081::

11082+:: Provisional declaration extraction only; this does not derive asks,

11083+:: validate imported types, or claim that an API module has checked.

11084++$ iapi-path [at=span name=term segments=(list pseg) full=term diffs=(list term) scry=(unit (list pseg))]

11085+++ api-path-mark

11086+ |= [sh=shape marks=(list term)]

11087+ ^- (unit term)

11088+ ?. ?=(%ref -.sh) ~

11089+ ?. ?=([@ ~] names.sh) ~

11090+ ?. (unique-value-name i.names.sh marks) ~

11091+ `i.names.sh

11092+::

11093+++ api-path-diffs

11094+ |= [shapes=(list shape) marks=(list term) used=(list term)]

11095+ ^- (unit (list term))

11096+ ?~ shapes `~

11097+ =/ n=(unit term) (api-path-mark i.shapes marks)

11098+ ?~ n ~

11099+ ?: (lien used |=(x=term =(x u.n))) ~

11100+ =/ rest=(unit (list term)) $(shapes t.shapes, used [u.n used])

11101+ ?~ rest ~

11102+ `[u.n u.rest]

11103+::

11104+++ api-path-payload

11105+ |= [sh=shape marks=(list term)]

11106+ ^- (unit [full=term diffs=(list term)])

11107+ =/ direct=(unit term) (api-path-mark sh marks)

11108+ ?^ direct `[u.direct ~]

11109+ ?. ?=(%apply -.sh) ~

11110+ ?. =(~[%facts] ref.sh) ~

11111+ ?~ args.sh ~

11112+ ?~ t.args.sh ~

11113+ =/ full=(unit term) (api-path-mark i.args.sh marks)

11114+ ?~ full ~

11115+ =/ diffs=(unit (list term)) (api-path-diffs t.args.sh marks ~[u.full])

11116+ ?~ diffs ~

11117+ `[u.full u.diffs]

11118+::

11119++$ iapi-parameter [name=term aura=@ta at=span]

11120+++ api-path-parameters

11121+ |= [segments=(list pseg) seen=(list term)]

11122+ ^- (unit (list iapi-parameter))

11123+ ?~ segments `~

11124+ ?: ?=(%knot -.i.segments) $(segments t.segments)

11125+ =/ seg=pseg i.segments

11126+ ?. ?=(%typed -.seg) ~

11127+ ?: =(0 aura.seg) ~

11128+ ?: (lien seen |=(n=term =(n name.seg))) ~

11129+ =/ rest=(unit (list iapi-parameter)) $(segments t.segments, seen [name.seg seen])

11130+ ?~ rest ~

11131+ `[[name.seg aura.seg at.seg] u.rest]

11132+::

11133+++ api-scry-parameters-compatible

11134+ |= [scry=(list iapi-parameter) watch=(list iapi-parameter)]

11135+ ^- ?

11136+ ?~ scry &

11137+ ?. (lien watch |=(p=iapi-parameter &(=(name.p name.i.scry) =(aura.p aura.i.scry)))) |

11138+ $(scry t.scry)

11139+::

11140+++ api-path-one

11141+ |= [sh=shape marks=(list term)]

11142+ ^- (unit iapi-path)

11143+ ?. ?=(%cell -.sh) ~

11144+ =/ fs=(list field) fields.sh

11145+ ?~ fs ~

11146+ ?~ t.fs ~

11147+ ?~ t.t.fs ~

11148+ ?: (gth (lent fs) 4) ~

11149+ ?. ?=(%bare -.i.fs) ~

11150+ =/ tag=shape shape.i.fs

11151+ ?. ?=(%const -.tag) ~

11152+ ?. =(%term form.lit.tag) ~

11153+ =/ name=term val.lit.tag

11154+ ?. (jibb-face-name name) ~

11155+ ?. ?=(%bare -.i.t.fs) ~

11156+ =/ path-shape=shape shape.i.t.fs

11157+ ?. ?=(%path -.path-shape) ~

11158+ ?. ?=(%bare -.i.t.t.fs) ~

11159+ =/ payload=(unit [full=term diffs=(list term)]) (api-path-payload shape.i.t.t.fs marks)

11160+ ?~ payload ~

11161+ =/ scry=(unit (unit (list pseg)))

11162+ ?~ t.t.t.fs `~

11163+ =/ entry=field i.t.t.t.fs

11164+ ?. ?=(%face -.entry) ~

11165+ ?. =(%scry name.entry) ~

11166+ ?. ?=(%path -.shape.entry) ~

11167+ ``segs.shape.entry

11168+ ?~ scry ~

11169+ =/ params=(unit (list iapi-parameter)) (api-path-parameters segs.path-shape ~)

11170+ ?~ params ~

11171+ ?^ u.scry

11172+ =/ scry-params=(unit (list iapi-parameter)) (api-path-parameters u.u.scry ~)

11173+ ?~ scry-params ~

11174+ ?. (api-scry-parameters-compatible u.scry-params u.params) ~

11175+ `[at.sh name segs.path-shape full.u.payload diffs.u.payload u.scry]

11176+ `[at.sh name segs.path-shape full.u.payload diffs.u.payload u.scry]

11177+::

11178+++ api-path-many

11179+ |= [shapes=(list shape) marks=(list term) seen=(list term)]

11180+ ^- (unit (list iapi-path))

11181+ ?~ shapes `~

11182+ =/ one=(unit iapi-path) (api-path-one i.shapes marks)

11183+ ?~ one ~

11184+ ?: (lien seen |=(n=term =(n name.u.one))) ~

11185+ =/ rest=(unit (list iapi-path)) $(shapes t.shapes, seen [name.u.one seen])

11186+ ?~ rest ~

11187+ `[u.one u.rest]

11188+::

11189+++ api-path-declaration

11190+ |= [sh=shape marks=(list term)]

11191+ ^- (unit (list iapi-path))

11192+ ?: ?=(%union -.sh) (api-path-many cases.sh marks ~)

11193+ (api-path-many ~[sh] marks ~)

11194+::

11195+:: Derived gates share the value namespace. /% marks name molds; /- and

11196+:: /= also introduce faces that cannot be shadowed by a derived value.

11197+++ api-import-faces

11198+ |= imports=(list import)

11199+ ^- (list term)

11200+ ?~ imports ~

11201+ ?- -.i.imports

11202+ %mark $(imports t.imports)

11203+ %sur [name.i.imports $(imports t.imports)]

11204+ %jibb [face.i.imports $(imports t.imports)]

11205+ ==

11206+::

11207+++ api-derived-names-valid

11208+ |= [paths=(list iapi-path) poke-names=(list term) mod=module prelude-values=(list term)]

11209+ ^- ?

11210+ =/ path-names=(list term) (turn paths |=(p=iapi-path name.p))

11211+ =/ derived=(list term) (weld path-names poke-names)

11212+ ?: (lien derived |=(n=term =(n %proj))) |

11213+ =/ outer=(list term) (weld prelude-values (weld (global-value-names defs.mod) (api-import-faces imports.mod)))

11214+ (levy derived |=(n=term &((unique-value-name n derived) !(lien outer |=(x=term =(n x))))))

11215+::

11216+:: Analysis only. Successful external entries must be unchanged results

11217+:: produced for the declared marks; no request interface is produced.

11218++$ iapi-mark-type [name=term typ=itype]

11219++$ iapi-path-typed [path=iapi-path full=itype diffs=(list iapi-mark-type)]

11220+++ api-diff-types

11221+ |= [names=(list term) externals=imark-externals declared=(list term)]

11222+ ^- (unit (list iapi-mark-type))

11223+ ?~ names `~

11224+ =/ typ=(unit itype) (find-imported-mark i.names externals declared)

11225+ ?~ typ ~

11226+ =/ tail=(unit (list iapi-mark-type)) $(names t.names)

11227+ ?~ tail ~

11228+ `[[i.names u.typ] u.tail]

11229+::

11230+++ api-path-types

11231+ |= [paths=(list iapi-path) externals=imark-externals declared=(list term)]

11232+ ^- (unit (list iapi-path-typed))

11233+ ?~ paths `~

11234+ =/ full=(unit itype) (find-imported-mark full.i.paths externals declared)

11235+ ?~ full ~

11236+ =/ diffs=(unit (list iapi-mark-type)) (api-diff-types diffs.i.paths externals declared)

11237+ ?~ diffs ~

11238+ =/ tail=(unit (list iapi-path-typed)) $(paths t.paths)

11239+ ?~ tail ~

11240+ `[[i.paths u.full u.diffs] u.tail]

11241+::

11242+++ api-poke-mark-names

11243+ |= [pokes=(list def) declared=(list term)]

11244+ ^- (unit (list term))

11245+ ?~ pokes `~

11246+ ?^ t.pokes ~

11247+ =/ d=def i.pokes

11248+ ?. ?=(%mold -.d) ~

11249+ =/ sh=shape shape.d

11250+ ?: ?=(%union -.sh) (api-path-diffs cases.sh declared ~)

11251+ =/ name=(unit term) (api-path-mark sh declared)

11252+ ?~ name ~

11253+ `~[u.name]

11254+::

11255+++ api-path-analysis

11256+ |= [mod=module externals=imark-externals prelude-values=(list term) prelude-molds=(list term)]

11257+ ^- (unit (list iapi-path-typed))

11258+ ?: (lien defs.mod def-has-hole) ~

11259+ ?^ (duplicate-defs defs.mod) ~

11260+ =/ ds=(list def) defs.mod

11261+ =/ declarations=(list def)

11262+ (skim ds |=(d=def &(?=(%mold -.d) =(%paths name.d))))

11263+ ?. ?=([* ~] declarations) ~

11264+ =/ pokes=(list def)

11265+ (skim ds |=(d=def &(?=(%mold -.d) =(%poke name.d))))

11266+ ?: (gth (lent pokes) 1) ~

11267+ =/ ordinary=(list def)

11268+ (skim ds |=(d=def !&(?=(%mold -.d) |(=(%paths name.d) =(%poke name.d)))))

11269+ ?. (module-scope-valid mod(defs ordinary) prelude-values prelude-molds) ~

11270+ =/ declared=(list term) (collect-mark-imports imports.mod)

11271+ =/ poke-names=(unit (list term)) (api-poke-mark-names pokes declared)

11272+ ?~ poke-names ~

11273+ =/ decl=def i.declarations

11274+ ?> ?=(%mold -.decl)

11275+ =/ paths=(unit (list iapi-path)) (api-path-declaration shape.decl declared)

11276+ ?~ paths ~

11277+ ?. (api-derived-names-valid u.paths u.poke-names mod prelude-values) ~

11278+ (api-path-types u.paths externals declared)

11279+::

11280+:: Source/graph entry for path analysis only. The returned paths retain

11281+:: reader-derived mark types and import resolution has checked reachable

11282+:: Jibb dependencies. This is not an API interface or a module check.

11283+++ api-path-analysis-source

11284+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

11285+ ^- (each (list iapi-path-typed) @t)

11286+ ?. ?=([%ui %api @ %jibb ~] file) [%| 'API path analysis requires /ui/api/<agent>.jibb']

11287+ =/ parsed (parse file src)

11288+ ?: ?=(%| -.parsed) [%| 'API path source does not parse']

11289+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11290+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

11291+ ?~ prepared [%| 'API path analysis needs the prepared prelude']

11292+ =/ prelude=(unit ifile) `iface.u.prepared

11293+ =/ deps=jimports-result

11294+ (resolve-jibb-imports imports.p.parsed externals marks modules ~[file] values.u.prepared molds.u.prepared ~ prelude)

11295+ ?: ?=(%| -.deps) [%| p.deps]

11296+ =/ paths=(unit (list iapi-path-typed))

11297+ (api-path-analysis p.parsed marks values.u.prepared molds.u.prepared)

11298+ ?~ paths [%| 'API path declaration needs unsupported analysis']

11299+ [%& u.paths]

11300+::

11301+:: Analysis evidence retains the API source, the prepared interface, the

11302+:: caller's reader results and the resolved Jibb dependency cache alongside

11303+:: the typed path declarations. Reader results and prepared interfaces are

11304+:: trusted inputs: this does not verify their underlying Hoon source/version,

11305+:: create requests or check the provenance of arbitrary values.

11306++$ iapi-path-evidence

11307+ [at=path source=@t prepared=iprelude externals=iexternals marks=imark-externals dependencies=jcache paths=(list iapi-path-typed)]

11308+++ api-path-evidence-source

11309+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

11310+ ^- (each iapi-path-evidence @t)

11311+ ?. ?=([%ui %api @ %jibb ~] file) [%| 'API path evidence requires /ui/api/<agent>.jibb']

11312+ =/ parsed (parse file src)

11313+ ?: ?=(%| -.parsed) [%| 'API path evidence source does not parse']

11314+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11315+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

11316+ ?~ prepared [%| 'API path evidence needs the prepared prelude']

11317+ =/ public=ifile iface.u.prepared

11318+ =/ deps=jimports-result

11319+ (resolve-jibb-imports imports.p.parsed externals marks modules ~[file] values.u.prepared molds.u.prepared ~ `public)

11320+ ?: ?=(%| -.deps) [%| p.deps]

11321+ =/ paths=(unit (list iapi-path-typed))

11322+ (api-path-analysis p.parsed marks values.u.prepared molds.u.prepared)

11323+ ?~ paths [%| 'API path declaration needs unsupported analysis']

11324+ [%& [file src u.prepared externals marks cache.p.deps u.paths]]

11325+:: Graph-aware variant preserves the caller active stack and cache.

11326+++ api-path-evidence-graph

11327+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

11328+ ^- (each iapi-path-evidence @t)

11329+ ?~ active [%| 'API analysis needs an active graph']

11330+ ?. =(i.active file) [%| 'API analysis active graph does not start at the source']

11331+ ?: (lien t.active |=(p=path =(p file))) [%| 'API analysis active graph contains a cycle']

11332+ ?. ?=([%ui %api @ %jibb ~] file) [%| 'API path evidence requires /ui/api/<agent>.jibb']

11333+ =/ parsed (parse file src)

11334+ ?: ?=(%| -.parsed) [%| 'API path evidence source does not parse']

11335+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11336+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

11337+ ?~ prepared [%| 'API path evidence needs the prepared prelude']

11338+ =/ public=ifile iface.u.prepared

11339+ =/ deps=jimports-result

11340+ (resolve-jibb-imports imports.p.parsed externals marks modules active values.u.prepared molds.u.prepared cache `public)

11341+ ?: ?=(%| -.deps) [%| p.deps]

11342+ =/ paths=(unit (list iapi-path-typed))

11343+ (api-path-analysis p.parsed marks values.u.prepared molds.u.prepared)

11344+ ?~ paths [%| 'API path declaration needs unsupported analysis']

11345+ [%& [file src u.prepared externals marks cache.p.deps u.paths]]

11346+::

11347+:: This query classifies a unique path declaration only. Missing evidence

11348+:: or a nonunique name is unknown; it proves nothing about an ask value.

11349+:: Like prepared interfaces, the supplied evidence is a trusted host input.

11350+++ api-path-watchability

11351+ |= [evidence=(unit iapi-path-evidence) case-name=term]

11352+ ^- ?(%watchable %not-watchable %unknown)

11353+ ?~ evidence %unknown

11354+ =/ found=(list iapi-path-typed)

11355+ (skim paths.u.evidence |=(p=iapi-path-typed =(name.path.p case-name)))

11356+ ?. ?=([* ~] found) %unknown

11357+ ?~ scry.path.i.found %watchable

11358+ %not-watchable

11359+::

11360+:: These are declaration-derived request components, not a callable gate,

11361+:: an ask value, or proof of a value's provenance. Keep the exact trusted

11362+:: source/reader evidence until a later checked interface and lowerer can

11363+:: attach it to a generated request. No argument ordering is claimed here.

11364++$ iapi-request-parameter [name=term typ=itype at=span]

11365++$ iapi-request-parts

11366+ [evidence=iapi-path-evidence path=iapi-path-typed parameters=(list iapi-request-parameter) reply-sample=itype fold=(unit itype) watchability=?(%watchable %not-watchable)]

11367+++ api-request-parameter-types

11368+ |= params=(list iapi-parameter)

11369+ ^- (unit (list iapi-request-parameter))

11370+ ?~ params `~

11371+ =/ aura=@ta aura.i.params

11372+ ?. |(?=(?(%u %ud %ux %uv %t %ta %tas %p %da %dr) aura) =('tD' aura)) ~

11373+ =/ rest=(unit (list iapi-request-parameter)) $(params t.params)

11374+ ?~ rest ~

11375+ `[[name.i.params [%atom aura] at.i.params] u.rest]

11376+::

11377+:: A single diff's fold consumes the tagged diff and the previous full value.

11378+:: Multiple-diff unions need a checked union representation and remain open.

11379+++ api-request-fold-type

11380+ |= p=iapi-path-typed

11381+ ^- (unit (unit itype))

11382+ ?~ diffs.p `~

11383+ ?^ t.diffs.p ~

11384+ =/ d=iapi-mark-type i.diffs.p

11385+ =/ literal=lit [%term %tas name.d (crip ['%' (trip name.d)])]

11386+ =/ sample=itype [%cell [%cell [%const literal] typ.d] full.p]

11387+ ``[%fn sample full.p]

11388+::

11389+++ api-request-parts

11390+ |= [evidence=(unit iapi-path-evidence) case-name=term]

11391+ ^- (unit iapi-request-parts)

11392+ ?~ evidence ~

11393+ =/ found=(list iapi-path-typed)

11394+ (skim paths.u.evidence |=(p=iapi-path-typed =(name.path.p case-name)))

11395+ ?. ?=([* ~] found) ~

11396+ =/ p=iapi-path-typed i.found

11397+ =/ raw=(unit (list iapi-parameter)) (api-path-parameters segments.path.p ~)

11398+ ?~ raw ~

11399+ =/ params=(unit (list iapi-request-parameter)) (api-request-parameter-types u.raw)

11400+ ?~ params ~

11401+ =/ fold=(unit (unit itype)) (api-request-fold-type p)

11402+ ?~ fold ~

11403+ =/ watch=?(%watchable %not-watchable) ?~(scry.path.p %watchable %not-watchable)

11404+ `[u.evidence p u.params full.p u.fold watch]

11405+::

11406+:: Check ordinary API molds and values plus every declared mark type using

11407+:: the same trusted source, prepared prelude and reader inputs as path

11408+:: evidence. Keep elaborations with those inputs for a later interface.

11409+:: This is partial analysis: an unused /- core is not independently checked,

11410+:: definitions needing derived values remain unsupported, and no complete

11411+:: API, request or constructor is exported or given runtime behavior.

11412++$ iapi-support-evidence

11413+ [paths=iapi-path-evidence values=ienv molds=imold-types marks=(list iapi-mark-type) elaborations=(list iwidth-definition)]

11414+++ api-support-analysis-source

11415+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

11416+ ^- (each iapi-support-evidence @t)

11417+ =/ path-result (api-path-evidence-source file src externals marks modules prepared)

11418+ ?: ?=(%| -.path-result) [%| p.path-result]

11419+ =/ evidence=iapi-path-evidence p.path-result

11420+ =/ parsed (parse file src)

11421+ ?: ?=(%| -.parsed) [%| 'API source does not parse']

11422+ =/ mod=module p.parsed

11423+ =/ ordinary=(list def)

11424+ (skim defs.mod |=(d=def !&(?=(%mold -.d) |(=(%paths name.d) =(%poke name.d)))))

11425+ =/ prep=iprelude prepared.evidence

11426+ ?. (module-scope-valid mod(defs ordinary) values.prep molds.prep) [%| 'API ordinary scope needs unsupported inference']

11427+ =/ vals=(list term) (global-value-names ordinary)

11428+ ?: (lien vals |=(n=term =(n %main))) [%| 'API module kind needs unsupported inference']

11429+ =/ declared=(list term) (collect-mark-imports imports.mod)

11430+ =/ mark-types=(unit (list iapi-mark-type)) (api-diff-types declared marks declared)

11431+ ?~ mark-types [%| 'API declared marks need unsupported inference']

11432+ =/ prelude=(unit ifile) `iface.prep

11433+ =/ deps=jimports-result

11434+ (resolve-jibb-imports imports.mod externals marks modules ~[file] values.prep molds.prep dependencies.evidence prelude)

11435+ ?: ?=(%| -.deps) [%| p.deps]

11436+ =/ molds=imolds (collect-simple-molds ordinary)

11437+ =/ globals=(list term) (weld values.prep (weld (import-binding-names imports.mod) vals))

11438+ =/ surs=(list term) (collect-sur-imports imports.mod)

11439+ =/ reserved=(list term) (weld molds.prep (turn resolved.p.deps |=(j=[face=term interface=ifile] face.j)))

11440+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

11441+ =/ state=istate [0 ~ ~ ~ molds globals externals surs marks declared resolved.p.deps reserved ~ ~ ~ | file top prelude ~ 256 ~ ~ ~ ~]

11442+ =/ mts=(each imold-types @t) (module-mold-types molds state)

11443+ ?: ?=(%| -.mts) [%| p.mts]

11444+ =/ resolution=iresolved (resolve-groups ordinary molds globals externals surs marks declared resolved.p.deps reserved file prelude)

11445+ ?. (module-values-complete ordinary env.resolution) [%| 'API ordinary definitions need unsupported inference']

11446+ [%& [evidence env.resolution p.mts u.mark-types artifacts.resolution]]

11447+:: Preserve the same graph context through supporting definitions.

11448+++ api-support-analysis-graph

11449+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

11450+ ^- (each iapi-support-evidence @t)

11451+ =/ path-result (api-path-evidence-graph file src externals marks modules active cache prepared)

11452+ ?: ?=(%| -.path-result) [%| p.path-result]

11453+ =/ evidence=iapi-path-evidence p.path-result

11454+ =/ parsed (parse file src)

11455+ ?: ?=(%| -.parsed) [%| 'API source does not parse']

11456+ =/ mod=module p.parsed

11457+ =/ ordinary=(list def)

11458+ (skim defs.mod |=(d=def !&(?=(%mold -.d) |(=(%paths name.d) =(%poke name.d)))))

11459+ =/ prep=iprelude prepared.evidence

11460+ ?. (module-scope-valid mod(defs ordinary) values.prep molds.prep) [%| 'API ordinary scope needs unsupported inference']

11461+ =/ vals=(list term) (global-value-names ordinary)

11462+ ?: (lien vals |=(n=term =(n %main))) [%| 'API module kind needs unsupported inference']

11463+ =/ declared=(list term) (collect-mark-imports imports.mod)

11464+ =/ mark-types=(unit (list iapi-mark-type)) (api-diff-types declared marks declared)

11465+ ?~ mark-types [%| 'API declared marks need unsupported inference']

11466+ =/ prelude=(unit ifile) `iface.prep

11467+ =/ deps=jimports-result

11468+ (resolve-jibb-imports imports.mod externals marks modules active values.prep molds.prep dependencies.evidence prelude)

11469+ ?: ?=(%| -.deps) [%| p.deps]

11470+ =/ molds=imolds (collect-simple-molds ordinary)

11471+ =/ globals=(list term) (weld values.prep (weld (import-binding-names imports.mod) vals))

11472+ =/ surs=(list term) (collect-sur-imports imports.mod)

11473+ =/ reserved=(list term) (weld molds.prep (turn resolved.p.deps |=(j=[face=term interface=ifile] face.j)))

11474+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

11475+ =/ state=istate [0 ~ ~ ~ molds globals externals surs marks declared resolved.p.deps reserved ~ ~ ~ | file top prelude ~ 256 ~ ~ ~ ~]

11476+ =/ mts=(each imold-types @t) (module-mold-types molds state)

11477+ ?: ?=(%| -.mts) [%| p.mts]

11478+ =/ resolution=iresolved (resolve-groups ordinary molds globals externals surs marks declared resolved.p.deps reserved file prelude)

11479+ ?. (module-values-complete ordinary env.resolution) [%| 'API ordinary definitions need unsupported inference']

11480+ [%& [evidence env.resolution p.mts u.mark-types artifacts.resolution]]

11481+::

11482+:: Type-analysis artifact for one plain request. The resolver may publish

11483+:: its interface only together with trusted source and reader evidence.

11484+:: No lowering or runtime validator exists.

11485+:: Value watchability remains unproved even for a watchable declaration.

11486++$ ione-request-interface

11487+ [support=iapi-support-evidence parts=iapi-request-parts iface=ifile]

11488+++ request-compatible-ask

11489+ |= prelude=iprelude

11490+ ^- (unit ischeme)

11491+ =/ public=ifile iface.prelude

11492+ ?. =(at.public /lib/jibb/prelude/jibb) ~

11493+ =/ ask=(unit ischeme) (find-jibb-mold %ask public)

11494+ ?~ ask ~

11495+ ?. ?=([@ ~] vars.u.ask) ~

11496+ ?. ?=(%union -.typ.u.ask) ~

11497+ ?. =(origin.typ.u.ask `[/lib/jibb/internal/jibb %ask]) ~

11498+ ?. (identity-union-parameters vars.u.ask args.typ.u.ask) ~

11499+ =/ m=@ud i.vars.u.ask

11500+ ?: (itype-var-is-atom m typ.u.ask) ~

11501+ ?. (levy (itype-vars typ.u.ask) |=(n=@ud =(n m))) ~

11502+ ?: (itype-has-tag typ.u.ask) ~

11503+ =/ private=(list iwidth-dependency)

11504+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

11505+ ?. ?=([* ~] private) ~

11506+ ?~ source.i.private ~

11507+ =/ path=(unit ischeme) (find-jibb-mold %path public)

11508+ ?~ path ~

11509+ ?^ vars.u.path ~

11510+ =/ path-type=itype [%collection %list ~[[%atom %ta]]]

11511+ ?. =(typ.u.path path-type) ~

11512+ =/ unit-template=(unit ischeme) (find-jibb-mold %unit public)

11513+ ?~ unit-template ~

11514+ ?. (standard-unit-template u.unit-template /lib/jibb/prelude/jibb) ~

11515+ =/ state-unit=(unit itype) (template-apply u.unit-template ~[[%noun ~]])

11516+ ?~ state-unit ~

11517+ =/ path-unit=(unit itype) (template-apply u.unit-template ~[path-type])

11518+ ?~ path-unit ~

11519+ =/ output=itype [%cell [%face %state [%noun ~]] [%face %message [%var m]]]

11520+ =/ agent-input=itype [%cell [%face %mark [%atom %tas]] [%cell [%face %state u.state-unit] [%face %fact [%noun ~]]]]

11521+ =/ store-input=itype [%cell [%face %state u.state-unit] [%face %fact [%noun ~]]]

11522+ =/ pure-case=itype [%cell [%const [%term %tas %pure '%pure']] [%face %value [%var m]]]

11523+ =/ agent-case=itype

11524+ [%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]]]]]]]]

11525+ =/ store-case=itype

11526+ [%cell [%const [%term %tas %store '%store']] [%cell [%face %module [%atom %t]] [%cell [%face %name [%atom %tas]] [%face %receive [%fn store-input output]]]]]

11527+ ?. =(cases.typ.u.ask ~[pure-case agent-case store-case]) ~

11528+ ask

11529+::

11530+:: The first supported standalone API has exactly one mark import and one

11531+:: plain path declaration, with no other definitions or imports. No partial

11532+:: success is published when source, schema, or a required mold is unknown.

11533+++ one-request-interface-source

11534+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

11535+ ^- (each ione-request-interface @t)

11536+ =/ out (api-support-analysis-source file src externals marks modules prepared)

11537+ ?: ?=(%| -.out) [%| p.out]

11538+ =/ support=iapi-support-evidence p.out

11539+ =/ ev=iapi-path-evidence paths.support

11540+ =/ parsed (parse file src)

11541+ ?: ?=(%| -.parsed) [%| 'request source does not parse']

11542+ =/ mod=module p.parsed

11543+ ?. ?=(?([[%mark *] ~] [[%mark *] [%mark *] ~]) imports.mod) [%| 'request imports need unsupported inference']

11544+ ?. ?=([[%mold *] ~] defs.mod) [%| 'request definitions need unsupported inference']

11545+ ?. =(%paths name.i.defs.mod) [%| 'request declaration needs unsupported inference']

11546+ ?. ?=([* ~] paths.ev) [%| 'request count needs unsupported inference']

11547+ =/ p=iapi-path-typed i.paths.ev

11548+ =/ parts=(unit iapi-request-parts) (api-request-parts `ev name.path.p)

11549+ ?~ parts [%| 'request components need unsupported inference']

11550+ ?. ?=(?(~ [* ~]) parameters.u.parts) [%| 'request parameters need unsupported inference']

11551+ ?: &(?=(^ fold.u.parts) ?=(^ parameters.u.parts)) [%| 'request parameter and fold need unsupported inference']

11552+ ?^ scry.path.p [%| 'request scry needs unsupported inference']

11553+ =/ valid-marks=?

11554+ ?~ fold.u.parts ?=([* ~] marks.support)

11555+ ?=([* [* ~]] marks.support)

11556+ ?. valid-marks [%| 'request marks need unsupported inference']

11557+ =/ fold-open=?

11558+ ?~ fold.u.parts |

11559+ |(?=(^ (itype-vars u.fold.u.parts)) (itype-has-tag u.fold.u.parts))

11560+ ?: fold-open [%| 'request fold needs unsupported inference']

11561+ ?^ (itype-vars reply-sample.u.parts) [%| 'request payload needs unsupported inference']

11562+ ?: (itype-has-tag reply-sample.u.parts) [%| 'request payload needs unsupported inference']

11563+ =/ ask=(unit ischeme) (request-compatible-ask prepared.ev)

11564+ ?~ ask [%| 'request ask needs unsupported inference']

11565+ =/ result=(unit itype) (template-apply u.ask ~[[%var 0]])

11566+ ?~ result [%| 'request ask needs unsupported inference']

11567+ =/ callback=itype [%fn reply-sample.u.parts [%var 0]]

11568+ =/ sample=itype

11569+ ?^ fold.u.parts [%cell callback u.fold.u.parts]

11570+ ?~ parameters.u.parts callback

11571+ [%cell typ.i.parameters.u.parts callback]

11572+ =/ scheme=ischeme [[%fn sample u.result] ~[0]]

11573+ =/ exports=imold-types

11574+ (turn marks.support |=(m=iapi-mark-type [name.m [typ.m ~]]))

11575+ =/ prelude=iprelude prepared.ev

11576+ =/ public=ifile iface.prelude

11577+ ?~ source.public [%| 'request prelude source needs unsupported inference']

11578+ =/ private=(list iwidth-dependency)

11579+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

11580+ ?. ?=([* ~] private) [%| 'request internal source needs unsupported inference']

11581+ ?~ source.i.private [%| 'request internal source needs unsupported inference']

11582+ =/ req=irequest-evidence

11583+ [file name.path.p p src u.source.public u.source.i.private values.prelude molds.prelude externals marks]

11584+ =/ interface=ifile [~[[name.path.p scheme]] exports file ~ ~ ~ `src `[(silt `(list path)`~[file]) ~[req] modules `public values.prelude molds.prelude externals marks]]

11585+ [%& [support u.parts interface]]

11586+:: Graph-aware request artifact; resolver use remains type-only.

11587+++ one-request-interface-graph

11588+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

11589+ ^- (each ione-request-interface @t)

11590+ =/ out (api-support-analysis-graph file src externals marks modules active cache prepared)

11591+ ?: ?=(%| -.out) [%| p.out]

11592+ =/ support=iapi-support-evidence p.out

11593+ =/ ev=iapi-path-evidence paths.support

11594+ =/ parsed (parse file src)

11595+ ?: ?=(%| -.parsed) [%| 'request source does not parse']

11596+ =/ mod=module p.parsed

11597+ ?. ?=(?([[%mark *] ~] [[%mark *] [%mark *] ~]) imports.mod) [%| 'request imports need unsupported inference']

11598+ ?. ?=([[%mold *] ~] defs.mod) [%| 'request definitions need unsupported inference']

11599+ ?. =(%paths name.i.defs.mod) [%| 'request declaration needs unsupported inference']

11600+ ?. ?=([* ~] paths.ev) [%| 'request count needs unsupported inference']

11601+ =/ p=iapi-path-typed i.paths.ev

11602+ =/ parts=(unit iapi-request-parts) (api-request-parts `ev name.path.p)

11603+ ?~ parts [%| 'request components need unsupported inference']

11604+ ?. ?=(?(~ [* ~]) parameters.u.parts) [%| 'request parameters need unsupported inference']

11605+ ?: &(?=(^ fold.u.parts) ?=(^ parameters.u.parts)) [%| 'request parameter and fold need unsupported inference']

11606+ ?^ scry.path.p [%| 'request scry needs unsupported inference']

11607+ =/ valid-marks=?

11608+ ?~ fold.u.parts ?=([* ~] marks.support)

11609+ ?=([* [* ~]] marks.support)

11610+ ?. valid-marks [%| 'request marks need unsupported inference']

11611+ =/ fold-open=?

11612+ ?~ fold.u.parts |

11613+ |(?=(^ (itype-vars u.fold.u.parts)) (itype-has-tag u.fold.u.parts))

11614+ ?: fold-open [%| 'request fold needs unsupported inference']

11615+ ?^ (itype-vars reply-sample.u.parts) [%| 'request payload needs unsupported inference']

11616+ ?: (itype-has-tag reply-sample.u.parts) [%| 'request payload needs unsupported inference']

11617+ =/ ask=(unit ischeme) (request-compatible-ask prepared.ev)

11618+ ?~ ask [%| 'request ask needs unsupported inference']

11619+ =/ result=(unit itype) (template-apply u.ask ~[[%var 0]])

11620+ ?~ result [%| 'request ask needs unsupported inference']

11621+ =/ callback=itype [%fn reply-sample.u.parts [%var 0]]

11622+ =/ sample=itype

11623+ ?^ fold.u.parts [%cell callback u.fold.u.parts]

11624+ ?~ parameters.u.parts callback

11625+ [%cell typ.i.parameters.u.parts callback]

11626+ =/ scheme=ischeme [[%fn sample u.result] ~[0]]

11627+ =/ exports=imold-types

11628+ (turn marks.support |=(m=iapi-mark-type [name.m [typ.m ~]]))

11629+ =/ prelude=iprelude prepared.ev

11630+ =/ public=ifile iface.prelude

11631+ ?~ source.public [%| 'request prelude source needs unsupported inference']

11632+ =/ private=(list iwidth-dependency)

11633+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

11634+ ?. ?=([* ~] private) [%| 'request internal source needs unsupported inference']

11635+ ?~ source.i.private [%| 'request internal source needs unsupported inference']

11636+ =/ req=irequest-evidence

11637+ [file name.path.p p src u.source.public u.source.i.private values.prelude molds.prelude externals marks]

11638+ =/ interface=ifile [~[[name.path.p scheme]] exports file ~ ~ ~ `src `[(silt `(list path)`~[file]) ~[req] modules `public values.prelude molds.prelude externals marks]]

11639+ [%& [support u.parts interface]]

11640+::

11641+++ api-mark-exports

11642+ |= [marks=(list term) all=(list term) externals=imark-externals]

11643+ ^- imold-types

11644+ ?~ marks ~

11645+ =/ t=(unit itype) (find-imported-mark i.marks externals all)

11646+ ?~ t $(marks t.marks)

11647+ [[i.marks [u.t ~]] $(marks t.marks)]

11648+::

11649+:: Experimental direct poke-only API. Unsupported API declarations fail

11650+:: as a whole; supplied mark reader results retain their existing boundary.

11651+++ api-poke-interface

11652+ |= [at=path mod=module mark-externals=imark-externals prelude-values=(list term) prelude-molds=(list term) prelude=(unit ifile)]

11653+ ^- (unit ifile)

11654+ ?: (lien defs.mod def-has-hole) ~

11655+ ?. ?=([%ui %api @ %jibb ~] at) ~

11656+ ?^ (duplicate-defs defs.mod) ~

11657+ ?~ prelude ~

11658+ ?. =(at.u.prelude /lib/jibb/prelude/jibb) ~

11659+ =/ poke=(unit ischeme) (find-jibb-mold %poke u.prelude)

11660+ ?~ poke ~

11661+ ?. ?=(%union -.typ.u.poke) ~

11662+ ?^ vars.u.poke ~

11663+ =/ compatible=?

11664+ %+ lien cases.typ.u.poke

11665+ |= c=itype

11666+ ?=([%cell [%const [%term %tas %agent *]] [%cell [%face %agent [%atom %tas]] [%cell [%face %mark [%atom %tas]] [%face %payload [%noun ~]]]]] c)

11667+ ?. compatible ~

11668+ ?. (module-scope-valid mod(defs ~) prelude-values prelude-molds) ~

11669+ ?. (levy imports.mod |=(i=import ?=(%mark -.i))) ~

11670+ =/ marks=(list term) (collect-mark-imports imports.mod)

11671+ ?. ?=([@ ~] marks) ~

11672+ =/ ds=(list def) defs.mod

11673+ ?. ?=([[%mold *] ~] ds) ~

11674+ ?. =(%poke name.i.ds) ~

11675+ =/ sh=shape shape.i.ds

11676+ ?. ?=([%ref *] sh) ~

11677+ ?. ?=([@ ~] names.sh) ~

11678+ =/ n=term i.names.sh

11679+ ?. (unique-value-name n marks) ~

11680+ ?: |((lien prelude-values |=(x=term =(n x))) (lien prelude-molds |=(x=term =(n x)))) ~

11681+ =/ mark=(unit itype) (find-imported-mark n mark-externals marks)

11682+ ?~ mark ~

11683+ =/ sc=ischeme [[%fn u.mark typ.u.poke] ~]

11684+ `[~[[n sc]] (api-mark-exports marks marks mark-externals) at ~[[n i.t.t.at n]] ~ ~ ~ ~]

11685+::

11686+:: Source-proven ordinary helpers validate each selected /sur dependency.

11687+:: Unused or less direct cores remain unsupported by this first interface.

11688+++ api-sur-covered

11689+ |= [surs=(list term) defs=(list def) externals=iexternals all=(list term)]

11690+ ^- ?

11691+ ?~ surs &

11692+ =/ found=(list def)

11693+ %+ skim defs

11694+ |= d=def

11695+ ?. ?=(%mold -.d) |

11696+ ?. ?=(%ref -.shape.d) |

11697+ ?. ?=([@ [@ ~]] names.shape.d) |

11698+ =(i.t.names.shape.d i.surs)

11699+ ?~ found |

11700+ =/ selected=def i.found

11701+ ?. ?=(%mold -.selected) |

11702+ =/ sh=shape shape.selected

11703+ ?. ?=(%ref -.sh) |

11704+ ?. ?=([@ [@ ~]] names.sh) |

11705+ =/ checked=(unit itype) (find-imported-mold i.surs i.names.sh externals all)

11706+ ?~ checked |

11707+ $(surs t.surs)

11708+::

11709++$ imulti-request-gates [values=ienv requests=(list irequest-evidence)]

11710+++ api-request-gates

11711+ |= [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]

11712+ ^- (unit imulti-request-gates)

11713+ ?~ paths `[~ ~]

11714+ ?: =(0 fuel) ~

11715+ =/ p=iapi-path-typed i.paths

11716+ =/ parts=(unit iapi-request-parts) (api-request-parts `ev name.path.p)

11717+ ?~ parts ~

11718+ ?. ?=(?(~ [* ~]) parameters.u.parts) ~

11719+ ?: &(?=(^ fold.u.parts) ?=(^ parameters.u.parts)) ~

11720+ ?^ scry.path.p ~

11721+ ?^ (itype-vars reply-sample.u.parts) ~

11722+ ?: (itype-has-tag reply-sample.u.parts) ~

11723+ =/ open-fold=?

11724+ ?~ fold.u.parts |

11725+ |(?=(^ (itype-vars u.fold.u.parts)) (itype-has-tag u.fold.u.parts))

11726+ ?: open-fold ~

11727+ =/ result=(unit itype) (template-apply ask ~[[%var 0]])

11728+ ?~ result ~

11729+ =/ callback=itype [%fn reply-sample.u.parts [%var 0]]

11730+ =/ sample=itype

11731+ ?^ fold.u.parts [%cell callback u.fold.u.parts]

11732+ ?~ parameters.u.parts callback

11733+ [%cell typ.i.parameters.u.parts callback]

11734+ =/ scheme=ischeme [[%fn sample u.result] ~[0]]

11735+ =/ prep=iprelude prepared.ev

11736+ =/ req=irequest-evidence

11737+ [file name.path.p p src public internal values.prep molds.prep externals marks]

11738+ =/ rest=(unit imulti-request-gates)

11739+ $(paths t.paths, fuel (dec fuel))

11740+ ?~ rest ~

11741+ `[[[name.path.p scheme] values.u.rest] [req requests.u.rest]]

11742+::

11743+++ api-poke-from-checked

11744+ |= [file=path mod=module marks=imark-externals values=(list term) molds=(list term) prelude=(unit ifile)]

11745+ ^- (unit [values=ienv derived=(list iderived)])

11746+ =/ pokes=(list def)

11747+ (skim defs.mod |=(d=def &(?=(%mold -.d) =(%poke name.d))))

11748+ ?~ pokes `[~ ~]

11749+ ?. ?=([* ~] pokes) ~

11750+ =/ declared=(list term) (collect-mark-imports imports.mod)

11751+ =/ ns=(unit (list term)) (api-poke-mark-names pokes declared)

11752+ ?~ ns ~

11753+ ?. ?=([@ ~] u.ns) ~

11754+ =/ matching=(list import)

11755+ %+ skim imports.mod

11756+ |= i=import

11757+ ?. ?=(%mark -.i) |

11758+ =(mark.i i.u.ns)

11759+ ?. ?=([* ~] matching) ~

11760+ =/ checked=(unit ifile)

11761+ (api-poke-interface file mod(defs pokes, imports matching) marks values molds prelude)

11762+ ?~ checked ~

11763+ `[values.u.checked derived.u.checked]

11764+::

11765+:: The partial interface is published atomically: all paths, ordinary

11766+:: source definitions, declared marks and the poke must check. Unselected

11767+:: /sur bindings, runtime validation and value watchability remain unproved.

11768+++ multi-request-interface-graph

11769+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

11770+ ^- (each [iface=ifile cache=jcache] @t)

11771+ =/ out (api-support-analysis-graph file src externals marks modules active cache prepared)

11772+ ?: ?=(%| -.out) [%| p.out]

11773+ =/ support=iapi-support-evidence p.out

11774+ =/ ev=iapi-path-evidence paths.support

11775+ =/ parsed (parse file src)

11776+ ?: ?=(%| -.parsed) [%| 'request source does not parse']

11777+ =/ mod=module p.parsed

11778+ ?. (levy imports.mod |=(i=import ?=(?(%mark %sur) -.i)))

11779+ [%| 'request imports need unsupported inference']

11780+ =/ surs=(list term) (collect-sur-imports imports.mod)

11781+ ?. (api-sur-covered surs defs.mod externals surs)

11782+ [%| 'API source dependency needs unsupported inference']

11783+ ?~ paths.ev [%| 'request count needs unsupported inference']

11784+ =/ ask=(unit ischeme) (request-compatible-ask prepared.ev)

11785+ ?~ ask [%| 'request ask needs unsupported inference']

11786+ =/ prep=iprelude prepared.ev

11787+ =/ public=ifile iface.prep

11788+ ?~ source.public [%| 'request prelude source needs unsupported inference']

11789+ =/ private=(list iwidth-dependency)

11790+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

11791+ ?. ?=([* ~] private) [%| 'request internal source needs unsupported inference']

11792+ ?~ source.i.private [%| 'request internal source needs unsupported inference']

11793+ =/ gates=(unit imulti-request-gates)

11794+ (api-request-gates paths.ev ev u.ask file src u.source.public u.source.i.private externals marks 256)

11795+ ?~ gates [%| 'request paths need unsupported inference']

11796+ =/ poke=(unit [values=ienv derived=(list iderived)])

11797+ (api-poke-from-checked file mod marks values.prep molds.prep `public)

11798+ ?~ poke [%| 'API poke needs unsupported inference']

11799+ =/ mark-molds=imold-types

11800+ (turn marks.support |=(m=iapi-mark-type [name.m [typ.m ~]]))

11801+ =/ exports=imold-types (weld mark-molds molds.support)

11802+ =/ names=(list term) (turn exports |=(m=[name=term template=ischeme] name.m))

11803+ ?. (levy names |=(n=term (unique-value-name n names)))

11804+ [%| 'API exported molds need unsupported inference']

11805+ =/ env=ienv (weld values.u.gates (weld values.u.poke values.support))

11806+ =/ graph=irequest-graph

11807+ [(silt `(list path)`~[file]) requests.u.gates modules `public values.prep molds.prep externals marks]

11808+ =/ iface=ifile

11809+ [env exports file derived.u.poke elaborations.support ~ `src `graph]

11810+ [%& [iface dependencies.ev]]

11811+::

845211812++ infer-jibb-file

845311813 |= [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)]

845411814 ^- jfile-result

8455− ?: ?=([%ui %api *] at) [%| (crip "API module needs unsupported inference: {(spud at)}")]

845611815 =/ parsed (parse at src)

845711816 ?: ?=(%| -.parsed) [%| (crip "module source does not parse: {(spud at)}")]

845811817 =/ mod=module p.parsed

8459− ?. (module-scope-valid mod prelude-values prelude-molds) [%| (crip "module has conflicting names: {(spud at)}")]

11818+ =/ duplicate=(unit idiag) (duplicate-defs defs.mod)

11819+ ?^ duplicate [%| (show-duplicate-fields at src u.duplicate)]

11820+ ?: ?=([%ui %api *] at)

11821+ =/ iface=(unit ifile) (api-poke-interface at mod mark-externals prelude-values prelude-molds prelude)

11822+ ?^ iface

11823+ =/ checked=ifile u.iface(source `src, graph `[(silt `(list path)`~[at]) ~ modules prelude prelude-values prelude-molds externals mark-externals])

11824+ [%& [checked [[at checked] cache]]]

11825+ ?~ prelude [%| (crip "API module needs unsupported inference: {(spud at)}")]

11826+ =/ prepared=iprelude [u.prelude prelude-values prelude-molds]

11827+ =/ narrow=?

11828+ ?. ?=([[%mark *] ~] imports.mod) |

11829+ ?. ?=([[%mold *] ~] defs.mod) |

11830+ ?. =(%paths name.i.defs.mod) |

11831+ !?=(%union -.shape.i.defs.mod)

11832+ ?: narrow

11833+ =/ request=(each ione-request-interface @t)

11834+ (one-request-interface-graph at src externals mark-externals modules active cache `prepared)

11835+ ?: ?=(%| -.request) [%| (crip "API module needs unsupported inference: {(spud at)}")]

11836+ =/ checked=ifile iface.p.request

11837+ [%& [checked [[at checked] dependencies.paths.support.p.request]]]

11838+ =/ multi=(each [iface=ifile cache=jcache] @t)

11839+ (multi-request-interface-graph at src externals mark-externals modules active cache `prepared)

11840+ ?: ?=(%| -.multi) [%| (crip "API module needs unsupported inference: {(spud at)}")]

11841+ [%& [iface.p.multi [[at iface.p.multi] cache.p.multi]]]

11842+ ?. (module-scope-valid mod prelude-values prelude-molds)

11843+ ?: (pending-declared-poke at mod prelude-values prelude-molds)

11844+ [%| (crip "module kind or scope needs unsupported inference: {(spud at)}")]

11845+ [%| (crip "module has conflicting names: {(spud at)}")]

846011846 =/ vals=(list term) (global-value-names defs.mod)

846111847 ?: (lien vals |=(n=term =(n %main)))

846211848 [%| (crip "module kind needs unsupported inference: {(spud at)}")]

846311849 =/ js=jimports-result (resolve-jibb-imports imports.mod externals mark-externals modules active prelude-values prelude-molds cache prelude)

846411850 ?: ?=(%| -.js) [%| p.js]

8465− =/ molds=imolds (collect-simple-molds defs.mod)

11851+ =/ collected=grec-collected

11852+ ?^ imports.mod [(collect-simple-molds defs.mod) *(map term shape)]

11853+ (grec-collect-molds defs.mod)

11854+ =/ molds=imolds molds.collected

846611855 =/ globals=(list term) (weld prelude-values (weld (import-binding-names imports.mod) vals))

846711856 =/ surs=(list term) (collect-sur-imports imports.mod)

846811857 =/ marks=(list term) (collect-mark-imports imports.mod)

846911858 =/ reserved=(list term) (weld prelude-molds (turn resolved.p.js |=(j=[face=term interface=ifile] face.j)))

847011859 =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

8471− =/ state=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks resolved.p.js reserved ~ ~ ~ | at top prelude]

11860+ =/ state=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks resolved.p.js reserved ~ ~ ~ | at top prelude ~ 256 ~ ~ ~ ~]

11861+ :: Source and scope were checked above; preserve that exact root and prelude.

11862+ :: This first integration only indexes import-free library sources.

11863+ =/ index=(unit [at=path source=@t prelude=ifile shapes=(map term shape)])

11864+ ?^ imports.mod ~

11865+ ?~ prelude ~

11866+ =/ standard=(unit ischeme) (find-jibb-mold %list u.prelude)

11867+ ?~ standard ~

11868+ ?. =(u.standard [[%collection %list ~[[%var 0]]] ~[0]]) ~

11869+ =/ index=(map term shape) proofs.collected

11870+ ?. !=(index *(map term shape)) ~

11871+ ?: (lien molds |=(m=[name=term body=shape] =(%list name.m))) ~

11872+ `[at src u.prelude index]

11873+ =. grec-index.state index

847211874 =/ mts=(each imold-types @t) (module-mold-types molds state)

847311875 ?: ?=(%| -.mts) [%| (crip "{(trip p.mts)}: {(spud at)}")]

8474− =/ env=ienv (resolve-supported-defs defs.mod molds globals externals surs mark-externals marks resolved.p.js reserved at prelude)

11876+ =/ resolution=iresolved

11877+ ?~ index

11878+ (resolve-groups defs.mod molds globals externals surs mark-externals marks resolved.p.js reserved at prelude)

11879+ (resolve-groups-core defs.mod molds globals externals surs mark-externals marks resolved.p.js reserved at prelude index)

11880+ =/ env=ienv env.resolution

847511881 ?. (module-values-complete defs.mod env)

847611882 [%| (crip "module definitions need unsupported inference: {(spud at)}")]

8477− [%& [[env p.mts at] [[at [env p.mts at]] cache.p.js]]]

11883+ =/ initial=irequest-graph [(silt `(list path)`~[at]) ~ modules prelude prelude-values prelude-molds externals mark-externals]

11884+ =/ graph=(unit irequest-graph) (request-graph-merge resolved.p.js initial (add 1 (lent resolved.p.js)))

11885+ ?~ graph [%| 'module request evidence needs unsupported inference']

11886+ =/ iface=ifile [env p.mts at ~ artifacts.resolution ~ `src graph]

11887+ [%& [iface [[at iface] cache.p.js]]]

11888+::

11889+:: A source-bound analysis of one named mold, not a module, island,

11890+:: request, watchability or runtime check. The host owns the trusted

11891+:: prepared prelude, canonical paths and reader/source version identities.

11892+:: The 256-node cap covers only classification, not source/graph work.

11893++$ igate-free-mold

11894+ [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]

11895+++ gate-free-mold-source

11896+ |= [file=path src=@t name=term externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude) fuel=@ud]

11897+ ^- (each igate-free-mold @t)

11898+ ?~ file [%| 'mold analysis needs a path ending in jibb']

11899+ ?. =(%jibb (rear file)) [%| 'mold analysis needs a path ending in jibb']

11900+ ?: |(=(file /lib/jibb/internal/jibb) =(file /lib/jibb/primitives/jibb))

11901+ [%| 'the prelude internal modules are private']

11902+ ?: ?=([%ui %api *] file) [%| 'API declarations need unsupported mold analysis']

11903+ ?: ?=([%ui %stores *] file) [%| 'store declarations need unsupported mold analysis']

11904+ =/ entries=jbundle (skim modules |=(m=jsource =(file at.m)))

11905+ ?: (gth (lent entries) 1) [%| 'duplicate root module sources']

11906+ =/ wrong-root=? ?~(entries | !=(source.i.entries src))

11907+ ?: wrong-root [%| 'root module source does not match bundle']

11908+ =/ parsed (parse file src)

11909+ ?: ?=(%| -.parsed) [%| 'mold source does not parse']

11910+ =/ mod=module p.parsed

11911+ =/ duplicate=(unit idiag) (duplicate-defs defs.mod)

11912+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

11913+ ?~ prepared [%| 'mold analysis needs the prepared prelude']

11914+ ?. (module-scope-valid mod values.u.prepared molds.u.prepared)

11915+ [%| 'mold source has conflicting or unsupported scope']

11916+ =/ selected=(list def)

11917+ (skim defs.mod |=(d=def &(?=(%mold -.d) =(name.d name))))

11918+ ?~ selected [%| 'selected mold is not declared']

11919+ ?^ t.selected [%| 'selected mold is not unique']

11920+ ?> ?=(%mold -.i.selected)

11921+ =/ public=ifile iface.u.prepared

11922+ =/ js=jimports-result

11923+ (resolve-jibb-imports imports.mod externals marks modules ~[file] values.u.prepared molds.u.prepared ~ `public)

11924+ ?: ?=(%| -.js) [%| p.js]

11925+ =/ ms=imolds (collect-simple-molds defs.mod)

11926+ =/ vals=(list term) (global-value-names defs.mod)

11927+ =/ globals=(list term) (weld values.u.prepared (weld (import-binding-names imports.mod) vals))

11928+ =/ surs=(list term) (collect-sur-imports imports.mod)

11929+ =/ declared=(list term) (collect-mark-imports imports.mod)

11930+ =/ reserved=(list term) (weld molds.u.prepared (turn resolved.p.js |=(j=[face=term interface=ifile] face.j)))

11931+ =/ top=(list term) (turn ms |=(m=[name=term body=shape] name.m))

11932+ =/ state=istate [0 ~ ~ ~ ms globals externals surs marks declared resolved.p.js reserved ~ ~ ~ | file top `public ~ 256 ~ ~ ~ ~]

11933+ =/ inferred=(unit [template=ischeme state=istate])

11934+ (infer-mold-template shape.i.selected state(active ~[name], in-mold &))

11935+ ?~ inferred [%| 'selected mold needs unsupported inference']

11936+ =/ template=ischeme template.u.inferred

11937+ =. typ.template (label-direct-union typ.template shape.i.selected name state)

11938+ =. typ.template (itype-normalize typ.template sub.state.u.inferred)

11939+ =/ cap=@ud (min fuel 256)

11940+ =/ analysis=igate-free (gate-free-type typ.template cap ~)

11941+ [%& [file src name u.prepared externals marks modules cache.p.js template fuel cap analysis]]

847811942::

847911943:: +golden-types-with-modules fails closed for imports without prelude

848011944:: scope. +golden-types-with-prelude resolves supported library graphs;

@@ -8485,6 +11949,8 @@

848511949 ^- @t

848611950 =/ parsed (parse file src)

848711951 ?: ?=(%| -.parsed) (show-error src p.parsed)

11952+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11953+ ?^ duplicate (duplicate-fields-report file src u.duplicate)

848811954 ?: (lien imports.p.parsed |=(i=import ?=(%jibb -.i)))

848911955 'partial inference; module not checked\0aprelude source missing; module import inference unsupported'

849011956 (golden-types-with-marks file src externals mark-externals)

@@ -8499,6 +11965,8 @@

849911965 ^- @t

850011966 =/ parsed (parse file src)

850111967 ?: ?=(%| -.parsed) (show-error src p.parsed)

11968+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11969+ ?^ duplicate (duplicate-fields-report file src u.duplicate)

850211970 ?: =(0 prelude-source) 'partial inference; module not checked\0aprelude source missing; module import inference unsupported'

850311971 =/ prelude (parse /lib/jibb/prelude/jibb prelude-source)

850411972 ?: ?=(%| -.prelude) 'partial inference; module not checked\0aprelude source does not parse; module import inference unsupported'

@@ -8506,16 +11974,26 @@

850611974 ?~ prepared 'partial inference; module not checked\0aprelude interface is not supported'

850711975 (golden-types-with-prepared-prelude file src externals mark-externals modules prepared)

850811976::

11977+++ golden-types-with-prelude-and-internal

11978+ |= [file=path src=@t externals=iexternals mark-externals=imark-externals modules=jbundle prelude-source=@t internal-source=@t]

11979+ ^- @t

11980+ =/ prepared=(unit iprelude) (prepare-prelude-with-internal prelude-source internal-source)

11981+ (golden-types-with-prepared-prelude file src externals mark-externals modules prepared)

11982+::

850911983++ golden-types-with-prepared-prelude

851011984 |= [file=path src=@t externals=iexternals mark-externals=imark-externals modules=jbundle prepared=(unit iprelude)]

851111985 ^- @t

851211986 =/ parsed (parse file src)

851311987 ?: ?=(%| -.parsed) (show-error src p.parsed)

11988+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11989+ ?^ duplicate (duplicate-fields-report file src u.duplicate)

851411990 ?~ prepared 'partial inference; module not checked\0aprelude interface is not supported'

851511991 =/ prelude-values=(list term) values.u.prepared

851611992 =/ prelude-molds=(list term) molds.u.prepared

851711993 =/ iface=(unit ifile) `iface.u.prepared

851811994 ?. (module-scope-valid p.parsed prelude-values prelude-molds)

11995+ ?: (pending-declared-poke file p.parsed prelude-values prelude-molds)

11996+ 'partial inference; module not checked\0amodule kind or scope needs unsupported inference'

851911997 'partial inference; module not checked\0amodule has conflicting names'

852011998 =/ js=jimports-result

852111999 (resolve-jibb-imports imports.p.parsed externals mark-externals modules ~[file] prelude-values prelude-molds ~ iface)

@@ -8556,13 +12034,20 @@

855612034 =. reserved-molds (weld reserved-molds (turn jimports |=(j=[face=term interface=ifile] face.j)))

855712035 =/ parsed (parse file src)

855812036 ?: ?=(%| -.parsed) (show-error src p.parsed)

12037+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

12038+ ?^ duplicate (duplicate-fields-report file src u.duplicate)

12039+ ?: (module-has-reserved-proj p.parsed)

12040+ 'module has reserved proj name'

855912041 =/ ds=(list def) defs.p.parsed

856012042 =/ molds=imolds (collect-simple-molds ds)

856112043 =/ globals=(list term) (weld prelude-values (weld (turn jimports |=(j=[face=term interface=ifile] face.j)) (global-value-names ds)))

856212044 =/ surs=(list term) (collect-sur-imports imports.p.parsed)

856312045 =/ marks=(list term) (collect-mark-imports imports.p.parsed)

856412046 =/ resolution=iresolved (resolve-groups ds molds globals externals surs mark-externals marks jimports reserved-molds file prelude)

12047+ =/ cycles=(list icycle) (definite-value-cycles ds globals)

856512048 =/ env=ienv env.resolution

12049+ =/ source-defs=(map term def) (direct-checked-gates ds env)

12050+ =/ heads=(unit igate-prelude-evidence) (direct-prelude-evidence ds prelude)

856612051 =/ lines=(list @t) ~

856712052 |-

856812053 ?~ ds (of-wain:format ['partial inference; module not checked' (flop lines)])

@@ -8571,6 +12056,10 @@

857112056 $(ds t.ds, lines [(show-partial-mold file src d molds) lines])

857212057 ?. (unique-value-name name.d globals)

857312058 $(ds t.ds, lines [(crip "++ {(trip name.d)}: name already in scope") lines])

12059+ =/ cycle=(list icycle) (skim cycles |=(c=icycle =(name.c name.d)))

12060+ ?^ cycle

12061+ =/ diag=idiag ["non-gate value depends on itself through a cycle" ~[[first.i.cycle "value in cycle"] [next.i.cycle "dependency in cycle"]]]

12062+ $(ds t.ds, lines [(show-inference-diagnostic file src name.d diag) lines])

857412063 ?: (lien grouped.resolution |=(n=term =(n name.d)))

857512064 =/ found=(unit ischeme) (ienv-lookup name.d env)

857612065 ?~ found $(ds t.ds, lines [(crip "++ {(trip name.d)}: recursive group unavailable") lines])

@@ -8578,7 +12067,9 @@

857812067 =/ line=@t (crip "++ {(trip name.d)}: {(show-itype typ ~)}{(show-atom-constraint typ)}")

857912068 $(ds t.ds, lines [line lines])

858012069 =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

8581− =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | file top prelude]

12070+ =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | file top prelude ~ 256 ~ ~ ~ ~]

12071+ =. gate-defs.initial source-defs

12072+ =. head-evidence.initial heads

858212073 =. initial (reserve-def-caps val.d initial)

858312074 =/ result=iresult

858412075 ?: |(?=(%gate -.val.d) ?=(%gate-wide -.val.d))

@@ -8586,6 +12077,11 @@

858612077 (infer-fragment val.d env initial)

858712078 ?: ?=(%| -.result)

858812079 $(ds t.ds, lines [(show-inference-diagnostic file src name.d p.result) lines])

12080+ =. state.p.result (promote-restricted-numbers state.p.result env)

12081+ =. 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)))

12082+ =/ hole=(unit idiag) (unresolved-hole holes.state.p.result holes.initial state.p.result)

12083+ ?^ hole

12084+ $(ds t.ds, lines [(show-inference-diagnostic file src name.d u.hole) lines])

858912085 =/ merged=(unit [first=icap second=icap])

859012086 (merged-capitals caps.state.p.result sub.state.p.result)

859112087 ?^ merged

@@ -8608,7 +12104,126 @@

860812104 =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

860912105 ?: (gth (lent vars) 26)

861012106 $(ds t.ds, lines [(crip "++ {(trip name.d)}: too many variables for partial printer") lines])

12107+ ?~ (width-finalize projections.state.p.result sub.state.p.result vars)

12108+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: record projection elaboration needs unsupported inference") lines])

861112109 =/ printable=itype (canonical-itype typ vars)

861212110 =/ line=@t (crip "++ {(trip name.d)}: {(show-itype printable ~)}{(show-atom-constraint printable)}")

861312111 $(ds t.ds, lines [line lines])

12112+:: Experimental per-module, source-derived recursive tree index.

12113+:: The two tags and the exact children/list/self layout are fixed-shape

12114+:: checks, so ordinary definitions incur no type-tree or source scans.

12115+++ grec-tagged-fields

12116+ |= sh=shape

12117+ ^- (unit [tag=@ fields=(list field)])

12118+ ?. ?=(%cell -.sh) ~

12119+ ?~ fields.sh ~

12120+ =/ head=field i.fields.sh

12121+ ?. ?=(%bare -.head) ~

12122+ ?. ?=(%const -.shape.head) ~

12123+ ?. &(?=(%term form.lit.shape.head) =(%tas aura.lit.shape.head)) ~

12124+ `[val.lit.shape.head t.fields.sh]

12125+++ grec-tree-children

12126+ |= [fs=(list field) param=@t]

12127+ ^- (unit field)

12128+ ?~ fs ~

12129+ ?~ t.fs `i.fs

12130+ ?^ t.t.fs ~

12131+ =/ event=field i.fs

12132+ =/ kids=field i.t.fs

12133+ ?. &(?=(%face -.event) ?=(%face -.kids)) ~

12134+ ?. !=(name.event name.kids) ~

12135+ ?. ?=(%fn -.shape.event) ~

12136+ ?. ?=(%aura -.sample.shape.event) ~

12137+ ?. =(%t aura.sample.shape.event) ~

12138+ ?. ?=(%tvar -.product.shape.event) ~

12139+ ?. =(param name.product.shape.event) ~

12140+ `kids

12141+::

12142+++ grec-tree-proof

12143+ |= [name=term sh=shape]

12144+ ^- ?

12145+ ?. ?=(%generic -.sh) |

12146+ ?. ?=([@ ~] vars.sh) |

12147+ =/ param=@t i.vars.sh

12148+ ?. ?=(%union -.body.sh) |

12149+ ?. ?=([* [* ~]] cases.body.sh) |

12150+ =/ a=(unit [tag=@ fields=(list field)]) (grec-tagged-fields i.cases.body.sh)

12151+ =/ b=(unit [tag=@ fields=(list field)]) (grec-tagged-fields i.t.cases.body.sh)

12152+ ?~ a |

12153+ ?~ b |

12154+ ?. !=(tag.u.a tag.u.b) |

12155+ ?. ?=([* ~] fields.u.a) |

12156+ =/ value=field i.fields.u.a

12157+ ?. ?=(%face -.value) |

12158+ ?. ?=(%aura -.shape.value) |

12159+ ?. =(%t aura.shape.value) |

12160+ =/ selected=(unit field) (grec-tree-children fields.u.b param)

12161+ ?~ selected |

12162+ =/ kids=field u.selected

12163+ ?. ?=(%face -.kids) |

12164+ ?. ?=(%apply -.shape.kids) |

12165+ ?. =(ref.shape.kids ~[%list]) |

12166+ ?. ?=([* ~] args.shape.kids) |

12167+ =/ self=shape i.args.shape.kids

12168+ ?. ?=(%apply -.self) |

12169+ ?. =(ref.self ~[name]) |

12170+ ?. ?=([* ~] args.self) |

12171+ ?. ?=(%tvar -.i.args.self) |

12172+ =(name.i.args.self param)

12173++$ grec-collected [molds=imolds proofs=(map term shape)]

12174+:: Experimental one-layer analysis view, never an exported mold identity.

12175+++ grec-unfold-view

12176+ |= [typ=itype fuel=@ud]

12177+ ^- (unit [view=itype left=@ud])

12178+ ?. ?=(%grec -.typ) ~

12179+ ?: =(fuel 0) ~

12180+ ?. ?=([* ~] args.typ) ~

12181+ =/ sh=shape proof.typ

12182+ ?. (grec-tree-proof name.typ sh) ~

12183+ ?> ?=(%generic -.sh)

12184+ ?> ?=([@ ~] vars.sh)

12185+ ?> ?=(%union -.body.sh)

12186+ ?> ?=([* [* ~]] cases.body.sh)

12187+ =/ ca=shape i.cases.body.sh

12188+ =/ cb=shape i.t.cases.body.sh

12189+ ?> ?=(%cell -.ca)

12190+ ?> ?=(%cell -.cb)

12191+ ?> ?=([* [* ~]] fields.ca)

12192+ ?> ?=([* *] fields.cb)

12193+ =/ tag-a=field i.fields.ca

12194+ =/ tag-b=field i.fields.cb

12195+ ?> ?=(%bare -.tag-a)

12196+ ?> ?=(%bare -.tag-b)

12197+ ?> ?=(%const -.shape.tag-a)

12198+ ?> ?=(%const -.shape.tag-b)

12199+ =/ text-field=field i.t.fields.ca

12200+ ?> ?=(%face -.text-field)

12201+ =/ branch=(list field) t.fields.cb

12202+ =/ kids=(unit field) (grec-tree-children branch i.vars.sh)

12203+ ?~ kids ~

12204+ ?> ?=(%face -.u.kids)

12205+ =/ children=itype [%face name.u.kids [%collection %list ~[typ]]]

12206+ ?> ?=(^ branch)

12207+ =/ payload=itype

12208+ ?~ t.branch children

12209+ =/ event=field i.branch

12210+ ?> ?=(%face -.event)

12211+ [%cell [%face name.event [%fn [%atom %t] i.args.typ]] children]

12212+ =/ leaf=itype [%cell [%const lit.shape.tag-a] [%face name.text-field [%atom %t]]]

12213+ =/ node=itype [%cell [%const lit.shape.tag-b] payload]

12214+ `[[%union ~[leaf node] ~ ~ ~] (dec fuel)]

12215+::

12216+++ grec-collect-molds

12217+ |= ds=(list def)

12218+ ^- grec-collected

12219+ ?~ ds [~ *(map term shape)]

12220+ =/ rest=grec-collected $(ds t.ds)

12221+ ?. ?=(%mold -.i.ds) rest

12222+ =/ name=term name.i.ds

12223+ =/ body=shape shape.i.ds

12224+ =/ proofs=(map term shape) proofs.rest

12225+ =? proofs (grec-tree-proof name body) (~(put by proofs) name body)

12226+ [[[name body] molds.rest] proofs]

12227+::

12228+

861412229--

jibb-dev/lib/jibb/internal.jibbnew file+31

@@ -0,0 +1,31 @@

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+

22+:: Transparent request data. Identity and path fields are writable and do not

23+:: prove a schema or watchability. A future executor must bind them to checked

24+:: source evidence and validate facts and state; generated receivers must

25+:: decode before calling typed replies or folds. Runtime validation, watch

26+:: provenance and effect execution are not implemented.

27++$ agent-path (list.core @ta)

28++$ ask |$ [M]

29+ [%pure value=M]

30+ [%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])]

31+ [%store module=@t name=@tas receive=$-([state=(unit.core *) fact=*] [state=* message=M])]

jibb-dev/lib/jibb/prelude.jibb+139−55

@@ -1,4 +1,9 @@

1+/= internal /lib/jibb/internal

2++$ poke poke.internal

3++$ qath qath.internal

15:: Initial prelude functions. The rest of the inventory is still to come.

27++ same |= x=A x

49++ head |= p=[A B]

@@ -96,6 +101,14 @@

96101

97102+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

98103

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+

99112++ wonk |= veq=(like A)

100113 ?- q.veq

101114 ~ !!

@@ -140,9 +153,16 @@

140153 (reverse-into xs ~)

141154

142155++ drop |= maybe=(unit A)

143− ?- maybe

144− ~ ~

145− [~ value] [value ~]

156+ ^- (list A)

157+ ?- maybe

158+ ~ ~

159+ [~ value] [value ~]

160+

161+++ bond |= fallback=$-(~ A)

162+ |= maybe=(unit A)

163+ ?- maybe

164+ ~ (fallback ~)

165+ [~ value] value

146166

147167++ bind |= args=[(unit A) $-(A B)]

148168 ?- args

@@ -170,7 +190,7 @@

170190

171191++ clap |= args=[(unit A) (unit A) $-([A A] A)]

172192 ?- args

173− [first second combine]

193+ [first second combine] ^- (unit A)

174194 ?- first

175195 ~ second

176196 [~ a]

@@ -180,7 +200,7 @@

180200

181201++ clef |= args=[(unit A) (unit B) $-([A B] (unit C))]

182202 ?- args

183− [first second combine]

203+ [first second combine] ^- (unit C)

184204 ?- first

185205 ~ ~

186206 [~ a]

@@ -190,43 +210,45 @@

190210

191211++ skim |= args=[(list A) $-(A ?)]

192212 ?- args

193− [xs predicate]

194− ?- xs

195− ~ ~

196− [item rest]

197− ?- (predicate item)

198− %.y [item (skim rest predicate)]

199− %.n (skim rest predicate)

213+ [xs predicate] ^- (list A)

214+ ?- xs

215+ ~ ~

216+ [item rest]

217+ ?- (predicate item)

218+ %.y [item (skim rest predicate)]

219+ %.n (skim rest predicate)

200220

201221++ skip |= args=[(list A) $-(A ?)]

202222 ?- args

203− [xs predicate]

204− ?- xs

205− ~ ~

206− [item rest]

207− ?- (predicate item)

208− %.y (skip rest predicate)

209− %.n [item (skip rest 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)]

210230

211231++ levy |= args=[(list A) $-(A ?)]

212− ?- args

213− [xs predicate]

214− ?- xs

215− ~ %.y

216− [item rest]

217− ?- (predicate item)

218− %.y (levy rest predicate)

219− %.n %.n

232+ ^- ?

233+ ?- args

234+ [xs predicate]

235+ ?- xs

236+ ~ %.y

237+ [item rest]

238+ ?- (predicate item)

239+ %.y (levy rest predicate)

240+ %.n %.n

220241

221242++ lien |= args=[(list A) $-(A ?)]

222− ?- args

223− [xs predicate]

224− ?- xs

225− ~ %.n

226− [item rest]

227− ?- (predicate item)

228− %.y %.y

229− %.n (lien rest predicate)

243+ ^- ?

244+ ?- args

245+ [xs predicate]

246+ ?- xs

247+ ~ %.n

248+ [item rest]

249+ ?- (predicate item)

250+ %.y %.y

251+ %.n (lien rest predicate)

230252

231253++ roll |= args=[(list A) B $-([A B] B)]

232254 ?- args

@@ -251,31 +273,32 @@

251273

252274++ murn |= args=[(list A) $-(A (unit B))]

253275 ?- args

254− [xs f]

255− ?- xs

256− ~ ~

257− [item rest]

258− ?- (f item)

259− ~ (murn rest f)

260− [~ value] [value (murn rest f)]

276+ [xs f] ^- (list B)

277+ ?- xs

278+ ~ ~

279+ [item rest]

280+ ?- (f item)

281+ ~ (murn rest f)

282+ [~ value] [value (murn rest f)]

261283

262284++ join |= args=[A (list A)]

263285 ?- args

264− [separator xs]

265− ?- xs

266− ~ ~

267− [item rest]

268− ?- rest

269− ~ [item ~]

270− [next more] [item [separator (join separator rest)]]

286+ [separator xs] ^- (list A)

287+ ?- xs

288+ ~ ~

289+ [item rest]

290+ ?- rest

291+ ~ [item ~]

292+ [next more] [item [separator (join separator rest)]]

271293

272294++ snip |= xs=(list A)

273− ?- xs

274− ~ ~

275− [item rest]

276− ?- rest

277− ~ ~

278− [next more] [item (snip rest)]

295+ ^- (list A)

296+ ?- xs

297+ ~ ~

298+ [item rest]

299+ ?- rest

300+ ~ ~

301+ [next more] [item (snip rest)]

279302

280303++ rear |= xs=(list A)

281304 ?- xs

@@ -284,3 +307,64 @@

284307 ?- rest

285308 ~ item

286309 [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))

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/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/source.jibb+1−1

@@ -10,5 +10,5 @@

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

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

1212 [t %draft] t

13− [t %sent at] t

13+ [t %sent sent-at] t

1414 %stop "stop"

tests/golden/doc-grammar-04-step/tokens.txt+2−2

@@ -74,8 +74,8 @@

747413:5 glyph [

757513:6 tight name t

767613:8 lit %sent

77−13:14 name at

78−13:16 tight glyph ]

77+13:14 name sent-at

78+13:21 tight glyph ]

797913:23 name t

808014:5 NEWLINE

818114:5 lit %stop

tests/golden/doc-grammar-04-step/tree.txt+1−1

@@ -33,6 +33,6 @@

3333 (cell 12:5 (bind 12:6 t) (lit 12:8 %draft))

3434 (wing 12:23 t))

3535 (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))

3737 (wing 13:23 t))

3838 (arm 14:5 (lit 14:5 %stop) (str 14:23 "stop")))))))

tests/golden/doc-grammar-06-cart-store/about.txt+1−1

@@ -1,4 +1,4 @@

11source: Grammar tab, section "Example: a store and an island", code block 6 of the tab (block 5 is the EBNF)

22tests: 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))`

33expect: parses

4−expect-types: a partial inference report

4+expect-types: a partial inference report; store kind and declaration scope remain unresolved

tests/golden/doc-grammar-06-cart-store/types.txt+1−6

@@ -1,7 +1,2 @@

11partial inference; module not checked

2−+$ state: not checked

3−+$ cart-action: cases proven disjoint; mold not checked

4−+$ poke: not checked

5−++ main: name is not available to partial inference

6−++ init: [items=(list @t) open=?]

7−++ update: $-([a=cart-action s=[items=(list @t) open=?]] [items=(list @t) open=?])

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."

2−tests: the opaque molds by name

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 effect and application-path types by name

33expect: parses

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+8

@@ -96,6 +96,14 @@

9696

9797+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

9898

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+

99107++ wonk |= veq=(like A)

100108 ?- q.veq

101109 ~ !!

tests/golden/prelude-1c-structural/tokens.txt+199−124

@@ -588,144 +588,219 @@

58858897:45 tight glyph ]

58958999:1 NEWLINE

59059099:1 glyph ++

591−99:4 name wonk

591+99:4 name like

59259299:9 glyph |=

593−99:12 name veq

594−99:15 tight glyph =

595−99:16 tight glyph (

596−99:17 tight name like

597−99:22 tvar A

598−99:23 tight 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 ]

599607100:3 INDENT

600−100:3 glyph ?-

601−100:6 wing q.veq

608+100:3 glyph ++

609+100:6 name mapped

602610101:5 INDENT

603−101:5 lit ~

604−101:7 glyph !!

605−102:5 NEWLINE

606−102:5 glyph [

607−102:6 tight lit ~

608−102:8 name product

609−102:15 tight glyph ]

610−102:17 wing p.product

611−104:1 DEDENT

612−104:1 DEDENT

613−104:1 NEWLINE

614−104:1 glyph +$

615−104:4 name lone

616−104:9 glyph |$

617−104:12 glyph [

618−104:13 tight tvar A

619−104:14 tight glyph ]

620−104:16 glyph [

621−104:17 tight name p

622−104:18 tight glyph =

623−104:19 tight tvar A

624−104:20 tight glyph ]

625−106:1 NEWLINE

626−106:1 glyph +$

627−106:4 name lest

628−106:9 glyph |$

629−106:12 glyph [

630−106:13 tight tvar A

631−106:14 tight glyph ]

632−106:16 glyph [

633−106:17 tight name i

634−106:18 tight glyph =

635−106:19 tight tvar A

636−106:21 name t

637−106:22 tight glyph =

638−106:23 tight glyph (

639−106:24 tight name list

640−106:29 tvar A

641−106:30 tight glyph )

642−106:31 tight glyph ]

643−108:1 NEWLINE

644−108:1 glyph +$

645−108:4 name pole

646−108:9 glyph |$

647−108:12 glyph [

648−108:13 tight tvar A

649−108:14 tight glyph ]

650−109:3 INDENT

651−109:3 lit ~

652−110:3 NEWLINE

653−110:3 glyph [

654−110:4 tight tvar A

655−110:6 glyph (

656−110:7 tight name pole

657−110:12 tvar A

658−110:13 tight glyph )

659−110:14 tight glyph ]

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

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

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

684+110:15 tight glyph ]

685+110:17 wing p.product

686+112:1 DEDENT

660687112:1 DEDENT

661688112:1 NEWLINE

662689112:1 glyph +$

663−112:4 name quip

690+112:4 name lone

664691112:9 glyph |$

665692112:12 glyph [

666693112:13 tight tvar A

667−112:15 tvar B

668−112:16 tight glyph ]

669−112:18 glyph [

670−112:19 tight glyph (

671−112:20 tight name list

672−112:25 tvar A

673−112:26 tight glyph )

674−112:28 tvar B

675−112:29 tight glyph ]

694+112:14 tight glyph ]

695+112:16 glyph [

696+112:17 tight name p

697+112:18 tight glyph =

698+112:19 tight tvar A

699+112:20 tight glyph ]

676700114:1 NEWLINE

677701114:1 glyph +$

678−114:4 name tree

702+114:4 name lest

679703114:9 glyph |$

680704114:12 glyph [

681705114:13 tight tvar A

682706114:14 tight glyph ]

683−115:3 INDENT

684−115:3 lit ~

685−116:3 NEWLINE

686−116:3 glyph [

687−116:4 tight name n

688−116:5 tight glyph =

689−116:6 tight tvar A

690−116:8 name l

691−116:9 tight glyph =

692−116:10 tight glyph (

693−116:11 tight name tree

694−116:16 tvar A

695−116:17 tight glyph )

696−116:19 name r

697−116:20 tight glyph =

698−116:21 tight glyph (

699−116:22 tight name tree

700−116:27 tvar A

701−116:28 tight glyph )

702−116:29 tight glyph ]

703−118:1 DEDENT

704−118:1 NEWLINE

705−118:1 glyph +$

706−118:4 name each

707−118:9 glyph |$

708−118:12 glyph [

709−118:13 tight tvar A

710−118:15 tvar B

711−118:16 tight glyph ]

712−119:3 INDENT

713−119:3 glyph [

714−119:4 tight lit %|

715−119:7 name p

716−119:8 tight glyph =

717−119:9 tight tvar B

718−119:10 tight glyph ]

719−120:3 NEWLINE

720−120:3 glyph [

721−120:4 tight lit %&

722−120:7 name p

723−120:8 tight glyph =

724−120:9 tight tvar A

725−120:10 tight glyph ]

726−122:1 DEDENT

707+114:16 glyph [

708+114:17 tight name i

709+114:18 tight glyph =

710+114:19 tight tvar A

711+114:21 name t

712+114:22 tight glyph =

713+114:23 tight glyph (

714+114:24 tight name list

715+114:29 tvar A

716+114:30 tight glyph )

717+114:31 tight glyph ]

718+116:1 NEWLINE

719+116:1 glyph +$

720+116:4 name pole

721+116:9 glyph |$

722+116:12 glyph [

723+116:13 tight tvar A

724+116:14 tight glyph ]

725+117:3 INDENT

726+117:3 lit ~

727+118:3 NEWLINE

728+118:3 glyph [

729+118:4 tight tvar A

730+118:6 glyph (

731+118:7 tight name pole

732+118:12 tvar A

733+118:13 tight glyph )

734+118:14 tight glyph ]

735+120:1 DEDENT

736+120:1 NEWLINE

737+120:1 glyph +$

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 ]

727751122:1 NEWLINE

728752122:1 glyph +$

729−122:4 name bloq

730−122:9 aura @

731−122:10 NEWLINE

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+130:10 NEWLINE

tests/golden/prelude-1c-structural/tree.txt+82−50

@@ -235,56 +235,88 @@

235235 (cell 97:32

236236 (face 97:33 p (tvar 97:35 A))

237237 (face 97:37 q (ref 97:39 nail))))))))

238− (value 99:1 wonk

238+ (value 99:1 like

239239 (gate 99:9

240− (face 99:12 veq

241− (apply 99:16 like (tvar 99:22 A)))

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))))

242245 (body 100:3

243− (branch 100:3

244− (wing 100:6 q.veq)

245− (arm 101:5 (lit 101:5 ~) (crash 101:7))

246− (arm 102:5

247− (cell 102:5 (lit 102:6 ~) (bind 102:8 product))

248− (wing 102:17 p.product))))))

249− (mold 104:1 lone

250− (generic 104:9 A

251− (cell 104:16

252− (face 104:17 p (tvar 104:19 A)))))

253− (mold 106:1 lest

254− (generic 106:9 A

255− (cell 106:16

256− (face 106:17 i (tvar 106:19 A))

257− (face 106:21 t

258− (apply 106:23 list (tvar 106:29 A))))))

259− (mold 108:1 pole

260− (generic 108:9 A

261− (union 109:3

262− (const 109:3 ~)

263− (cell 110:3

264− (tvar 110:4 A)

265− (apply 110:6 pole (tvar 110:12 A))))))

266− (mold 112:1 quip

267− (generic 112:9 A B

268− (cell 112:18

269− (apply 112:19 list (tvar 112:25 A))

270− (tvar 112:28 B))))

271− (mold 114:1 tree

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

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

282+ (generic 112:9 A

283+ (cell 112:16

284+ (face 112:17 p (tvar 112:19 A)))))

285+ (mold 114:1 lest

272286 (generic 114:9 A

273− (union 115:3

274− (const 115:3 ~)

275− (cell 116:3

276− (face 116:4 n (tvar 116:6 A))

277− (face 116:8 l

278− (apply 116:10 tree (tvar 116:16 A)))

279− (face 116:19 r

280− (apply 116:21 tree (tvar 116:27 A)))))))

281− (mold 118:1 each

282− (generic 118:9 A B

283− (union 119:3

284− (cell 119:3

285− (const 119:4 %|)

286− (face 119:7 p (tvar 119:9 B)))

287− (cell 120:3

288− (const 120:4 %&)

289− (face 120:7 p (tvar 120:9 A))))))

290− (mold 122:1 bloq (aura 122:9 @)))

287+ (cell 114:16

288+ (face 114:17 i (tvar 114:19 A))

289+ (face 114:21 t

290+ (apply 114:23 list (tvar 114:29 A))))))

291+ (mold 116:1 pole

292+ (generic 116:9 A

293+ (union 117:3

294+ (const 117: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

317+ (const 127:4 %|)

318+ (face 127:7 p (tvar 127:9 B)))

319+ (cell 128:3

320+ (const 128:4 %&)

321+ (face 128:7 p (tvar 128:9 A))))))

322+ (mold 130:1 bloq (aura 130:9 @)))

tests/golden/prelude-1c-structural/types.txt+1

@@ -27,6 +27,7 @@ partial inference; module not checked

2727+$ spot: not checked

2828+$ toon: cases proven disjoint; mold not checked

2929+$ like: not checked

30+++ like: sample mold is not supported by partial inference

3031++ wonk: sample mold is not supported by partial inference

3132+$ lone: not checked

3233+$ lest: 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`.

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`.

1+source: Overview, Prelude: Hoon 3g includes `like` and `wonk`; the value `like` maps an existing result.

2+tests: The source includes the generic `like` mold, its mapping gate and `wonk`.

33expect: 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+8

@@ -96,6 +96,14 @@

9696

9797+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

9898

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+

99107++ wonk |= veq=(like A)

100108 ?- q.veq

101109 ~ !!

tests/golden/prelude-3g-like/tokens.txt+95−20

@@ -588,26 +588,101 @@

58858897:45 tight glyph ]

58958999:1 NEWLINE

59059099:1 glyph ++

591−99:4 name wonk

591+99:4 name like

59259299:9 glyph |=

593−99:12 name veq

594−99:15 tight glyph =

595−99:16 tight glyph (

596−99:17 tight name like

597−99:22 tvar A

598−99:23 tight 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 ]

599607100:3 INDENT

600−100:3 glyph ?-

601−100:6 wing q.veq

608+100:3 glyph ++

609+100:6 name mapped

602610101:5 INDENT

603−101:5 lit ~

604−101:7 glyph !!

605−102:5 NEWLINE

606−102:5 glyph [

607−102:6 tight lit ~

608−102:8 name product

609−102:15 tight glyph ]

610−102:17 wing p.product

611−102:26 DEDENT

612−102:26 DEDENT

613−102:26 NEWLINE

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

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

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

684+110:15 tight glyph ]

685+110:17 wing p.product

686+110:26 DEDENT

687+110:26 DEDENT

688+110:26 NEWLINE

tests/golden/prelude-3g-like/tree.txt+41−9

@@ -235,14 +235,46 @@

235235 (cell 97:32

236236 (face 97:33 p (tvar 97:35 A))

237237 (face 97:37 q (ref 97:39 nail))))))))

238− (value 99:1 wonk

238+ (value 99:1 like

239239 (gate 99:9

240− (face 99:12 veq

241− (apply 99:16 like (tvar 99:22 A)))

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))))

242245 (body 100:3

243− (branch 100:3

244− (wing 100:6 q.veq)

245− (arm 101:5 (lit 101:5 ~) (crash 101:7))

246− (arm 102:5

247− (cell 102:5 (lit 102:6 ~) (bind 102:8 product))

248− (wing 102:17 p.product)))))))

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

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)))))))

tests/golden/prelude-3g-like/types.txt+1

@@ -27,4 +27,5 @@ partial inference; module not checked

2727+$ spot: not checked

2828+$ toon: cases proven disjoint; mold not checked

2929+$ like: not checked

30+++ like: sample mold is not supported by partial inference

3031++ wonk: sample mold is not supported by partial inference

tests/golden/prelude-list-helpers/source.jibb+8

@@ -96,6 +96,14 @@

9696

9797+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

9898

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+

99107++ wonk |= veq=(like A)

100108 ?- q.veq

101109 ~ !!

tests/golden/prelude-list-helpers/tokens.txt+319−244

@@ -588,266 +588,341 @@

58858897:45 tight glyph ]

58958999:1 NEWLINE

59059099:1 glyph ++

591−99:4 name wonk

591+99:4 name like

59259299:9 glyph |=

593−99:12 name veq

594−99:15 tight glyph =

595−99:16 tight glyph (

596−99:17 tight name like

597−99:22 tvar A

598−99:23 tight 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 ]

599607100:3 INDENT

600−100:3 glyph ?-

601−100:6 wing q.veq

608+100:3 glyph ++

609+100:6 name mapped

602610101:5 INDENT

603−101:5 lit ~

604−101:7 glyph !!

605−102:5 NEWLINE

606−102:5 glyph [

607−102:6 tight lit ~

608−102:8 name product

609−102:15 tight glyph ]

610−102:17 wing p.product

611−104:1 DEDENT

612−104:1 DEDENT

613−104:1 NEWLINE

614−104:1 glyph +$

615−104:4 name lone

616−104:9 glyph |$

617−104:12 glyph [

618−104:13 tight tvar A

619−104:14 tight glyph ]

620−104:16 glyph [

621−104:17 tight name p

622−104:18 tight glyph =

623−104:19 tight tvar A

624−104:20 tight glyph ]

625−106:1 NEWLINE

626−106:1 glyph +$

627−106:4 name lest

628−106:9 glyph |$

629−106:12 glyph [

630−106:13 tight tvar A

631−106:14 tight glyph ]

632−106:16 glyph [

633−106:17 tight name i

634−106:18 tight glyph =

635−106:19 tight tvar A

636−106:21 name t

637−106:22 tight glyph =

638−106:23 tight glyph (

639−106:24 tight name list

640−106:29 tvar A

641−106:30 tight glyph )

642−106:31 tight glyph ]

643−108:1 NEWLINE

644−108:1 glyph +$

645−108:4 name pole

646−108:9 glyph |$

647−108:12 glyph [

648−108:13 tight tvar A

649−108:14 tight glyph ]

650−109:3 INDENT

651−109:3 lit ~

652−110:3 NEWLINE

653−110:3 glyph [

654−110:4 tight tvar A

655−110:6 glyph (

656−110:7 tight name pole

657−110:12 tvar A

658−110:13 tight glyph )

659−110:14 tight glyph ]

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

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

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

684+110:15 tight glyph ]

685+110:17 wing p.product

686+112:1 DEDENT

660687112:1 DEDENT

661688112:1 NEWLINE

662689112:1 glyph +$

663−112:4 name quip

690+112:4 name lone

664691112:9 glyph |$

665692112:12 glyph [

666693112:13 tight tvar A

667−112:15 tvar B

668−112:16 tight glyph ]

669−112:18 glyph [

670−112:19 tight glyph (

671−112:20 tight name list

672−112:25 tvar A

673−112:26 tight glyph )

674−112:28 tvar B

675−112:29 tight glyph ]

694+112:14 tight glyph ]

695+112:16 glyph [

696+112:17 tight name p

697+112:18 tight glyph =

698+112:19 tight tvar A

699+112:20 tight glyph ]

676700114:1 NEWLINE

677701114:1 glyph +$

678−114:4 name tree

702+114:4 name lest

679703114:9 glyph |$

680704114:12 glyph [

681705114:13 tight tvar A

682706114:14 tight glyph ]

683−115:3 INDENT

684−115:3 lit ~

685−116:3 NEWLINE

686−116:3 glyph [

687−116:4 tight name n

688−116:5 tight glyph =

689−116:6 tight tvar A

690−116:8 name l

691−116:9 tight glyph =

692−116:10 tight glyph (

693−116:11 tight name tree

694−116:16 tvar A

695−116:17 tight glyph )

696−116:19 name r

697−116:20 tight glyph =

698−116:21 tight glyph (

699−116:22 tight name tree

700−116:27 tvar A

701−116:28 tight glyph )

702−116:29 tight glyph ]

703−118:1 DEDENT

704−118:1 NEWLINE

705−118:1 glyph +$

706−118:4 name each

707−118:9 glyph |$

708−118:12 glyph [

709−118:13 tight tvar A

710−118:15 tvar B

711−118:16 tight glyph ]

712−119:3 INDENT

713−119:3 glyph [

714−119:4 tight lit %|

715−119:7 name p

716−119:8 tight glyph =

717−119:9 tight tvar B

718−119:10 tight glyph ]

719−120:3 NEWLINE

720−120:3 glyph [

721−120:4 tight lit %&

722−120:7 name p

723−120:8 tight glyph =

724−120:9 tight tvar A

725−120:10 tight glyph ]

726−122:1 DEDENT

707+114:16 glyph [

708+114:17 tight name i

709+114:18 tight glyph =

710+114:19 tight tvar A

711+114:21 name t

712+114:22 tight glyph =

713+114:23 tight glyph (

714+114:24 tight name list

715+114:29 tvar A

716+114:30 tight glyph )

717+114:31 tight glyph ]

718+116:1 NEWLINE

719+116:1 glyph +$

720+116:4 name pole

721+116:9 glyph |$

722+116:12 glyph [

723+116:13 tight tvar A

724+116:14 tight glyph ]

725+117:3 INDENT

726+117:3 lit ~

727+118:3 NEWLINE

728+118:3 glyph [

729+118:4 tight tvar A

730+118:6 glyph (

731+118:7 tight name pole

732+118:12 tvar A

733+118:13 tight glyph )

734+118:14 tight glyph ]

735+120:1 DEDENT

736+120:1 NEWLINE

737+120:1 glyph +$

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 ]

727751122:1 NEWLINE

728752122:1 glyph +$

729−122:4 name bloq

730−122:9 aura @

731−124:1 NEWLINE

732−124:1 glyph ++

733−124:4 name some

734−124:9 glyph |=

735−124:12 name item

736−124:16 tight glyph =

737−124:17 tight tvar A

738−124:19 glyph `

739−124:20 tight name item

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

740779126:1 NEWLINE

741−126:1 glyph ++

742−126:4 name lure

743−126:9 glyph |=

744−126:12 name item

745−126:16 tight glyph =

746−126:17 tight tvar A

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 ]

747787127:3 INDENT

748−127:3 glyph ^-

749−127:6 glyph (

750−127:7 tight name list

751−127:12 tvar A

752−127:13 tight glyph )

753−127:15 glyph [

754−127:16 tight name item

755−127:21 lit ~

756−127:22 tight glyph ]

757−129:1 DEDENT

758−129:1 NEWLINE

759−129:1 glyph ++

760−129:4 name snoc

761−129:9 glyph |=

762−129:12 name args

763−129:16 tight glyph =

764−129:17 tight glyph [

765−129:18 tight glyph (

766−129:19 tight name list

767−129:24 tvar A

768−129:25 tight glyph )

769−129:27 tvar A

770−129:28 tight glyph ]

771−130:3 INDENT

772−130:3 glyph ?-

773−130:6 name args

774−131:5 INDENT

775−131:5 glyph [

776−131:6 tight name xs

777−131:9 name item

778−131:13 tight glyph ]

779−131:15 glyph (

780−131:16 tight name weld

781−131:21 name xs

782−131:24 glyph [

783−131:25 tight name item

784−131:30 lit ~

785−131:31 tight glyph ]

786−131:32 tight glyph )

787−133:1 DEDENT

788−133:1 DEDENT

789−133:1 NEWLINE

790−133:1 glyph ++

791−133:4 name flop

792−133:9 glyph |=

793−133:12 name xs

794−133:14 tight glyph =

795−133:15 tight glyph (

796−133:16 tight name list

797−133:21 tvar A

798−133:22 tight glyph )

799−134:3 INDENT

800−134:3 glyph ++

801−134:6 name reverse-into

802−134:19 glyph |=

803−134:22 name args

804−134:26 tight glyph =

805−134:27 tight glyph [

806−134:28 tight glyph (

807−134:29 tight name list

808−134:34 tvar A

809−134:35 tight glyph )

810−134:37 glyph (

811−134:38 tight name list

812−134:43 tvar A

813−134:44 tight glyph )

814−134:45 tight glyph ]

815−135:5 INDENT

816−135:5 glyph ?-

817−135:8 name args

818−136:7 INDENT

819−136:7 glyph [

820−136:8 tight name rest

821−136:13 name acc

822−136:16 tight glyph ]

823−137:9 INDENT

824−137:9 glyph ?-

825−137:12 name rest

826−138:11 INDENT

827−138:11 lit ~

828−138:13 name acc

829−139:11 NEWLINE

830−139:11 glyph [

831−139:12 tight name item

832−139:17 name more

833−139:21 tight glyph ]

834−139:23 glyph (

835−139:24 tight name reverse-into

836−139:37 name more

837−139:42 glyph [

838−139:43 tight name item

839−139:48 name acc

840−139:51 tight glyph ]

841−139:52 tight glyph )

842−140:3 DEDENT

843−140:3 DEDENT

844−140:3 DEDENT

845−140:3 DEDENT

846−140:3 NEWLINE

847−140:3 glyph (

848−140:4 tight name reverse-into

849−140:17 name xs

850−140:20 lit ~

851−140:21 tight glyph )

852−140:22 DEDENT

853−140:22 NEWLINE

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 ++

808+132:4 name some

809+132:9 glyph |=

810+132:12 name item

811+132:16 tight glyph =

812+132:17 tight tvar A

813+132:19 glyph `

814+132:20 tight name item

815+134:1 NEWLINE

816+134:1 glyph ++

817+134:4 name lure

818+134:9 glyph |=

819+134:12 name item

820+134:16 tight glyph =

821+134:17 tight tvar A

822+135:3 INDENT

823+135:3 glyph ^-

824+135:6 glyph (

825+135:7 tight name list

826+135:12 tvar A

827+135:13 tight glyph )

828+135:15 glyph [

829+135:16 tight name item

830+135:21 lit ~

831+135:22 tight glyph ]

832+137:1 DEDENT

833+137:1 NEWLINE

834+137:1 glyph ++

835+137:4 name snoc

836+137:9 glyph |=

837+137:12 name args

838+137:16 tight glyph =

839+137:17 tight glyph [

840+137:18 tight glyph (

841+137:19 tight name list

842+137:24 tvar A

843+137:25 tight glyph )

844+137:27 tvar A

845+137:28 tight glyph ]

846+138:3 INDENT

847+138:3 glyph ?-

848+138:6 name args

849+139:5 INDENT

850+139:5 glyph [

851+139:6 tight name xs

852+139:9 name item

853+139:13 tight glyph ]

854+139:15 glyph (

855+139:16 tight name weld

856+139:21 name xs

857+139:24 glyph [

858+139:25 tight name item

859+139:30 lit ~

860+139:31 tight glyph ]

861+139:32 tight glyph )

862+141:1 DEDENT

863+141:1 DEDENT

864+141:1 NEWLINE

865+141:1 glyph ++

866+141:4 name flop

867+141:9 glyph |=

868+141:12 name xs

869+141:14 tight glyph =

870+141:15 tight glyph (

871+141:16 tight name list

872+141:21 tvar A

873+141:22 tight glyph )

874+142:3 INDENT

875+142:3 glyph ++

876+142:6 name reverse-into

877+142:19 glyph |=

878+142:22 name args

879+142:26 tight glyph =

880+142:27 tight glyph [

881+142:28 tight glyph (

882+142:29 tight name list

883+142:34 tvar A

884+142:35 tight glyph )

885+142:37 glyph (

886+142:38 tight name list

887+142:43 tvar A

888+142:44 tight glyph )

889+142:45 tight glyph ]

890+143:5 INDENT

891+143:5 glyph ?-

892+143:8 name args

893+144:7 INDENT

894+144:7 glyph [

895+144:8 tight name rest

896+144:13 name acc

897+144:16 tight glyph ]

898+145:9 INDENT

899+145:9 glyph ?-

900+145:12 name rest

901+146:11 INDENT

902+146:11 lit ~

903+146:13 name acc

904+147:11 NEWLINE

905+147:11 glyph [

906+147:12 tight name item

907+147:17 name more

908+147:21 tight glyph ]

909+147:23 glyph (

910+147:24 tight name reverse-into

911+147:37 name more

912+147:42 glyph [

913+147:43 tight name item

914+147:48 name acc

915+147:51 tight glyph ]

916+147:52 tight glyph )

917+148:3 DEDENT

918+148:3 DEDENT

919+148:3 DEDENT

920+148:3 DEDENT

921+148:3 NEWLINE

922+148:3 glyph (

923+148:4 tight name reverse-into

924+148:17 name xs

925+148:20 lit ~

926+148:21 tight glyph )

927+148:22 DEDENT

928+148:22 NEWLINE

tests/golden/prelude-list-helpers/tree.txt+138−106

@@ -235,112 +235,144 @@

235235 (cell 97:32

236236 (face 97:33 p (tvar 97:35 A))

237237 (face 97:37 q (ref 97:39 nail))))))))

238− (value 99:1 wonk

238+ (value 99:1 like

239239 (gate 99:9

240− (face 99:12 veq

241− (apply 99:16 like (tvar 99:22 A)))

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))))

242245 (body 100:3

243− (branch 100:3

244− (wing 100:6 q.veq)

245− (arm 101:5 (lit 101:5 ~) (crash 101:7))

246− (arm 102:5

247− (cell 102:5 (lit 102:6 ~) (bind 102:8 product))

248− (wing 102:17 p.product))))))

249− (mold 104:1 lone

250− (generic 104:9 A

251− (cell 104:16

252− (face 104:17 p (tvar 104:19 A)))))

253− (mold 106:1 lest

254− (generic 106:9 A

255− (cell 106:16

256− (face 106:17 i (tvar 106:19 A))

257− (face 106:21 t

258− (apply 106:23 list (tvar 106:29 A))))))

259− (mold 108:1 pole

260− (generic 108:9 A

261− (union 109:3

262− (const 109:3 ~)

263− (cell 110:3

264− (tvar 110:4 A)

265− (apply 110:6 pole (tvar 110:12 A))))))

266− (mold 112:1 quip

267− (generic 112:9 A B

268− (cell 112:18

269− (apply 112:19 list (tvar 112:25 A))

270− (tvar 112:28 B))))

271− (mold 114:1 tree

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

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

282+ (generic 112:9 A

283+ (cell 112:16

284+ (face 112:17 p (tvar 112:19 A)))))

285+ (mold 114:1 lest

272286 (generic 114:9 A

273− (union 115:3

274− (const 115:3 ~)

275− (cell 116:3

276− (face 116:4 n (tvar 116:6 A))

277− (face 116:8 l

278− (apply 116:10 tree (tvar 116:16 A)))

279− (face 116:19 r

280− (apply 116:21 tree (tvar 116:27 A)))))))

281− (mold 118:1 each

282− (generic 118:9 A B

283− (union 119:3

284− (cell 119:3

285− (const 119:4 %|)

286− (face 119:7 p (tvar 119:9 B)))

287− (cell 120:3

288− (const 120:4 %&)

289− (face 120:7 p (tvar 120:9 A))))))

290− (mold 122:1 bloq (aura 122:9 @))

291− (value 124:1 some

292− (gate 124:9

293− (face 124:12 item (tvar 124:17 A))

294− (unit 124:19 (wing 124:20 item))))

295− (value 126:1 lure

296− (gate 126:9

297− (face 126:12 item (tvar 126:17 A))

298− (body 127:3

299− (cast 127:3

300− (apply 127:6 list (tvar 127:12 A))

301− (tuple 127:15 (wing 127:16 item) (lit 127:21 ~))))))

302− (value 129:1 snoc

303− (gate 129:9

304− (face 129:12 args

305− (cell 129:17

306− (apply 129:18 list (tvar 129:24 A))

307− (tvar 129:27 A)))

308− (body 130:3

309− (branch 130:3

310− (wing 130:6 args)

311− (arm 131:5

312− (cell 131:5 (bind 131:6 xs) (bind 131:9 item))

313− (group 131:15

314− (call 131:16

315− (wing 131:16 weld)

316− (wing 131:21 xs)

317− (tuple 131:24 (wing 131:25 item) (lit 131:30 ~)))))))))

318− (value 133:1 flop

319− (gate 133:9

320− (face 133:12 xs

321− (apply 133:15 list (tvar 133:21 A)))

322− (body 134:3

323− (value 134:3 reverse-into

324− (gate 134:19

325− (face 134:22 args

326− (cell 134:27

327− (apply 134:28 list (tvar 134:34 A))

328− (apply 134:37 list (tvar 134:43 A))))

329− (body 135:5

330− (branch 135:5

331− (wing 135:8 args)

332− (arm 136:7

333− (cell 136:7 (bind 136:8 rest) (bind 136:13 acc))

334− (body 137:9

335− (branch 137:9

336− (wing 137:12 rest)

337− (arm 138:11 (lit 138:11 ~) (wing 138:13 acc))

338− (arm 139:11

339− (cell 139:11 (bind 139:12 item) (bind 139:17 more))

340− (group 139:23

341− (call 139:24

342− (wing 139:24 reverse-into)

343− (wing 139:37 more)

344− (tuple 139:42 (wing 139:43 item) (wing 139:48 acc))))))))))))

345− (group 140:3

346− (call 140:4 (wing 140:4 reverse-into) (wing 140:17 xs) (lit 140:20 ~)))))))

287+ (cell 114:16

288+ (face 114:17 i (tvar 114:19 A))

289+ (face 114:21 t

290+ (apply 114:23 list (tvar 114:29 A))))))

291+ (mold 116:1 pole

292+ (generic 116:9 A

293+ (union 117:3

294+ (const 117: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

317+ (const 127:4 %|)

318+ (face 127:7 p (tvar 127:9 B)))

319+ (cell 128:3

320+ (const 128:4 %&)

321+ (face 128:7 p (tvar 128:9 A))))))

322+ (mold 130:1 bloq (aura 130:9 @))

323+ (value 132:1 some

324+ (gate 132:9

325+ (face 132:12 item (tvar 132:17 A))

326+ (unit 132:19 (wing 132:20 item))))

327+ (value 134:1 lure

328+ (gate 134:9

329+ (face 134:12 item (tvar 134:17 A))

330+ (body 135:3

331+ (cast 135:3

332+ (apply 135:6 list (tvar 135:12 A))

333+ (tuple 135:15 (wing 135:16 item) (lit 135:21 ~))))))

334+ (value 137:1 snoc

335+ (gate 137:9

336+ (face 137:12 args

337+ (cell 137:17

338+ (apply 137:18 list (tvar 137:24 A))

339+ (tvar 137:27 A)))

340+ (body 138:3

341+ (branch 138:3

342+ (wing 138:6 args)

343+ (arm 139:5

344+ (cell 139:5 (bind 139:6 xs) (bind 139:9 item))

345+ (group 139:15

346+ (call 139:16

347+ (wing 139:16 weld)

348+ (wing 139:21 xs)

349+ (tuple 139:24 (wing 139:25 item) (lit 139:30 ~)))))))))

350+ (value 141:1 flop

351+ (gate 141:9

352+ (face 141:12 xs

353+ (apply 141:15 list (tvar 141:21 A)))

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+1

@@ -27,6 +27,7 @@ partial inference; module not checked

2727+$ spot: not checked

2828+$ toon: cases proven disjoint; mold not checked

2929+$ like: not checked

30+++ like: sample mold is not supported by partial inference

3031++ wonk: sample mold is not supported by partial inference

3132+$ lone: not checked

3233+$ lest: not checked

tests/golden/prelude-unit-list-transforms/about.txt+1−1

@@ -1,4 +1,4 @@

11source: 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, 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.

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.

33expect: parses

44expect-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+108−55

@@ -1,4 +1,9 @@

1+/= internal /lib/jibb/internal

2++$ poke poke.internal

3++$ qath qath.internal

15:: Initial prelude functions. The rest of the inventory is still to come.

27++ same |= x=A x

49++ head |= p=[A B]

@@ -96,6 +101,14 @@

96101

97102+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

98103

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+

99112++ wonk |= veq=(like A)

100113 ?- q.veq

101114 ~ !!

@@ -140,9 +153,16 @@

140153 (reverse-into xs ~)

141154

142155++ drop |= maybe=(unit A)

143− ?- maybe

144− ~ ~

145− [~ value] [value ~]

156+ ^- (list A)

157+ ?- maybe

158+ ~ ~

159+ [~ value] [value ~]

160+

161+++ bond |= fallback=$-(~ A)

162+ |= maybe=(unit A)

163+ ?- maybe

164+ ~ (fallback ~)

165+ [~ value] value

146166

147167++ bind |= args=[(unit A) $-(A B)]

148168 ?- args

@@ -170,7 +190,7 @@

170190

171191++ clap |= args=[(unit A) (unit A) $-([A A] A)]

172192 ?- args

173− [first second combine]

193+ [first second combine] ^- (unit A)

174194 ?- first

175195 ~ second

176196 [~ a]

@@ -180,7 +200,7 @@

180200

181201++ clef |= args=[(unit A) (unit B) $-([A B] (unit C))]

182202 ?- args

183− [first second combine]

203+ [first second combine] ^- (unit C)

184204 ?- first

185205 ~ ~

186206 [~ a]

@@ -190,43 +210,45 @@

190210

191211++ skim |= args=[(list A) $-(A ?)]

192212 ?- args

193− [xs predicate]

194− ?- xs

195− ~ ~

196− [item rest]

197− ?- (predicate item)

198− %.y [item (skim rest predicate)]

199− %.n (skim rest predicate)

213+ [xs predicate] ^- (list A)

214+ ?- xs

215+ ~ ~

216+ [item rest]

217+ ?- (predicate item)

218+ %.y [item (skim rest predicate)]

219+ %.n (skim rest predicate)

200220

201221++ skip |= args=[(list A) $-(A ?)]

202222 ?- args

203− [xs predicate]

204− ?- xs

205− ~ ~

206− [item rest]

207− ?- (predicate item)

208− %.y (skip rest predicate)

209− %.n [item (skip rest 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)]

210230

211231++ levy |= args=[(list A) $-(A ?)]

212− ?- args

213− [xs predicate]

214− ?- xs

215− ~ %.y

216− [item rest]

217− ?- (predicate item)

218− %.y (levy rest predicate)

219− %.n %.n

232+ ^- ?

233+ ?- args

234+ [xs predicate]

235+ ?- xs

236+ ~ %.y

237+ [item rest]

238+ ?- (predicate item)

239+ %.y (levy rest predicate)

240+ %.n %.n

220241

221242++ lien |= args=[(list A) $-(A ?)]

222− ?- args

223− [xs predicate]

224− ?- xs

225− ~ %.n

226− [item rest]

227− ?- (predicate item)

228− %.y %.y

229− %.n (lien rest predicate)

243+ ^- ?

244+ ?- args

245+ [xs predicate]

246+ ?- xs

247+ ~ %.n

248+ [item rest]

249+ ?- (predicate item)

250+ %.y %.y

251+ %.n (lien rest predicate)

230252

231253++ roll |= args=[(list A) B $-([A B] B)]

232254 ?- args

@@ -251,31 +273,32 @@

251273

252274++ murn |= args=[(list A) $-(A (unit B))]

253275 ?- args

254− [xs f]

255− ?- xs

256− ~ ~

257− [item rest]

258− ?- (f item)

259− ~ (murn rest f)

260− [~ value] [value (murn rest f)]

276+ [xs f] ^- (list B)

277+ ?- xs

278+ ~ ~

279+ [item rest]

280+ ?- (f item)

281+ ~ (murn rest f)

282+ [~ value] [value (murn rest f)]

261283

262284++ join |= args=[A (list A)]

263285 ?- args

264− [separator xs]

265− ?- xs

266− ~ ~

267− [item rest]

268− ?- rest

269− ~ [item ~]

270− [next more] [item [separator (join separator rest)]]

286+ [separator xs] ^- (list A)

287+ ?- xs

288+ ~ ~

289+ [item rest]

290+ ?- rest

291+ ~ [item ~]

292+ [next more] [item [separator (join separator rest)]]

271293

272294++ snip |= xs=(list A)

273− ?- xs

274− ~ ~

275− [item rest]

276− ?- rest

277− ~ ~

278− [next more] [item (snip rest)]

295+ ^- (list A)

296+ ?- xs

297+ ~ ~

298+ [item rest]

299+ ?- rest

300+ ~ ~

301+ [next more] [item (snip rest)]

279302

280303++ rear |= xs=(list A)

281304 ?- xs

@@ -284,3 +307,33 @@

284307 ?- rest

285308 ~ item

286309 [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]

tests/golden/prelude-unit-list-transforms/tokens.txt+1994−1543

@@ -1,1116 +1,1120 @@

1−2:1 glyph ++

2−2:4 name same

3−2:9 glyph |=

4−2:12 name x

5−2:13 tight glyph =

6−2:14 tight tvar A

7−2:16 name x

8−4:1 NEWLINE

9−4:1 glyph ++

10−4:4 name head

11−4:9 glyph |=

12−4:12 name p

13−4:13 tight glyph =

14−4:14 tight glyph [

15−4:15 tight tvar A

16−4:17 tvar B

17−4:18 tight glyph ]

18−5:3 INDENT

19−5:3 glyph ?-

20−5:6 name p

21−6:5 INDENT

22−6:5 glyph [

23−6:6 tight name a

24−6:8 name b

25−6:9 tight glyph ]

26−6:11 name a

27−8:1 DEDENT

28−8:1 DEDENT

29−8:1 NEWLINE

30−8:1 glyph ++

31−8:4 name tail

32−8:9 glyph |=

33−8:12 name p

34−8:13 tight glyph =

35−8:14 tight glyph [

36−8:15 tight tvar A

37−8:17 tvar B

38−8:18 tight glyph ]

39−9:3 INDENT

40−9:3 glyph ?-

41−9:6 name p

42−10:5 INDENT

43−10:5 glyph [

44−10:6 tight name a

45−10:8 name b

46−10:9 tight glyph ]

47−10:11 name b

48−12:1 DEDENT

49−12:1 DEDENT

50−12:1 NEWLINE

51−12:1 glyph ++

52−12:4 name not

53−12:8 glyph |=

54−12:11 name b

55−12:12 tight glyph =

56−12:13 tight glyph ?

57−13:3 INDENT

58−13:3 glyph ?-

59−13:6 name b

60−14:5 INDENT

61−14:5 lit %.y

62−14:9 lit %.n

63−15:5 NEWLINE

64−15:5 lit %.n

65−15:9 lit %.y

1+1:1 glyph /=

2+1:4 name internal

3+1:13 glyph /

4+1:14 tight knot lib

5+1:17 tight glyph /

6+1:18 tight knot jibb

7+1:22 tight glyph /

8+1:23 tight knot internal

9+2:1 NEWLINE

10+2:1 glyph +$

11+2:4 name poke

12+2:9 wing poke.internal

13+3:1 NEWLINE

14+3:1 glyph +$

15+3:4 name qath

16+3:9 wing qath.internal

17+7:1 NEWLINE

18+7:1 glyph ++

19+7:4 name same

20+7:9 glyph |=

21+7:12 name x

22+7:13 tight glyph =

23+7:14 tight tvar A

24+7:16 name x

25+9:1 NEWLINE

26+9:1 glyph ++

27+9:4 name head

28+9:9 glyph |=

29+9:12 name p

30+9:13 tight glyph =

31+9:14 tight glyph [

32+9:15 tight tvar A

33+9:17 tvar B

34+9:18 tight glyph ]

35+10:3 INDENT

36+10:3 glyph ?-

37+10:6 name p

38+11:5 INDENT

39+11:5 glyph [

40+11:6 tight name a

41+11:8 name b

42+11:9 tight glyph ]

43+11:11 name a

44+13:1 DEDENT

45+13:1 DEDENT

46+13:1 NEWLINE

47+13:1 glyph ++

48+13:4 name tail

49+13:9 glyph |=

50+13:12 name p

51+13:13 tight glyph =

52+13:14 tight glyph [

53+13:15 tight tvar A

54+13:17 tvar B

55+13:18 tight glyph ]

56+14:3 INDENT

57+14:3 glyph ?-

58+14:6 name p

59+15:5 INDENT

60+15:5 glyph [

61+15:6 tight name a

62+15:8 name b

63+15:9 tight glyph ]

64+15:11 name b

666517:1 DEDENT

676617:1 DEDENT

686717:1 NEWLINE

69−17:1 glyph +$

70−17:4 name list

71−17:9 glyph |$

72−17:12 glyph [

73−17:13 tight tvar A

74−17:14 tight glyph ]

68+17:1 glyph ++

69+17:4 name not

70+17:8 glyph |=

71+17:11 name b

72+17:12 tight glyph =

73+17:13 tight glyph ?

757418:3 INDENT

76−18:3 lit ~

77−19:3 NEWLINE

78−19:3 glyph [

79−19:4 tight name i

80−19:5 tight glyph =

81−19:6 tight tvar A

82−19:8 name t

83−19:9 tight glyph =

84−19:10 tight glyph (

85−19:11 tight name list

86−19:16 tvar A

87−19:17 tight glyph )

88−19:18 tight glyph ]

89−21:1 DEDENT

90−21:1 NEWLINE

91−21:1 glyph +$

92−21:4 name unit

93−21:9 glyph |$

94−21:12 glyph [

95−21:13 tight tvar A

96−21:14 tight glyph ]

97−22:3 INDENT

98−22:3 lit ~

99−23:3 NEWLINE

100−23:3 glyph [

101−23:4 tight lit ~

102−23:6 name u

103−23:7 tight glyph =

104−23:8 tight tvar A

105−23:9 tight glyph ]

106−25:1 DEDENT

107−25:1 NEWLINE

108−25:1 glyph ++

109−25:4 name fall

110−25:9 glyph |=

111−25:12 name args

112−25:16 tight glyph =

113−25:17 tight glyph [

114−25:18 tight glyph (

115−25:19 tight name unit

116−25:24 tvar A

117−25:25 tight glyph )

118−25:27 tvar A

119−25:28 tight glyph ]

120−26:3 INDENT

121−26:3 glyph ?-

122−26:6 name args

123−27:5 INDENT

124−27:5 glyph [

125−27:6 tight name maybe

126−27:12 name fallback

127−27:20 tight glyph ]

128−28:7 INDENT

129−28:7 glyph ?-

130−28:10 name maybe

131−29:9 INDENT

132−29:9 lit ~

133−29:11 name fallback

134−30:9 NEWLINE

135−30:9 glyph [

136−30:10 tight lit ~

137−30:12 name value

138−30:17 tight glyph ]

139−30:19 name value

140−32:1 DEDENT

141−32:1 DEDENT

142−32:1 DEDENT

143−32:1 DEDENT

144−32:1 NEWLINE

145−32:1 glyph ++

146−32:4 name need

147−32:9 glyph |=

148−32:12 name maybe

149−32:17 tight glyph =

150−32:18 tight glyph (

151−32:19 tight name unit

152−32:24 tvar A

153−32:25 tight glyph )

154−33:3 INDENT

155−33:3 glyph ?-

156−33:6 name maybe

157−34:5 INDENT

158−34:5 lit ~

159−34:7 glyph !!

160−35:5 NEWLINE

161−35:5 glyph [

162−35:6 tight lit ~

163−35:8 name value

164−35:13 tight glyph ]

165−35:15 name value

75+18:3 glyph ?-

76+18:6 name b

77+19:5 INDENT

78+19:5 lit %.y

79+19:9 lit %.n

80+20:5 NEWLINE

81+20:5 lit %.n

82+20:9 lit %.y

83+22:1 DEDENT

84+22:1 DEDENT

85+22:1 NEWLINE

86+22:1 glyph +$

87+22:4 name list

88+22:9 glyph |$

89+22:12 glyph [

90+22:13 tight tvar A

91+22:14 tight glyph ]

92+23:3 INDENT

93+23:3 lit ~

94+24:3 NEWLINE

95+24:3 glyph [

96+24:4 tight name i

97+24:5 tight glyph =

98+24:6 tight tvar A

99+24:8 name t

100+24:9 tight glyph =

101+24:10 tight glyph (

102+24:11 tight name list

103+24:16 tvar A

104+24:17 tight glyph )

105+24:18 tight glyph ]

106+26:1 DEDENT

107+26:1 NEWLINE

108+26:1 glyph +$

109+26:4 name unit

110+26:9 glyph |$

111+26:12 glyph [

112+26:13 tight tvar A

113+26:14 tight glyph ]

114+27:3 INDENT

115+27:3 lit ~

116+28:3 NEWLINE

117+28:3 glyph [

118+28:4 tight lit ~

119+28:6 name u

120+28:7 tight glyph =

121+28:8 tight tvar A

122+28:9 tight glyph ]

123+30:1 DEDENT

124+30:1 NEWLINE

125+30:1 glyph ++

126+30:4 name fall

127+30:9 glyph |=

128+30:12 name args

129+30:16 tight glyph =

130+30:17 tight glyph [

131+30:18 tight glyph (

132+30:19 tight name unit

133+30:24 tvar A

134+30:25 tight glyph )

135+30:27 tvar A

136+30:28 tight glyph ]

137+31:3 INDENT

138+31:3 glyph ?-

139+31:6 name args

140+32:5 INDENT

141+32:5 glyph [

142+32:6 tight name maybe

143+32:12 name fallback

144+32:20 tight glyph ]

145+33:7 INDENT

146+33:7 glyph ?-

147+33:10 name maybe

148+34:9 INDENT

149+34:9 lit ~

150+34:11 name fallback

151+35:9 NEWLINE

152+35:9 glyph [

153+35:10 tight lit ~

154+35:12 name value

155+35:17 tight glyph ]

156+35:19 name value

157+37:1 DEDENT

158+37:1 DEDENT

16615937:1 DEDENT

16716037:1 DEDENT

16816137:1 NEWLINE

16916237:1 glyph ++

170−37:4 name weld

163+37:4 name need

17116437:9 glyph |=

172−37:12 name args

173−37:16 tight glyph =

174−37:17 tight glyph [

165+37:12 name maybe

166+37:17 tight glyph =

17516737:18 tight glyph (

176−37:19 tight name list

168+37:19 tight name unit

17716937:24 tvar A

17817037:25 tight glyph )

179−37:27 glyph (

180−37:28 tight name list

181−37:33 tvar A

182−37:34 tight glyph )

183−37:35 tight glyph ]

18417138:3 INDENT

18517238:3 glyph ?-

186−38:6 name args

173+38:6 name maybe

18717439:5 INDENT

188−39:5 glyph [

189−39:6 tight name xs

190−39:9 name ys

191−39:11 tight glyph ]

192−40:7 INDENT

193−40:7 glyph ^-

194−40:10 glyph (

195−40:11 tight name list

196−40:16 tvar A

197−40:17 tight glyph )

198−41:9 INDENT

199−41:9 glyph ?-

200−41:12 name xs

201−42:11 INDENT

202−42:11 lit ~

203−42:13 name ys

204−43:11 NEWLINE

205−43:11 glyph [

206−43:12 tight name item

207−43:17 name rest

208−43:21 tight glyph ]

209−43:23 glyph [

210−43:24 tight name item

211−43:29 glyph (

212−43:30 tight name weld

213−43:35 name rest

214−43:40 name ys

215−43:42 tight glyph )

216−43:43 tight glyph ]

217−45:1 DEDENT

218−45:1 DEDENT

219−45:1 DEDENT

220−45:1 DEDENT

221−45:1 DEDENT

222−45:1 NEWLINE

223−45:1 glyph ++

224−45:4 name turn

225−45:9 glyph |=

226−45:12 name args

227−45:16 tight glyph =

228−45:17 tight glyph [

229−45:18 tight glyph (

230−45:19 tight name list

231−45:24 tvar A

232−45:25 tight glyph )

233−45:27 glyph $-(

234−45:30 tight tvar A

235−45:32 tvar B

236−45:33 tight glyph )

237−45:34 tight glyph ]

238−46:3 INDENT

239−46:3 glyph ?-

240−46:6 name args

241−47:5 INDENT

242−47:5 glyph [

243−47:6 tight name xs

244−47:9 name f

245−47:10 tight glyph ]

246−48:7 INDENT

247−48:7 glyph ^-

248−48:10 glyph (

249−48:11 tight name list

250−48:16 tvar B

251−48:17 tight glyph )

252−49:9 INDENT

253−49:9 glyph ?-

254−49:12 name xs

255−50:11 INDENT

256−50:11 lit ~

257−50:13 lit ~

258−51:11 NEWLINE

259−51:11 glyph [

260−51:12 tight name item

261−51:17 name rest

262−51:21 tight glyph ]

263−51:23 glyph [

264−51:24 tight glyph (

265−51:25 tight name f

266−51:27 name item

267−51:31 tight glyph )

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−53:1 DEDENT

275−53:1 DEDENT

276−53:1 DEDENT

277−53:1 DEDENT

278−53:1 DEDENT

279−53:1 NEWLINE

280−53:1 glyph +$

281−53:4 name dime

282−53:9 glyph [

283−53:10 tight name p

284−53:11 tight glyph =

285−53:12 tight aura @ta

286−53:16 name q

287−53:17 tight glyph =

288−53:18 tight aura @

289−53:19 tight glyph ]

290−55:1 NEWLINE

291−55:1 glyph +$

292−55:4 name hair

293−55:9 glyph [

294−55:10 tight name p

295−55:11 tight glyph =

296−55:12 tight aura @ud

297−55:16 name q

298−55:17 tight glyph =

299−55:18 tight aura @ud

300−55:21 tight glyph ]

301−57:1 NEWLINE

302−57:1 glyph +$

303−57:4 name pint

304−57:9 glyph [

305−57:10 tight name p

306−57:11 tight glyph =

307−57:12 tight glyph [

308−57:13 tight name p

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

330−60:3 glyph [

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

346−62:10 name p

175+39:5 lit ~

176+39:7 glyph !!

177+40:5 NEWLINE

178+40:5 glyph [

179+40:6 tight lit ~

180+40:8 name value

181+40:13 tight glyph ]

182+40:15 name value

183+42:1 DEDENT

184+42:1 DEDENT

185+42:1 NEWLINE

186+42:1 glyph ++

187+42:4 name weld

188+42:9 glyph |=

189+42:12 name args

190+42:16 tight glyph =

191+42:17 tight glyph [

192+42:18 tight glyph (

193+42:19 tight name list

194+42:24 tvar A

195+42:25 tight glyph )

196+42:27 glyph (

197+42:28 tight name list

198+42:33 tvar A

199+42:34 tight glyph )

200+42:35 tight glyph ]

201+43:3 INDENT

202+43:3 glyph ?-

203+43:6 name args

204+44:5 INDENT

205+44:5 glyph [

206+44:6 tight name xs

207+44:9 name ys

208+44:11 tight glyph ]

209+45:7 INDENT

210+45:7 glyph ^-

211+45:10 glyph (

212+45:11 tight name list

213+45:16 tvar A

214+45:17 tight glyph )

215+46:9 INDENT

216+46:9 glyph ?-

217+46:12 name xs

218+47:11 INDENT

219+47:11 lit ~

220+47:13 name ys

221+48:11 NEWLINE

222+48:11 glyph [

223+48:12 tight name item

224+48:17 name rest

225+48:21 tight glyph ]

226+48:23 glyph [

227+48:24 tight name item

228+48:29 glyph (

229+48:30 tight name weld

230+48:35 name rest

231+48:40 name ys

232+48:42 tight glyph )

233+48:43 tight glyph ]

234+50:1 DEDENT

235+50:1 DEDENT

236+50:1 DEDENT

237+50:1 DEDENT

238+50:1 DEDENT

239+50:1 NEWLINE

240+50:1 glyph ++

241+50:4 name turn

242+50:9 glyph |=

243+50:12 name args

244+50:16 tight glyph =

245+50:17 tight glyph [

246+50:18 tight glyph (

247+50:19 tight name list

248+50:24 tvar A

249+50:25 tight glyph )

250+50:27 glyph $-(

251+50:30 tight tvar A

252+50:32 tvar B

253+50:33 tight glyph )

254+50:34 tight glyph ]

255+51:3 INDENT

256+51:3 glyph ?-

257+51:6 name args

258+52:5 INDENT

259+52:5 glyph [

260+52:6 tight name xs

261+52:9 name f

262+52:10 tight glyph ]

263+53:7 INDENT

264+53:7 glyph ^-

265+53:10 glyph (

266+53:11 tight name list

267+53:16 tvar B

268+53:17 tight glyph )

269+54:9 INDENT

270+54:9 glyph ?-

271+54:12 name xs

272+55:11 INDENT

273+55:11 lit ~

274+55:13 lit ~

275+56:11 NEWLINE

276+56:11 glyph [

277+56:12 tight name item

278+56:17 name rest

279+56:21 tight glyph ]

280+56:23 glyph [

281+56:24 tight glyph (

282+56:25 tight name f

283+56:27 name item

284+56:31 tight glyph )

285+56:33 glyph (

286+56:34 tight name turn

287+56:39 name rest

288+56:44 name f

289+56:45 tight glyph )

290+56:46 tight glyph ]

291+58:1 DEDENT

292+58:1 DEDENT

293+58:1 DEDENT

294+58:1 DEDENT

295+58:1 DEDENT

296+58:1 NEWLINE

297+58:1 glyph +$

298+58:4 name dime

299+58:9 glyph [

300+58:10 tight name p

301+58:11 tight glyph =

302+58:12 tight aura @ta

303+58:16 name q

304+58:17 tight glyph =

305+58:18 tight aura @

306+58:19 tight glyph ]

307+60:1 NEWLINE

308+60:1 glyph +$

309+60:4 name hair

310+60:9 glyph [

311+60:10 tight name p

312+60:11 tight glyph =

313+60:12 tight aura @ud

314+60:16 name q

315+60:17 tight glyph =

316+60:18 tight aura @ud

317+60:21 tight glyph ]

318+62:1 NEWLINE

319+62:1 glyph +$

320+62:4 name pint

321+62:9 glyph [

322+62:10 tight name p

34732362:11 tight glyph =

348−62:12 tight glyph (

349−62:13 tight name list

350−62:18 name coin

351−62:22 tight glyph )

352−62:23 tight glyph ]

353−64:1 DEDENT

324+62:12 tight glyph [

325+62:13 tight name p

326+62:14 tight glyph =

327+62:15 tight aura @

328+62:17 name q

329+62:18 tight glyph =

330+62:19 tight aura @

331+62:20 tight glyph ]

332+62:22 name q

333+62:23 tight glyph =

334+62:24 tight glyph [

335+62:25 tight name p

336+62:26 tight glyph =

337+62:27 tight aura @

338+62:29 name q

339+62:30 tight glyph =

340+62:31 tight aura @

341+62:32 tight glyph ]

342+62:33 tight glyph ]

35434364:1 NEWLINE

35534464:1 glyph +$

356−64:4 name pair

357−64:9 glyph |$

358−64:12 glyph [

359−64:13 tight tvar A

360−64:15 tvar B

361−64:16 tight glyph ]

362−64:18 glyph [

363−64:19 tight name p

364−64:20 tight glyph =

365−64:21 tight tvar A

366−64:23 name q

367−64:24 tight glyph =

368−64:25 tight tvar B

369−64:26 tight glyph ]

370−66:1 NEWLINE

371−66:1 glyph +$

372−66:4 name trel

373−66:9 glyph |$

374−66:12 glyph [

375−66:13 tight tvar A

376−66:15 tvar B

377−66:17 tvar C

378−66:18 tight glyph ]

379−66:20 glyph [

380−66:21 tight name p

381−66:22 tight glyph =

382−66:23 tight tvar A

383−66:25 name q

384−66:26 tight glyph =

385−66:27 tight tvar B

386−66:29 name r

387−66:30 tight glyph =

388−66:31 tight tvar C

389−66:32 tight glyph ]

390−68:1 NEWLINE

391−68:1 glyph +$

392−68:4 name qual

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 ]

414−70:1 NEWLINE

415−70:1 glyph +$

416−70:4 name cord

417−70:9 aura @t

418−72:1 NEWLINE

419−72:1 glyph +$

420−72:4 name knot

421−72:9 aura @ta

422−74:1 NEWLINE

423−74:1 glyph +$

424−74:4 name tape

425−74:9 glyph (

426−74:10 tight name list

427−74:15 aura @tD

428−74:18 tight glyph )

429−76:1 NEWLINE

430−76:1 glyph +$

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

439−79:3 INDENT

440−79:3 name cord

441−80:3 NEWLINE

442−80:3 glyph [

443−80:4 tight lit %leaf

444−80:10 name p

445−80:11 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 (

454−81:13 tight name qual

455−81:18 name tape

456−81:23 name tape

457−81:28 name tape

458−81:33 name tape

459−81:37 tight glyph )

460−81:39 name q

461−81:40 tight glyph =

462−81:41 tight glyph (

463−81:42 tight name list

464−81:47 name tank

465−81:51 tight glyph )

466−81:52 tight glyph ]

467−82:3 NEWLINE

468−82:3 glyph [

469−82:4 tight lit %rose

470−82:10 name p

471−82:11 tight glyph =

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 )

478−82:34 name q

479−82:35 tight glyph =

480−82:36 tight glyph (

481−82:37 tight name list

482−82:42 name tank

483−82:46 tight glyph )

484−82:47 tight glyph ]

485−84:1 DEDENT

486−84:1 NEWLINE

487−84:1 glyph +$

488−84:4 name nail

489−84:9 glyph [

490−84:10 tight name p

491−84:11 tight glyph =

492−84:12 tight name hair

493−84:17 name q

494−84:18 tight glyph =

495−84:19 tight name tape

496−84:23 tight glyph ]

497−86:1 NEWLINE

498−86:1 glyph +$

499−86:4 name edge

500−86:9 glyph [

501−86:10 tight name p

345+64:4 name coin

346+65:3 INDENT

347+65:3 glyph [

348+65:4 tight lit %$

349+65:7 name p

350+65:8 tight glyph =

351+65:9 tight name dime

352+65:13 tight glyph ]

353+66:3 NEWLINE

354+66:3 glyph [

355+66:4 tight lit %blob

356+66:10 name p

357+66:11 tight glyph =

358+66:12 tight glyph *

359+66:13 tight glyph ]

360+67:3 NEWLINE

361+67:3 glyph [

362+67:4 tight lit %many

363+67:10 name p

364+67:11 tight glyph =

365+67:12 tight glyph (

366+67:13 tight name list

367+67:18 name coin

368+67:22 tight glyph )

369+67:23 tight glyph ]

370+69:1 DEDENT

371+69:1 NEWLINE

372+69:1 glyph +$

373+69:4 name pair

374+69:9 glyph |$

375+69:12 glyph [

376+69:13 tight tvar A

377+69:15 tvar B

378+69:16 tight glyph ]

379+69:18 glyph [

380+69:19 tight name p

381+69:20 tight glyph =

382+69:21 tight tvar A

383+69:23 name q

384+69:24 tight glyph =

385+69:25 tight tvar B

386+69:26 tight glyph ]

387+71:1 NEWLINE

388+71:1 glyph +$

389+71:4 name trel

390+71:9 glyph |$

391+71:12 glyph [

392+71:13 tight tvar A

393+71:15 tvar B

394+71:17 tvar C

395+71:18 tight glyph ]

396+71:20 glyph [

397+71:21 tight name p

398+71:22 tight glyph =

399+71:23 tight tvar A

400+71:25 name q

401+71:26 tight glyph =

402+71:27 tight tvar B

403+71:29 name r

404+71:30 tight glyph =

405+71:31 tight tvar C

406+71:32 tight glyph ]

407+73:1 NEWLINE

408+73:1 glyph +$

409+73:4 name qual

410+73:9 glyph |$

411+73:12 glyph [

412+73:13 tight tvar A

413+73:15 tvar B

414+73:17 tvar C

415+73:19 tvar D

416+73:20 tight glyph ]

417+73:22 glyph [

418+73:23 tight name p

419+73:24 tight glyph =

420+73:25 tight tvar A

421+73:27 name q

422+73:28 tight glyph =

423+73:29 tight tvar B

424+73:31 name r

425+73:32 tight glyph =

426+73:33 tight tvar C

427+73:35 name s

428+73:36 tight glyph =

429+73:37 tight tvar D

430+73:38 tight glyph ]

431+75:1 NEWLINE

432+75:1 glyph +$

433+75:4 name cord

434+75:9 aura @t

435+77:1 NEWLINE

436+77:1 glyph +$

437+77:4 name knot

438+77:9 aura @ta

439+79:1 NEWLINE

440+79:1 glyph +$

441+79:4 name tape

442+79:9 glyph (

443+79:10 tight name list

444+79:15 aura @tD

445+79:18 tight glyph )

446+81:1 NEWLINE

447+81:1 glyph +$

448+81:4 name path

449+81:9 glyph (

450+81:10 tight name list

451+81:15 name knot

452+81:19 tight glyph )

453+83:1 NEWLINE

454+83:1 glyph +$

455+83:4 name tank

456+84:3 INDENT

457+84:3 name cord

458+85:3 NEWLINE

459+85:3 glyph [

460+85:4 tight lit %leaf

461+85:10 name p

462+85:11 tight glyph =

463+85:12 tight name tape

464+85:16 tight glyph ]

465+86:3 NEWLINE

466+86:3 glyph [

467+86:4 tight lit %palm

468+86:10 name p

50246986: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 =

514−86:32 tight name nail

515−86:36 tight glyph ]

470+86:12 tight glyph (

471+86:13 tight name qual

472+86:18 name tape

473+86:23 name tape

474+86:28 name tape

475+86:33 name tape

51647686:37 tight glyph )

517−86:38 tight glyph ]

518−88:1 NEWLINE

519−88:1 glyph +$

520−88:4 name rule

521−88:9 glyph $-(

522−88:12 tight name nail

523−88:17 name edge

524−88:21 tight glyph )

525−90:1 NEWLINE

526−90:1 glyph +$

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

539−93:3 INDENT

540−93:3 glyph [

541−93:4 tight lit %0

542−93:7 name p

543−93:8 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 (

559−95:10 tight name list

560−95:15 name tank

561−95:19 tight glyph )

562−95:20 tight glyph ]

563−97:1 DEDENT

477+86:39 name q

478+86:40 tight glyph =

479+86:41 tight glyph (

480+86:42 tight name list

481+86:47 name tank

482+86:51 tight glyph )

483+86:52 tight glyph ]

484+87:3 NEWLINE

485+87:3 glyph [

486+87:4 tight lit %rose

487+87:10 name p

488+87:11 tight glyph =

489+87:12 tight glyph (

490+87:13 tight name trel

491+87:18 name tape

492+87:23 name tape

493+87:28 name tape

494+87:32 tight glyph )

495+87:34 name q

496+87:35 tight glyph =

497+87:36 tight glyph (

498+87:37 tight name list

499+87:42 name tank

500+87:46 tight glyph )

501+87:47 tight glyph ]

502+89:1 DEDENT

503+89:1 NEWLINE

504+89:1 glyph +$

505+89:4 name nail

506+89:9 glyph [

507+89:10 tight name p

508+89:11 tight glyph =

509+89:12 tight name hair

510+89:17 name q

511+89:18 tight glyph =

512+89:19 tight name tape

513+89:23 tight glyph ]

514+91:1 NEWLINE

515+91:1 glyph +$

516+91:4 name edge

517+91:9 glyph [

518+91:10 tight name p

519+91:11 tight glyph =

520+91:12 tight name hair

521+91:17 name q

522+91:18 tight glyph =

523+91:19 tight glyph (

524+91:20 tight name unit

525+91:25 glyph [

526+91:26 tight name p

527+91:27 tight glyph =

528+91:28 tight glyph *

529+91:30 name q

530+91:31 tight glyph =

531+91:32 tight name nail

532+91:36 tight glyph ]

533+91:37 tight glyph )

534+91:38 tight glyph ]

535+93:1 NEWLINE

536+93:1 glyph +$

537+93:4 name rule

538+93:9 glyph $-(

539+93:12 tight name nail

540+93:17 name edge

541+93:21 tight glyph )

542+95:1 NEWLINE

543+95:1 glyph +$

544+95:4 name spot

545+95:9 glyph [

546+95:10 tight name p

547+95:11 tight glyph =

548+95:12 tight name path

549+95:17 name q

550+95:18 tight glyph =

551+95:19 tight name pint

552+95:23 tight glyph ]

56455397:1 NEWLINE

56555497:1 glyph +$

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 wonk

592−99:9 glyph |=

593−99:12 name veq

594−99:15 tight glyph =

595−99:16 tight glyph (

596−99:17 tight name like

597−99:22 tvar A

598−99:23 tight glyph )

599−100:3 INDENT

600−100:3 glyph ?-

601−100:6 wing q.veq

602−101:5 INDENT

603−101:5 lit ~

604−101:7 glyph !!

605−102:5 NEWLINE

606−102:5 glyph [

607−102:6 tight lit ~

608−102:8 name product

609−102:15 tight glyph ]

610−102:17 wing p.product

611−104:1 DEDENT

612−104:1 DEDENT

555+97:4 name toon

556+98:3 INDENT

557+98:3 glyph [

558+98:4 tight lit %0

559+98:7 name p

560+98:8 tight glyph =

561+98:9 tight glyph *

562+98:10 tight glyph ]

563+99:3 NEWLINE

564+99:3 glyph [

565+99:4 tight lit %1

566+99:7 name p

567+99:8 tight glyph =

568+99:9 tight glyph *

569+99:10 tight glyph ]

570+100:3 NEWLINE

571+100:3 glyph [

572+100:4 tight lit %2

573+100:7 name p

574+100:8 tight glyph =

575+100:9 tight glyph (

576+100:10 tight name list

577+100:15 name tank

578+100:19 tight glyph )

579+100:20 tight glyph ]

580+102:1 DEDENT

581+102:1 NEWLINE

582+102:1 glyph +$

583+102:4 name like

584+102:9 glyph |$

585+102:12 glyph [

586+102:13 tight tvar A

587+102:14 tight glyph ]

588+102:16 glyph [

589+102:17 tight name p

590+102:18 tight glyph =

591+102:19 tight name hair

592+102:24 name q

593+102:25 tight glyph =

594+102:26 tight glyph (

595+102:27 tight name unit

596+102:32 glyph [

597+102:33 tight name p

598+102:34 tight glyph =

599+102:35 tight tvar A

600+102:37 name q

601+102:38 tight glyph =

602+102:39 tight name nail

603+102:43 tight glyph ]

604+102:44 tight glyph )

605+102:45 tight glyph ]

613606104:1 NEWLINE

614−104:1 glyph +$

615−104:4 name lone

616−104:9 glyph |$

607+104:1 glyph ++

608+104:4 name like

609+104:9 glyph |=

617610104:12 glyph [

618−104:13 tight tvar A

619−104:14 tight glyph ]

620−104:16 glyph [

621−104:17 tight name p

622−104:18 tight glyph =

623−104:19 tight tvar A

624−104:20 tight glyph ]

625−106:1 NEWLINE

626−106:1 glyph +$

627−106:4 name lest

628−106:9 glyph |$

629−106:12 glyph [

630−106:13 tight tvar A

631−106:14 tight glyph ]

632−106:16 glyph [

633−106:17 tight name i

634−106:18 tight glyph =

635−106:19 tight tvar A

636−106:21 name t

637−106:22 tight glyph =

638−106:23 tight glyph (

639−106:24 tight name list

640−106:29 tvar A

641−106:30 tight glyph )

642−106:31 tight glyph ]

643−108:1 NEWLINE

644−108:1 glyph +$

645−108:4 name pole

646−108:9 glyph |$

647−108:12 glyph [

648−108:13 tight tvar A

649−108:14 tight glyph ]

650−109:3 INDENT

651−109:3 lit ~

611+104:13 tight name f

612+104:14 tight glyph =

613+104:15 tight glyph $-(

614+104:18 tight tvar A

615+104:20 tvar B

616+104:21 tight glyph )

617+104:23 name result

618+104:29 tight glyph =

619+104:30 tight glyph (

620+104:31 tight name like

621+104:36 tvar A

622+104:37 tight glyph )

623+104:38 tight glyph ]

624+105:3 INDENT

625+105:3 glyph ++

626+105:6 name mapped

627+106:5 INDENT

628+106:5 glyph ^-

629+106:8 glyph (

630+106:9 tight name unit

631+106:14 glyph [

632+106:15 tight name p

633+106:16 tight glyph =

634+106:17 tight tvar B

635+106:19 name q

636+106:20 tight glyph =

637+106:21 tight name nail

638+106:25 tight glyph ]

639+106:26 tight glyph )

640+107:7 INDENT

641+107:7 glyph ?-

642+107:10 wing q.result

643+108:9 INDENT

644+108:9 lit ~

645+108:11 lit ~

646+109:9 NEWLINE

647+109:9 glyph [

648+109:10 tight lit ~

649+109:12 name value

650+109:17 tight glyph ]

651+109:19 glyph `

652+109:20 tight glyph [

653+109:21 tight name p

654+109:22 tight glyph =

655+109:23 tight glyph (

656+109:24 tight name f

657+109:26 wing p.value

658+109:33 tight glyph )

659+109:35 name q

660+109:36 tight glyph =

661+109:37 tight wing q.value

662+109:44 tight glyph ]

663+110:3 DEDENT

664+110:3 DEDENT

665+110:3 DEDENT

652666110:3 NEWLINE

653−110:3 glyph [

654−110:4 tight tvar A

667+110:3 glyph ^-

655668110:6 glyph (

656−110:7 tight name pole

657−110:12 tvar A

669+110:7 tight name like

670+110:12 tvar B

658671110:13 tight glyph )

659−110:14 tight glyph ]

672+110:15 glyph [

673+110:16 tight name p

674+110:17 tight glyph =

675+110:18 tight wing p.result

676+110:27 name q

677+110:28 tight glyph =

678+110:29 tight name mapped

679+110:35 tight glyph ]

660680112:1 DEDENT

661681112:1 NEWLINE

662−112:1 glyph +$

663−112:4 name quip

664−112:9 glyph |$

665−112:12 glyph [

666−112:13 tight tvar A

667−112:15 tvar B

668−112:16 tight glyph ]

669−112:18 glyph [

670−112:19 tight glyph (

671−112:20 tight name list

672−112:25 tvar A

673−112:26 tight glyph )

674−112:28 tvar B

675−112:29 tight glyph ]

676−114:1 NEWLINE

677−114:1 glyph +$

678−114:4 name tree

679−114:9 glyph |$

680−114:12 glyph [

681−114:13 tight tvar A

682−114:14 tight glyph ]

683−115:3 INDENT

684−115:3 lit ~

685−116:3 NEWLINE

686−116:3 glyph [

687−116:4 tight name n

688−116:5 tight glyph =

689−116:6 tight tvar A

690−116:8 name l

691−116:9 tight glyph =

692−116:10 tight glyph (

693−116:11 tight name tree

694−116:16 tvar A

695−116:17 tight glyph )

696−116:19 name r

697−116:20 tight glyph =

698−116:21 tight glyph (

699−116:22 tight name tree

700−116:27 tvar A

701−116:28 tight glyph )

702−116:29 tight glyph ]

703−118:1 DEDENT

704−118:1 NEWLINE

705−118:1 glyph +$

706−118:4 name each

707−118:9 glyph |$

708−118:12 glyph [

709−118:13 tight tvar A

710−118:15 tvar B

711−118:16 tight glyph ]

712−119:3 INDENT

713−119:3 glyph [

714−119:4 tight lit %|

715−119:7 name p

716−119:8 tight glyph =

717−119:9 tight tvar B

718−119:10 tight glyph ]

719−120:3 NEWLINE

720−120:3 glyph [

721−120:4 tight lit %&

722−120:7 name p

723−120:8 tight glyph =

724−120:9 tight tvar A

725−120:10 tight glyph ]

726−122:1 DEDENT

727−122:1 NEWLINE

728−122:1 glyph +$

729−122:4 name bloq

730−122:9 aura @

731−124:1 NEWLINE

732−124:1 glyph ++

733−124:4 name some

734−124:9 glyph |=

735−124:12 name item

736−124:16 tight glyph =

737−124:17 tight tvar A

738−124:19 glyph `

739−124:20 tight name item

740−126:1 NEWLINE

741−126:1 glyph ++

742−126:4 name lure

743−126:9 glyph |=

744−126:12 name item

745−126:16 tight glyph =

746−126:17 tight tvar A

747−127:3 INDENT

748−127:3 glyph ^-

749−127:6 glyph (

750−127:7 tight name list

751−127:12 tvar A

752−127:13 tight glyph )

753−127:15 glyph [

754−127:16 tight name item

755−127:21 lit ~

756−127:22 tight glyph ]

757−129:1 DEDENT

758−129:1 NEWLINE

759−129:1 glyph ++

760−129:4 name snoc

761−129:9 glyph |=

762−129:12 name args

763−129:16 tight glyph =

764−129:17 tight glyph [

765−129:18 tight glyph (

766−129:19 tight name list

767−129:24 tvar A

768−129:25 tight glyph )

682+112:1 glyph ++

683+112:4 name wonk

684+112:9 glyph |=

685+112:12 name veq

686+112:15 tight glyph =

687+112:16 tight glyph (

688+112:17 tight name like

689+112:22 tvar A

690+112:23 tight glyph )

691+113:3 INDENT

692+113:3 glyph ?-

693+113:6 wing q.veq

694+114:5 INDENT

695+114:5 lit ~

696+114:7 glyph !!

697+115:5 NEWLINE

698+115:5 glyph [

699+115:6 tight lit ~

700+115:8 name product

701+115:15 tight glyph ]

702+115:17 wing p.product

703+117:1 DEDENT

704+117:1 DEDENT

705+117:1 NEWLINE

706+117:1 glyph +$

707+117:4 name lone

708+117:9 glyph |$

709+117:12 glyph [

710+117:13 tight tvar A

711+117:14 tight glyph ]

712+117:16 glyph [

713+117:17 tight name p

714+117:18 tight glyph =

715+117:19 tight tvar A

716+117:20 tight glyph ]

717+119:1 NEWLINE

718+119:1 glyph +$

719+119:4 name lest

720+119:9 glyph |$

721+119:12 glyph [

722+119:13 tight tvar A

723+119:14 tight glyph ]

724+119:16 glyph [

725+119:17 tight name i

726+119:18 tight glyph =

727+119:19 tight tvar A

728+119:21 name t

729+119:22 tight glyph =

730+119:23 tight glyph (

731+119:24 tight name list

732+119:29 tvar A

733+119:30 tight glyph )

734+119:31 tight glyph ]

735+121:1 NEWLINE

736+121:1 glyph +$

737+121:4 name pole

738+121:9 glyph |$

739+121:12 glyph [

740+121:13 tight tvar A

741+121:14 tight glyph ]

742+122:3 INDENT

743+122:3 lit ~

744+123:3 NEWLINE

745+123:3 glyph [

746+123:4 tight tvar A

747+123:6 glyph (

748+123:7 tight name pole

749+123:12 tvar A

750+123:13 tight glyph )

751+123:14 tight glyph ]

752+125:1 DEDENT

753+125:1 NEWLINE

754+125:1 glyph +$

755+125:4 name quip

756+125:9 glyph |$

757+125:12 glyph [

758+125:13 tight tvar A

759+125:15 tvar B

760+125:16 tight glyph ]

761+125:18 glyph [

762+125:19 tight glyph (

763+125:20 tight name list

764+125:25 tvar A

765+125:26 tight glyph )

766+125:28 tvar B

767+125:29 tight glyph ]

768+127:1 NEWLINE

769+127:1 glyph +$

770+127:4 name tree

771+127:9 glyph |$

772+127:12 glyph [

773+127:13 tight tvar A

774+127:14 tight glyph ]

775+128:3 INDENT

776+128:3 lit ~

777+129:3 NEWLINE

778+129:3 glyph [

779+129:4 tight name n

780+129:5 tight glyph =

781+129:6 tight tvar A

782+129:8 name l

783+129:9 tight glyph =

784+129:10 tight glyph (

785+129:11 tight name tree

786+129:16 tvar A

787+129:17 tight glyph )

788+129:19 name r

789+129:20 tight glyph =

790+129:21 tight glyph (

791+129:22 tight name tree

769792129:27 tvar A

770−129:28 tight glyph ]

771−130:3 INDENT

772−130:3 glyph ?-

773−130:6 name args

774−131:5 INDENT

775−131:5 glyph [

776−131:6 tight name xs

777−131:9 name item

778−131:13 tight glyph ]

779−131:15 glyph (

780−131:16 tight name weld

781−131:21 name xs

782−131:24 glyph [

783−131:25 tight name item

784−131:30 lit ~

785−131:31 tight glyph ]

786−131:32 tight glyph )

787−133:1 DEDENT

788−133:1 DEDENT

789−133:1 NEWLINE

790−133:1 glyph ++

791−133:4 name flop

792−133:9 glyph |=

793−133:12 name xs

794−133:14 tight glyph =

795−133:15 tight glyph (

796−133:16 tight name list

797−133:21 tvar A

798−133:22 tight glyph )

799−134:3 INDENT

800−134:3 glyph ++

801−134:6 name reverse-into

802−134:19 glyph |=

803−134:22 name args

804−134:26 tight glyph =

805−134:27 tight glyph [

806−134:28 tight glyph (

807−134:29 tight name list

808−134:34 tvar A

809−134:35 tight glyph )

810−134:37 glyph (

811−134:38 tight name list

812−134:43 tvar A

813−134:44 tight glyph )

814−134:45 tight glyph ]

815−135:5 INDENT

816−135:5 glyph ?-

817−135:8 name args

818−136:7 INDENT

819−136:7 glyph [

820−136:8 tight name rest

821−136:13 name acc

822−136:16 tight glyph ]

823−137:9 INDENT

824−137:9 glyph ?-

825−137:12 name rest

826−138:11 INDENT

827−138:11 lit ~

828−138:13 name acc

829−139:11 NEWLINE

830−139:11 glyph [

831−139:12 tight name item

832−139:17 name more

833−139:21 tight glyph ]

834−139:23 glyph (

835−139:24 tight name reverse-into

836−139:37 name more

837−139:42 glyph [

838−139:43 tight name item

839−139:48 name acc

840−139:51 tight glyph ]

841−139:52 tight glyph )

842−140:3 DEDENT

843−140:3 DEDENT

844−140:3 DEDENT

845−140:3 DEDENT

846−140:3 NEWLINE

847−140:3 glyph (

848−140:4 tight name reverse-into

849−140:17 name xs

850−140:20 lit ~

851−140:21 tight glyph )

793+129:28 tight glyph )

794+129:29 tight glyph ]

795+131:1 DEDENT

796+131:1 NEWLINE

797+131:1 glyph +$

798+131:4 name each

799+131:9 glyph |$

800+131:12 glyph [

801+131:13 tight tvar A

802+131:15 tvar B

803+131:16 tight glyph ]

804+132:3 INDENT

805+132:3 glyph [

806+132:4 tight lit %|

807+132:7 name p

808+132:8 tight glyph =

809+132:9 tight tvar B

810+132:10 tight glyph ]

811+133:3 NEWLINE

812+133:3 glyph [

813+133:4 tight lit %&

814+133:7 name p

815+133:8 tight glyph =

816+133:9 tight tvar A

817+133:10 tight glyph ]

818+135:1 DEDENT

819+135:1 NEWLINE

820+135:1 glyph +$

821+135:4 name bloq

822+135:9 aura @

823+137:1 NEWLINE

824+137:1 glyph ++

825+137:4 name some

826+137:9 glyph |=

827+137:12 name item

828+137:16 tight glyph =

829+137:17 tight tvar A

830+137:19 glyph `

831+137:20 tight name item

832+139:1 NEWLINE

833+139:1 glyph ++

834+139:4 name lure

835+139:9 glyph |=

836+139:12 name item

837+139:16 tight glyph =

838+139:17 tight tvar A

839+140:3 INDENT

840+140:3 glyph ^-

841+140:6 glyph (

842+140:7 tight name list

843+140:12 tvar A

844+140:13 tight glyph )

845+140:15 glyph [

846+140:16 tight name item

847+140:21 lit ~

848+140:22 tight glyph ]

852849142:1 DEDENT

853850142:1 NEWLINE

854851142:1 glyph ++

855−142:4 name drop

852+142:4 name snoc

856853142:9 glyph |=

857−142:12 name maybe

858−142:17 tight glyph =

854+142:12 name args

855+142:16 tight glyph =

856+142:17 tight glyph [

859857142:18 tight glyph (

860−142:19 tight name unit

858+142:19 tight name list

861859142:24 tvar A

862860142:25 tight glyph )

861+142:27 tvar A

862+142:28 tight glyph ]

863863143:3 INDENT

864864143:3 glyph ?-

865−143:6 name maybe

865+143:6 name args

866866144:5 INDENT

867−144:5 lit ~

868−144:7 lit ~

869−145:5 NEWLINE

870−145:5 glyph [

871−145:6 tight lit ~

872−145:8 name value

873−145:13 tight glyph ]

874−145:15 glyph [

875−145:16 tight name value

876−145:22 lit ~

877−145:23 tight glyph ]

878−147:1 DEDENT

879−147:1 DEDENT

880−147:1 NEWLINE

881−147:1 glyph ++

882−147:4 name bind

883−147:9 glyph |=

884−147:12 name args

885−147:16 tight glyph =

886−147:17 tight glyph [

887−147:18 tight glyph (

888−147:19 tight name unit

889−147:24 tvar A

890−147:25 tight glyph )

891−147:27 glyph $-(

892−147:30 tight tvar A

893−147:32 tvar B

894−147:33 tight glyph )

895−147:34 tight glyph ]

896−148:3 INDENT

897−148:3 glyph ?-

898−148:6 name args

899−149:5 INDENT

900−149:5 glyph [

901−149:6 tight name maybe

902−149:12 name f

903−149:13 tight glyph ]

904−149:15 glyph ^-

905−149:18 glyph (

906−149:19 tight name unit

907−149:24 tvar B

908−149:25 tight glyph )

909−150:7 INDENT

910−150:7 glyph ?-

911−150:10 name maybe

912−151:9 INDENT

913−151:9 lit ~

867+144:5 glyph [

868+144:6 tight name xs

869+144:9 name item

870+144:13 tight glyph ]

871+144:15 glyph (

872+144:16 tight name weld

873+144:21 name xs

874+144:24 glyph [

875+144:25 tight name item

876+144:30 lit ~

877+144:31 tight glyph ]

878+144:32 tight glyph )

879+146:1 DEDENT

880+146:1 DEDENT

881+146:1 NEWLINE

882+146:1 glyph ++

883+146:4 name flop

884+146:9 glyph |=

885+146:12 name xs

886+146:14 tight glyph =

887+146:15 tight glyph (

888+146:16 tight name list

889+146:21 tvar A

890+146:22 tight glyph )

891+147:3 INDENT

892+147:3 glyph ++

893+147:6 name reverse-into

894+147:19 glyph |=

895+147:22 name args

896+147:26 tight glyph =

897+147:27 tight glyph [

898+147:28 tight glyph (

899+147:29 tight name list

900+147:34 tvar A

901+147:35 tight glyph )

902+147:37 glyph (

903+147:38 tight name list

904+147:43 tvar A

905+147:44 tight glyph )

906+147:45 tight glyph ]

907+148:5 INDENT

908+148:5 glyph ?-

909+148:8 name args

910+149:7 INDENT

911+149:7 glyph [

912+149:8 tight name rest

913+149:13 name acc

914+149:16 tight glyph ]

915+150:9 INDENT

916+150:9 glyph ?-

917+150:12 name rest

918+151:11 INDENT

914919151:11 lit ~

915−152:9 NEWLINE

916−152:9 glyph [

917−152:10 tight lit ~

918−152:12 name value

919−152:17 tight glyph ]

920−152:19 glyph `

921−152:20 tight glyph (

922−152:21 tight name f

923−152:23 name value

924−152:28 tight glyph )

925−154:1 DEDENT

926−154:1 DEDENT

927−154:1 DEDENT

928−154:1 DEDENT

929−154:1 NEWLINE

930−154:1 glyph ++

931−154:4 name biff

932−154:9 glyph |=

933−154:12 name args

934−154:16 tight glyph =

935−154:17 tight glyph [

936−154:18 tight glyph (

937−154:19 tight name unit

938−154:24 tvar A

939−154:25 tight glyph )

940−154:27 glyph $-(

941−154:30 tight tvar A

942−154:32 glyph (

943−154:33 tight name unit

944−154:38 tvar B

945−154:39 tight glyph )

946−154:40 tight glyph )

947−154:41 tight glyph ]

948−155:3 INDENT

949−155:3 glyph ?-

950−155:6 name args

951−156:5 INDENT

952−156:5 glyph [

953−156:6 tight name maybe

954−156:12 name f

955−156:13 tight glyph ]

956−156:15 glyph ^-

957−156:18 glyph (

958−156:19 tight name unit

959−156:24 tvar B

960−156:25 tight glyph )

961−157:7 INDENT

962−157:7 glyph ?-

963−157:10 name maybe

964−158:9 INDENT

920+151:13 name acc

921+152:11 NEWLINE

922+152:11 glyph [

923+152:12 tight name item

924+152:17 name more

925+152:21 tight glyph ]

926+152:23 glyph (

927+152:24 tight name reverse-into

928+152:37 name more

929+152:42 glyph [

930+152:43 tight name item

931+152:48 name acc

932+152:51 tight glyph ]

933+152:52 tight glyph )

934+153:3 DEDENT

935+153:3 DEDENT

936+153:3 DEDENT

937+153:3 DEDENT

938+153:3 NEWLINE

939+153:3 glyph (

940+153:4 tight name reverse-into

941+153:17 name xs

942+153:20 lit ~

943+153:21 tight glyph )

944+155:1 DEDENT

945+155:1 NEWLINE

946+155:1 glyph ++

947+155:4 name drop

948+155:9 glyph |=

949+155:12 name maybe

950+155:17 tight glyph =

951+155:18 tight glyph (

952+155:19 tight name unit

953+155:24 tvar A

954+155:25 tight glyph )

955+156:3 INDENT

956+156:3 glyph ^-

957+156:6 glyph (

958+156:7 tight name list

959+156:12 tvar A

960+156:13 tight glyph )

961+157:5 INDENT

962+157:5 glyph ?-

963+157:8 name maybe

964+158:7 INDENT

965+158:7 lit ~

965966158:9 lit ~

966−158:11 lit ~

967−159:9 NEWLINE

968−159:9 glyph [

969−159:10 tight lit ~

970−159:12 name value

971−159:17 tight glyph ]

972−159:19 glyph (

973−159:20 tight name f

974−159:22 name value

975−159:27 tight glyph )

976−161:1 DEDENT

967+159:7 NEWLINE

968+159:7 glyph [

969+159:8 tight lit ~

970+159:10 name value

971+159:15 tight glyph ]

972+159:17 glyph [

973+159:18 tight name value

974+159:24 lit ~

975+159:25 tight glyph ]

977976161:1 DEDENT

978977161:1 DEDENT

979978161:1 DEDENT

980979161:1 NEWLINE

981980161:1 glyph ++

982−161:4 name both

981+161:4 name bond

983982161:9 glyph |=

984−161:12 name args

985−161:16 tight glyph =

986−161:17 tight glyph [

987−161:18 tight glyph (

988−161:19 tight name unit

989−161:24 tvar A

990−161:25 tight glyph )

991−161:27 glyph (

992−161:28 tight name unit

993−161:33 tvar B

994−161:34 tight glyph )

995−161:35 tight glyph ]

983+161:12 name fallback

984+161:20 tight glyph =

985+161:21 tight glyph $-(

986+161:24 tight lit ~

987+161:26 tvar A

988+161:27 tight glyph )

996989162:3 INDENT

997−162:3 glyph ?-

998−162:6 name args

990+162:3 glyph |=

991+162:6 name maybe

992+162:11 tight glyph =

993+162:12 tight glyph (

994+162:13 tight name unit

995+162:18 tvar A

996+162:19 tight glyph )

999997163:5 INDENT

1000−163:5 glyph [

1001−163:6 tight name first

1002−163:12 name second

1003−163:18 tight glyph ]

1004−163:20 glyph ^-

1005−163:23 glyph (

1006−163:24 tight name unit

1007−163:29 glyph [

1008−163:30 tight tvar A

1009−163:32 tvar B

1010−163:33 tight glyph ]

1011−163:34 tight glyph )

998+163:5 glyph ?-

999+163:8 name maybe

10121000164:7 INDENT

1013−164:7 glyph ?-

1014−164:10 name first

1015−165:9 INDENT

1016−165:9 lit ~

1017−165:11 lit ~

1018−166:9 NEWLINE

1019−166:9 glyph [

1020−166:10 tight lit ~

1021−166:12 name a

1022−166:13 tight glyph ]

1023−167:11 INDENT

1024−167:11 glyph ?-

1025−167:14 name second

1026−168:13 INDENT

1027−168:13 lit ~

1028−168:15 lit ~

1029−169:13 NEWLINE

1030−169:13 glyph [

1031−169:14 tight lit ~

1032−169:16 name b

1033−169:17 tight glyph ]

1034−169:19 glyph `

1035−169:20 tight glyph [

1036−169:21 tight name a

1037−169:23 name b

1038−169:24 tight glyph ]

1039−171:1 DEDENT

1040−171:1 DEDENT

1041−171:1 DEDENT

1042−171:1 DEDENT

1043−171:1 DEDENT

1044−171:1 DEDENT

1045−171:1 NEWLINE

1046−171:1 glyph ++

1047−171:4 name clap

1048−171:9 glyph |=

1049−171:12 name args

1050−171:16 tight glyph =

1051−171:17 tight glyph [

1052−171:18 tight glyph (

1053−171:19 tight name unit

1054−171:24 tvar A

1055−171:25 tight glyph )

1056−171:27 glyph (

1057−171:28 tight name unit

1058−171:33 tvar A

1059−171:34 tight glyph )

1060−171:36 glyph $-(

1061−171:39 tight glyph [

1062−171:40 tight tvar A

1063−171:42 tvar A

1064−171:43 tight glyph ]

1065−171:45 tvar A

1066−171:46 tight glyph )

1067−171:47 tight glyph ]

1068−172:3 INDENT

1069−172:3 glyph ?-

1070−172:6 name args

1071−173:5 INDENT

1072−173:5 glyph [

1073−173:6 tight name first

1074−173:12 name second

1075−173:19 name combine

1076−173:26 tight glyph ]

1077−174:7 INDENT

1078−174:7 glyph ?-

1079−174:10 name first

1080−175:9 INDENT

1081−175:9 lit ~

1082−175:11 name second

1083−176:9 NEWLINE

1084−176:9 glyph [

1085−176:10 tight lit ~

1086−176:12 name a

1001+164:7 lit ~

1002+164:9 glyph (

1003+164:10 tight name fallback

1004+164:19 lit ~

1005+164:20 tight glyph )

1006+165:7 NEWLINE

1007+165:7 glyph [

1008+165:8 tight lit ~

1009+165:10 name value

1010+165:15 tight glyph ]

1011+165:17 name value

1012+167:1 DEDENT

1013+167:1 DEDENT

1014+167:1 DEDENT

1015+167:1 NEWLINE

1016+167:1 glyph ++

1017+167:4 name bind

1018+167:9 glyph |=

1019+167:12 name args

1020+167:16 tight glyph =

1021+167:17 tight glyph [

1022+167:18 tight glyph (

1023+167:19 tight name unit

1024+167:24 tvar A

1025+167:25 tight glyph )

1026+167:27 glyph $-(

1027+167:30 tight tvar A

1028+167:32 tvar B

1029+167:33 tight glyph )

1030+167:34 tight glyph ]

1031+168:3 INDENT

1032+168:3 glyph ?-

1033+168:6 name args

1034+169:5 INDENT

1035+169:5 glyph [

1036+169:6 tight name maybe

1037+169:12 name f

1038+169:13 tight glyph ]

1039+169:15 glyph ^-

1040+169:18 glyph (

1041+169:19 tight name unit

1042+169:24 tvar B

1043+169:25 tight glyph )

1044+170:7 INDENT

1045+170:7 glyph ?-

1046+170:10 name maybe

1047+171:9 INDENT

1048+171:9 lit ~

1049+171:11 lit ~

1050+172:9 NEWLINE

1051+172:9 glyph [

1052+172:10 tight lit ~

1053+172:12 name value

1054+172:17 tight glyph ]

1055+172:19 glyph `

1056+172:20 tight glyph (

1057+172:21 tight name f

1058+172:23 name value

1059+172:28 tight glyph )

1060+174:1 DEDENT

1061+174:1 DEDENT

1062+174:1 DEDENT

1063+174:1 DEDENT

1064+174:1 NEWLINE

1065+174:1 glyph ++

1066+174:4 name biff

1067+174:9 glyph |=

1068+174:12 name args

1069+174:16 tight glyph =

1070+174:17 tight glyph [

1071+174:18 tight glyph (

1072+174:19 tight name unit

1073+174:24 tvar A

1074+174:25 tight glyph )

1075+174:27 glyph $-(

1076+174:30 tight tvar A

1077+174:32 glyph (

1078+174:33 tight name unit

1079+174:38 tvar B

1080+174:39 tight glyph )

1081+174:40 tight glyph )

1082+174:41 tight glyph ]

1083+175:3 INDENT

1084+175:3 glyph ?-

1085+175:6 name args

1086+176:5 INDENT

1087+176:5 glyph [

1088+176:6 tight name maybe

1089+176:12 name f

10871090176:13 tight glyph ]

1088−177:11 INDENT

1089−177:11 glyph ?-

1090−177:14 name second

1091−178:13 INDENT

1092−178:13 lit ~

1093−178:15 name first

1094−179:13 NEWLINE

1095−179:13 glyph [

1096−179:14 tight lit ~

1097−179:16 name b

1091+176:15 glyph ^-

1092+176:18 glyph (

1093+176:19 tight name unit

1094+176:24 tvar B

1095+176:25 tight glyph )

1096+177:7 INDENT

1097+177:7 glyph ?-

1098+177:10 name maybe

1099+178:9 INDENT

1100+178:9 lit ~

1101+178:11 lit ~

1102+179:9 NEWLINE

1103+179:9 glyph [

1104+179:10 tight lit ~

1105+179:12 name value

10981106179:17 tight glyph ]

1099−179:19 glyph `

1100−179:20 tight glyph (

1101−179:21 tight name combine

1102−179:29 name a

1103−179:31 name b

1104−179:32 tight glyph )

1105−181:1 DEDENT

1106−181:1 DEDENT

1107+179:19 glyph (

1108+179:20 tight name f

1109+179:22 name value

1110+179:27 tight glyph )

11071111181:1 DEDENT

11081112181:1 DEDENT

11091113181:1 DEDENT

11101114181:1 DEDENT

11111115181:1 NEWLINE

11121116181:1 glyph ++

1113−181:4 name clef

1117+181:4 name both

11141118181:9 glyph |=

11151119181:12 name args

11161120181:16 tight glyph =

@@ -1123,17 +1127,7 @@

11231127181:28 tight name unit

11241128181:33 tvar B

11251129181:34 tight glyph )

1126−181:36 glyph $-(

1127−181:39 tight glyph [

1128−181:40 tight tvar A

1129−181:42 tvar B

1130−181:43 tight glyph ]

1131−181:45 glyph (

1132−181:46 tight name unit

1133−181:51 tvar C

1134−181:52 tight glyph )

1135−181:53 tight glyph )

1136−181:54 tight glyph ]

1130+181:35 tight glyph ]

11371131182:3 INDENT

11381132182:3 glyph ?-

11391133182:6 name args

@@ -1141,8 +1135,15 @@

11411135183:5 glyph [

11421136183:6 tight name first

11431137183:12 name second

1144−183:19 name combine

1145−183:26 tight glyph ]

1138+183:18 tight glyph ]

1139+183:20 glyph ^-

1140+183:23 glyph (

1141+183:24 tight name unit

1142+183:29 glyph [

1143+183:30 tight tvar A

1144+183:32 tvar B

1145+183:33 tight glyph ]

1146+183:34 tight glyph )

11461147184:7 INDENT

11471148184:7 glyph ?-

11481149184:10 name first

@@ -1165,11 +1166,11 @@

11651166189:14 tight lit ~

11661167189:16 name b

11671168189:17 tight glyph ]

1168−189:19 glyph (

1169−189:20 tight name combine

1170−189:28 name a

1171−189:30 name b

1172−189:31 tight glyph )

1169+189:19 glyph `

1170+189:20 tight glyph [

1171+189:21 tight name a

1172+189:23 name b

1173+189:24 tight glyph ]

11731174191:1 DEDENT

11741175191:1 DEDENT

11751176191:1 DEDENT

@@ -1178,62 +1179,69 @@

11781179191:1 DEDENT

11791180191:1 NEWLINE

11801181191:1 glyph ++

1181−191:4 name skim

1182+191:4 name clap

11821183191:9 glyph |=

11831184191:12 name args

11841185191:16 tight glyph =

11851186191:17 tight glyph [

11861187191:18 tight glyph (

1187−191:19 tight name list

1188+191:19 tight name unit

11881189191:24 tvar A

11891190191:25 tight glyph )

1190−191:27 glyph $-(

1191−191:30 tight tvar A

1192−191:32 glyph ?

1193−191:33 tight glyph )

1194−191:34 tight glyph ]

1191+191:27 glyph (

1192+191:28 tight name unit

1193+191:33 tvar A

1194+191:34 tight glyph )

1195+191:36 glyph $-(

1196+191:39 tight glyph [

1197+191:40 tight tvar A

1198+191:42 tvar A

1199+191:43 tight glyph ]

1200+191:45 tvar A

1201+191:46 tight glyph )

1202+191:47 tight glyph ]

11951203192:3 INDENT

11961204192:3 glyph ?-

11971205192:6 name args

11981206193:5 INDENT

11991207193:5 glyph [

1200−193:6 tight name xs

1201−193:9 name predicate

1202−193:18 tight glyph ]

1208+193:6 tight name first

1209+193:12 name second

1210+193:19 name combine

1211+193:26 tight glyph ]

1212+193:28 glyph ^-

1213+193:31 glyph (

1214+193:32 tight name unit

1215+193:37 tvar A

1216+193:38 tight glyph )

12031217194:7 INDENT

12041218194:7 glyph ?-

1205−194:10 name xs

1219+194:10 name first

12061220195:9 INDENT

12071221195:9 lit ~

1208−195:11 lit ~

1222+195:11 name second

12091223196:9 NEWLINE

12101224196:9 glyph [

1211−196:10 tight name item

1212−196:15 name rest

1213−196:19 tight glyph ]

1225+196:10 tight lit ~

1226+196:12 name a

1227+196:13 tight glyph ]

12141228197:11 INDENT

12151229197:11 glyph ?-

1216−197:14 glyph (

1217−197:15 tight name predicate

1218−197:25 name item

1219−197:29 tight glyph )

1230+197:14 name second

12201231198:13 INDENT

1221−198:13 lit %.y

1222−198:17 glyph [

1223−198:18 tight name item

1224−198:23 glyph (

1225−198:24 tight name skim

1226−198:29 name rest

1227−198:34 name predicate

1228−198:43 tight glyph )

1229−198:44 tight glyph ]

1232+198:13 lit ~

1233+198:15 name first

12301234199:13 NEWLINE

1231−199:13 lit %.n

1232−199:17 glyph (

1233−199:18 tight name skim

1234−199:23 name rest

1235−199:28 name predicate

1236−199:37 tight glyph )

1235+199:13 glyph [

1236+199:14 tight lit ~

1237+199:16 name b

1238+199:17 tight glyph ]

1239+199:19 glyph `

1240+199:20 tight glyph (

1241+199:21 tight name combine

1242+199:29 name a

1243+199:31 name b

1244+199:32 tight glyph )

12371245201:1 DEDENT

12381246201:1 DEDENT

12391247201:1 DEDENT

@@ -1242,62 +1250,71 @@

12421250201:1 DEDENT

12431251201:1 NEWLINE

12441252201:1 glyph ++

1245−201:4 name skip

1253+201:4 name clef

12461254201:9 glyph |=

12471255201:12 name args

12481256201:16 tight glyph =

12491257201:17 tight glyph [

12501258201:18 tight glyph (

1251−201:19 tight name list

1259+201:19 tight name unit

12521260201:24 tvar A

12531261201:25 tight glyph )

1254−201:27 glyph $-(

1255−201:30 tight tvar A

1256−201:32 glyph ?

1257−201:33 tight glyph )

1258−201:34 tight glyph ]

1262+201:27 glyph (

1263+201:28 tight name unit

1264+201:33 tvar B

1265+201:34 tight glyph )

1266+201:36 glyph $-(

1267+201:39 tight glyph [

1268+201:40 tight tvar A

1269+201:42 tvar B

1270+201:43 tight glyph ]

1271+201:45 glyph (

1272+201:46 tight name unit

1273+201:51 tvar C

1274+201:52 tight glyph )

1275+201:53 tight glyph )

1276+201:54 tight glyph ]

12591277202:3 INDENT

12601278202:3 glyph ?-

12611279202:6 name args

12621280203:5 INDENT

12631281203:5 glyph [

1264−203:6 tight name xs

1265−203:9 name predicate

1266−203:18 tight glyph ]

1282+203:6 tight name first

1283+203:12 name second

1284+203:19 name combine

1285+203:26 tight glyph ]

1286+203:28 glyph ^-

1287+203:31 glyph (

1288+203:32 tight name unit

1289+203:37 tvar C

1290+203:38 tight glyph )

12671291204:7 INDENT

12681292204:7 glyph ?-

1269−204:10 name xs

1293+204:10 name first

12701294205:9 INDENT

12711295205:9 lit ~

12721296205:11 lit ~

12731297206:9 NEWLINE

12741298206:9 glyph [

1275−206:10 tight name item

1276−206:15 name rest

1277−206:19 tight glyph ]

1299+206:10 tight lit ~

1300+206:12 name a

1301+206:13 tight glyph ]

12781302207:11 INDENT

12791303207:11 glyph ?-

1280−207:14 glyph (

1281−207:15 tight name predicate

1282−207:25 name item

1283−207:29 tight glyph )

1304+207:14 name second

12841305208:13 INDENT

1285−208:13 lit %.y

1286−208:17 glyph (

1287−208:18 tight name skip

1288−208:23 name rest

1289−208:28 name predicate

1290−208:37 tight glyph )

1306+208:13 lit ~

1307+208:15 lit ~

12911308209:13 NEWLINE

1292−209:13 lit %.n

1293−209:17 glyph [

1294−209:18 tight name item

1295−209:23 glyph (

1296−209:24 tight name skip

1297−209:29 name rest

1298−209:34 name predicate

1299−209:43 tight glyph )

1300−209:44 tight glyph ]

1309+209:13 glyph [

1310+209:14 tight lit ~

1311+209:16 name b

1312+209:17 tight glyph ]

1313+209:19 glyph (

1314+209:20 tight name combine

1315+209:28 name a

1316+209:30 name b

1317+209:31 tight glyph )

13011318211:1 DEDENT

13021319211:1 DEDENT

13031320211:1 DEDENT

@@ -1306,7 +1323,7 @@

13061323211:1 DEDENT

13071324211:1 NEWLINE

13081325211:1 glyph ++

1309−211:4 name levy

1326+211:4 name skim

13101327211:9 glyph |=

13111328211:12 name args

13121329211:16 tight glyph =

@@ -1328,33 +1345,45 @@

13281345213:6 tight name xs

13291346213:9 name predicate

13301347213:18 tight glyph ]

1331−214:7 INDENT

1332−214:7 glyph ?-

1333−214:10 name xs

1334−215:9 INDENT

1335−215:9 lit ~

1336−215:11 lit %.y

1337−216:9 NEWLINE

1338−216:9 glyph [

1339−216:10 tight name item

1340−216:15 name rest

1341−216:19 tight glyph ]

1342−217:11 INDENT

1343−217:11 glyph ?-

1344−217:14 glyph (

1345−217:15 tight name predicate

1346−217:25 name item

1347−217:29 tight glyph )

1348−218:13 INDENT

1349−218:13 lit %.y

1350−218:17 glyph (

1351−218:18 tight name levy

1352−218:23 name rest

1353−218:28 name predicate

1354−218:37 tight glyph )

1355−219:13 NEWLINE

1356−219:13 lit %.n

1357−219:17 lit %.n

1348+213:20 glyph ^-

1349+213:23 glyph (

1350+213:24 tight name list

1351+213:29 tvar A

1352+213:30 tight glyph )

1353+214:9 INDENT

1354+214:9 glyph ?-

1355+214:12 name xs

1356+215:11 INDENT

1357+215:11 lit ~

1358+215:13 lit ~

1359+216:11 NEWLINE

1360+216:11 glyph [

1361+216:12 tight name item

1362+216:17 name rest

1363+216:21 tight glyph ]

1364+217:13 INDENT

1365+217:13 glyph ?-

1366+217:16 glyph (

1367+217:17 tight name predicate

1368+217:27 name item

1369+217:31 tight glyph )

1370+218:15 INDENT

1371+218:15 lit %.y

1372+218:19 glyph [

1373+218:20 tight name item

1374+218:25 glyph (

1375+218:26 tight name skim

1376+218:31 name rest

1377+218:36 name predicate

1378+218:45 tight glyph )

1379+218:46 tight glyph ]

1380+219:15 NEWLINE

1381+219:15 lit %.n

1382+219:19 glyph (

1383+219:20 tight name skim

1384+219:25 name rest

1385+219:30 name predicate

1386+219:39 tight glyph )

13581387221:1 DEDENT

13591388221:1 DEDENT

13601389221:1 DEDENT

@@ -1363,7 +1392,7 @@

13631392221:1 DEDENT

13641393221:1 NEWLINE

13651394221:1 glyph ++

1366−221:4 name lien

1395+221:4 name skip

13671396221:9 glyph |=

13681397221:12 name args

13691398221:16 tight glyph =

@@ -1385,33 +1414,45 @@

13851414223:6 tight name xs

13861415223:9 name predicate

13871416223:18 tight glyph ]

1388−224:7 INDENT

1389−224:7 glyph ?-

1390−224:10 name xs

1391−225:9 INDENT

1392−225:9 lit ~

1393−225:11 lit %.n

1394−226:9 NEWLINE

1395−226:9 glyph [

1396−226:10 tight name item

1397−226:15 name rest

1398−226:19 tight glyph ]

1399−227:11 INDENT

1400−227:11 glyph ?-

1401−227:14 glyph (

1402−227:15 tight name predicate

1403−227:25 name item

1404−227:29 tight glyph )

1405−228:13 INDENT

1406−228:13 lit %.y

1407−228:17 lit %.y

1408−229:13 NEWLINE

1409−229:13 lit %.n

1410−229:17 glyph (

1411−229:18 tight name lien

1412−229:23 name rest

1413−229:28 name predicate

1414−229:37 tight glyph )

1417+223:20 glyph ^-

1418+223:23 glyph (

1419+223:24 tight name list

1420+223:29 tvar A

1421+223:30 tight glyph )

1422+224:9 INDENT

1423+224:9 glyph ?-

1424+224:12 name xs

1425+225:11 INDENT

1426+225:11 lit ~

1427+225:13 lit ~

1428+226:11 NEWLINE

1429+226:11 glyph [

1430+226:12 tight name item

1431+226:17 name rest

1432+226:21 tight glyph ]

1433+227:13 INDENT

1434+227:13 glyph ?-

1435+227:16 glyph (

1436+227:17 tight name predicate

1437+227:27 name item

1438+227:31 tight glyph )

1439+228:15 INDENT

1440+228:15 lit %.y

1441+228:19 glyph (

1442+228:20 tight name skip

1443+228:25 name rest

1444+228:30 name predicate

1445+228:39 tight glyph )

1446+229:15 NEWLINE

1447+229:15 lit %.n

1448+229:19 glyph [

1449+229:20 tight name item

1450+229:25 glyph (

1451+229:26 tight name skip

1452+229:31 name rest

1453+229:36 name predicate

1454+229:45 tight glyph )

1455+229:46 tight glyph ]

14151456231:1 DEDENT

14161457231:1 DEDENT

14171458231:1 DEDENT

@@ -1420,7 +1461,7 @@

14201461231:1 DEDENT

14211462231:1 NEWLINE

14221463231:1 glyph ++

1423−231:4 name roll

1464+231:4 name levy

14241465231:9 glyph |=

14251466231:12 name args

14261467231:16 tight glyph =

@@ -1429,355 +1470,765 @@

14291470231:19 tight name list

14301471231:24 tvar A

14311472231:25 tight glyph )

1432−231:27 tvar B

1433−231:29 glyph $-(

1434−231:32 tight glyph [

1435−231:33 tight tvar A

1436−231:35 tvar B

1437−231:36 tight glyph ]

1438−231:38 tvar B

1439−231:39 tight glyph )

1440−231:40 tight glyph ]

1473+231:27 glyph $-(

1474+231:30 tight tvar A

1475+231:32 glyph ?

1476+231:33 tight glyph )

1477+231:34 tight glyph ]

14411478232:3 INDENT

1442−232:3 glyph ?-

1443−232:6 name args

1479+232:3 glyph ^-

1480+232:6 glyph ?

14441481233:5 INDENT

1445−233:5 glyph [

1446−233:6 tight name xs

1447−233:9 name start

1448−233:15 name combine

1449−233:22 tight glyph ]

1482+233:5 glyph ?-

1483+233:8 name args

14501484234:7 INDENT

1451−234:7 glyph ?-

1452−234:10 name xs

1485+234:7 glyph [

1486+234:8 tight name xs

1487+234:11 name predicate

1488+234:20 tight glyph ]

14531489235:9 INDENT

1454−235:9 lit ~

1455−235:11 name start

1456−236:9 NEWLINE

1457−236:9 glyph [

1458−236:10 tight name item

1459−236:15 name rest

1460−236:19 tight glyph ]

1461−236:21 glyph (

1462−236:22 tight name roll

1463−236:27 name rest

1464−236:32 glyph (

1465−236:33 tight name combine

1466−236:41 name item

1467−236:46 name start

1468−236:51 tight glyph )

1469−236:53 name combine

1470−236:60 tight glyph )

1471−238:1 DEDENT

1472−238:1 DEDENT

1473−238:1 DEDENT

1474−238:1 DEDENT

1475−238:1 NEWLINE

1476−238:1 glyph ++

1477−238:4 name reel

1478−238:9 glyph |=

1479−238:12 name args

1480−238:16 tight glyph =

1481−238:17 tight glyph [

1482−238:18 tight glyph (

1483−238:19 tight name list

1484−238:24 tvar A

1485−238:25 tight glyph )

1486−238:27 tvar B

1487−238:29 glyph $-(

1488−238:32 tight glyph [

1489−238:33 tight tvar A

1490−238:35 tvar B

1491−238:36 tight glyph ]

1492−238:38 tvar B

1493−238:39 tight glyph )

1494−238:40 tight glyph ]

1495−239:3 INDENT

1496−239:3 glyph ?-

1497−239:6 name args

1498−240:5 INDENT

1499−240:5 glyph [

1500−240:6 tight name xs

1501−240:9 name start

1502−240:15 name combine

1503−240:22 tight glyph ]

1504−241:7 INDENT

1505−241:7 glyph ?-

1506−241:10 name xs

1507−242:9 INDENT

1508−242:9 lit ~

1509−242:11 name start

1510−243:9 NEWLINE

1511−243:9 glyph [

1512−243:10 tight name item

1513−243:15 name rest

1514−243:19 tight glyph ]

1515−243:21 glyph (

1516−243:22 tight name combine

1517−243:30 name item

1518−243:35 glyph (

1519−243:36 tight name reel

1520−243:41 name rest

1521−243:46 name start

1522−243:52 name combine

1523−243:59 tight glyph )

1524−243:60 tight glyph )

1525−245:1 DEDENT

1526−245:1 DEDENT

1527−245:1 DEDENT

1528−245:1 DEDENT

1529−245:1 NEWLINE

1530−245:1 glyph ++

1531−245:4 name flit

1532−245:9 glyph |=

1533−245:12 name predicate

1534−245:21 tight glyph =

1535−245:22 tight glyph $-(

1536−245:25 tight tvar A

1537−245:27 glyph ?

1538−245:28 tight glyph )

1539−246:3 INDENT

1540−246:3 glyph |=

1541−246:6 name value

1542−246:11 tight glyph =

1543−246:12 tight tvar A

1544−247:5 INDENT

1545−247:5 glyph ^-

1546−247:8 glyph (

1547−247:9 tight name unit

1548−247:14 tvar A

1549−247:15 tight glyph )

1550−248:7 INDENT

1551−248:7 glyph ?-

1552−248:10 glyph (

1553−248:11 tight name predicate

1554−248:21 name value

1555−248:26 tight glyph )

1556−249:9 INDENT

1557−249:9 lit %.y

1558−249:13 glyph `

1559−249:14 tight name value

1560−250:9 NEWLINE

1561−250:9 lit %.n

1562−250:13 lit ~

1563−252:1 DEDENT

1564−252:1 DEDENT

1565−252:1 DEDENT

1566−252:1 DEDENT

1567−252:1 NEWLINE

1568−252:1 glyph ++

1569−252:4 name murn

1570−252:9 glyph |=

1571−252:12 name args

1572−252:16 tight glyph =

1573−252:17 tight glyph [

1574−252:18 tight glyph (

1575−252:19 tight name list

1576−252:24 tvar A

1577−252:25 tight glyph )

1578−252:27 glyph $-(

1579−252:30 tight tvar A

1580−252:32 glyph (

1581−252:33 tight name unit

1582−252:38 tvar B

1583−252:39 tight glyph )

1584−252:40 tight glyph )

1585−252:41 tight glyph ]

1586−253:3 INDENT

1587−253:3 glyph ?-

1588−253:6 name args

1589−254:5 INDENT

1590−254:5 glyph [

1591−254:6 tight name xs

1592−254:9 name f

1593−254:10 tight glyph ]

1594−255:7 INDENT

1595−255:7 glyph ?-

1596−255:10 name xs

1597−256:9 INDENT

1598−256:9 lit ~

1599−256:11 lit ~

1600−257:9 NEWLINE

1601−257:9 glyph [

1602−257:10 tight name item

1603−257:15 name rest

1604−257:19 tight glyph ]

1605−258:11 INDENT

1606−258:11 glyph ?-

1607−258:14 glyph (

1608−258:15 tight name f

1609−258:17 name item

1610−258:21 tight glyph )

1611−259:13 INDENT

1612−259:13 lit ~

1613−259:15 glyph (

1614−259:16 tight name murn

1615−259:21 name rest

1616−259:26 name f

1617−259:27 tight glyph )

1618−260:13 NEWLINE

1619−260:13 glyph [

1620−260:14 tight lit ~

1621−260:16 name value

1622−260:21 tight glyph ]

1623−260:23 glyph [

1624−260:24 tight name value

1625−260:30 glyph (

1626−260:31 tight name murn

1627−260:36 name rest

1628−260:41 name f

1629−260:42 tight glyph )

1630−260:43 tight glyph ]

1631−262:1 DEDENT

1632−262:1 DEDENT

1633−262:1 DEDENT

1634−262:1 DEDENT

1635−262:1 DEDENT

1636−262:1 DEDENT

1637−262:1 NEWLINE

1638−262:1 glyph ++

1639−262:4 name join

1640−262:9 glyph |=

1641−262:12 name args

1642−262:16 tight glyph =

1643−262:17 tight glyph [

1644−262:18 tight tvar A

1645−262:20 glyph (

1646−262:21 tight name list

1647−262:26 tvar A

1648−262:27 tight glyph )

1649−262:28 tight glyph ]

1650−263:3 INDENT

1651−263:3 glyph ?-

1652−263:6 name args

1653−264:5 INDENT

1654−264:5 glyph [

1655−264:6 tight name separator

1656−264:16 name xs

1657−264:18 tight glyph ]

1658−265:7 INDENT

1659−265:7 glyph ?-

1660−265:10 name xs

1661−266:9 INDENT

1662−266:9 lit ~

1663−266:11 lit ~

1664−267:9 NEWLINE

1665−267:9 glyph [

1666−267:10 tight name item

1667−267:15 name rest

1668−267:19 tight glyph ]

1669−268:11 INDENT

1670−268:11 glyph ?-

1671−268:14 name rest

1672−269:13 INDENT

1673−269:13 lit ~

1674−269:15 glyph [

1675−269:16 tight name item

1676−269:21 lit ~

1677−269:22 tight glyph ]

1678−270:13 NEWLINE

1679−270:13 glyph [

1680−270:14 tight name next

1681−270:19 name more

1682−270:23 tight glyph ]

1683−270:25 glyph [

1684−270:26 tight name item

1685−270:31 glyph [

1686−270:32 tight name separator

1687−270:42 glyph (

1688−270:43 tight name join

1689−270:48 name separator

1690−270:58 name rest

1691−270:62 tight glyph )

1692−270:63 tight glyph ]

1693−270:64 tight glyph ]

1694−272:1 DEDENT

1695−272:1 DEDENT

1696−272:1 DEDENT

1697−272:1 DEDENT

1698−272:1 DEDENT

1699−272:1 DEDENT

1700−272:1 NEWLINE

1701−272:1 glyph ++

1702−272:4 name snip

1703−272:9 glyph |=

1704−272:12 name xs

1705−272:14 tight glyph =

1706−272:15 tight glyph (

1707−272:16 tight name list

1708−272:21 tvar A

1709−272:22 tight glyph )

1710−273:3 INDENT

1711−273:3 glyph ?-

1712−273:6 name xs

1713−274:5 INDENT

1714−274:5 lit ~

1715−274:7 lit ~

1716−275:5 NEWLINE

1717−275:5 glyph [

1718−275:6 tight name item

1719−275:11 name rest

1720−275:15 tight glyph ]

1721−276:7 INDENT

1722−276:7 glyph ?-

1723−276:10 name rest

1490+235:9 glyph ?-

1491+235:12 name xs

1492+236:11 INDENT

1493+236:11 lit ~

1494+236:13 lit %.y

1495+237:11 NEWLINE

1496+237:11 glyph [

1497+237:12 tight name item

1498+237:17 name rest

1499+237:21 tight glyph ]

1500+238:13 INDENT

1501+238:13 glyph ?-

1502+238:16 glyph (

1503+238:17 tight name predicate

1504+238:27 name item

1505+238:31 tight glyph )

1506+239:15 INDENT

1507+239:15 lit %.y

1508+239:19 glyph (

1509+239:20 tight name levy

1510+239:25 name rest

1511+239:30 name predicate

1512+239:39 tight glyph )

1513+240:15 NEWLINE

1514+240:15 lit %.n

1515+240:19 lit %.n

1516+242:1 DEDENT

1517+242:1 DEDENT

1518+242:1 DEDENT

1519+242:1 DEDENT

1520+242:1 DEDENT

1521+242:1 DEDENT

1522+242:1 DEDENT

1523+242:1 NEWLINE

1524+242:1 glyph ++

1525+242:4 name lien

1526+242:9 glyph |=

1527+242:12 name args

1528+242:16 tight glyph =

1529+242:17 tight glyph [

1530+242:18 tight glyph (

1531+242:19 tight name list

1532+242:24 tvar A

1533+242:25 tight glyph )

1534+242:27 glyph $-(

1535+242:30 tight tvar A

1536+242:32 glyph ?

1537+242:33 tight glyph )

1538+242:34 tight glyph ]

1539+243:3 INDENT

1540+243:3 glyph ^-

1541+243:6 glyph ?

1542+244:5 INDENT

1543+244:5 glyph ?-

1544+244:8 name args

1545+245:7 INDENT

1546+245:7 glyph [

1547+245:8 tight name xs

1548+245:11 name predicate

1549+245:20 tight glyph ]

1550+246:9 INDENT

1551+246:9 glyph ?-

1552+246:12 name xs

1553+247:11 INDENT

1554+247:11 lit ~

1555+247:13 lit %.n

1556+248:11 NEWLINE

1557+248:11 glyph [

1558+248:12 tight name item

1559+248:17 name rest

1560+248:21 tight glyph ]

1561+249:13 INDENT

1562+249:13 glyph ?-

1563+249:16 glyph (

1564+249:17 tight name predicate

1565+249:27 name item

1566+249:31 tight glyph )

1567+250:15 INDENT

1568+250:15 lit %.y

1569+250:19 lit %.y

1570+251:15 NEWLINE

1571+251:15 lit %.n

1572+251:19 glyph (

1573+251:20 tight name lien

1574+251:25 name rest

1575+251:30 name predicate

1576+251:39 tight glyph )

1577+253:1 DEDENT

1578+253:1 DEDENT

1579+253:1 DEDENT

1580+253:1 DEDENT

1581+253:1 DEDENT

1582+253:1 DEDENT

1583+253:1 DEDENT

1584+253:1 NEWLINE

1585+253:1 glyph ++

1586+253:4 name roll

1587+253:9 glyph |=

1588+253:12 name args

1589+253:16 tight glyph =

1590+253:17 tight glyph [

1591+253:18 tight glyph (

1592+253:19 tight name list

1593+253:24 tvar A

1594+253:25 tight glyph )

1595+253:27 tvar B

1596+253:29 glyph $-(

1597+253:32 tight glyph [

1598+253:33 tight tvar A

1599+253:35 tvar B

1600+253:36 tight glyph ]

1601+253:38 tvar B

1602+253:39 tight glyph )

1603+253:40 tight glyph ]

1604+254:3 INDENT

1605+254:3 glyph ?-

1606+254:6 name args

1607+255:5 INDENT

1608+255:5 glyph [

1609+255:6 tight name xs

1610+255:9 name start

1611+255:15 name combine

1612+255:22 tight glyph ]

1613+256:7 INDENT

1614+256:7 glyph ?-

1615+256:10 name xs

1616+257:9 INDENT

1617+257:9 lit ~

1618+257:11 name start

1619+258:9 NEWLINE

1620+258:9 glyph [

1621+258:10 tight name item

1622+258:15 name rest

1623+258:19 tight glyph ]

1624+258:21 glyph (

1625+258:22 tight name roll

1626+258:27 name rest

1627+258:32 glyph (

1628+258:33 tight name combine

1629+258:41 name item

1630+258:46 name start

1631+258:51 tight glyph )

1632+258:53 name combine

1633+258:60 tight glyph )

1634+260:1 DEDENT

1635+260:1 DEDENT

1636+260:1 DEDENT

1637+260:1 DEDENT

1638+260:1 NEWLINE

1639+260:1 glyph ++

1640+260:4 name reel

1641+260:9 glyph |=

1642+260:12 name args

1643+260:16 tight glyph =

1644+260:17 tight glyph [

1645+260:18 tight glyph (

1646+260:19 tight name list

1647+260:24 tvar A

1648+260:25 tight glyph )

1649+260:27 tvar B

1650+260:29 glyph $-(

1651+260:32 tight glyph [

1652+260:33 tight tvar A

1653+260:35 tvar B

1654+260:36 tight glyph ]

1655+260:38 tvar B

1656+260:39 tight glyph )

1657+260:40 tight glyph ]

1658+261:3 INDENT

1659+261:3 glyph ?-

1660+261:6 name args

1661+262:5 INDENT

1662+262:5 glyph [

1663+262:6 tight name xs

1664+262:9 name start

1665+262:15 name combine

1666+262:22 tight glyph ]

1667+263:7 INDENT

1668+263:7 glyph ?-

1669+263:10 name xs

1670+264:9 INDENT

1671+264:9 lit ~

1672+264:11 name start

1673+265:9 NEWLINE

1674+265:9 glyph [

1675+265:10 tight name item

1676+265:15 name rest

1677+265:19 tight glyph ]

1678+265:21 glyph (

1679+265:22 tight name combine

1680+265:30 name item

1681+265:35 glyph (

1682+265:36 tight name reel

1683+265:41 name rest

1684+265:46 name start

1685+265:52 name combine

1686+265:59 tight glyph )

1687+265:60 tight glyph )

1688+267:1 DEDENT

1689+267:1 DEDENT

1690+267:1 DEDENT

1691+267:1 DEDENT

1692+267:1 NEWLINE

1693+267:1 glyph ++

1694+267:4 name flit

1695+267:9 glyph |=

1696+267:12 name predicate

1697+267:21 tight glyph =

1698+267:22 tight glyph $-(

1699+267:25 tight tvar A

1700+267:27 glyph ?

1701+267:28 tight glyph )

1702+268:3 INDENT

1703+268:3 glyph |=

1704+268:6 name value

1705+268:11 tight glyph =

1706+268:12 tight tvar A

1707+269:5 INDENT

1708+269:5 glyph ^-

1709+269:8 glyph (

1710+269:9 tight name unit

1711+269:14 tvar A

1712+269:15 tight glyph )

1713+270:7 INDENT

1714+270:7 glyph ?-

1715+270:10 glyph (

1716+270:11 tight name predicate

1717+270:21 name value

1718+270:26 tight glyph )

1719+271:9 INDENT

1720+271:9 lit %.y

1721+271:13 glyph `

1722+271:14 tight name value

1723+272:9 NEWLINE

1724+272:9 lit %.n

1725+272:13 lit ~

1726+274:1 DEDENT

1727+274:1 DEDENT

1728+274:1 DEDENT

1729+274:1 DEDENT

1730+274:1 NEWLINE

1731+274:1 glyph ++

1732+274:4 name murn

1733+274:9 glyph |=

1734+274:12 name args

1735+274:16 tight glyph =

1736+274:17 tight glyph [

1737+274:18 tight glyph (

1738+274:19 tight name list

1739+274:24 tvar A

1740+274:25 tight glyph )

1741+274:27 glyph $-(

1742+274:30 tight tvar A

1743+274:32 glyph (

1744+274:33 tight name unit

1745+274:38 tvar B

1746+274:39 tight glyph )

1747+274:40 tight glyph )

1748+274:41 tight glyph ]

1749+275:3 INDENT

1750+275:3 glyph ?-

1751+275:6 name args

1752+276:5 INDENT

1753+276:5 glyph [

1754+276:6 tight name xs

1755+276:9 name f

1756+276:10 tight glyph ]

1757+276:12 glyph ^-

1758+276:15 glyph (

1759+276:16 tight name list

1760+276:21 tvar B

1761+276:22 tight glyph )

17241762277:9 INDENT

1725−277:9 lit ~

1726−277:11 lit ~

1727−278:9 NEWLINE

1728−278:9 glyph [

1729−278:10 tight name next

1730−278:15 name more

1731−278:19 tight glyph ]

1732−278:21 glyph [

1733−278:22 tight name item

1734−278:27 glyph (

1735−278:28 tight name snip

1736−278:33 name rest

1737−278:37 tight glyph )

1738−278:38 tight glyph ]

1739−280:1 DEDENT

1740−280:1 DEDENT

1741−280:1 DEDENT

1742−280:1 DEDENT

1743−280:1 NEWLINE

1744−280:1 glyph ++

1745−280:4 name rear

1746−280:9 glyph |=

1747−280:12 name xs

1748−280:14 tight glyph =

1749−280:15 tight glyph (

1750−280:16 tight name list

1751−280:21 tvar A

1752−280:22 tight glyph )

1753−281:3 INDENT

1754−281:3 glyph ?-

1755−281:6 name xs

1756−282:5 INDENT

1757−282:5 lit ~

1758−282:7 glyph !!

1759−283:5 NEWLINE

1760−283:5 glyph [

1761−283:6 tight name item

1762−283:11 name rest

1763−283:15 tight glyph ]

1764−284:7 INDENT

1765−284:7 glyph ?-

1766−284:10 name rest

1767−285:9 INDENT

1768−285:9 lit ~

1769−285:11 name item

1770−286:9 NEWLINE

1771−286:9 glyph [

1772−286:10 tight name next

1773−286:15 name more

1774−286:19 tight glyph ]

1775−286:21 glyph (

1776−286:22 tight name rear

1777−286:27 name rest

1778−286:31 tight glyph )

1779−286:32 DEDENT

1780−286:32 DEDENT

1781−286:32 DEDENT

1782−286:32 DEDENT

1783−286:32 NEWLINE

1763+277:9 glyph ?-

1764+277:12 name xs

1765+278:11 INDENT

1766+278:11 lit ~

1767+278:13 lit ~

1768+279:11 NEWLINE

1769+279:11 glyph [

1770+279:12 tight name item

1771+279:17 name rest

1772+279:21 tight glyph ]

1773+280:13 INDENT

1774+280:13 glyph ?-

1775+280:16 glyph (

1776+280:17 tight name f

1777+280:19 name item

1778+280:23 tight glyph )

1779+281:15 INDENT

1780+281:15 lit ~

1781+281:17 glyph (

1782+281:18 tight name murn

1783+281:23 name rest

1784+281:28 name f

1785+281:29 tight glyph )

1786+282:15 NEWLINE

1787+282:15 glyph [

1788+282:16 tight lit ~

1789+282:18 name value

1790+282:23 tight glyph ]

1791+282:25 glyph [

1792+282:26 tight name value

1793+282:32 glyph (

1794+282:33 tight name murn

1795+282:38 name rest

1796+282:43 name f

1797+282:44 tight glyph )

1798+282:45 tight glyph ]

1799+284:1 DEDENT

1800+284:1 DEDENT

1801+284:1 DEDENT

1802+284:1 DEDENT

1803+284:1 DEDENT

1804+284:1 DEDENT

1805+284:1 NEWLINE

1806+284:1 glyph ++

1807+284:4 name join

1808+284:9 glyph |=

1809+284:12 name args

1810+284:16 tight glyph =

1811+284:17 tight glyph [

1812+284:18 tight tvar A

1813+284:20 glyph (

1814+284:21 tight name list

1815+284:26 tvar A

1816+284:27 tight glyph )

1817+284:28 tight glyph ]

1818+285:3 INDENT

1819+285:3 glyph ?-

1820+285:6 name args

1821+286:5 INDENT

1822+286:5 glyph [

1823+286:6 tight name separator

1824+286:16 name xs

1825+286:18 tight glyph ]

1826+286:20 glyph ^-

1827+286:23 glyph (

1828+286:24 tight name list

1829+286:29 tvar A

1830+286:30 tight glyph )

1831+287:9 INDENT

1832+287:9 glyph ?-

1833+287:12 name xs

1834+288:11 INDENT

1835+288:11 lit ~

1836+288:13 lit ~

1837+289:11 NEWLINE

1838+289:11 glyph [

1839+289:12 tight name item

1840+289:17 name rest

1841+289:21 tight glyph ]

1842+290:13 INDENT

1843+290:13 glyph ?-

1844+290:16 name rest

1845+291:15 INDENT

1846+291:15 lit ~

1847+291:17 glyph [

1848+291:18 tight name item

1849+291:23 lit ~

1850+291:24 tight glyph ]

1851+292:15 NEWLINE

1852+292:15 glyph [

1853+292:16 tight name next

1854+292:21 name more

1855+292:25 tight glyph ]

1856+292:27 glyph [

1857+292:28 tight name item

1858+292:33 glyph [

1859+292:34 tight name separator

1860+292:44 glyph (

1861+292:45 tight name join

1862+292:50 name separator

1863+292:60 name rest

1864+292:64 tight glyph )

1865+292:65 tight glyph ]

1866+292:66 tight glyph ]

1867+294:1 DEDENT

1868+294:1 DEDENT

1869+294:1 DEDENT

1870+294:1 DEDENT

1871+294:1 DEDENT

1872+294:1 DEDENT

1873+294:1 NEWLINE

1874+294:1 glyph ++

1875+294:4 name snip

1876+294:9 glyph |=

1877+294:12 name xs

1878+294:14 tight glyph =

1879+294:15 tight glyph (

1880+294:16 tight name list

1881+294:21 tvar A

1882+294:22 tight glyph )

1883+295:3 INDENT

1884+295:3 glyph ^-

1885+295:6 glyph (

1886+295:7 tight name list

1887+295:12 tvar A

1888+295:13 tight glyph )

1889+296:5 INDENT

1890+296:5 glyph ?-

1891+296:8 name xs

1892+297:7 INDENT

1893+297:7 lit ~

1894+297:9 lit ~

1895+298:7 NEWLINE

1896+298:7 glyph [

1897+298:8 tight name item

1898+298:13 name rest

1899+298:17 tight glyph ]

1900+299:9 INDENT

1901+299:9 glyph ?-

1902+299:12 name rest

1903+300:11 INDENT

1904+300:11 lit ~

1905+300:13 lit ~

1906+301:11 NEWLINE

1907+301:11 glyph [

1908+301:12 tight name next

1909+301:17 name more

1910+301:21 tight glyph ]

1911+301:23 glyph [

1912+301:24 tight name item

1913+301:29 glyph (

1914+301:30 tight name snip

1915+301:35 name rest

1916+301:39 tight glyph )

1917+301:40 tight glyph ]

1918+303:1 DEDENT

1919+303:1 DEDENT

1920+303:1 DEDENT

1921+303:1 DEDENT

1922+303:1 DEDENT

1923+303:1 NEWLINE

1924+303:1 glyph ++

1925+303:4 name rear

1926+303:9 glyph |=

1927+303:12 name xs

1928+303:14 tight glyph =

1929+303:15 tight glyph (

1930+303:16 tight name list

1931+303:21 tvar A

1932+303:22 tight glyph )

1933+304:3 INDENT

1934+304:3 glyph ?-

1935+304:6 name xs

1936+305:5 INDENT

1937+305:5 lit ~

1938+305:7 glyph !!

1939+306:5 NEWLINE

1940+306:5 glyph [

1941+306:6 tight name item

1942+306:11 name rest

1943+306:15 tight glyph ]

1944+307:7 INDENT

1945+307:7 glyph ?-

1946+307:10 name rest

1947+308:9 INDENT

1948+308:9 lit ~

1949+308:11 name item

1950+309:9 NEWLINE

1951+309:9 glyph [

1952+309:10 tight name next

1953+309:15 name more

1954+309:19 tight glyph ]

1955+309:21 glyph (

1956+309:22 tight name rear

1957+309:27 name rest

1958+309:31 tight glyph )

1959+311:1 DEDENT

1960+311:1 DEDENT

1961+311:1 DEDENT

1962+311:1 DEDENT

1963+311:1 NEWLINE

1964+311:1 glyph ++

1965+311:4 name cork

1966+311:9 glyph |=

1967+311:12 name gates

1968+311:17 tight glyph =

1969+311:18 tight glyph [

1970+311:19 tight glyph $-(

1971+311:22 tight tvar A

1972+311:24 tvar B

1973+311:25 tight glyph )

1974+311:27 glyph $-(

1975+311:30 tight tvar B

1976+311:32 tvar C

1977+311:33 tight glyph )

1978+311:34 tight glyph ]

1979+312:3 INDENT

1980+312:3 glyph ?-

1981+312:6 name gates

1982+313:5 INDENT

1983+313:5 glyph [

1984+313:6 tight name f

1985+313:8 name g

1986+313:9 tight glyph ]

1987+313:11 glyph |=

1988+313:14 name x

1989+313:15 tight glyph =

1990+313:16 tight tvar A

1991+313:18 glyph (

1992+313:19 tight name g

1993+313:21 glyph (

1994+313:22 tight name f

1995+313:24 name x

1996+313:25 tight glyph )

1997+313:26 tight glyph )

1998+315:1 DEDENT

1999+315:1 DEDENT

2000+315:1 NEWLINE

2001+315:1 glyph ++

2002+315:4 name corl

2003+315:9 glyph |=

2004+315:12 name gates

2005+315:17 tight glyph =

2006+315:18 tight glyph [

2007+315:19 tight glyph $-(

2008+315:22 tight tvar B

2009+315:24 tvar C

2010+315:25 tight glyph )

2011+315:27 glyph $-(

2012+315:30 tight tvar A

2013+315:32 tvar B

2014+315:33 tight glyph )

2015+315:34 tight glyph ]

2016+316:3 INDENT

2017+316:3 glyph ?-

2018+316:6 name gates

2019+317:5 INDENT

2020+317:5 glyph [

2021+317:6 tight name f

2022+317:8 name g

2023+317:9 tight glyph ]

2024+317:11 glyph |=

2025+317:14 name x

2026+317:15 tight glyph =

2027+317:16 tight tvar A

2028+317:18 glyph (

2029+317:19 tight name f

2030+317:21 glyph (

2031+317:22 tight name g

2032+317:24 name x

2033+317:25 tight glyph )

2034+317:26 tight glyph )

2035+319:1 DEDENT

2036+319:1 DEDENT

2037+319:1 NEWLINE

2038+319:1 glyph ++

2039+319:4 name cury

2040+319:9 glyph |=

2041+319:12 name args

2042+319:16 tight glyph =

2043+319:17 tight glyph [

2044+319:18 tight glyph $-(

2045+319:21 tight glyph [

2046+319:22 tight tvar A

2047+319:24 tvar B

2048+319:25 tight glyph ]

2049+319:27 tvar C

2050+319:28 tight glyph )

2051+319:30 tvar A

2052+319:31 tight glyph ]

2053+320:3 INDENT

2054+320:3 glyph ?-

2055+320:6 name args

2056+321:5 INDENT

2057+321:5 glyph [

2058+321:6 tight name f

2059+321:8 name a

2060+321:9 tight glyph ]

2061+321:11 glyph |=

2062+321:14 name b

2063+321:15 tight glyph =

2064+321:16 tight tvar B

2065+321:18 glyph (

2066+321:19 tight name f

2067+321:21 name a

2068+321:23 name b

2069+321:24 tight glyph )

2070+323:1 DEDENT

2071+323:1 DEDENT

2072+323:1 NEWLINE

2073+323:1 glyph ++

2074+323:4 name curr

2075+323:9 glyph |=

2076+323:12 name args

2077+323:16 tight glyph =

2078+323:17 tight glyph [

2079+323:18 tight glyph $-(

2080+323:21 tight glyph [

2081+323:22 tight tvar A

2082+323:24 tvar B

2083+323:25 tight glyph ]

2084+323:27 tvar C

2085+323:28 tight glyph )

2086+323:30 tvar B

2087+323:31 tight glyph ]

2088+324:3 INDENT

2089+324:3 glyph ?-

2090+324:6 name args

2091+325:5 INDENT

2092+325:5 glyph [

2093+325:6 tight name f

2094+325:8 name b

2095+325:9 tight glyph ]

2096+325:11 glyph |=

2097+325:14 name a

2098+325:15 tight glyph =

2099+325:16 tight tvar A

2100+325:18 glyph (

2101+325:19 tight name f

2102+325:21 name a

2103+325:23 name b

2104+325:24 tight glyph )

2105+327:1 DEDENT

2106+327:1 DEDENT

2107+327:1 NEWLINE

2108+327:1 glyph +$

2109+327:4 name cmd

2110+327:8 glyph |$

2111+327:11 glyph [

2112+327:12 tight tvar M

2113+327:13 tight glyph ]

2114+328:3 INDENT

2115+328:3 glyph [

2116+328:4 tight lit %poke

2117+328:10 name p

2118+328:11 tight glyph =

2119+328:12 tight name poke

2120+328:17 name reply

2121+328:22 tight glyph =

2122+328:23 tight glyph $-(

2123+328:26 tight glyph (

2124+328:27 tight name unit

2125+328:32 aura @t

2126+328:34 tight glyph )

2127+328:36 tvar M

2128+328:37 tight glyph )

2129+328:38 tight glyph ]

2130+329:3 NEWLINE

2131+329:3 glyph [

2132+329:4 tight lit %go

2133+329:8 name url

2134+329:11 tight glyph =

2135+329:12 tight aura @t

2136+329:14 tight glyph ]

2137+330:3 NEWLINE

2138+330:3 glyph [

2139+330:4 tight lit %wait

2140+330:10 name gap

2141+330:13 tight glyph =

2142+330:14 tight aura @dr

2143+330:18 name msg

2144+330:21 tight glyph =

2145+330:22 tight tvar M

2146+330:23 tight glyph ]

2147+331:3 NEWLINE

2148+331:3 glyph [

2149+331:4 tight lit %now

2150+331:9 name reply

2151+331:14 tight glyph =

2152+331:15 tight glyph $-(

2153+331:18 tight aura @da

2154+331:22 tvar M

2155+331:23 tight glyph )

2156+331:24 tight glyph ]

2157+332:3 NEWLINE

2158+332:3 glyph [

2159+332:4 tight lit %who

2160+332:9 name reply

2161+332:14 tight glyph =

2162+332:15 tight glyph $-(

2163+332:18 tight aura @p

2164+332:21 tvar M

2165+332:22 tight glyph )

2166+332:23 tight glyph ]

2167+334:1 DEDENT

2168+334:1 NEWLINE

2169+334:1 glyph ++

2170+334:4 name gth

2171+334:8 glyph |=

2172+334:11 name args

2173+334:15 tight glyph =

2174+334:16 tight glyph [

2175+334:17 tight tvar A

2176+334:19 tvar A

2177+334:20 tight glyph ]

2178+334:22 glyph (

2179+334:23 tight wing gth-atom.internal

2180+334:41 name args

2181+334:45 tight glyph )

2182+335:1 NEWLINE

2183+335:1 glyph ++

2184+335:4 name add

2185+335:8 glyph |=

2186+335:11 name args

2187+335:15 tight glyph =

2188+335:16 tight glyph [

2189+335:17 tight tvar A

2190+335:19 tvar A

2191+335:20 tight glyph ]

2192+335:22 glyph (

2193+335:23 tight wing add-atom.internal

2194+335:41 name args

2195+335:45 tight glyph )

2196+336:1 NEWLINE

2197+336:1 glyph ++

2198+336:4 name dec

2199+336:8 glyph |=

2200+336:11 name atom

2201+336:15 tight glyph =

2202+336:16 tight tvar A

2203+336:18 glyph (

2204+336:19 tight wing dec-atom.internal

2205+336:37 name atom

2206+336:41 tight glyph )

2207+338:1 NEWLINE

2208+338:1 glyph +$

2209+338:4 name ask

2210+338:8 glyph |$

2211+338:11 glyph [

2212+338:12 tight tvar M

2213+338:13 tight glyph ]

2214+338:15 glyph (

2215+338:16 tight wing ask.internal

2216+338:29 tvar M

2217+338:30 tight glyph )

2218+339:1 NEWLINE

2219+339:1 glyph ++

2220+339:4 name pure

2221+339:9 glyph |=

2222+339:12 name x

2223+339:13 tight glyph =

2224+339:14 tight tvar M

2225+339:16 glyph ^-

2226+339:19 glyph (

2227+339:20 tight name ask

2228+339:24 tvar M

2229+339:25 tight glyph )

2230+339:27 glyph [

2231+339:28 tight lit %pure

2232+339:34 name x

2233+339:35 tight glyph ]

2234+339:36 NEWLINE

tests/golden/prelude-unit-list-transforms/tree.txt+916−718

@@ -1,553 +1,551 @@

11(module

2− (value 2:1 same

3− (gate 2:9

4− (face 2:12 x (tvar 2:14 A))

5− (wing 2:16 x)))

6− (value 4:1 head

7− (gate 4:9

8− (face 4:12 p

9− (cell 4:14 (tvar 4:15 A) (tvar 4:17 B)))

10− (body 5:3

11− (branch 5:3

12− (wing 5:6 p)

13− (arm 6:5

14− (cell 6:5 (bind 6:6 a) (bind 6:8 b))

15− (wing 6:11 a))))))

16− (value 8:1 tail

17− (gate 8:9

18− (face 8:12 p

19− (cell 8:14 (tvar 8:15 A) (tvar 8:17 B)))

20− (body 9:3

21− (branch 9:3

22− (wing 9:6 p)

23− (arm 10:5

24− (cell 10:5 (bind 10:6 a) (bind 10:8 b))

25− (wing 10:11 b))))))

26− (value 12:1 not

27− (gate 12:8

28− (face 12:11 b (flag 12:13))

29− (body 13:3

30− (branch 13:3

31− (wing 13:6 b)

32− (arm 14:5 (lit 14:5 %.y) (lit 14:9 %.n))

33− (arm 15:5 (lit 15:5 %.n) (lit 15:9 %.y))))))

34− (mold 17:1 list

35− (generic 17:9 A

36− (union 18:3

37− (const 18:3 ~)

38− (cell 19:3

39− (face 19:4 i (tvar 19:6 A))

40− (face 19:8 t

41− (apply 19:10 list (tvar 19:16 A)))))))

42− (mold 21:1 unit

43− (generic 21:9 A

44− (union 22:3

45− (const 22:3 ~)

46− (cell 23:3

47− (const 23:4 ~)

48− (face 23:6 u (tvar 23:8 A))))))

49− (value 25:1 fall

50− (gate 25:9

51− (face 25:12 args

52− (cell 25:17

53− (apply 25:18 unit (tvar 25:24 A))

54− (tvar 25:27 A)))

55− (body 26:3

56− (branch 26:3

57− (wing 26:6 args)

58− (arm 27:5

59− (cell 27:5 (bind 27:6 maybe) (bind 27:12 fallback))

60− (body 28:7

61− (branch 28:7

62− (wing 28:10 maybe)

63− (arm 29:9 (lit 29:9 ~) (wing 29:11 fallback))

64− (arm 30:9

65− (cell 30:9 (lit 30:10 ~) (bind 30:12 value))

66− (wing 30:19 value)))))))))

67− (value 32:1 need

68− (gate 32:9

69− (face 32:12 maybe

70− (apply 32:18 unit (tvar 32:24 A)))

71− (body 33:3

72− (branch 33:3

73− (wing 33:6 maybe)

74− (arm 34:5 (lit 34:5 ~) (crash 34:7))

75− (arm 35:5

76− (cell 35:5 (lit 35:6 ~) (bind 35:8 value))

77− (wing 35:15 value))))))

78− (value 37:1 weld

2+ (jibb 1:1 internal /lib/jibb/internal)

3+ (mold 2:1 poke (ref 2:9 poke.internal))

4+ (mold 3:1 qath (ref 3:9 qath.internal))

5+ (value 7:1 same

6+ (gate 7:9

7+ (face 7:12 x (tvar 7:14 A))

8+ (wing 7:16 x)))

9+ (value 9:1 head

10+ (gate 9:9

11+ (face 9:12 p

12+ (cell 9:14 (tvar 9:15 A) (tvar 9:17 B)))

13+ (body 10:3

14+ (branch 10:3

15+ (wing 10:6 p)

16+ (arm 11:5

17+ (cell 11:5 (bind 11:6 a) (bind 11:8 b))

18+ (wing 11:11 a))))))

19+ (value 13:1 tail

20+ (gate 13:9

21+ (face 13:12 p

22+ (cell 13:14 (tvar 13:15 A) (tvar 13:17 B)))

23+ (body 14:3

24+ (branch 14:3

25+ (wing 14:6 p)

26+ (arm 15:5

27+ (cell 15:5 (bind 15:6 a) (bind 15:8 b))

28+ (wing 15:11 b))))))

29+ (value 17:1 not

30+ (gate 17:8

31+ (face 17:11 b (flag 17:13))

32+ (body 18:3

33+ (branch 18:3

34+ (wing 18:6 b)

35+ (arm 19:5 (lit 19:5 %.y) (lit 19:9 %.n))

36+ (arm 20:5 (lit 20:5 %.n) (lit 20:9 %.y))))))

37+ (mold 22:1 list

38+ (generic 22:9 A

39+ (union 23:3

40+ (const 23:3 ~)

41+ (cell 24:3

42+ (face 24:4 i (tvar 24:6 A))

43+ (face 24:8 t

44+ (apply 24:10 list (tvar 24:16 A)))))))

45+ (mold 26:1 unit

46+ (generic 26:9 A

47+ (union 27:3

48+ (const 27:3 ~)

49+ (cell 28:3

50+ (const 28:4 ~)

51+ (face 28:6 u (tvar 28:8 A))))))

52+ (value 30:1 fall

53+ (gate 30:9

54+ (face 30:12 args

55+ (cell 30:17

56+ (apply 30:18 unit (tvar 30:24 A))

57+ (tvar 30:27 A)))

58+ (body 31:3

59+ (branch 31:3

60+ (wing 31:6 args)

61+ (arm 32:5

62+ (cell 32:5 (bind 32:6 maybe) (bind 32:12 fallback))

63+ (body 33:7

64+ (branch 33:7

65+ (wing 33:10 maybe)

66+ (arm 34:9 (lit 34:9 ~) (wing 34:11 fallback))

67+ (arm 35:9

68+ (cell 35:9 (lit 35:10 ~) (bind 35:12 value))

69+ (wing 35:19 value)))))))))

70+ (value 37:1 need

7971 (gate 37:9

80− (face 37:12 args

81− (cell 37:17

82− (apply 37:18 list (tvar 37:24 A))

83− (apply 37:27 list (tvar 37:33 A))))

72+ (face 37:12 maybe

73+ (apply 37:18 unit (tvar 37:24 A)))

8474 (body 38:3

8575 (branch 38:3

86− (wing 38:6 args)

87− (arm 39:5

88− (cell 39:5 (bind 39:6 xs) (bind 39:9 ys))

89− (body 40:7

90− (cast 40:7

91− (apply 40:10 list (tvar 40:16 A))

92− (body 41:9

93− (branch 41:9

94− (wing 41:12 xs)

95− (arm 42:11 (lit 42:11 ~) (wing 42:13 ys))

96− (arm 43:11

97− (cell 43:11 (bind 43:12 item) (bind 43:17 rest))

98− (tuple 43:23

99− (wing 43:24 item)

100− (group 43:29

101− (call 43:30 (wing 43:30 weld) (wing 43:35 rest) (wing 43:40 ys))))))))))))))

102− (value 45:1 turn

103− (gate 45:9

104− (face 45:12 args

105− (cell 45:17

106− (apply 45:18 list (tvar 45:24 A))

107− (fn 45:27 (tvar 45:30 A) (tvar 45:32 B))))

108− (body 46:3

109− (branch 46:3

110− (wing 46:6 args)

111− (arm 47:5

112− (cell 47:5 (bind 47:6 xs) (bind 47:9 f))

113− (body 48:7

114− (cast 48:7

115− (apply 48:10 list (tvar 48:16 B))

116− (body 49:9

117− (branch 49:9

118− (wing 49:12 xs)

119− (arm 50:11 (lit 50:11 ~) (lit 50:13 ~))

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))))))))))))))

127− (mold 53:1 dime

128− (cell 53:9

129− (face 53:10 p (aura 53:12 @ta))

130− (face 53:16 q (aura 53:18 @))))

131− (mold 55:1 hair

132− (cell 55:9

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

138− (cell 57:12

139− (face 57:13 p (aura 57:15 @))

140− (face 57:17 q (aura 57:19 @))))

141− (face 57:22 q

142− (cell 57:24

143− (face 57:25 p (aura 57:27 @))

144− (face 57:29 q (aura 57:31 @))))))

145− (mold 59:1 coin

146− (union 60:3

147− (cell 60:3

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)

155− (face 62:10 p

156− (apply 62:12 list (ref 62:18 coin))))))

157− (mold 64:1 pair

158− (generic 64:9 A B

159− (cell 64:18

160− (face 64:19 p (tvar 64:21 A))

161− (face 64:23 q (tvar 64:25 B)))))

162− (mold 66:1 trel

163− (generic 66:9 A B C

164− (cell 66:20

165− (face 66:21 p (tvar 66:23 A))

166− (face 66:25 q (tvar 66:27 B))

167− (face 66:29 r (tvar 66:31 C)))))

168− (mold 68:1 qual

169− (generic 68:9 A B C D

170− (cell 68:22

171− (face 68:23 p (tvar 68:25 A))

172− (face 68:27 q (tvar 68:29 B))

173− (face 68:31 r (tvar 68:33 C))

174− (face 68:35 s (tvar 68:37 D)))))

175− (mold 70:1 cord (aura 70:9 @t))

176− (mold 72:1 knot (aura 72:9 @ta))

177− (mold 74:1 tape

178− (apply 74:9 list (aura 74:15 @tD)))

179− (mold 76:1 path

180− (apply 76:9 list (ref 76:15 knot)))

181− (mold 78:1 tank

182− (union 79:3

183− (ref 79:3 cord)

184− (cell 80:3

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)

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

200− (cell 84:9

201− (face 84:10 p (ref 84:12 hair))

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

207− (apply 86:19 unit

208− (cell 86:25

209− (face 86:26 p (noun 86:28))

210− (face 86:30 q (ref 86:32 nail)))))))

211− (mold 88:1 rule

212− (fn 88:9 (ref 88:12 nail) (ref 88:17 edge)))

213− (mold 90:1 spot

214− (cell 90:9

215− (face 90:10 p (ref 90:12 path))

216− (face 90:17 q (ref 90:19 pint))))

217− (mold 92:1 toon

218− (union 93:3

219− (cell 93:3

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)

227− (face 95:7 p

228− (apply 95:9 list (ref 95:15 tank))))))

229− (mold 97:1 like

230− (generic 97:9 A

231− (cell 97:16

232− (face 97:17 p (ref 97:19 hair))

233− (face 97:24 q

234− (apply 97:26 unit

235− (cell 97:32

236− (face 97:33 p (tvar 97:35 A))

237− (face 97:37 q (ref 97:39 nail))))))))

238− (value 99:1 wonk

239− (gate 99:9

240− (face 99:12 veq

241− (apply 99:16 like (tvar 99:22 A)))

242− (body 100:3

243− (branch 100:3

244− (wing 100:6 q.veq)

245− (arm 101:5 (lit 101:5 ~) (crash 101:7))

246− (arm 102:5

247− (cell 102:5 (lit 102:6 ~) (bind 102:8 product))

248− (wing 102:17 p.product))))))

249− (mold 104:1 lone

250− (generic 104:9 A

251− (cell 104:16

252− (face 104:17 p (tvar 104:19 A)))))

253− (mold 106:1 lest

254− (generic 106:9 A

255− (cell 106:16

256− (face 106:17 i (tvar 106:19 A))

257− (face 106:21 t

258− (apply 106:23 list (tvar 106:29 A))))))

259− (mold 108:1 pole

260− (generic 108:9 A

261− (union 109:3

262− (const 109:3 ~)

263− (cell 110:3

264− (tvar 110:4 A)

265− (apply 110:6 pole (tvar 110:12 A))))))

266− (mold 112:1 quip

267− (generic 112:9 A B

268− (cell 112:18

269− (apply 112:19 list (tvar 112:25 A))

270− (tvar 112:28 B))))

271− (mold 114:1 tree

272− (generic 114:9 A

273− (union 115:3

274− (const 115:3 ~)

275− (cell 116:3

276− (face 116:4 n (tvar 116:6 A))

277− (face 116:8 l

278− (apply 116:10 tree (tvar 116:16 A)))

279− (face 116:19 r

280− (apply 116:21 tree (tvar 116:27 A)))))))

281− (mold 118:1 each

282− (generic 118:9 A B

283− (union 119:3

284− (cell 119:3

285− (const 119:4 %|)

286− (face 119:7 p (tvar 119:9 B)))

287− (cell 120:3

288− (const 120:4 %&)

289− (face 120:7 p (tvar 120:9 A))))))

290− (mold 122:1 bloq (aura 122:9 @))

291− (value 124:1 some

292− (gate 124:9

293− (face 124:12 item (tvar 124:17 A))

294− (unit 124:19 (wing 124:20 item))))

295− (value 126:1 lure

296− (gate 126:9

297− (face 126:12 item (tvar 126:17 A))

298− (body 127:3

299− (cast 127:3

300− (apply 127:6 list (tvar 127:12 A))

301− (tuple 127:15 (wing 127:16 item) (lit 127:21 ~))))))

302− (value 129:1 snoc

303− (gate 129:9

304− (face 129:12 args

305− (cell 129:17

306− (apply 129:18 list (tvar 129:24 A))

307− (tvar 129:27 A)))

308− (body 130:3

309− (branch 130:3

310− (wing 130:6 args)

311− (arm 131:5

312− (cell 131:5 (bind 131:6 xs) (bind 131:9 item))

313− (group 131:15

314− (call 131:16

315− (wing 131:16 weld)

316− (wing 131:21 xs)

317− (tuple 131:24 (wing 131:25 item) (lit 131:30 ~)))))))))

318− (value 133:1 flop

319− (gate 133:9

320− (face 133:12 xs

321− (apply 133:15 list (tvar 133:21 A)))

322− (body 134:3

323− (value 134:3 reverse-into

324− (gate 134:19

325− (face 134:22 args

326− (cell 134:27

327− (apply 134:28 list (tvar 134:34 A))

328− (apply 134:37 list (tvar 134:43 A))))

329− (body 135:5

330− (branch 135:5

331− (wing 135:8 args)

332− (arm 136:7

333− (cell 136:7 (bind 136:8 rest) (bind 136:13 acc))

334− (body 137:9

335− (branch 137:9

336− (wing 137:12 rest)

337− (arm 138:11 (lit 138:11 ~) (wing 138:13 acc))

338− (arm 139:11

339− (cell 139:11 (bind 139:12 item) (bind 139:17 more))

340− (group 139:23

341− (call 139:24

342− (wing 139:24 reverse-into)

343− (wing 139:37 more)

344− (tuple 139:42 (wing 139:43 item) (wing 139:48 acc))))))))))))

345− (group 140:3

346− (call 140:4 (wing 140:4 reverse-into) (wing 140:17 xs) (lit 140:20 ~))))))

347− (value 142:1 drop

76+ (wing 38:6 maybe)

77+ (arm 39:5 (lit 39:5 ~) (crash 39:7))

78+ (arm 40:5

79+ (cell 40:5 (lit 40:6 ~) (bind 40:8 value))

80+ (wing 40:15 value))))))

81+ (value 42:1 weld

82+ (gate 42:9

83+ (face 42:12 args

84+ (cell 42:17

85+ (apply 42:18 list (tvar 42:24 A))

86+ (apply 42:27 list (tvar 42:33 A))))

87+ (body 43:3

88+ (branch 43:3

89+ (wing 43:6 args)

90+ (arm 44:5

91+ (cell 44:5 (bind 44:6 xs) (bind 44:9 ys))

92+ (body 45:7

93+ (cast 45:7

94+ (apply 45:10 list (tvar 45:16 A))

95+ (body 46:9

96+ (branch 46:9

97+ (wing 46:12 xs)

98+ (arm 47:11 (lit 47:11 ~) (wing 47:13 ys))

99+ (arm 48:11

100+ (cell 48:11 (bind 48:12 item) (bind 48:17 rest))

101+ (tuple 48:23

102+ (wing 48:24 item)

103+ (group 48:29

104+ (call 48:30 (wing 48:30 weld) (wing 48:35 rest) (wing 48:40 ys))))))))))))))

105+ (value 50:1 turn

106+ (gate 50:9

107+ (face 50:12 args

108+ (cell 50:17

109+ (apply 50:18 list (tvar 50:24 A))

110+ (fn 50:27 (tvar 50:30 A) (tvar 50:32 B))))

111+ (body 51:3

112+ (branch 51:3

113+ (wing 51:6 args)

114+ (arm 52:5

115+ (cell 52:5 (bind 52:6 xs) (bind 52:9 f))

116+ (body 53:7

117+ (cast 53:7

118+ (apply 53:10 list (tvar 53:16 B))

119+ (body 54:9

120+ (branch 54:9

121+ (wing 54:12 xs)

122+ (arm 55:11 (lit 55:11 ~) (lit 55:13 ~))

123+ (arm 56:11

124+ (cell 56:11 (bind 56:12 item) (bind 56:17 rest))

125+ (tuple 56:23

126+ (group 56:24

127+ (call 56:25 (wing 56:25 f) (wing 56:27 item)))

128+ (group 56:33

129+ (call 56:34 (wing 56:34 turn) (wing 56:39 rest) (wing 56:44 f))))))))))))))

130+ (mold 58:1 dime

131+ (cell 58:9

132+ (face 58:10 p (aura 58:12 @ta))

133+ (face 58:16 q (aura 58:18 @))))

134+ (mold 60:1 hair

135+ (cell 60:9

136+ (face 60:10 p (aura 60:12 @ud))

137+ (face 60:16 q (aura 60:18 @ud))))

138+ (mold 62:1 pint

139+ (cell 62:9

140+ (face 62:10 p

141+ (cell 62:12

142+ (face 62:13 p (aura 62:15 @))

143+ (face 62:17 q (aura 62:19 @))))

144+ (face 62:22 q

145+ (cell 62:24

146+ (face 62:25 p (aura 62:27 @))

147+ (face 62:29 q (aura 62:31 @))))))

148+ (mold 64:1 coin

149+ (union 65:3

150+ (cell 65:3

151+ (const 65:4 %$)

152+ (face 65:7 p (ref 65:9 dime)))

153+ (cell 66:3

154+ (const 66:4 %blob)

155+ (face 66:10 p (noun 66:12)))

156+ (cell 67:3

157+ (const 67:4 %many)

158+ (face 67:10 p

159+ (apply 67:12 list (ref 67:18 coin))))))

160+ (mold 69:1 pair

161+ (generic 69:9 A B

162+ (cell 69:18

163+ (face 69:19 p (tvar 69:21 A))

164+ (face 69:23 q (tvar 69:25 B)))))

165+ (mold 71:1 trel

166+ (generic 71:9 A B C

167+ (cell 71:20

168+ (face 71:21 p (tvar 71:23 A))

169+ (face 71:25 q (tvar 71:27 B))

170+ (face 71:29 r (tvar 71:31 C)))))

171+ (mold 73:1 qual

172+ (generic 73:9 A B C D

173+ (cell 73:22

174+ (face 73:23 p (tvar 73:25 A))

175+ (face 73:27 q (tvar 73:29 B))

176+ (face 73:31 r (tvar 73:33 C))

177+ (face 73:35 s (tvar 73:37 D)))))

178+ (mold 75:1 cord (aura 75:9 @t))

179+ (mold 77:1 knot (aura 77:9 @ta))

180+ (mold 79:1 tape

181+ (apply 79:9 list (aura 79:15 @tD)))

182+ (mold 81:1 path

183+ (apply 81:9 list (ref 81:15 knot)))

184+ (mold 83:1 tank

185+ (union 84:3

186+ (ref 84:3 cord)

187+ (cell 85:3

188+ (const 85:4 %leaf)

189+ (face 85:10 p (ref 85:12 tape)))

190+ (cell 86:3

191+ (const 86:4 %palm)

192+ (face 86:10 p

193+ (apply 86:12 qual (ref 86:18 tape) (ref 86:23 tape) (ref 86:28 tape) (ref 86:33 tape)))

194+ (face 86:39 q

195+ (apply 86:41 list (ref 86:47 tank))))

196+ (cell 87:3

197+ (const 87:4 %rose)

198+ (face 87:10 p

199+ (apply 87:12 trel (ref 87:18 tape) (ref 87:23 tape) (ref 87:28 tape)))

200+ (face 87:34 q

201+ (apply 87:36 list (ref 87:42 tank))))))

202+ (mold 89:1 nail

203+ (cell 89:9

204+ (face 89:10 p (ref 89:12 hair))

205+ (face 89:17 q (ref 89:19 tape))))

206+ (mold 91:1 edge

207+ (cell 91:9

208+ (face 91:10 p (ref 91:12 hair))

209+ (face 91:17 q

210+ (apply 91:19 unit

211+ (cell 91:25

212+ (face 91:26 p (noun 91:28))

213+ (face 91:30 q (ref 91:32 nail)))))))

214+ (mold 93:1 rule

215+ (fn 93:9 (ref 93:12 nail) (ref 93:17 edge)))

216+ (mold 95:1 spot

217+ (cell 95:9

218+ (face 95:10 p (ref 95:12 path))

219+ (face 95:17 q (ref 95:19 pint))))

220+ (mold 97:1 toon

221+ (union 98:3

222+ (cell 98:3

223+ (const 98:4 %0)

224+ (face 98:7 p (noun 98:9)))

225+ (cell 99:3

226+ (const 99:4 %1)

227+ (face 99:7 p (noun 99:9)))

228+ (cell 100:3

229+ (const 100:4 %2)

230+ (face 100:7 p

231+ (apply 100:9 list (ref 100:15 tank))))))

232+ (mold 102:1 like

233+ (generic 102:9 A

234+ (cell 102:16

235+ (face 102:17 p (ref 102:19 hair))

236+ (face 102:24 q

237+ (apply 102:26 unit

238+ (cell 102:32

239+ (face 102:33 p (tvar 102:35 A))

240+ (face 102:37 q (ref 102:39 nail))))))))

241+ (value 104:1 like

242+ (gate 104:9

243+ (cell 104:12

244+ (face 104:13 f

245+ (fn 104:15 (tvar 104:18 A) (tvar 104:20 B)))

246+ (face 104:23 result

247+ (apply 104:30 like (tvar 104:36 A))))

248+ (body 105:3

249+ (value 105:3 mapped

250+ (body 106:5

251+ (cast 106:5

252+ (apply 106:8 unit

253+ (cell 106:14

254+ (face 106:15 p (tvar 106:17 B))

255+ (face 106:19 q (ref 106:21 nail))))

256+ (body 107:7

257+ (branch 107:7

258+ (wing 107:10 q.result)

259+ (arm 108:9 (lit 108:9 ~) (lit 108:11 ~))

260+ (arm 109:9

261+ (cell 109:9 (lit 109:10 ~) (bind 109:12 value))

262+ (unit 109:19

263+ (tuple 109:20

264+ (face 109:21 p

265+ (group 109:23

266+ (call 109:24 (wing 109:24 f) (wing 109:26 p.value))))

267+ (face 109:35 q (wing 109:37 q.value))))))))))

268+ (cast 110:3

269+ (apply 110:6 like (tvar 110:12 B))

270+ (tuple 110:15

271+ (face 110:16 p (wing 110:18 p.result))

272+ (face 110:27 q (wing 110:29 mapped)))))))

273+ (value 112:1 wonk

274+ (gate 112:9

275+ (face 112:12 veq

276+ (apply 112:16 like (tvar 112:22 A)))

277+ (body 113:3

278+ (branch 113:3

279+ (wing 113:6 q.veq)

280+ (arm 114:5 (lit 114:5 ~) (crash 114:7))

281+ (arm 115:5

282+ (cell 115:5 (lit 115:6 ~) (bind 115:8 product))

283+ (wing 115:17 p.product))))))

284+ (mold 117:1 lone

285+ (generic 117:9 A

286+ (cell 117:16

287+ (face 117:17 p (tvar 117:19 A)))))

288+ (mold 119:1 lest

289+ (generic 119:9 A

290+ (cell 119:16

291+ (face 119:17 i (tvar 119:19 A))

292+ (face 119:21 t

293+ (apply 119:23 list (tvar 119:29 A))))))

294+ (mold 121:1 pole

295+ (generic 121:9 A

296+ (union 122:3

297+ (const 122:3 ~)

298+ (cell 123:3

299+ (tvar 123:4 A)

300+ (apply 123:6 pole (tvar 123:12 A))))))

301+ (mold 125:1 quip

302+ (generic 125:9 A B

303+ (cell 125:18

304+ (apply 125:19 list (tvar 125:25 A))

305+ (tvar 125:28 B))))

306+ (mold 127:1 tree

307+ (generic 127:9 A

308+ (union 128:3

309+ (const 128:3 ~)

310+ (cell 129:3

311+ (face 129:4 n (tvar 129:6 A))

312+ (face 129:8 l

313+ (apply 129:10 tree (tvar 129:16 A)))

314+ (face 129:19 r

315+ (apply 129:21 tree (tvar 129:27 A)))))))

316+ (mold 131:1 each

317+ (generic 131:9 A B

318+ (union 132:3

319+ (cell 132:3

320+ (const 132:4 %|)

321+ (face 132:7 p (tvar 132:9 B)))

322+ (cell 133:3

323+ (const 133:4 %&)

324+ (face 133:7 p (tvar 133:9 A))))))

325+ (mold 135:1 bloq (aura 135:9 @))

326+ (value 137:1 some

327+ (gate 137:9

328+ (face 137:12 item (tvar 137:17 A))

329+ (unit 137:19 (wing 137:20 item))))

330+ (value 139:1 lure

331+ (gate 139:9

332+ (face 139:12 item (tvar 139:17 A))

333+ (body 140:3

334+ (cast 140:3

335+ (apply 140:6 list (tvar 140:12 A))

336+ (tuple 140:15 (wing 140:16 item) (lit 140:21 ~))))))

337+ (value 142:1 snoc

348338 (gate 142:9

349− (face 142:12 maybe

350− (apply 142:18 unit (tvar 142:24 A)))

339+ (face 142:12 args

340+ (cell 142:17

341+ (apply 142:18 list (tvar 142:24 A))

342+ (tvar 142:27 A)))

351343 (body 143:3

352344 (branch 143:3

353− (wing 143:6 maybe)

354− (arm 144:5 (lit 144:5 ~) (lit 144:7 ~))

355− (arm 145:5

356− (cell 145:5 (lit 145:6 ~) (bind 145:8 value))

357− (tuple 145:15 (wing 145:16 value) (lit 145:22 ~)))))))

358− (value 147:1 bind

359− (gate 147:9

360− (face 147:12 args

361− (cell 147:17

362− (apply 147:18 unit (tvar 147:24 A))

363− (fn 147:27 (tvar 147:30 A) (tvar 147:32 B))))

364− (body 148:3

365− (branch 148:3

366− (wing 148:6 args)

367− (arm 149:5

368− (cell 149:5 (bind 149:6 maybe) (bind 149:12 f))

369− (cast 149:15

370− (apply 149:18 unit (tvar 149:24 B))

371− (body 150:7

372− (branch 150:7

373− (wing 150:10 maybe)

374− (arm 151:9 (lit 151:9 ~) (lit 151:11 ~))

375− (arm 152:9

376− (cell 152:9 (lit 152:10 ~) (bind 152:12 value))

377− (unit 152:19

378− (group 152:20

379− (call 152:21 (wing 152:21 f) (wing 152:23 value)))))))))))))

380− (value 154:1 biff

381− (gate 154:9

382− (face 154:12 args

383− (cell 154:17

384− (apply 154:18 unit (tvar 154:24 A))

385− (fn 154:27

386− (tvar 154:30 A)

387− (apply 154:32 unit (tvar 154:38 B)))))

388− (body 155:3

389− (branch 155:3

390− (wing 155:6 args)

391− (arm 156:5

392− (cell 156:5 (bind 156:6 maybe) (bind 156:12 f))

393− (cast 156:15

394− (apply 156:18 unit (tvar 156:24 B))

395− (body 157:7

396− (branch 157:7

397− (wing 157:10 maybe)

398− (arm 158:9 (lit 158:9 ~) (lit 158:11 ~))

399− (arm 159:9

400− (cell 159:9 (lit 159:10 ~) (bind 159:12 value))

401− (group 159:19

402− (call 159:20 (wing 159:20 f) (wing 159:22 value))))))))))))

403− (value 161:1 both

345+ (wing 143:6 args)

346+ (arm 144:5

347+ (cell 144:5 (bind 144:6 xs) (bind 144:9 item))

348+ (group 144:15

349+ (call 144:16

350+ (wing 144:16 weld)

351+ (wing 144:21 xs)

352+ (tuple 144:24 (wing 144:25 item) (lit 144:30 ~)))))))))

353+ (value 146:1 flop

354+ (gate 146:9

355+ (face 146:12 xs

356+ (apply 146:15 list (tvar 146:21 A)))

357+ (body 147:3

358+ (value 147:3 reverse-into

359+ (gate 147:19

360+ (face 147:22 args

361+ (cell 147:27

362+ (apply 147:28 list (tvar 147:34 A))

363+ (apply 147:37 list (tvar 147:43 A))))

364+ (body 148:5

365+ (branch 148:5

366+ (wing 148:8 args)

367+ (arm 149:7

368+ (cell 149:7 (bind 149:8 rest) (bind 149:13 acc))

369+ (body 150:9

370+ (branch 150:9

371+ (wing 150:12 rest)

372+ (arm 151:11 (lit 151:11 ~) (wing 151:13 acc))

373+ (arm 152:11

374+ (cell 152:11 (bind 152:12 item) (bind 152:17 more))

375+ (group 152:23

376+ (call 152:24

377+ (wing 152:24 reverse-into)

378+ (wing 152:37 more)

379+ (tuple 152:42 (wing 152:43 item) (wing 152:48 acc))))))))))))

380+ (group 153:3

381+ (call 153:4 (wing 153:4 reverse-into) (wing 153:17 xs) (lit 153:20 ~))))))

382+ (value 155:1 drop

383+ (gate 155:9

384+ (face 155:12 maybe

385+ (apply 155:18 unit (tvar 155:24 A)))

386+ (body 156:3

387+ (cast 156:3

388+ (apply 156:6 list (tvar 156:12 A))

389+ (body 157:5

390+ (branch 157:5

391+ (wing 157:8 maybe)

392+ (arm 158:7 (lit 158:7 ~) (lit 158:9 ~))

393+ (arm 159:7

394+ (cell 159:7 (lit 159:8 ~) (bind 159:10 value))

395+ (tuple 159:17 (wing 159:18 value) (lit 159:24 ~)))))))))

396+ (value 161:1 bond

404397 (gate 161:9

405− (face 161:12 args

406− (cell 161:17

407− (apply 161:18 unit (tvar 161:24 A))

408− (apply 161:27 unit (tvar 161:33 B))))

398+ (face 161:12 fallback

399+ (fn 161:21 (const 161:24 ~) (tvar 161:26 A)))

409400 (body 162:3

410− (branch 162:3

411− (wing 162:6 args)

412− (arm 163:5

413− (cell 163:5 (bind 163:6 first) (bind 163:12 second))

414− (cast 163:20

415− (apply 163:23 unit

416− (cell 163:29 (tvar 163:30 A) (tvar 163:32 B)))

417− (body 164:7

418− (branch 164:7

419− (wing 164:10 first)

420− (arm 165:9 (lit 165:9 ~) (lit 165:11 ~))

421− (arm 166:9

422− (cell 166:9 (lit 166:10 ~) (bind 166:12 a))

423− (body 167:11

424− (branch 167:11

425− (wing 167:14 second)

426− (arm 168:13 (lit 168:13 ~) (lit 168:15 ~))

427− (arm 169:13

428− (cell 169:13 (lit 169:14 ~) (bind 169:16 b))

429− (unit 169:19

430− (tuple 169:20 (wing 169:21 a) (wing 169:23 b)))))))))))))))

431− (value 171:1 clap

432− (gate 171:9

433− (face 171:12 args

434− (cell 171:17

435− (apply 171:18 unit (tvar 171:24 A))

436− (apply 171:27 unit (tvar 171:33 A))

437− (fn 171:36

438− (cell 171:39 (tvar 171:40 A) (tvar 171:42 A))

439− (tvar 171:45 A))))

440− (body 172:3

441− (branch 172:3

442− (wing 172:6 args)

443− (arm 173:5

444− (cell 173:5 (bind 173:6 first) (bind 173:12 second) (bind 173:19 combine))

445− (body 174:7

446− (branch 174:7

447− (wing 174:10 first)

448− (arm 175:9 (lit 175:9 ~) (wing 175:11 second))

449− (arm 176:9

450− (cell 176:9 (lit 176:10 ~) (bind 176:12 a))

451− (body 177:11

452− (branch 177:11

453− (wing 177:14 second)

454− (arm 178:13 (lit 178:13 ~) (wing 178:15 first))

455− (arm 179:13

456− (cell 179:13 (lit 179:14 ~) (bind 179:16 b))

457− (unit 179:19

458− (group 179:20

459− (call 179:21 (wing 179:21 combine) (wing 179:29 a) (wing 179:31 b)))))))))))))))

460− (value 181:1 clef

401+ (gate 162:3

402+ (face 162:6 maybe

403+ (apply 162:12 unit (tvar 162:18 A)))

404+ (body 163:5

405+ (branch 163:5

406+ (wing 163:8 maybe)

407+ (arm 164:7

408+ (lit 164:7 ~)

409+ (group 164:9

410+ (call 164:10 (wing 164:10 fallback) (lit 164:19 ~))))

411+ (arm 165:7

412+ (cell 165:7 (lit 165:8 ~) (bind 165:10 value))

413+ (wing 165:17 value))))))))

414+ (value 167:1 bind

415+ (gate 167:9

416+ (face 167:12 args

417+ (cell 167:17

418+ (apply 167:18 unit (tvar 167:24 A))

419+ (fn 167:27 (tvar 167:30 A) (tvar 167:32 B))))

420+ (body 168:3

421+ (branch 168:3

422+ (wing 168:6 args)

423+ (arm 169:5

424+ (cell 169:5 (bind 169:6 maybe) (bind 169:12 f))

425+ (cast 169:15

426+ (apply 169:18 unit (tvar 169:24 B))

427+ (body 170:7

428+ (branch 170:7

429+ (wing 170:10 maybe)

430+ (arm 171:9 (lit 171:9 ~) (lit 171:11 ~))

431+ (arm 172:9

432+ (cell 172:9 (lit 172:10 ~) (bind 172:12 value))

433+ (unit 172:19

434+ (group 172:20

435+ (call 172:21 (wing 172:21 f) (wing 172:23 value)))))))))))))

436+ (value 174:1 biff

437+ (gate 174:9

438+ (face 174:12 args

439+ (cell 174:17

440+ (apply 174:18 unit (tvar 174:24 A))

441+ (fn 174:27

442+ (tvar 174:30 A)

443+ (apply 174:32 unit (tvar 174:38 B)))))

444+ (body 175:3

445+ (branch 175:3

446+ (wing 175:6 args)

447+ (arm 176:5

448+ (cell 176:5 (bind 176:6 maybe) (bind 176:12 f))

449+ (cast 176:15

450+ (apply 176:18 unit (tvar 176:24 B))

451+ (body 177:7

452+ (branch 177:7

453+ (wing 177:10 maybe)

454+ (arm 178:9 (lit 178:9 ~) (lit 178:11 ~))

455+ (arm 179:9

456+ (cell 179:9 (lit 179:10 ~) (bind 179:12 value))

457+ (group 179:19

458+ (call 179:20 (wing 179:20 f) (wing 179:22 value))))))))))))

459+ (value 181:1 both

461460 (gate 181:9

462461 (face 181:12 args

463462 (cell 181:17

464463 (apply 181:18 unit (tvar 181:24 A))

465− (apply 181:27 unit (tvar 181:33 B))

466− (fn 181:36

467− (cell 181:39 (tvar 181:40 A) (tvar 181:42 B))

468− (apply 181:45 unit (tvar 181:51 C)))))

464+ (apply 181:27 unit (tvar 181:33 B))))

469465 (body 182:3

470466 (branch 182:3

471467 (wing 182:6 args)

472468 (arm 183:5

473− (cell 183:5 (bind 183:6 first) (bind 183:12 second) (bind 183:19 combine))

474− (body 184:7

475− (branch 184:7

476− (wing 184:10 first)

477− (arm 185:9 (lit 185:9 ~) (lit 185:11 ~))

478− (arm 186:9

479− (cell 186:9 (lit 186:10 ~) (bind 186:12 a))

480− (body 187:11

481− (branch 187:11

482− (wing 187:14 second)

483− (arm 188:13 (lit 188:13 ~) (lit 188:15 ~))

484− (arm 189:13

485− (cell 189:13 (lit 189:14 ~) (bind 189:16 b))

486− (group 189:19

487− (call 189:20 (wing 189:20 combine) (wing 189:28 a) (wing 189:30 b))))))))))))))

488− (value 191:1 skim

469+ (cell 183:5 (bind 183:6 first) (bind 183:12 second))

470+ (cast 183:20

471+ (apply 183:23 unit

472+ (cell 183:29 (tvar 183:30 A) (tvar 183:32 B)))

473+ (body 184:7

474+ (branch 184:7

475+ (wing 184:10 first)

476+ (arm 185:9 (lit 185:9 ~) (lit 185:11 ~))

477+ (arm 186:9

478+ (cell 186:9 (lit 186:10 ~) (bind 186:12 a))

479+ (body 187:11

480+ (branch 187:11

481+ (wing 187:14 second)

482+ (arm 188:13 (lit 188:13 ~) (lit 188:15 ~))

483+ (arm 189:13

484+ (cell 189:13 (lit 189:14 ~) (bind 189:16 b))

485+ (unit 189:19

486+ (tuple 189:20 (wing 189:21 a) (wing 189:23 b)))))))))))))))

487+ (value 191:1 clap

489488 (gate 191:9

490489 (face 191:12 args

491490 (cell 191:17

492− (apply 191:18 list (tvar 191:24 A))

493− (fn 191:27 (tvar 191:30 A) (flag 191:32))))

491+ (apply 191:18 unit (tvar 191:24 A))

492+ (apply 191:27 unit (tvar 191:33 A))

493+ (fn 191:36

494+ (cell 191:39 (tvar 191:40 A) (tvar 191:42 A))

495+ (tvar 191:45 A))))

494496 (body 192:3

495497 (branch 192:3

496498 (wing 192:6 args)

497499 (arm 193:5

498− (cell 193:5 (bind 193:6 xs) (bind 193:9 predicate))

499− (body 194:7

500− (branch 194:7

501− (wing 194:10 xs)

502− (arm 195:9 (lit 195:9 ~) (lit 195:11 ~))

503− (arm 196:9

504− (cell 196:9 (bind 196:10 item) (bind 196:15 rest))

505− (body 197:11

506− (branch 197:11

507− (group 197:14

508− (call 197:15 (wing 197:15 predicate) (wing 197:25 item)))

509− (arm 198:13

510− (lit 198:13 %.y)

511− (tuple 198:17

512− (wing 198:18 item)

513− (group 198:23

514− (call 198:24 (wing 198:24 skim) (wing 198:29 rest) (wing 198:34 predicate)))))

515− (arm 199:13

516− (lit 199:13 %.n)

517− (group 199:17

518− (call 199:18 (wing 199:18 skim) (wing 199:23 rest) (wing 199:28 predicate))))))))))))))

519− (value 201:1 skip

500+ (cell 193:5 (bind 193:6 first) (bind 193:12 second) (bind 193:19 combine))

501+ (cast 193:28

502+ (apply 193:31 unit (tvar 193:37 A))

503+ (body 194:7

504+ (branch 194:7

505+ (wing 194:10 first)

506+ (arm 195:9 (lit 195:9 ~) (wing 195:11 second))

507+ (arm 196:9

508+ (cell 196:9 (lit 196:10 ~) (bind 196:12 a))

509+ (body 197:11

510+ (branch 197:11

511+ (wing 197:14 second)

512+ (arm 198:13 (lit 198:13 ~) (wing 198:15 first))

513+ (arm 199:13

514+ (cell 199:13 (lit 199:14 ~) (bind 199:16 b))

515+ (unit 199:19

516+ (group 199:20

517+ (call 199:21 (wing 199:21 combine) (wing 199:29 a) (wing 199:31 b))))))))))))))))

518+ (value 201:1 clef

520519 (gate 201:9

521520 (face 201:12 args

522521 (cell 201:17

523− (apply 201:18 list (tvar 201:24 A))

524− (fn 201:27 (tvar 201:30 A) (flag 201:32))))

522+ (apply 201:18 unit (tvar 201:24 A))

523+ (apply 201:27 unit (tvar 201:33 B))

524+ (fn 201:36

525+ (cell 201:39 (tvar 201:40 A) (tvar 201:42 B))

526+ (apply 201:45 unit (tvar 201:51 C)))))

525527 (body 202:3

526528 (branch 202:3

527529 (wing 202:6 args)

528530 (arm 203:5

529− (cell 203:5 (bind 203:6 xs) (bind 203:9 predicate))

530− (body 204:7

531− (branch 204:7

532− (wing 204:10 xs)

533− (arm 205:9 (lit 205:9 ~) (lit 205:11 ~))

534− (arm 206:9

535− (cell 206:9 (bind 206:10 item) (bind 206:15 rest))

536− (body 207:11

537− (branch 207:11

538− (group 207:14

539− (call 207:15 (wing 207:15 predicate) (wing 207:25 item)))

540− (arm 208:13

541− (lit 208:13 %.y)

542− (group 208:17

543− (call 208:18 (wing 208:18 skip) (wing 208:23 rest) (wing 208:28 predicate))))

544− (arm 209:13

545− (lit 209:13 %.n)

546− (tuple 209:17

547− (wing 209:18 item)

548− (group 209:23

549− (call 209:24 (wing 209:24 skip) (wing 209:29 rest) (wing 209:34 predicate)))))))))))))))

550− (value 211:1 levy

531+ (cell 203:5 (bind 203:6 first) (bind 203:12 second) (bind 203:19 combine))

532+ (cast 203:28

533+ (apply 203:31 unit (tvar 203:37 C))

534+ (body 204:7

535+ (branch 204:7

536+ (wing 204:10 first)

537+ (arm 205:9 (lit 205:9 ~) (lit 205:11 ~))

538+ (arm 206:9

539+ (cell 206:9 (lit 206:10 ~) (bind 206:12 a))

540+ (body 207:11

541+ (branch 207:11

542+ (wing 207:14 second)

543+ (arm 208:13 (lit 208:13 ~) (lit 208:15 ~))

544+ (arm 209:13

545+ (cell 209:13 (lit 209:14 ~) (bind 209:16 b))

546+ (group 209:19

547+ (call 209:20 (wing 209:20 combine) (wing 209:28 a) (wing 209:30 b)))))))))))))))

548+ (value 211:1 skim

551549 (gate 211:9

552550 (face 211:12 args

553551 (cell 211:17

@@ -558,22 +556,29 @@

558556 (wing 212:6 args)

559557 (arm 213:5

560558 (cell 213:5 (bind 213:6 xs) (bind 213:9 predicate))

561− (body 214:7

562− (branch 214:7

563− (wing 214:10 xs)

564− (arm 215:9 (lit 215:9 ~) (lit 215:11 %.y))

565− (arm 216:9

566− (cell 216:9 (bind 216:10 item) (bind 216:15 rest))

567− (body 217:11

568− (branch 217:11

569− (group 217:14

570− (call 217:15 (wing 217:15 predicate) (wing 217:25 item)))

571− (arm 218:13

572− (lit 218:13 %.y)

573− (group 218:17

574− (call 218:18 (wing 218:18 levy) (wing 218:23 rest) (wing 218:28 predicate))))

575− (arm 219:13 (lit 219:13 %.n) (lit 219:17 %.n))))))))))))

576− (value 221:1 lien

559+ (cast 213:20

560+ (apply 213:23 list (tvar 213:29 A))

561+ (body 214:9

562+ (branch 214:9

563+ (wing 214:12 xs)

564+ (arm 215:11 (lit 215:11 ~) (lit 215:13 ~))

565+ (arm 216:11

566+ (cell 216:11 (bind 216:12 item) (bind 216:17 rest))

567+ (body 217:13

568+ (branch 217:13

569+ (group 217:16

570+ (call 217:17 (wing 217:17 predicate) (wing 217:27 item)))

571+ (arm 218:15

572+ (lit 218:15 %.y)

573+ (tuple 218:19

574+ (wing 218:20 item)

575+ (group 218:25

576+ (call 218:26 (wing 218:26 skim) (wing 218:31 rest) (wing 218:36 predicate)))))

577+ (arm 219:15

578+ (lit 219:15 %.n)

579+ (group 219:19

580+ (call 219:20 (wing 219:20 skim) (wing 219:25 rest) (wing 219:30 predicate)))))))))))))))

581+ (value 221:1 skip

577582 (gate 221:9

578583 (face 221:12 args

579584 (cell 221:17

@@ -584,191 +589,384 @@

584589 (wing 222:6 args)

585590 (arm 223:5

586591 (cell 223:5 (bind 223:6 xs) (bind 223:9 predicate))

587− (body 224:7

588− (branch 224:7

589− (wing 224:10 xs)

590− (arm 225:9 (lit 225:9 ~) (lit 225:11 %.n))

591− (arm 226:9

592− (cell 226:9 (bind 226:10 item) (bind 226:15 rest))

593− (body 227:11

594− (branch 227:11

595− (group 227:14

596− (call 227:15 (wing 227:15 predicate) (wing 227:25 item)))

597− (arm 228:13 (lit 228:13 %.y) (lit 228:17 %.y))

598− (arm 229:13

599− (lit 229:13 %.n)

600− (group 229:17

601− (call 229:18 (wing 229:18 lien) (wing 229:23 rest) (wing 229:28 predicate))))))))))))))

602− (value 231:1 roll

592+ (cast 223:20

593+ (apply 223:23 list (tvar 223:29 A))

594+ (body 224:9

595+ (branch 224:9

596+ (wing 224:12 xs)

597+ (arm 225:11 (lit 225:11 ~) (lit 225:13 ~))

598+ (arm 226:11

599+ (cell 226:11 (bind 226:12 item) (bind 226:17 rest))

600+ (body 227:13

601+ (branch 227:13

602+ (group 227:16

603+ (call 227:17 (wing 227:17 predicate) (wing 227:27 item)))

604+ (arm 228:15

605+ (lit 228:15 %.y)

606+ (group 228:19

607+ (call 228:20 (wing 228:20 skip) (wing 228:25 rest) (wing 228:30 predicate))))

608+ (arm 229:15

609+ (lit 229:15 %.n)

610+ (tuple 229:19

611+ (wing 229:20 item)

612+ (group 229:25

613+ (call 229:26 (wing 229:26 skip) (wing 229:31 rest) (wing 229:36 predicate))))))))))))))))

614+ (value 231:1 levy

603615 (gate 231:9

604616 (face 231:12 args

605617 (cell 231:17

606618 (apply 231:18 list (tvar 231:24 A))

607− (tvar 231:27 B)

608− (fn 231:29

609− (cell 231:32 (tvar 231:33 A) (tvar 231:35 B))

610− (tvar 231:38 B))))

619+ (fn 231:27 (tvar 231:30 A) (flag 231:32))))

611620 (body 232:3

612− (branch 232:3

613− (wing 232:6 args)

614− (arm 233:5

615− (cell 233:5 (bind 233:6 xs) (bind 233:9 start) (bind 233:15 combine))

616− (body 234:7

617− (branch 234:7

618− (wing 234:10 xs)

619− (arm 235:9 (lit 235:9 ~) (wing 235:11 start))

620− (arm 236:9

621− (cell 236:9 (bind 236:10 item) (bind 236:15 rest))

622− (group 236:21

623− (call 236:22

624− (wing 236:22 roll)

625− (wing 236:27 rest)

626− (group 236:32

627− (call 236:33 (wing 236:33 combine) (wing 236:41 item) (wing 236:46 start)))

628− (wing 236:53 combine)))))))))))

629− (value 238:1 reel

630− (gate 238:9

631− (face 238:12 args

632− (cell 238:17

633− (apply 238:18 list (tvar 238:24 A))

634− (tvar 238:27 B)

635− (fn 238:29

636− (cell 238:32 (tvar 238:33 A) (tvar 238:35 B))

637− (tvar 238:38 B))))

638− (body 239:3

639− (branch 239:3

640− (wing 239:6 args)

641− (arm 240:5

642− (cell 240:5 (bind 240:6 xs) (bind 240:9 start) (bind 240:15 combine))

643− (body 241:7

644− (branch 241:7

645− (wing 241:10 xs)

646− (arm 242:9 (lit 242:9 ~) (wing 242:11 start))

647− (arm 243:9

648− (cell 243:9 (bind 243:10 item) (bind 243:15 rest))

649− (group 243:21

650− (call 243:22

651− (wing 243:22 combine)

652− (wing 243:30 item)

653− (group 243:35

654− (call 243:36 (wing 243:36 reel) (wing 243:41 rest) (wing 243:46 start) (wing 243:52 combine)))))))))))))

655− (value 245:1 flit

656− (gate 245:9

657− (face 245:12 predicate

658− (fn 245:22 (tvar 245:25 A) (flag 245:27)))

659− (body 246:3

660− (gate 246:3

661− (face 246:6 value (tvar 246:12 A))

662− (body 247:5

663− (cast 247:5

664− (apply 247:8 unit (tvar 247:14 A))

665− (body 248:7

666− (branch 248:7

667− (group 248:10

668− (call 248:11 (wing 248:11 predicate) (wing 248:21 value)))

669− (arm 249:9

670− (lit 249:9 %.y)

671− (unit 249:13 (wing 249:14 value)))

672− (arm 250:9 (lit 250:9 %.n) (lit 250:13 ~))))))))))

673− (value 252:1 murn

674− (gate 252:9

675− (face 252:12 args

676− (cell 252:17

677− (apply 252:18 list (tvar 252:24 A))

678− (fn 252:27

679− (tvar 252:30 A)

680− (apply 252:32 unit (tvar 252:38 B)))))

681− (body 253:3

682− (branch 253:3

683− (wing 253:6 args)

684− (arm 254:5

685− (cell 254:5 (bind 254:6 xs) (bind 254:9 f))

686− (body 255:7

687− (branch 255:7

688− (wing 255:10 xs)

689− (arm 256:9 (lit 256:9 ~) (lit 256:11 ~))

690− (arm 257:9

691− (cell 257:9 (bind 257:10 item) (bind 257:15 rest))

692− (body 258:11

693− (branch 258:11

694− (group 258:14

695− (call 258:15 (wing 258:15 f) (wing 258:17 item)))

696− (arm 259:13

697− (lit 259:13 ~)

698− (group 259:15

699− (call 259:16 (wing 259:16 murn) (wing 259:21 rest) (wing 259:26 f))))

700− (arm 260:13

701− (cell 260:13 (lit 260:14 ~) (bind 260:16 value))

702− (tuple 260:23

703− (wing 260:24 value)

704− (group 260:30

705− (call 260:31 (wing 260:31 murn) (wing 260:36 rest) (wing 260:41 f)))))))))))))))

706− (value 262:1 join

707− (gate 262:9

708− (face 262:12 args

709− (cell 262:17

710− (tvar 262:18 A)

711− (apply 262:20 list (tvar 262:26 A))))

712− (body 263:3

713− (branch 263:3

714− (wing 263:6 args)

715− (arm 264:5

716− (cell 264:5 (bind 264:6 separator) (bind 264:16 xs))

717− (body 265:7

718− (branch 265:7

719− (wing 265:10 xs)

720− (arm 266:9 (lit 266:9 ~) (lit 266:11 ~))

721− (arm 267:9

722− (cell 267:9 (bind 267:10 item) (bind 267:15 rest))

723− (body 268:11

724− (branch 268:11

725− (wing 268:14 rest)

726− (arm 269:13

727− (lit 269:13 ~)

728− (tuple 269:15 (wing 269:16 item) (lit 269:21 ~)))

729− (arm 270:13

730− (cell 270:13 (bind 270:14 next) (bind 270:19 more))

731− (tuple 270:25

732− (wing 270:26 item)

733− (tuple 270:31

734− (wing 270:32 separator)

735− (group 270:42

736− (call 270:43 (wing 270:43 join) (wing 270:48 separator) (wing 270:58 rest))))))))))))))))

737− (value 272:1 snip

738− (gate 272:9

739− (face 272:12 xs

740− (apply 272:15 list (tvar 272:21 A)))

741− (body 273:3

742− (branch 273:3

743− (wing 273:6 xs)

744− (arm 274:5 (lit 274:5 ~) (lit 274:7 ~))

745− (arm 275:5

746− (cell 275:5 (bind 275:6 item) (bind 275:11 rest))

747− (body 276:7

748− (branch 276:7

749− (wing 276:10 rest)

750− (arm 277:9 (lit 277:9 ~) (lit 277:11 ~))

751− (arm 278:9

752− (cell 278:9 (bind 278:10 next) (bind 278:15 more))

753− (tuple 278:21

754− (wing 278:22 item)

755− (group 278:27

756− (call 278:28 (wing 278:28 snip) (wing 278:33 rest))))))))))))

757− (value 280:1 rear

758− (gate 280:9

759− (face 280:12 xs

760− (apply 280:15 list (tvar 280:21 A)))

761− (body 281:3

762− (branch 281:3

763− (wing 281:6 xs)

764− (arm 282:5 (lit 282:5 ~) (crash 282:7))

765− (arm 283:5

766− (cell 283:5 (bind 283:6 item) (bind 283:11 rest))

767− (body 284:7

768− (branch 284:7

769− (wing 284:10 rest)

770− (arm 285:9 (lit 285:9 ~) (wing 285:11 item))

771− (arm 286:9

772− (cell 286:9 (bind 286:10 next) (bind 286:15 more))

773− (group 286:21

774− (call 286:22 (wing 286:22 rear) (wing 286:27 rest))))))))))))

621+ (cast 232:3

622+ (flag 232:6)

623+ (body 233:5

624+ (branch 233:5

625+ (wing 233:8 args)

626+ (arm 234:7

627+ (cell 234:7 (bind 234:8 xs) (bind 234:11 predicate))

628+ (body 235:9

629+ (branch 235:9

630+ (wing 235:12 xs)

631+ (arm 236:11 (lit 236:11 ~) (lit 236:13 %.y))

632+ (arm 237:11

633+ (cell 237:11 (bind 237:12 item) (bind 237:17 rest))

634+ (body 238:13

635+ (branch 238:13

636+ (group 238:16

637+ (call 238:17 (wing 238:17 predicate) (wing 238:27 item)))

638+ (arm 239:15

639+ (lit 239:15 %.y)

640+ (group 239:19

641+ (call 239:20 (wing 239:20 levy) (wing 239:25 rest) (wing 239:30 predicate))))

642+ (arm 240:15 (lit 240:15 %.n) (lit 240:19 %.n))))))))))))))

643+ (value 242:1 lien

644+ (gate 242:9

645+ (face 242:12 args

646+ (cell 242:17

647+ (apply 242:18 list (tvar 242:24 A))

648+ (fn 242:27 (tvar 242:30 A) (flag 242:32))))

649+ (body 243:3

650+ (cast 243:3

651+ (flag 243:6)

652+ (body 244:5

653+ (branch 244:5

654+ (wing 244:8 args)

655+ (arm 245:7

656+ (cell 245:7 (bind 245:8 xs) (bind 245:11 predicate))

657+ (body 246:9

658+ (branch 246:9

659+ (wing 246:12 xs)

660+ (arm 247:11 (lit 247:11 ~) (lit 247:13 %.n))

661+ (arm 248:11

662+ (cell 248:11 (bind 248:12 item) (bind 248:17 rest))

663+ (body 249:13

664+ (branch 249:13

665+ (group 249:16

666+ (call 249:17 (wing 249:17 predicate) (wing 249:27 item)))

667+ (arm 250:15 (lit 250:15 %.y) (lit 250:19 %.y))

668+ (arm 251:15

669+ (lit 251:15 %.n)

670+ (group 251:19

671+ (call 251:20 (wing 251:20 lien) (wing 251:25 rest) (wing 251:30 predicate))))))))))))))))

672+ (value 253:1 roll

673+ (gate 253:9

674+ (face 253:12 args

675+ (cell 253:17

676+ (apply 253:18 list (tvar 253:24 A))

677+ (tvar 253:27 B)

678+ (fn 253:29

679+ (cell 253:32 (tvar 253:33 A) (tvar 253:35 B))

680+ (tvar 253:38 B))))

681+ (body 254:3

682+ (branch 254:3

683+ (wing 254:6 args)

684+ (arm 255:5

685+ (cell 255:5 (bind 255:6 xs) (bind 255:9 start) (bind 255:15 combine))

686+ (body 256:7

687+ (branch 256:7

688+ (wing 256:10 xs)

689+ (arm 257:9 (lit 257:9 ~) (wing 257:11 start))

690+ (arm 258:9

691+ (cell 258:9 (bind 258:10 item) (bind 258:15 rest))

692+ (group 258:21

693+ (call 258:22

694+ (wing 258:22 roll)

695+ (wing 258:27 rest)

696+ (group 258:32

697+ (call 258:33 (wing 258:33 combine) (wing 258:41 item) (wing 258:46 start)))

698+ (wing 258:53 combine)))))))))))

699+ (value 260:1 reel

700+ (gate 260:9

701+ (face 260:12 args

702+ (cell 260:17

703+ (apply 260:18 list (tvar 260:24 A))

704+ (tvar 260:27 B)

705+ (fn 260:29

706+ (cell 260:32 (tvar 260:33 A) (tvar 260:35 B))

707+ (tvar 260:38 B))))

708+ (body 261:3

709+ (branch 261:3

710+ (wing 261:6 args)

711+ (arm 262:5

712+ (cell 262:5 (bind 262:6 xs) (bind 262:9 start) (bind 262:15 combine))

713+ (body 263:7

714+ (branch 263:7

715+ (wing 263:10 xs)

716+ (arm 264:9 (lit 264:9 ~) (wing 264:11 start))

717+ (arm 265:9

718+ (cell 265:9 (bind 265:10 item) (bind 265:15 rest))

719+ (group 265:21

720+ (call 265:22

721+ (wing 265:22 combine)

722+ (wing 265:30 item)

723+ (group 265:35

724+ (call 265:36 (wing 265:36 reel) (wing 265:41 rest) (wing 265:46 start) (wing 265:52 combine)))))))))))))

725+ (value 267:1 flit

726+ (gate 267:9

727+ (face 267:12 predicate

728+ (fn 267:22 (tvar 267:25 A) (flag 267:27)))

729+ (body 268:3

730+ (gate 268:3

731+ (face 268:6 value (tvar 268:12 A))

732+ (body 269:5

733+ (cast 269:5

734+ (apply 269:8 unit (tvar 269:14 A))

735+ (body 270:7

736+ (branch 270:7

737+ (group 270:10

738+ (call 270:11 (wing 270:11 predicate) (wing 270:21 value)))

739+ (arm 271:9

740+ (lit 271:9 %.y)

741+ (unit 271:13 (wing 271:14 value)))

742+ (arm 272:9 (lit 272:9 %.n) (lit 272:13 ~))))))))))

743+ (value 274:1 murn

744+ (gate 274:9

745+ (face 274:12 args

746+ (cell 274:17

747+ (apply 274:18 list (tvar 274:24 A))

748+ (fn 274:27

749+ (tvar 274:30 A)

750+ (apply 274:32 unit (tvar 274:38 B)))))

751+ (body 275:3

752+ (branch 275:3

753+ (wing 275:6 args)

754+ (arm 276:5

755+ (cell 276:5 (bind 276:6 xs) (bind 276:9 f))

756+ (cast 276:12

757+ (apply 276:15 list (tvar 276:21 B))

758+ (body 277:9

759+ (branch 277:9

760+ (wing 277:12 xs)

761+ (arm 278:11 (lit 278:11 ~) (lit 278:13 ~))

762+ (arm 279:11

763+ (cell 279:11 (bind 279:12 item) (bind 279:17 rest))

764+ (body 280:13

765+ (branch 280:13

766+ (group 280:16

767+ (call 280:17 (wing 280:17 f) (wing 280:19 item)))

768+ (arm 281:15

769+ (lit 281:15 ~)

770+ (group 281:17

771+ (call 281:18 (wing 281:18 murn) (wing 281:23 rest) (wing 281:28 f))))

772+ (arm 282:15

773+ (cell 282:15 (lit 282:16 ~) (bind 282:18 value))

774+ (tuple 282:25

775+ (wing 282:26 value)

776+ (group 282:32

777+ (call 282:33 (wing 282:33 murn) (wing 282:38 rest) (wing 282:43 f))))))))))))))))

778+ (value 284:1 join

779+ (gate 284:9

780+ (face 284:12 args

781+ (cell 284:17

782+ (tvar 284:18 A)

783+ (apply 284:20 list (tvar 284:26 A))))

784+ (body 285:3

785+ (branch 285:3

786+ (wing 285:6 args)

787+ (arm 286:5

788+ (cell 286:5 (bind 286:6 separator) (bind 286:16 xs))

789+ (cast 286:20

790+ (apply 286:23 list (tvar 286:29 A))

791+ (body 287:9

792+ (branch 287:9

793+ (wing 287:12 xs)

794+ (arm 288:11 (lit 288:11 ~) (lit 288:13 ~))

795+ (arm 289:11

796+ (cell 289:11 (bind 289:12 item) (bind 289:17 rest))

797+ (body 290:13

798+ (branch 290:13

799+ (wing 290:16 rest)

800+ (arm 291:15

801+ (lit 291:15 ~)

802+ (tuple 291:17 (wing 291:18 item) (lit 291:23 ~)))

803+ (arm 292:15

804+ (cell 292:15 (bind 292:16 next) (bind 292:21 more))

805+ (tuple 292:27

806+ (wing 292:28 item)

807+ (tuple 292:33

808+ (wing 292:34 separator)

809+ (group 292:44

810+ (call 292:45 (wing 292:45 join) (wing 292:50 separator) (wing 292:60 rest)))))))))))))))))

811+ (value 294:1 snip

812+ (gate 294:9

813+ (face 294:12 xs

814+ (apply 294:15 list (tvar 294:21 A)))

815+ (body 295:3

816+ (cast 295:3

817+ (apply 295:6 list (tvar 295:12 A))

818+ (body 296:5

819+ (branch 296:5

820+ (wing 296:8 xs)

821+ (arm 297:7 (lit 297:7 ~) (lit 297:9 ~))

822+ (arm 298:7

823+ (cell 298:7 (bind 298:8 item) (bind 298:13 rest))

824+ (body 299:9

825+ (branch 299:9

826+ (wing 299:12 rest)

827+ (arm 300:11 (lit 300:11 ~) (lit 300:13 ~))

828+ (arm 301:11

829+ (cell 301:11 (bind 301:12 next) (bind 301:17 more))

830+ (tuple 301:23

831+ (wing 301:24 item)

832+ (group 301:29

833+ (call 301:30 (wing 301:30 snip) (wing 301:35 rest))))))))))))))

834+ (value 303:1 rear

835+ (gate 303:9

836+ (face 303:12 xs

837+ (apply 303:15 list (tvar 303:21 A)))

838+ (body 304:3

839+ (branch 304:3

840+ (wing 304:6 xs)

841+ (arm 305:5 (lit 305:5 ~) (crash 305:7))

842+ (arm 306:5

843+ (cell 306:5 (bind 306:6 item) (bind 306:11 rest))

844+ (body 307:7

845+ (branch 307:7

846+ (wing 307:10 rest)

847+ (arm 308:9 (lit 308:9 ~) (wing 308:11 item))

848+ (arm 309:9

849+ (cell 309:9 (bind 309:10 next) (bind 309:15 more))

850+ (group 309:21

851+ (call 309:22 (wing 309:22 rear) (wing 309:27 rest)))))))))))

852+ (value 311:1 cork

853+ (gate 311:9

854+ (face 311:12 gates

855+ (cell 311:18

856+ (fn 311:19 (tvar 311:22 A) (tvar 311:24 B))

857+ (fn 311:27 (tvar 311:30 B) (tvar 311:32 C))))

858+ (body 312:3

859+ (branch 312:3

860+ (wing 312:6 gates)

861+ (arm 313:5

862+ (cell 313:5 (bind 313:6 f) (bind 313:8 g))

863+ (gate 313:11

864+ (face 313:14 x (tvar 313:16 A))

865+ (group 313:18

866+ (call 313:19

867+ (wing 313:19 g)

868+ (group 313:21

869+ (call 313:22 (wing 313:22 f) (wing 313:24 x)))))))))))

870+ (value 315:1 corl

871+ (gate 315:9

872+ (face 315:12 gates

873+ (cell 315:18

874+ (fn 315:19 (tvar 315:22 B) (tvar 315:24 C))

875+ (fn 315:27 (tvar 315:30 A) (tvar 315:32 B))))

876+ (body 316:3

877+ (branch 316:3

878+ (wing 316:6 gates)

879+ (arm 317:5

880+ (cell 317:5 (bind 317:6 f) (bind 317:8 g))

881+ (gate 317:11

882+ (face 317:14 x (tvar 317:16 A))

883+ (group 317:18

884+ (call 317:19

885+ (wing 317:19 f)

886+ (group 317:21

887+ (call 317:22 (wing 317:22 g) (wing 317:24 x)))))))))))

888+ (value 319:1 cury

889+ (gate 319:9

890+ (face 319:12 args

891+ (cell 319:17

892+ (fn 319:18

893+ (cell 319:21 (tvar 319:22 A) (tvar 319:24 B))

894+ (tvar 319:27 C))

895+ (tvar 319:30 A)))

896+ (body 320:3

897+ (branch 320:3

898+ (wing 320:6 args)

899+ (arm 321:5

900+ (cell 321:5 (bind 321:6 f) (bind 321:8 a))

901+ (gate 321:11

902+ (face 321:14 b (tvar 321:16 B))

903+ (group 321:18

904+ (call 321:19 (wing 321:19 f) (wing 321:21 a) (wing 321:23 b)))))))))

905+ (value 323:1 curr

906+ (gate 323:9

907+ (face 323:12 args

908+ (cell 323:17

909+ (fn 323:18

910+ (cell 323:21 (tvar 323:22 A) (tvar 323:24 B))

911+ (tvar 323:27 C))

912+ (tvar 323:30 B)))

913+ (body 324:3

914+ (branch 324:3

915+ (wing 324:6 args)

916+ (arm 325:5

917+ (cell 325:5 (bind 325:6 f) (bind 325:8 b))

918+ (gate 325:11

919+ (face 325:14 a (tvar 325:16 A))

920+ (group 325:18

921+ (call 325:19 (wing 325:19 f) (wing 325:21 a) (wing 325:23 b)))))))))

922+ (mold 327:1 cmd

923+ (generic 327:8 M

924+ (union 328:3

925+ (cell 328:3

926+ (const 328:4 %poke)

927+ (face 328:10 p (ref 328:12 poke))

928+ (face 328:17 reply

929+ (fn 328:23

930+ (apply 328:26 unit (aura 328:32 @t))

931+ (tvar 328:36 M))))

932+ (cell 329:3

933+ (const 329:4 %go)

934+ (face 329:8 url (aura 329:12 @t)))

935+ (cell 330:3

936+ (const 330:4 %wait)

937+ (face 330:10 gap (aura 330:14 @dr))

938+ (face 330:18 msg (tvar 330:22 M)))

939+ (cell 331:3

940+ (const 331:4 %now)

941+ (face 331:9 reply

942+ (fn 331:15 (aura 331:18 @da) (tvar 331:22 M))))

943+ (cell 332:3

944+ (const 332:4 %who)

945+ (face 332:9 reply

946+ (fn 332:15 (aura 332:18 @p) (tvar 332:21 M)))))))

947+ (value 334:1 gth

948+ (gate 334:8

949+ (face 334:11 args

950+ (cell 334:16 (tvar 334:17 A) (tvar 334:19 A)))

951+ (group 334:22

952+ (call 334:23 (wing 334:23 gth-atom.internal) (wing 334:41 args)))))

953+ (value 335:1 add

954+ (gate 335:8

955+ (face 335:11 args

956+ (cell 335:16 (tvar 335:17 A) (tvar 335:19 A)))

957+ (group 335:22

958+ (call 335:23 (wing 335:23 add-atom.internal) (wing 335:41 args)))))

959+ (value 336:1 dec

960+ (gate 336:8

961+ (face 336:11 atom (tvar 336:16 A))

962+ (group 336:18

963+ (call 336:19 (wing 336:19 dec-atom.internal) (wing 336:37 atom)))))

964+ (mold 338:1 ask

965+ (generic 338:8 M

966+ (apply 338:15 ask.internal (tvar 338:29 M))))

967+ (value 339:1 pure

968+ (gate 339:9

969+ (face 339:12 x (tvar 339:14 M))

970+ (cast 339:16

971+ (apply 339:19 ask (tvar 339:24 M))

972+ (tuple 339:27 (lit 339:28 %pure) (wing 339:34 x))))))

tests/golden/prelude-unit-list-transforms/types.txt+17−3

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

11partial inference; module not checked

2++$ poke: not checked

3++$ qath: not checked

24++ same: $-(A A)

35++ head: $-([A B] A)

46++ tail: $-([A B] B)

@@ -27,6 +29,7 @@ partial inference; module not checked

2729+$ spot: not checked

2830+$ toon: cases proven disjoint; mold not checked

2931+$ like: not checked

32+++ like: sample mold is not supported by partial inference

3033++ wonk: sample mold is not supported by partial inference

3134+$ lone: not checked

3235+$ lest: not checked

@@ -39,12 +42,13 @@ partial inference; module not checked

3942++ lure: cast mold is not supported by partial inference

4043++ snoc: sample mold is not supported by partial inference

4144++ flop: sample mold is not supported by partial inference

42−++ drop: unit branch results need unsupported inference

45+++ drop: cast mold is not supported by partial inference

46+++ bond: $-($-(~ A) $-((unit A) A))

4347++ bind: unit construction needs the standard prelude in partial inference

4448++ biff: $-([(unit A) $-(A (unit B))] (unit B))

4549++ both: unit construction needs the standard prelude in partial inference

46−++ clap: branch pattern is not supported by partial inference

47−++ clef: branch pattern is not supported by partial inference

50+++ clap: unit construction needs the standard prelude in partial inference

51+++ clef: $-([(unit A) [(unit B) $-([A B] (unit C))]] (unit C))

4852++ skim: sample mold is not supported by partial inference

4953++ skip: sample mold is not supported by partial inference

5054++ levy: sample mold is not supported by partial inference

@@ -56,3 +60,13 @@ partial inference; module not checked

5660++ join: sample mold is not supported by partial inference

5761++ snip: sample mold is not supported by partial inference

5862++ rear: sample mold is not supported by partial inference

63+++ cork: $-([$-(A B) $-(B C)] $-(A C))

64+++ corl: $-([$-(A B) $-(C A)] $-(C B))

65+++ cury: $-([$-([A B] C) A] $-(B C))

66+++ curr: $-([$-([A B] C) B] $-(A C))

67++$ cmd: cases proven disjoint; mold not checked

68+++ gth: field access is not supported by partial inference

69+++ add: field access is not supported by partial inference

70+++ dec: field access is not supported by partial inference

71++$ ask: not checked

72+++ pure: cast mold is not supported by partial inference

tests/golden/types-arithmetic-combined/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: docs/spec/grammar.md, Molds, Atoms: "Arithmetic rejects loobean operands: `?` contains only 0 and 1, while an arithmetic result need not."

2+tests: Both inc operand orders retain non-loobean restrictions through aliases, concrete and generic holes, numeric defaulting, pending tags and @/? boundary checks.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-arithmetic-combined/modules.txtnew file+1

@@ -0,0 +1 @@

1+# Opt in to the actual source-backed prelude.

tests/golden/types-arithmetic-combined/source.jibbnew file+56

@@ -0,0 +1,56 @@

1+++ inc |= n=A (add n 1)

2+++ inc-reverse |= n=A (add 1 n)

3+++ inc-decimal ^- @ud (inc 2)

4+++ inc-hex ^- @ux (inc 0x2)

5+++ reverse-decimal ^- @ud (inc-reverse 2)

6+++ reverse-hex ^- @ux (inc-reverse 0x2)

7+++ default (add 1 2)

8+++ decrease-decimal ^- @ud (dec 2)

9+++ decrease-hex ^- @ux (dec 0x2)

10+++ bool-add (add %.n %.n)

11+++ bool-dec (dec %.n)

12+++ bool-reverse (add 1 %.y)

13+++ bool-inc (inc %.y)

14+++ bool-gate |= x=? (inc x)

15+++ bool-result ^- ? (add 1 1)

16+++ compare-bool (gth %.n %.y)

17+++ mixed (add ~zod "hi")

18+++ cells (add [1 2] [3 4])

19+++ distinct |= [a=A b=B] (add a b)

20+++ shared |= [a=A b=A] (add a b)

21+++ capture |= n=A

22+ ++ inner |= x=A (add n 1)

23+ (inner n)

24+++ nested |= n=A |= x=A (add n 1)

25+++ unrelated

26+ ~& %dangling

27+ (add 1 2)

28+++ identity |= x=A x

29+++ identity-bool (identity %.y)

30+++ alias-inc inc

31+++ alias-decimal ^- @ud (alias-inc 2)

32+++ alias-hex ^- @ux (alias-inc 0x2)

33+++ alias-bool (alias-inc %.y)

34+++ explicit-loobean-result |= n=A ^- ? (add n 1)

35+++ any-then-bool |= [x=@ b=?] (add x b)

36+++ bool-then-any |= [b=? x=@] (add b x)

37+++ any-dec |= x=@ (dec x)

38+++ any-plus-number |= x=@ (add x 1)

39+++ number-plus-any |= x=@ (add 1 x)

40+++ any-self |= x=@ (add x x)

41+++ hole-concrete |= n=_ ^- @ud (add n 1)

42+++ hole-written |= n=A ^- _ (add n 1)

43+++ hole-unresolved |= n=_ (add n 1)

44+++ standalone (add 1 2)

45+++ discarded-number

46+ ~& 2

47+ (add 1 2)

48+++ numeric-capture |= x

49+ ++ inner (add x 1)

50+ ^- @ux x

51+++ numeric-capture-reversed |= x

52+ ++ inner (add 1 x)

53+ ^- @ux x

54+++ bound-later |= x=A

55+ ++ inner (add x 1)

56+ x

tests/golden/types-arithmetic-combined/tokens.txtnew file+511

@@ -0,0 +1,511 @@

1+1:1 glyph ++

2+1:4 name inc

3+1:8 glyph |=

4+1:11 name n

5+1:12 tight glyph =

6+1:13 tight tvar A

7+1:15 glyph (

8+1:16 tight name add

9+1:20 name n

10+1:22 lit 1

11+1:23 tight glyph )

12+2:1 NEWLINE

13+2:1 glyph ++

14+2:4 name inc-reverse

15+2:16 glyph |=

16+2:19 name n

17+2:20 tight glyph =

18+2:21 tight tvar A

19+2:23 glyph (

20+2:24 tight name add

21+2:28 lit 1

22+2:30 name n

23+2:31 tight glyph )

24+3:1 NEWLINE

25+3:1 glyph ++

26+3:4 name inc-decimal

27+3:16 glyph ^-

28+3:19 aura @ud

29+3:23 glyph (

30+3:24 tight name inc

31+3:28 lit 2

32+3:29 tight glyph )

33+4:1 NEWLINE

34+4:1 glyph ++

35+4:4 name inc-hex

36+4:12 glyph ^-

37+4:15 aura @ux

38+4:19 glyph (

39+4:20 tight name inc

40+4:24 lit 0x2

41+4:27 tight glyph )

42+5:1 NEWLINE

43+5:1 glyph ++

44+5:4 name reverse-decimal

45+5:20 glyph ^-

46+5:23 aura @ud

47+5:27 glyph (

48+5:28 tight name inc-reverse

49+5:40 lit 2

50+5:41 tight glyph )

51+6:1 NEWLINE

52+6:1 glyph ++

53+6:4 name reverse-hex

54+6:16 glyph ^-

55+6:19 aura @ux

56+6:23 glyph (

57+6:24 tight name inc-reverse

58+6:36 lit 0x2

59+6:39 tight glyph )

60+7:1 NEWLINE

61+7:1 glyph ++

62+7:4 name default

63+7:12 glyph (

64+7:13 tight name add

65+7:17 lit 1

66+7:19 lit 2

67+7:20 tight glyph )

68+8:1 NEWLINE

69+8:1 glyph ++

70+8:4 name decrease-decimal

71+8:21 glyph ^-

72+8:24 aura @ud

73+8:28 glyph (

74+8:29 tight name dec

75+8:33 lit 2

76+8:34 tight glyph )

77+9:1 NEWLINE

78+9:1 glyph ++

79+9:4 name decrease-hex

80+9:17 glyph ^-

81+9:20 aura @ux

82+9:24 glyph (

83+9:25 tight name dec

84+9:29 lit 0x2

85+9:32 tight glyph )

86+10:1 NEWLINE

87+10:1 glyph ++

88+10:4 name bool-add

89+10:13 glyph (

90+10:14 tight name add

91+10:18 lit %.n

92+10:22 lit %.n

93+10:25 tight glyph )

94+11:1 NEWLINE

95+11:1 glyph ++

96+11:4 name bool-dec

97+11:13 glyph (

98+11:14 tight name dec

99+11:18 lit %.n

100+11:21 tight glyph )

101+12:1 NEWLINE

102+12:1 glyph ++

103+12:4 name bool-reverse

104+12:17 glyph (

105+12:18 tight name add

106+12:22 lit 1

107+12:24 lit %.y

108+12:27 tight glyph )

109+13:1 NEWLINE

110+13:1 glyph ++

111+13:4 name bool-inc

112+13:13 glyph (

113+13:14 tight name inc

114+13:18 lit %.y

115+13:21 tight glyph )

116+14:1 NEWLINE

117+14:1 glyph ++

118+14:4 name bool-gate

119+14:14 glyph |=

120+14:17 name x

121+14:18 tight glyph =

122+14:19 tight glyph ?

123+14:21 glyph (

124+14:22 tight name inc

125+14:26 name x

126+14:27 tight glyph )

127+15:1 NEWLINE

128+15:1 glyph ++

129+15:4 name bool-result

130+15:16 glyph ^-

131+15:19 glyph ?

132+15:21 glyph (

133+15:22 tight name add

134+15:26 lit 1

135+15:28 lit 1

136+15:29 tight glyph )

137+16:1 NEWLINE

138+16:1 glyph ++

139+16:4 name compare-bool

140+16:17 glyph (

141+16:18 tight name gth

142+16:22 lit %.n

143+16:26 lit %.y

144+16:29 tight glyph )

145+17:1 NEWLINE

146+17:1 glyph ++

147+17:4 name mixed

148+17:10 glyph (

149+17:11 tight name add

150+17:15 lit ~zod

151+17:20 str "hi"

152+17:24 tight glyph )

153+18:1 NEWLINE

154+18:1 glyph ++

155+18:4 name cells

156+18:10 glyph (

157+18:11 tight name add

158+18:15 glyph [

159+18:16 tight lit 1

160+18:18 lit 2

161+18:19 tight glyph ]

162+18:21 glyph [

163+18:22 tight lit 3

164+18:24 lit 4

165+18:25 tight glyph ]

166+18:26 tight glyph )

167+19:1 NEWLINE

168+19:1 glyph ++

169+19:4 name distinct

170+19:13 glyph |=

171+19:16 glyph [

172+19:17 tight name a

173+19:18 tight glyph =

174+19:19 tight tvar A

175+19:21 name b

176+19:22 tight glyph =

177+19:23 tight tvar B

178+19:24 tight glyph ]

179+19:26 glyph (

180+19:27 tight name add

181+19:31 name a

182+19:33 name b

183+19:34 tight glyph )

184+20:1 NEWLINE

185+20:1 glyph ++

186+20:4 name shared

187+20:11 glyph |=

188+20:14 glyph [

189+20:15 tight name a

190+20:16 tight glyph =

191+20:17 tight tvar A

192+20:19 name b

193+20:20 tight glyph =

194+20:21 tight tvar A

195+20:22 tight glyph ]

196+20:24 glyph (

197+20:25 tight name add

198+20:29 name a

199+20:31 name b

200+20:32 tight glyph )

201+21:1 NEWLINE

202+21:1 glyph ++

203+21:4 name capture

204+21:12 glyph |=

205+21:15 name n

206+21:16 tight glyph =

207+21:17 tight tvar A

208+22:3 INDENT

209+22:3 glyph ++

210+22:6 name inner

211+22:12 glyph |=

212+22:15 name x

213+22:16 tight glyph =

214+22:17 tight tvar A

215+22:19 glyph (

216+22:20 tight name add

217+22:24 name n

218+22:26 lit 1

219+22:27 tight glyph )

220+23:3 NEWLINE

221+23:3 glyph (

222+23:4 tight name inner

223+23:10 name n

224+23:11 tight glyph )

225+24:1 DEDENT

226+24:1 NEWLINE

227+24:1 glyph ++

228+24:4 name nested

229+24:11 glyph |=

230+24:14 name n

231+24:15 tight glyph =

232+24:16 tight tvar A

233+24:18 glyph |=

234+24:21 name x

235+24:22 tight glyph =

236+24:23 tight tvar A

237+24:25 glyph (

238+24:26 tight name add

239+24:30 name n

240+24:32 lit 1

241+24:33 tight glyph )

242+25:1 NEWLINE

243+25:1 glyph ++

244+25:4 name unrelated

245+26:3 INDENT

246+26:3 glyph ~&

247+26:6 lit %dangling

248+27:5 INDENT

249+27:5 glyph (

250+27:6 tight name add

251+27:10 lit 1

252+27:12 lit 2

253+27:13 tight glyph )

254+28:1 DEDENT

255+28:1 DEDENT

256+28:1 NEWLINE

257+28:1 glyph ++

258+28:4 name identity

259+28:13 glyph |=

260+28:16 name x

261+28:17 tight glyph =

262+28:18 tight tvar A

263+28:20 name x

264+29:1 NEWLINE

265+29:1 glyph ++

266+29:4 name identity-bool

267+29:18 glyph (

268+29:19 tight name identity

269+29:28 lit %.y

270+29:31 tight glyph )

271+30:1 NEWLINE

272+30:1 glyph ++

273+30:4 name alias-inc

274+30:14 name inc

275+31:1 NEWLINE

276+31:1 glyph ++

277+31:4 name alias-decimal

278+31:18 glyph ^-

279+31:21 aura @ud

280+31:25 glyph (

281+31:26 tight name alias-inc

282+31:36 lit 2

283+31:37 tight glyph )

284+32:1 NEWLINE

285+32:1 glyph ++

286+32:4 name alias-hex

287+32:14 glyph ^-

288+32:17 aura @ux

289+32:21 glyph (

290+32:22 tight name alias-inc

291+32:32 lit 0x2

292+32:35 tight glyph )

293+33:1 NEWLINE

294+33:1 glyph ++

295+33:4 name alias-bool

296+33:15 glyph (

297+33:16 tight name alias-inc

298+33:26 lit %.y

299+33:29 tight glyph )

300+34:1 NEWLINE

301+34:1 glyph ++

302+34:4 name explicit-loobean-result

303+34:28 glyph |=

304+34:31 name n

305+34:32 tight glyph =

306+34:33 tight tvar A

307+34:35 glyph ^-

308+34:38 glyph ?

309+34:40 glyph (

310+34:41 tight name add

311+34:45 name n

312+34:47 lit 1

313+34:48 tight glyph )

314+35:1 NEWLINE

315+35:1 glyph ++

316+35:4 name any-then-bool

317+35:18 glyph |=

318+35:21 glyph [

319+35:22 tight name x

320+35:23 tight glyph =

321+35:24 tight aura @

322+35:26 name b

323+35:27 tight glyph =

324+35:28 tight glyph ?

325+35:29 tight glyph ]

326+35:31 glyph (

327+35:32 tight name add

328+35:36 name x

329+35:38 name b

330+35:39 tight glyph )

331+36:1 NEWLINE

332+36:1 glyph ++

333+36:4 name bool-then-any

334+36:18 glyph |=

335+36:21 glyph [

336+36:22 tight name b

337+36:23 tight glyph =

338+36:24 tight glyph ?

339+36:26 name x

340+36:27 tight glyph =

341+36:28 tight aura @

342+36:29 tight glyph ]

343+36:31 glyph (

344+36:32 tight name add

345+36:36 name b

346+36:38 name x

347+36:39 tight glyph )

348+37:1 NEWLINE

349+37:1 glyph ++

350+37:4 name any-dec

351+37:12 glyph |=

352+37:15 name x

353+37:16 tight glyph =

354+37:17 tight aura @

355+37:19 glyph (

356+37:20 tight name dec

357+37:24 name x

358+37:25 tight glyph )

359+38:1 NEWLINE

360+38:1 glyph ++

361+38:4 name any-plus-number

362+38:20 glyph |=

363+38:23 name x

364+38:24 tight glyph =

365+38:25 tight aura @

366+38:27 glyph (

367+38:28 tight name add

368+38:32 name x

369+38:34 lit 1

370+38:35 tight glyph )

371+39:1 NEWLINE

372+39:1 glyph ++

373+39:4 name number-plus-any

374+39:20 glyph |=

375+39:23 name x

376+39:24 tight glyph =

377+39:25 tight aura @

378+39:27 glyph (

379+39:28 tight name add

380+39:32 lit 1

381+39:34 name x

382+39:35 tight glyph )

383+40:1 NEWLINE

384+40:1 glyph ++

385+40:4 name any-self

386+40:13 glyph |=

387+40:16 name x

388+40:17 tight glyph =

389+40:18 tight aura @

390+40:20 glyph (

391+40:21 tight name add

392+40:25 name x

393+40:27 name x

394+40:28 tight glyph )

395+41:1 NEWLINE

396+41:1 glyph ++

397+41:4 name hole-concrete

398+41:18 glyph |=

399+41:21 name n

400+41:22 tight glyph =

401+41:23 tight glyph _

402+41:25 glyph ^-

403+41:28 aura @ud

404+41:32 glyph (

405+41:33 tight name add

406+41:37 name n

407+41:39 lit 1

408+41:40 tight glyph )

409+42:1 NEWLINE

410+42:1 glyph ++

411+42:4 name hole-written

412+42:17 glyph |=

413+42:20 name n

414+42:21 tight glyph =

415+42:22 tight tvar A

416+42:24 glyph ^-

417+42:27 glyph _

418+42:29 glyph (

419+42:30 tight name add

420+42:34 name n

421+42:36 lit 1

422+42:37 tight glyph )

423+43:1 NEWLINE

424+43:1 glyph ++

425+43:4 name hole-unresolved

426+43:20 glyph |=

427+43:23 name n

428+43:24 tight glyph =

429+43:25 tight glyph _

430+43:27 glyph (

431+43:28 tight name add

432+43:32 name n

433+43:34 lit 1

434+43:35 tight glyph )

435+44:1 NEWLINE

436+44:1 glyph ++

437+44:4 name standalone

438+44:15 glyph (

439+44:16 tight name add

440+44:20 lit 1

441+44:22 lit 2

442+44:23 tight glyph )

443+45:1 NEWLINE

444+45:1 glyph ++

445+45:4 name discarded-number

446+46:3 INDENT

447+46:3 glyph ~&

448+46:6 lit 2

449+47:5 INDENT

450+47:5 glyph (

451+47:6 tight name add

452+47:10 lit 1

453+47:12 lit 2

454+47:13 tight glyph )

455+48:1 DEDENT

456+48:1 DEDENT

457+48:1 NEWLINE

458+48:1 glyph ++

459+48:4 name numeric-capture

460+48:20 glyph |=

461+48:23 name x

462+49:3 INDENT

463+49:3 glyph ++

464+49:6 name inner

465+49:12 glyph (

466+49:13 tight name add

467+49:17 name x

468+49:19 lit 1

469+49:20 tight glyph )

470+50:3 NEWLINE

471+50:3 glyph ^-

472+50:6 aura @ux

473+50:10 name x

474+51:1 DEDENT

475+51:1 NEWLINE

476+51:1 glyph ++

477+51:4 name numeric-capture-reversed

478+51:29 glyph |=

479+51:32 name x

480+52:3 INDENT

481+52:3 glyph ++

482+52:6 name inner

483+52:12 glyph (

484+52:13 tight name add

485+52:17 lit 1

486+52:19 name x

487+52:20 tight glyph )

488+53:3 NEWLINE

489+53:3 glyph ^-

490+53:6 aura @ux

491+53:10 name x

492+54:1 DEDENT

493+54:1 NEWLINE

494+54:1 glyph ++

495+54:4 name bound-later

496+54:16 glyph |=

497+54:19 name x

498+54:20 tight glyph =

499+54:21 tight tvar A

500+55:3 INDENT

501+55:3 glyph ++

502+55:6 name inner

503+55:12 glyph (

504+55:13 tight name add

505+55:17 name x

506+55:19 lit 1

507+55:20 tight glyph )

508+56:3 NEWLINE

509+56:3 name x

510+56:4 DEDENT

511+56:4 NEWLINE

tests/golden/types-arithmetic-combined/tree.txtnew file+232

@@ -0,0 +1,232 @@

1+(module

2+ (value 1:1 inc

3+ (gate 1:8

4+ (face 1:11 n (tvar 1:13 A))

5+ (group 1:15

6+ (call 1:16 (wing 1:16 add) (wing 1:20 n) (lit 1:22 1)))))

7+ (value 2:1 inc-reverse

8+ (gate 2:16

9+ (face 2:19 n (tvar 2:21 A))

10+ (group 2:23

11+ (call 2:24 (wing 2:24 add) (lit 2:28 1) (wing 2:30 n)))))

12+ (value 3:1 inc-decimal

13+ (cast 3:16

14+ (aura 3:19 @ud)

15+ (group 3:23

16+ (call 3:24 (wing 3:24 inc) (lit 3:28 2)))))

17+ (value 4:1 inc-hex

18+ (cast 4:12

19+ (aura 4:15 @ux)

20+ (group 4:19

21+ (call 4:20 (wing 4:20 inc) (lit 4:24 0x2)))))

22+ (value 5:1 reverse-decimal

23+ (cast 5:20

24+ (aura 5:23 @ud)

25+ (group 5:27

26+ (call 5:28 (wing 5:28 inc-reverse) (lit 5:40 2)))))

27+ (value 6:1 reverse-hex

28+ (cast 6:16

29+ (aura 6:19 @ux)

30+ (group 6:23

31+ (call 6:24 (wing 6:24 inc-reverse) (lit 6:36 0x2)))))

32+ (value 7:1 default

33+ (group 7:12

34+ (call 7:13 (wing 7:13 add) (lit 7:17 1) (lit 7:19 2))))

35+ (value 8:1 decrease-decimal

36+ (cast 8:21

37+ (aura 8:24 @ud)

38+ (group 8:28

39+ (call 8:29 (wing 8:29 dec) (lit 8:33 2)))))

40+ (value 9:1 decrease-hex

41+ (cast 9:17

42+ (aura 9:20 @ux)

43+ (group 9:24

44+ (call 9:25 (wing 9:25 dec) (lit 9:29 0x2)))))

45+ (value 10:1 bool-add

46+ (group 10:13

47+ (call 10:14 (wing 10:14 add) (lit 10:18 %.n) (lit 10:22 %.n))))

48+ (value 11:1 bool-dec

49+ (group 11:13

50+ (call 11:14 (wing 11:14 dec) (lit 11:18 %.n))))

51+ (value 12:1 bool-reverse

52+ (group 12:17

53+ (call 12:18 (wing 12:18 add) (lit 12:22 1) (lit 12:24 %.y))))

54+ (value 13:1 bool-inc

55+ (group 13:13

56+ (call 13:14 (wing 13:14 inc) (lit 13:18 %.y))))

57+ (value 14:1 bool-gate

58+ (gate 14:14

59+ (face 14:17 x (flag 14:19))

60+ (group 14:21

61+ (call 14:22 (wing 14:22 inc) (wing 14:26 x)))))

62+ (value 15:1 bool-result

63+ (cast 15:16

64+ (flag 15:19)

65+ (group 15:21

66+ (call 15:22 (wing 15:22 add) (lit 15:26 1) (lit 15:28 1)))))

67+ (value 16:1 compare-bool

68+ (group 16:17

69+ (call 16:18 (wing 16:18 gth) (lit 16:22 %.n) (lit 16:26 %.y))))

70+ (value 17:1 mixed

71+ (group 17:10

72+ (call 17:11 (wing 17:11 add) (lit 17:15 ~zod) (str 17:20 "hi"))))

73+ (value 18:1 cells

74+ (group 18:10

75+ (call 18:11

76+ (wing 18:11 add)

77+ (tuple 18:15 (lit 18:16 1) (lit 18:18 2))

78+ (tuple 18:21 (lit 18:22 3) (lit 18:24 4)))))

79+ (value 19:1 distinct

80+ (gate 19:13

81+ (cell 19:16

82+ (face 19:17 a (tvar 19:19 A))

83+ (face 19:21 b (tvar 19:23 B)))

84+ (group 19:26

85+ (call 19:27 (wing 19:27 add) (wing 19:31 a) (wing 19:33 b)))))

86+ (value 20:1 shared

87+ (gate 20:11

88+ (cell 20:14

89+ (face 20:15 a (tvar 20:17 A))

90+ (face 20:19 b (tvar 20:21 A)))

91+ (group 20:24

92+ (call 20:25 (wing 20:25 add) (wing 20:29 a) (wing 20:31 b)))))

93+ (value 21:1 capture

94+ (gate 21:12

95+ (face 21:15 n (tvar 21:17 A))

96+ (body 22:3

97+ (value 22:3 inner

98+ (gate 22:12

99+ (face 22:15 x (tvar 22:17 A))

100+ (group 22:19

101+ (call 22:20 (wing 22:20 add) (wing 22:24 n) (lit 22:26 1)))))

102+ (group 23:3

103+ (call 23:4 (wing 23:4 inner) (wing 23:10 n))))))

104+ (value 24:1 nested

105+ (gate 24:11

106+ (face 24:14 n (tvar 24:16 A))

107+ (gate 24:18

108+ (face 24:21 x (tvar 24:23 A))

109+ (group 24:25

110+ (call 24:26 (wing 24:26 add) (wing 24:30 n) (lit 24:32 1))))))

111+ (value 25:1 unrelated

112+ (body 26:3

113+ (trace 26:3

114+ (lit 26:6 %dangling)

115+ (body 27:5

116+ (group 27:5

117+ (call 27:6 (wing 27:6 add) (lit 27:10 1) (lit 27:12 2)))))))

118+ (value 28:1 identity

119+ (gate 28:13

120+ (face 28:16 x (tvar 28:18 A))

121+ (wing 28:20 x)))

122+ (value 29:1 identity-bool

123+ (group 29:18

124+ (call 29:19 (wing 29:19 identity) (lit 29:28 %.y))))

125+ (value 30:1 alias-inc (wing 30:14 inc))

126+ (value 31:1 alias-decimal

127+ (cast 31:18

128+ (aura 31:21 @ud)

129+ (group 31:25

130+ (call 31:26 (wing 31:26 alias-inc) (lit 31:36 2)))))

131+ (value 32:1 alias-hex

132+ (cast 32:14

133+ (aura 32:17 @ux)

134+ (group 32:21

135+ (call 32:22 (wing 32:22 alias-inc) (lit 32:32 0x2)))))

136+ (value 33:1 alias-bool

137+ (group 33:15

138+ (call 33:16 (wing 33:16 alias-inc) (lit 33:26 %.y))))

139+ (value 34:1 explicit-loobean-result

140+ (gate 34:28

141+ (face 34:31 n (tvar 34:33 A))

142+ (cast 34:35

143+ (flag 34:38)

144+ (group 34:40

145+ (call 34:41 (wing 34:41 add) (wing 34:45 n) (lit 34:47 1))))))

146+ (value 35:1 any-then-bool

147+ (gate 35:18

148+ (cell 35:21

149+ (face 35:22 x (aura 35:24 @))

150+ (face 35:26 b (flag 35:28)))

151+ (group 35:31

152+ (call 35:32 (wing 35:32 add) (wing 35:36 x) (wing 35:38 b)))))

153+ (value 36:1 bool-then-any

154+ (gate 36:18

155+ (cell 36:21

156+ (face 36:22 b (flag 36:24))

157+ (face 36:26 x (aura 36:28 @)))

158+ (group 36:31

159+ (call 36:32 (wing 36:32 add) (wing 36:36 b) (wing 36:38 x)))))

160+ (value 37:1 any-dec

161+ (gate 37:12

162+ (face 37:15 x (aura 37:17 @))

163+ (group 37:19

164+ (call 37:20 (wing 37:20 dec) (wing 37:24 x)))))

165+ (value 38:1 any-plus-number

166+ (gate 38:20

167+ (face 38:23 x (aura 38:25 @))

168+ (group 38:27

169+ (call 38:28 (wing 38:28 add) (wing 38:32 x) (lit 38:34 1)))))

170+ (value 39:1 number-plus-any

171+ (gate 39:20

172+ (face 39:23 x (aura 39:25 @))

173+ (group 39:27

174+ (call 39:28 (wing 39:28 add) (lit 39:32 1) (wing 39:34 x)))))

175+ (value 40:1 any-self

176+ (gate 40:13

177+ (face 40:16 x (aura 40:18 @))

178+ (group 40:20

179+ (call 40:21 (wing 40:21 add) (wing 40:25 x) (wing 40:27 x)))))

180+ (value 41:1 hole-concrete

181+ (gate 41:18

182+ (face 41:21 n (hole 41:23))

183+ (cast 41:25

184+ (aura 41:28 @ud)

185+ (group 41:32

186+ (call 41:33 (wing 41:33 add) (wing 41:37 n) (lit 41:39 1))))))

187+ (value 42:1 hole-written

188+ (gate 42:17

189+ (face 42:20 n (tvar 42:22 A))

190+ (cast 42:24

191+ (hole 42:27)

192+ (group 42:29

193+ (call 42:30 (wing 42:30 add) (wing 42:34 n) (lit 42:36 1))))))

194+ (value 43:1 hole-unresolved

195+ (gate 43:20

196+ (face 43:23 n (hole 43:25))

197+ (group 43:27

198+ (call 43:28 (wing 43:28 add) (wing 43:32 n) (lit 43:34 1)))))

199+ (value 44:1 standalone

200+ (group 44:15

201+ (call 44:16 (wing 44:16 add) (lit 44:20 1) (lit 44:22 2))))

202+ (value 45:1 discarded-number

203+ (body 46:3

204+ (trace 46:3

205+ (lit 46:6 2)

206+ (body 47:5

207+ (group 47:5

208+ (call 47:6 (wing 47:6 add) (lit 47:10 1) (lit 47:12 2)))))))

209+ (value 48:1 numeric-capture

210+ (gate 48:20

211+ (bind 48:23 x)

212+ (body 49:3

213+ (value 49:3 inner

214+ (group 49:12

215+ (call 49:13 (wing 49:13 add) (wing 49:17 x) (lit 49:19 1))))

216+ (cast 50:3 (aura 50:6 @ux) (wing 50:10 x)))))

217+ (value 51:1 numeric-capture-reversed

218+ (gate 51:29

219+ (bind 51:32 x)

220+ (body 52:3

221+ (value 52:3 inner

222+ (group 52:12

223+ (call 52:13 (wing 52:13 add) (lit 52:17 1) (wing 52:19 x))))

224+ (cast 53:3 (aura 53:6 @ux) (wing 53:10 x)))))

225+ (value 54:1 bound-later

226+ (gate 54:16

227+ (face 54:19 x (tvar 54:21 A))

228+ (body 55:3

229+ (value 55:3 inner

230+ (group 55:12

231+ (call 55:13 (wing 55:13 add) (wing 55:17 x) (lit 55:19 1))))

232+ (wing 56:3 x)))))

tests/golden/types-arithmetic-combined/types.txtnew file+120

@@ -0,0 +1,120 @@

1+partial inference; module not checked

2+++ inc: $-(A A) where A is an atom other than ?

3+++ inc-reverse: $-(A A) where A is an atom other than ?

4+++ inc-decimal: @ud

5+++ inc-hex: @ux

6+++ reverse-decimal: @ud

7+++ reverse-hex: @ux

8+++ default: @ud

9+++ decrease-decimal: @ud

10+++ decrease-hex: @ux

11+++ bool-add: call's sample and argument types do not unify

12+/tests/golden/types-arithmetic-combined/source.jibb:10:14: called gate has type $-([A A] A) where A is an atom other than ?

13+++ bool-add (add %.n %.n)

14+ ^

15+/tests/golden/types-arithmetic-combined/source.jibb:10:18: argument has type ?

16+++ bool-add (add %.n %.n)

17+ ^

18+++ bool-dec: call's sample and argument types do not unify

19+/tests/golden/types-arithmetic-combined/source.jibb:11:14: called gate has type $-(A A) where A is an atom other than ?

20+++ bool-dec (dec %.n)

21+ ^

22+/tests/golden/types-arithmetic-combined/source.jibb:11:18: argument has type ?

23+++ bool-dec (dec %.n)

24+ ^

25+++ bool-reverse: call's sample and argument types do not unify

26+/tests/golden/types-arithmetic-combined/source.jibb:12:18: called gate has type $-([A A] A) where A is an atom other than ?

27+++ bool-reverse (add 1 %.y)

28+ ^

29+/tests/golden/types-arithmetic-combined/source.jibb:12:22: argument

30+++ bool-reverse (add 1 %.y)

31+ ^

32+++ bool-inc: call's sample and argument types do not unify

33+/tests/golden/types-arithmetic-combined/source.jibb:13:14: called gate has type $-(A A) where A is an atom other than ?

34+++ bool-inc (inc %.y)

35+ ^

36+/tests/golden/types-arithmetic-combined/source.jibb:13:18: argument has type ?

37+++ bool-inc (inc %.y)

38+ ^

39+++ bool-gate: call's sample and argument types do not unify

40+/tests/golden/types-arithmetic-combined/source.jibb:14:22: called gate has type $-(A A) where A is an atom other than ?

41+++ bool-gate |= x=? (inc x)

42+ ^

43+/tests/golden/types-arithmetic-combined/source.jibb:14:26: argument has type ?

44+++ bool-gate |= x=? (inc x)

45+ ^

46+++ bool-result: cast mold and expression type do not unify

47+/tests/golden/types-arithmetic-combined/source.jibb:15:19: cast mold has type ?

48+++ bool-result ^- ? (add 1 1)

49+ ^

50+/tests/golden/types-arithmetic-combined/source.jibb:15:21: expression

51+++ bool-result ^- ? (add 1 1)

52+ ^

53+++ compare-bool: ?

54+++ mixed: call's sample and argument types do not unify

55+/tests/golden/types-arithmetic-combined/source.jibb:17:11: called gate has type $-([A A] A) where A is an atom other than ?

56+++ mixed (add ~zod "hi")

57+ ^

58+/tests/golden/types-arithmetic-combined/source.jibb:17:15: argument has type [@p @t]

59+++ mixed (add ~zod "hi")

60+ ^

61+++ cells: call's sample and argument types do not unify

62+/tests/golden/types-arithmetic-combined/source.jibb:18:11: called gate has type $-([A A] A) where A is an atom other than ?

63+++ cells (add [1 2] [3 4])

64+ ^

65+/tests/golden/types-arithmetic-combined/source.jibb:18:15: argument

66+++ cells (add [1 2] [3 4])

67+ ^

68+++ distinct: distinct type variables `A` and `B` must not be forced equal; use the same capital for a shared type

69+/tests/golden/types-arithmetic-combined/source.jibb:19:19: first type variable

70+++ distinct |= [a=A b=B] (add a b)

71+ ^

72+/tests/golden/types-arithmetic-combined/source.jibb:19:23: second type variable

73+++ distinct |= [a=A b=B] (add a b)

74+ ^

75+++ shared: $-([a=A b=A] A) where A is an atom other than ?

76+++ capture: explicit capital constraints are not supported by partial inference

77+++ nested: $-(A $-(A A)) where A is an atom other than ?

78+++ unrelated: tag needs context in partial inference

79+++ identity: $-(A A)

80+++ identity-bool: ?

81+++ alias-inc: $-(A A) where A is an atom other than ?

82+++ alias-decimal: @ud

83+++ alias-hex: @ux

84+++ alias-bool: call's sample and argument types do not unify

85+/tests/golden/types-arithmetic-combined/source.jibb:33:16: called gate has type $-(A A) where A is an atom other than ?

86+++ alias-bool (alias-inc %.y)

87+ ^

88+/tests/golden/types-arithmetic-combined/source.jibb:33:26: argument has type ?

89+++ alias-bool (alias-inc %.y)

90+ ^

91+++ explicit-loobean-result: cast mold and expression type do not unify

92+/tests/golden/types-arithmetic-combined/source.jibb:34:38: cast mold has type ?

93+++ explicit-loobean-result |= n=A ^- ? (add n 1)

94+ ^

95+/tests/golden/types-arithmetic-combined/source.jibb:34:40: expression

96+++ explicit-loobean-result |= n=A ^- ? (add n 1)

97+ ^

98+++ any-then-bool: call constraint is not supported by partial inference

99+++ bool-then-any: call's sample and argument types do not unify

100+/tests/golden/types-arithmetic-combined/source.jibb:36:32: called gate has type $-([A A] A) where A is an atom other than ?

101+++ bool-then-any |= [b=? x=@] (add b x)

102+ ^

103+/tests/golden/types-arithmetic-combined/source.jibb:36:36: argument has type ?

104+++ bool-then-any |= [b=? x=@] (add b x)

105+ ^

106+++ any-dec: call constraint is not supported by partial inference

107+++ any-plus-number: call constraint is not supported by partial inference

108+++ number-plus-any: call constraint is not supported by partial inference

109+++ any-self: call constraint is not supported by partial inference

110+++ hole-concrete: $-(@ud @ud)

111+++ hole-written: $-(A A) where A is an atom other than ?

112+++ hole-unresolved: type hole needs unsupported inference

113+/tests/golden/types-arithmetic-combined/source.jibb:43:25: type hole

114+++ hole-unresolved |= n=_ (add n 1)

115+ ^

116+++ standalone: @ud

117+++ discarded-number: @ud

118+++ numeric-capture: local definitions need unsupported inference

119+++ numeric-capture-reversed: local definitions need unsupported inference

120+++ bound-later: explicit capital constraints are not supported by partial inference

tests/golden/types-arithmetic-generic/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: docs/spec/grammar.md, Molds, Atoms: "Arithmetic rejects loobean operands: `?` contains only 0 and 1, while an arithmetic result need not."

2+tests: Generic add and dec, aliases and captured variables retain the restriction; ordinary identity and comparison still accept loobeans.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-arithmetic-generic/modules.txtnew file+1

@@ -0,0 +1 @@

1+# Opt in to the actual source-backed prelude.

tests/golden/types-arithmetic-generic/source.jibbnew file+21

@@ -0,0 +1,21 @@

1+++ sum |= [a=A b=A] (add a b)

2+++ decreasing |= x=A (dec x)

3+++ forward sum

4+++ text-aura ^- @t (sum "a" "b")

5+++ ship-aura ^- @p (sum ~zod ~nec)

6+++ decimal ^- @ud (sum 1 2)

7+++ hex ^- @ux (sum 0x1 0x2)

8+++ decrease-dec ^- @ud (decreasing 2)

9+++ decrease-hex ^- @ux (decreasing 0x2)

10+++ bad-sum (sum %.y %.n)

11+++ bad-dec (decreasing %.y)

12+++ bad-alias (forward %.y %.n)

13+++ compare (gth %.y %.n)

14+++ identity |= x=A x

15+++ accept-bool (identity %.y)

16+++ capture |= x=A

17+ ++ nested |= y=A (add x y)

18+ (nested x)

19+++ mixed |= [x=@ b=?] (sum x b)

20+++ opposite |= [b=? x=@] (sum b x)

21+++ any-dec |= x=@ (decreasing x)

tests/golden/types-arithmetic-generic/tokens.txtnew file+206

@@ -0,0 +1,206 @@

1+1:1 glyph ++

2+1:4 name sum

3+1:8 glyph |=

4+1:11 glyph [

5+1:12 tight name a

6+1:13 tight glyph =

7+1:14 tight tvar A

8+1:16 name b

9+1:17 tight glyph =

10+1:18 tight tvar A

11+1:19 tight glyph ]

12+1:21 glyph (

13+1:22 tight name add

14+1:26 name a

15+1:28 name b

16+1:29 tight glyph )

17+2:1 NEWLINE

18+2:1 glyph ++

19+2:4 name decreasing

20+2:15 glyph |=

21+2:18 name x

22+2:19 tight glyph =

23+2:20 tight tvar A

24+2:22 glyph (

25+2:23 tight name dec

26+2:27 name x

27+2:28 tight glyph )

28+3:1 NEWLINE

29+3:1 glyph ++

30+3:4 name forward

31+3:12 name sum

32+4:1 NEWLINE

33+4:1 glyph ++

34+4:4 name text-aura

35+4:14 glyph ^-

36+4:17 aura @t

37+4:20 glyph (

38+4:21 tight name sum

39+4:25 str "a"

40+4:29 str "b"

41+4:32 tight glyph )

42+5:1 NEWLINE

43+5:1 glyph ++

44+5:4 name ship-aura

45+5:14 glyph ^-

46+5:17 aura @p

47+5:20 glyph (

48+5:21 tight name sum

49+5:25 lit ~zod

50+5:30 lit ~nec

51+5:34 tight glyph )

52+6:1 NEWLINE

53+6:1 glyph ++

54+6:4 name decimal

55+6:12 glyph ^-

56+6:15 aura @ud

57+6:19 glyph (

58+6:20 tight name sum

59+6:24 lit 1

60+6:26 lit 2

61+6:27 tight glyph )

62+7:1 NEWLINE

63+7:1 glyph ++

64+7:4 name hex

65+7:8 glyph ^-

66+7:11 aura @ux

67+7:15 glyph (

68+7:16 tight name sum

69+7:20 lit 0x1

70+7:24 lit 0x2

71+7:27 tight glyph )

72+8:1 NEWLINE

73+8:1 glyph ++

74+8:4 name decrease-dec

75+8:17 glyph ^-

76+8:20 aura @ud

77+8:24 glyph (

78+8:25 tight name decreasing

79+8:36 lit 2

80+8:37 tight glyph )

81+9:1 NEWLINE

82+9:1 glyph ++

83+9:4 name decrease-hex

84+9:17 glyph ^-

85+9:20 aura @ux

86+9:24 glyph (

87+9:25 tight name decreasing

88+9:36 lit 0x2

89+9:39 tight glyph )

90+10:1 NEWLINE

91+10:1 glyph ++

92+10:4 name bad-sum

93+10:12 glyph (

94+10:13 tight name sum

95+10:17 lit %.y

96+10:21 lit %.n

97+10:24 tight glyph )

98+11:1 NEWLINE

99+11:1 glyph ++

100+11:4 name bad-dec

101+11:12 glyph (

102+11:13 tight name decreasing

103+11:24 lit %.y

104+11:27 tight glyph )

105+12:1 NEWLINE

106+12:1 glyph ++

107+12:4 name bad-alias

108+12:14 glyph (

109+12:15 tight name forward

110+12:23 lit %.y

111+12:27 lit %.n

112+12:30 tight glyph )

113+13:1 NEWLINE

114+13:1 glyph ++

115+13:4 name compare

116+13:12 glyph (

117+13:13 tight name gth

118+13:17 lit %.y

119+13:21 lit %.n

120+13:24 tight glyph )

121+14:1 NEWLINE

122+14:1 glyph ++

123+14:4 name identity

124+14:13 glyph |=

125+14:16 name x

126+14:17 tight glyph =

127+14:18 tight tvar A

128+14:20 name x

129+15:1 NEWLINE

130+15:1 glyph ++

131+15:4 name accept-bool

132+15:16 glyph (

133+15:17 tight name identity

134+15:26 lit %.y

135+15:29 tight glyph )

136+16:1 NEWLINE

137+16:1 glyph ++

138+16:4 name capture

139+16:12 glyph |=

140+16:15 name x

141+16:16 tight glyph =

142+16:17 tight tvar A

143+17:3 INDENT

144+17:3 glyph ++

145+17:6 name nested

146+17:13 glyph |=

147+17:16 name y

148+17:17 tight glyph =

149+17:18 tight tvar A

150+17:20 glyph (

151+17:21 tight name add

152+17:25 name x

153+17:27 name y

154+17:28 tight glyph )

155+18:3 NEWLINE

156+18:3 glyph (

157+18:4 tight name nested

158+18:11 name x

159+18:12 tight glyph )

160+19:1 DEDENT

161+19:1 NEWLINE

162+19:1 glyph ++

163+19:4 name mixed

164+19:10 glyph |=

165+19:13 glyph [

166+19:14 tight name x

167+19:15 tight glyph =

168+19:16 tight aura @

169+19:18 name b

170+19:19 tight glyph =

171+19:20 tight glyph ?

172+19:21 tight glyph ]

173+19:23 glyph (

174+19:24 tight name sum

175+19:28 name x

176+19:30 name b

177+19:31 tight glyph )

178+20:1 NEWLINE

179+20:1 glyph ++

180+20:4 name opposite

181+20:13 glyph |=

182+20:16 glyph [

183+20:17 tight name b

184+20:18 tight glyph =

185+20:19 tight glyph ?

186+20:21 name x

187+20:22 tight glyph =

188+20:23 tight aura @

189+20:24 tight glyph ]

190+20:26 glyph (

191+20:27 tight name sum

192+20:31 name b

193+20:33 name x

194+20:34 tight glyph )

195+21:1 NEWLINE

196+21:1 glyph ++

197+21:4 name any-dec

198+21:12 glyph |=

199+21:15 name x

200+21:16 tight glyph =

201+21:17 tight aura @

202+21:19 glyph (

203+21:20 tight name decreasing

204+21:31 name x

205+21:32 tight glyph )

206+21:33 NEWLINE

tests/golden/types-arithmetic-generic/tree.txtnew file+93

@@ -0,0 +1,93 @@

1+(module

2+ (value 1:1 sum

3+ (gate 1:8

4+ (cell 1:11

5+ (face 1:12 a (tvar 1:14 A))

6+ (face 1:16 b (tvar 1:18 A)))

7+ (group 1:21

8+ (call 1:22 (wing 1:22 add) (wing 1:26 a) (wing 1:28 b)))))

9+ (value 2:1 decreasing

10+ (gate 2:15

11+ (face 2:18 x (tvar 2:20 A))

12+ (group 2:22

13+ (call 2:23 (wing 2:23 dec) (wing 2:27 x)))))

14+ (value 3:1 forward (wing 3:12 sum))

15+ (value 4:1 text-aura

16+ (cast 4:14

17+ (aura 4:17 @t)

18+ (group 4:20

19+ (call 4:21 (wing 4:21 sum) (str 4:25 "a") (str 4:29 "b")))))

20+ (value 5:1 ship-aura

21+ (cast 5:14

22+ (aura 5:17 @p)

23+ (group 5:20

24+ (call 5:21 (wing 5:21 sum) (lit 5:25 ~zod) (lit 5:30 ~nec)))))

25+ (value 6:1 decimal

26+ (cast 6:12

27+ (aura 6:15 @ud)

28+ (group 6:19

29+ (call 6:20 (wing 6:20 sum) (lit 6:24 1) (lit 6:26 2)))))

30+ (value 7:1 hex

31+ (cast 7:8

32+ (aura 7:11 @ux)

33+ (group 7:15

34+ (call 7:16 (wing 7:16 sum) (lit 7:20 0x1) (lit 7:24 0x2)))))

35+ (value 8:1 decrease-dec

36+ (cast 8:17

37+ (aura 8:20 @ud)

38+ (group 8:24

39+ (call 8:25 (wing 8:25 decreasing) (lit 8:36 2)))))

40+ (value 9:1 decrease-hex

41+ (cast 9:17

42+ (aura 9:20 @ux)

43+ (group 9:24

44+ (call 9:25 (wing 9:25 decreasing) (lit 9:36 0x2)))))

45+ (value 10:1 bad-sum

46+ (group 10:12

47+ (call 10:13 (wing 10:13 sum) (lit 10:17 %.y) (lit 10:21 %.n))))

48+ (value 11:1 bad-dec

49+ (group 11:12

50+ (call 11:13 (wing 11:13 decreasing) (lit 11:24 %.y))))

51+ (value 12:1 bad-alias

52+ (group 12:14

53+ (call 12:15 (wing 12:15 forward) (lit 12:23 %.y) (lit 12:27 %.n))))

54+ (value 13:1 compare

55+ (group 13:12

56+ (call 13:13 (wing 13:13 gth) (lit 13:17 %.y) (lit 13:21 %.n))))

57+ (value 14:1 identity

58+ (gate 14:13

59+ (face 14:16 x (tvar 14:18 A))

60+ (wing 14:20 x)))

61+ (value 15:1 accept-bool

62+ (group 15:16

63+ (call 15:17 (wing 15:17 identity) (lit 15:26 %.y))))

64+ (value 16:1 capture

65+ (gate 16:12

66+ (face 16:15 x (tvar 16:17 A))

67+ (body 17:3

68+ (value 17:3 nested

69+ (gate 17:13

70+ (face 17:16 y (tvar 17:18 A))

71+ (group 17:20

72+ (call 17:21 (wing 17:21 add) (wing 17:25 x) (wing 17:27 y)))))

73+ (group 18:3

74+ (call 18:4 (wing 18:4 nested) (wing 18:11 x))))))

75+ (value 19:1 mixed

76+ (gate 19:10

77+ (cell 19:13

78+ (face 19:14 x (aura 19:16 @))

79+ (face 19:18 b (flag 19:20)))

80+ (group 19:23

81+ (call 19:24 (wing 19:24 sum) (wing 19:28 x) (wing 19:30 b)))))

82+ (value 20:1 opposite

83+ (gate 20:13

84+ (cell 20:16

85+ (face 20:17 b (flag 20:19))

86+ (face 20:21 x (aura 20:23 @)))

87+ (group 20:26

88+ (call 20:27 (wing 20:27 sum) (wing 20:31 b) (wing 20:33 x)))))

89+ (value 21:1 any-dec

90+ (gate 21:12

91+ (face 21:15 x (aura 21:17 @))

92+ (group 21:19

93+ (call 21:20 (wing 21:20 decreasing) (wing 21:31 x))))))

tests/golden/types-arithmetic-generic/types.txtnew file+44

@@ -0,0 +1,44 @@

1+partial inference; module not checked

2+++ sum: $-([a=A b=A] A) where A is an atom other than ?

3+++ decreasing: $-(A A) where A is an atom other than ?

4+++ forward: $-([a=A b=A] A) where A is an atom other than ?

5+++ text-aura: @t

6+++ ship-aura: @p

7+++ decimal: @ud

8+++ hex: @ux

9+++ decrease-dec: @ud

10+++ decrease-hex: @ux

11+++ bad-sum: call's sample and argument types do not unify

12+/tests/golden/types-arithmetic-generic/source.jibb:10:13: called gate has type $-([a=A b=A] A) where A is an atom other than ?

13+++ bad-sum (sum %.y %.n)

14+ ^

15+/tests/golden/types-arithmetic-generic/source.jibb:10:17: argument has type ?

16+++ bad-sum (sum %.y %.n)

17+ ^

18+++ bad-dec: call's sample and argument types do not unify

19+/tests/golden/types-arithmetic-generic/source.jibb:11:13: called gate has type $-(A A) where A is an atom other than ?

20+++ bad-dec (decreasing %.y)

21+ ^

22+/tests/golden/types-arithmetic-generic/source.jibb:11:24: argument has type ?

23+++ bad-dec (decreasing %.y)

24+ ^

25+++ bad-alias: call's sample and argument types do not unify

26+/tests/golden/types-arithmetic-generic/source.jibb:12:15: called gate has type $-([a=A b=A] A) where A is an atom other than ?

27+++ bad-alias (forward %.y %.n)

28+ ^

29+/tests/golden/types-arithmetic-generic/source.jibb:12:23: argument has type ?

30+++ bad-alias (forward %.y %.n)

31+ ^

32+++ compare: ?

33+++ identity: $-(A A)

34+++ accept-bool: ?

35+++ capture: $-(A A) where A is an atom other than ?

36+++ mixed: call constraint is not supported by partial inference

37+++ opposite: call's sample and argument types do not unify

38+/tests/golden/types-arithmetic-generic/source.jibb:20:27: called gate has type $-([a=A b=A] A) where A is an atom other than ?

39+++ opposite |= [b=? x=@] (sum b x)

40+ ^

41+/tests/golden/types-arithmetic-generic/source.jibb:20:31: argument has type ?

42+++ opposite |= [b=? x=@] (sum b x)

43+ ^

44+++ any-dec: call constraint is not supported by partial inference

tests/golden/types-arithmetic-module/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: docs/spec/grammar.md, Molds, Atoms: "Arithmetic rejects loobean operands: `?` contains only 0 and 1, while an arithmetic result need not."

2+tests: Imported generic arithmetic and aliases preserve restrictions under independent instantiation and reject loobeans; broad @ stays unsupported.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-arithmetic-module/module-trees.txtnew file+26

@@ -0,0 +1,26 @@

1+/ui/math.jibb

2+(module

3+ (value 1:1 sum

4+ (gate 1:8

5+ (cell 1:11

6+ (face 1:12 a (tvar 1:14 A))

7+ (face 1:16 b (tvar 1:18 A)))

8+ (group 1:21

9+ (call 1:22 (wing 1:22 add) (wing 1:26 a) (wing 1:28 b)))))

10+ (value 2:1 down

11+ (gate 2:9

12+ (face 2:12 x (tvar 2:14 A))

13+ (group 2:16

14+ (call 2:17 (wing 2:17 dec) (wing 2:21 x)))))

15+ (value 3:1 alias (wing 3:10 sum))

16+ (value 4:1 inc

17+ (gate 4:8

18+ (face 4:11 n (tvar 4:13 A))

19+ (group 4:15

20+ (call 4:16 (wing 4:16 add) (wing 4:20 n) (lit 4:22 1)))))

21+ (value 5:1 inc-reverse

22+ (gate 5:16

23+ (face 5:19 n (tvar 5:21 A))

24+ (group 5:23

25+ (call 5:24 (wing 5:24 add) (lit 5:28 1) (wing 5:30 n)))))

26+ (value 6:1 alias-inc (wing 6:14 inc)))

tests/golden/types-arithmetic-module/modules.txtnew file+1

@@ -0,0 +1 @@

1+/ui/math.jibb

tests/golden/types-arithmetic-module/modules/ui/math.jibbnew file+6

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

1+++ sum |= [a=A b=A] (add a b)

2+++ down |= x=A (dec x)

3+++ alias sum

4+++ inc |= n=A (add n 1)

5+++ inc-reverse |= n=A (add 1 n)

6+++ alias-inc inc

tests/golden/types-arithmetic-module/source.jibbnew file+16

@@ -0,0 +1,16 @@

1+/= math /ui/math

2+++ decimal ^- @ud (sum.math 1 2)

3+++ hex ^- @ux (sum.math 0x1 0x2)

4+++ text ^- @t (alias.math "a" "b")

5+++ ship ^- @p (down.math ~zod)

6+++ reject-bool (sum.math %.y %.n)

7+++ reject-down (down.math %.y)

8+++ reject-alias (alias.math %.n %.y)

9+++ reject-any |= x=@ (down.math x)

10+++ nested |= x=A

11+ ++ local |= y=A (sum.math x y)

12+ (local x)

13+++ inc-decimal ^- @ud (inc.math 2)

14+++ inc-hex ^- @ux (inc-reverse.math 0x2)

15+++ inc-bool (inc.math %.y)

16+++ alias-bool (alias-inc.math %.n)

tests/golden/types-arithmetic-module/tokens.txtnew file+137

@@ -0,0 +1,137 @@

1+1:1 glyph /=

2+1:4 name math

3+1:9 glyph /

4+1:10 tight knot ui

5+1:12 tight glyph /

6+1:13 tight knot math

7+2:1 NEWLINE

8+2:1 glyph ++

9+2:4 name decimal

10+2:12 glyph ^-

11+2:15 aura @ud

12+2:19 glyph (

13+2:20 tight wing sum.math

14+2:29 lit 1

15+2:31 lit 2

16+2:32 tight glyph )

17+3:1 NEWLINE

18+3:1 glyph ++

19+3:4 name hex

20+3:8 glyph ^-

21+3:11 aura @ux

22+3:15 glyph (

23+3:16 tight wing sum.math

24+3:25 lit 0x1

25+3:29 lit 0x2

26+3:32 tight glyph )

27+4:1 NEWLINE

28+4:1 glyph ++

29+4:4 name text

30+4:9 glyph ^-

31+4:12 aura @t

32+4:15 glyph (

33+4:16 tight wing alias.math

34+4:27 str "a"

35+4:31 str "b"

36+4:34 tight glyph )

37+5:1 NEWLINE

38+5:1 glyph ++

39+5:4 name ship

40+5:9 glyph ^-

41+5:12 aura @p

42+5:15 glyph (

43+5:16 tight wing down.math

44+5:26 lit ~zod

45+5:30 tight glyph )

46+6:1 NEWLINE

47+6:1 glyph ++

48+6:4 name reject-bool

49+6:16 glyph (

50+6:17 tight wing sum.math

51+6:26 lit %.y

52+6:30 lit %.n

53+6:33 tight glyph )

54+7:1 NEWLINE

55+7:1 glyph ++

56+7:4 name reject-down

57+7:16 glyph (

58+7:17 tight wing down.math

59+7:27 lit %.y

60+7:30 tight glyph )

61+8:1 NEWLINE

62+8:1 glyph ++

63+8:4 name reject-alias

64+8:17 glyph (

65+8:18 tight wing alias.math

66+8:29 lit %.n

67+8:33 lit %.y

68+8:36 tight glyph )

69+9:1 NEWLINE

70+9:1 glyph ++

71+9:4 name reject-any

72+9:15 glyph |=

73+9:18 name x

74+9:19 tight glyph =

75+9:20 tight aura @

76+9:22 glyph (

77+9:23 tight wing down.math

78+9:33 name x

79+9:34 tight glyph )

80+10:1 NEWLINE

81+10:1 glyph ++

82+10:4 name nested

83+10:11 glyph |=

84+10:14 name x

85+10:15 tight glyph =

86+10:16 tight tvar A

87+11:3 INDENT

88+11:3 glyph ++

89+11:6 name local

90+11:12 glyph |=

91+11:15 name y

92+11:16 tight glyph =

93+11:17 tight tvar A

94+11:19 glyph (

95+11:20 tight wing sum.math

96+11:29 name x

97+11:31 name y

98+11:32 tight glyph )

99+12:3 NEWLINE

100+12:3 glyph (

101+12:4 tight name local

102+12:10 name x

103+12:11 tight glyph )

104+13:1 DEDENT

105+13:1 NEWLINE

106+13:1 glyph ++

107+13:4 name inc-decimal

108+13:16 glyph ^-

109+13:19 aura @ud

110+13:23 glyph (

111+13:24 tight wing inc.math

112+13:33 lit 2

113+13:34 tight glyph )

114+14:1 NEWLINE

115+14:1 glyph ++

116+14:4 name inc-hex

117+14:12 glyph ^-

118+14:15 aura @ux

119+14:19 glyph (

120+14:20 tight wing inc-reverse.math

121+14:37 lit 0x2

122+14:40 tight glyph )

123+15:1 NEWLINE

124+15:1 glyph ++

125+15:4 name inc-bool

126+15:13 glyph (

127+15:14 tight wing inc.math

128+15:23 lit %.y

129+15:26 tight glyph )

130+16:1 NEWLINE

131+16:1 glyph ++

132+16:4 name alias-bool

133+16:15 glyph (

134+16:16 tight wing alias-inc.math

135+16:31 lit %.n

136+16:34 tight glyph )

137+16:35 NEWLINE

tests/golden/types-arithmetic-module/tree.txtnew file+63

@@ -0,0 +1,63 @@

1+(module

2+ (jibb 1:1 math /ui/math)

3+ (value 2:1 decimal

4+ (cast 2:12

5+ (aura 2:15 @ud)

6+ (group 2:19

7+ (call 2:20 (wing 2:20 sum.math) (lit 2:29 1) (lit 2:31 2)))))

8+ (value 3:1 hex

9+ (cast 3:8

10+ (aura 3:11 @ux)

11+ (group 3:15

12+ (call 3:16 (wing 3:16 sum.math) (lit 3:25 0x1) (lit 3:29 0x2)))))

13+ (value 4:1 text

14+ (cast 4:9

15+ (aura 4:12 @t)

16+ (group 4:15

17+ (call 4:16 (wing 4:16 alias.math) (str 4:27 "a") (str 4:31 "b")))))

18+ (value 5:1 ship

19+ (cast 5:9

20+ (aura 5:12 @p)

21+ (group 5:15

22+ (call 5:16 (wing 5:16 down.math) (lit 5:26 ~zod)))))

23+ (value 6:1 reject-bool

24+ (group 6:16

25+ (call 6:17 (wing 6:17 sum.math) (lit 6:26 %.y) (lit 6:30 %.n))))

26+ (value 7:1 reject-down

27+ (group 7:16

28+ (call 7:17 (wing 7:17 down.math) (lit 7:27 %.y))))

29+ (value 8:1 reject-alias

30+ (group 8:17

31+ (call 8:18 (wing 8:18 alias.math) (lit 8:29 %.n) (lit 8:33 %.y))))

32+ (value 9:1 reject-any

33+ (gate 9:15

34+ (face 9:18 x (aura 9:20 @))

35+ (group 9:22

36+ (call 9:23 (wing 9:23 down.math) (wing 9:33 x)))))

37+ (value 10:1 nested

38+ (gate 10:11

39+ (face 10:14 x (tvar 10:16 A))

40+ (body 11:3

41+ (value 11:3 local

42+ (gate 11:12

43+ (face 11:15 y (tvar 11:17 A))

44+ (group 11:19

45+ (call 11:20 (wing 11:20 sum.math) (wing 11:29 x) (wing 11:31 y)))))

46+ (group 12:3

47+ (call 12:4 (wing 12:4 local) (wing 12:10 x))))))

48+ (value 13:1 inc-decimal

49+ (cast 13:16

50+ (aura 13:19 @ud)

51+ (group 13:23

52+ (call 13:24 (wing 13:24 inc.math) (lit 13:33 2)))))

53+ (value 14:1 inc-hex

54+ (cast 14:12

55+ (aura 14:15 @ux)

56+ (group 14:19

57+ (call 14:20 (wing 14:20 inc-reverse.math) (lit 14:37 0x2)))))

58+ (value 15:1 inc-bool

59+ (group 15:13

60+ (call 15:14 (wing 15:14 inc.math) (lit 15:23 %.y))))

61+ (value 16:1 alias-bool

62+ (group 16:15

63+ (call 16:16 (wing 16:16 alias-inc.math) (lit 16:31 %.n)))))

tests/golden/types-arithmetic-module/types.txtnew file+44

@@ -0,0 +1,44 @@

1+partial inference; module not checked

2+++ decimal: @ud

3+++ hex: @ux

4+++ text: @t

5+++ ship: @p

6+++ reject-bool: call's sample and argument types do not unify

7+/tests/golden/types-arithmetic-module/source.jibb:6:17: called gate has type $-([a=A b=A] A) where A is an atom other than ?

8+++ reject-bool (sum.math %.y %.n)

9+ ^

10+/tests/golden/types-arithmetic-module/source.jibb:6:26: argument has type ?

11+++ reject-bool (sum.math %.y %.n)

12+ ^

13+++ reject-down: call's sample and argument types do not unify

14+/tests/golden/types-arithmetic-module/source.jibb:7:17: called gate has type $-(A A) where A is an atom other than ?

15+++ reject-down (down.math %.y)

16+ ^

17+/tests/golden/types-arithmetic-module/source.jibb:7:27: argument has type ?

18+++ reject-down (down.math %.y)

19+ ^

20+++ reject-alias: call's sample and argument types do not unify

21+/tests/golden/types-arithmetic-module/source.jibb:8:18: called gate has type $-([a=A b=A] A) where A is an atom other than ?

22+++ reject-alias (alias.math %.n %.y)

23+ ^

24+/tests/golden/types-arithmetic-module/source.jibb:8:29: argument has type ?

25+++ reject-alias (alias.math %.n %.y)

26+ ^

27+++ reject-any: call constraint is not supported by partial inference

28+++ nested: local definitions need unsupported inference

29+++ inc-decimal: @ud

30+++ inc-hex: @ux

31+++ inc-bool: call's sample and argument types do not unify

32+/tests/golden/types-arithmetic-module/source.jibb:15:14: called gate has type $-(A A) where A is an atom other than ?

33+++ inc-bool (inc.math %.y)

34+ ^

35+/tests/golden/types-arithmetic-module/source.jibb:15:23: argument has type ?

36+++ inc-bool (inc.math %.y)

37+ ^

38+++ alias-bool: call's sample and argument types do not unify

39+/tests/golden/types-arithmetic-module/source.jibb:16:16: called gate has type $-(A A) where A is an atom other than ?

40+++ alias-bool (alias-inc.math %.n)

41+ ^

42+/tests/golden/types-arithmetic-module/source.jibb:16:31: argument has type ?

43+++ alias-bool (alias-inc.math %.n)

44+ ^

tests/golden/types-arithmetic-proj-qath/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: docs/spec/grammar.md, Molds, Atoms: "Arithmetic rejects loobean operands: `?` contains only 0 and 1, while an arithmetic result need not."

2+tests: Arithmetic retains non-loobean constraints through wider and single-field projected records and qath values; incompatible auras, loobean operands, and scalar binder faces do not silently infer.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-arithmetic-proj-qath/modules.txtnew file+1

@@ -0,0 +1 @@

1+# Opt in to the actual source-backed prelude.

tests/golden/types-arithmetic-proj-qath/source.jibbnew file+18

@@ -0,0 +1,18 @@

1+++ project-increment |= r=[a=A b=@t c=@ud]

2+ ^- [a=A b=@t] (proj [a=(add a.r 1) b=b.r c=c.r])

3+++ good ^- [a=@ux b=@t] (project-increment [a=0x7 b="x" c=0])

4+++ flag (project-increment [a=%.y b="x" c=0])

5+++ mixed (add ~zod "x")

6+++ path-and-number [path=%/foo number=(add 1 2)]

7+++ path-value |= p=qath [path=p number=(add 1 2)]

8+++ with-path |= r=[a=A b=qath c=@ud]

9+ ^- [a=A b=qath] (proj [a=(dec a.r) b=b.r c=c.r])

10+++ wrong-width ^- [a=@ud b=@t] [a=(add 1 2) b="x" c=0]

11+++ select-one |= r=[a=A b=@t]

12+ ^- [a=A] (proj [a=(add a.r 1) b=b.r])

13+++ select-one-ux ^- [a=@ux] (select-one [a=0x7 b="x"])

14+++ select-one-bool (select-one [a=%.y b="x"])

15+++ scalar |= x=@t x

16+++ no-binder-field (scalar (proj [x="ok" y=~zod]))

17+++ select-one-nested |= r=[a=A b=@t]

18+ ^- [outer=[a=A] marker=@ud] [outer=(proj [a=(add a.r 1) b=b.r]) marker=0]

tests/golden/types-arithmetic-proj-qath/tokens.txtnew file+351

@@ -0,0 +1,351 @@

1+1:1 glyph ++

2+1:4 name project-increment

3+1:22 glyph |=

4+1:25 name r

5+1:26 tight glyph =

6+1:27 tight glyph [

7+1:28 tight name a

8+1:29 tight glyph =

9+1:30 tight tvar A

10+1:32 name b

11+1:33 tight glyph =

12+1:34 tight aura @t

13+1:37 name c

14+1:38 tight glyph =

15+1:39 tight aura @ud

16+1:42 tight glyph ]

17+2:3 INDENT

18+2:3 glyph ^-

19+2:6 glyph [

20+2:7 tight name a

21+2:8 tight glyph =

22+2:9 tight tvar A

23+2:11 name b

24+2:12 tight glyph =

25+2:13 tight aura @t

26+2:15 tight glyph ]

27+2:17 glyph (

28+2:18 tight name proj

29+2:23 glyph [

30+2:24 tight name a

31+2:25 tight glyph =

32+2:26 tight glyph (

33+2:27 tight name add

34+2:31 wing a.r

35+2:35 lit 1

36+2:36 tight glyph )

37+2:38 name b

38+2:39 tight glyph =

39+2:40 tight wing b.r

40+2:44 name c

41+2:45 tight glyph =

42+2:46 tight wing c.r

43+2:49 tight glyph ]

44+2:50 tight glyph )

45+3:1 DEDENT

46+3:1 NEWLINE

47+3:1 glyph ++

48+3:4 name good

49+3:9 glyph ^-

50+3:12 glyph [

51+3:13 tight name a

52+3:14 tight glyph =

53+3:15 tight aura @ux

54+3:19 name b

55+3:20 tight glyph =

56+3:21 tight aura @t

57+3:23 tight glyph ]

58+3:25 glyph (

59+3:26 tight name project-increment

60+3:44 glyph [

61+3:45 tight name a

62+3:46 tight glyph =

63+3:47 tight lit 0x7

64+3:51 name b

65+3:52 tight glyph =

66+3:53 tight str "x"

67+3:57 name c

68+3:58 tight glyph =

69+3:59 tight lit 0

70+3:60 tight glyph ]

71+3:61 tight glyph )

72+4:1 NEWLINE

73+4:1 glyph ++

74+4:4 name flag

75+4:9 glyph (

76+4:10 tight name project-increment

77+4:28 glyph [

78+4:29 tight name a

79+4:30 tight glyph =

80+4:31 tight lit %.y

81+4:35 name b

82+4:36 tight glyph =

83+4:37 tight str "x"

84+4:41 name c

85+4:42 tight glyph =

86+4:43 tight lit 0

87+4:44 tight glyph ]

88+4:45 tight glyph )

89+5:1 NEWLINE

90+5:1 glyph ++

91+5:4 name mixed

92+5:10 glyph (

93+5:11 tight name add

94+5:15 lit ~zod

95+5:20 str "x"

96+5:23 tight glyph )

97+6:1 NEWLINE

98+6:1 glyph ++

99+6:4 name path-and-number

100+6:20 glyph [

101+6:21 tight name path

102+6:25 tight glyph =

103+6:26 tight glyph %/

104+6:28 tight knot foo

105+6:32 name number

106+6:38 tight glyph =

107+6:39 tight glyph (

108+6:40 tight name add

109+6:44 lit 1

110+6:46 lit 2

111+6:47 tight glyph )

112+6:48 tight glyph ]

113+7:1 NEWLINE

114+7:1 glyph ++

115+7:4 name path-value

116+7:15 glyph |=

117+7:18 name p

118+7:19 tight glyph =

119+7:20 tight name qath

120+7:25 glyph [

121+7:26 tight name path

122+7:30 tight glyph =

123+7:31 tight name p

124+7:33 name number

125+7:39 tight glyph =

126+7:40 tight glyph (

127+7:41 tight name add

128+7:45 lit 1

129+7:47 lit 2

130+7:48 tight glyph )

131+7:49 tight glyph ]

132+8:1 NEWLINE

133+8:1 glyph ++

134+8:4 name with-path

135+8:14 glyph |=

136+8:17 name r

137+8:18 tight glyph =

138+8:19 tight glyph [

139+8:20 tight name a

140+8:21 tight glyph =

141+8:22 tight tvar A

142+8:24 name b

143+8:25 tight glyph =

144+8:26 tight name qath

145+8:31 name c

146+8:32 tight glyph =

147+8:33 tight aura @ud

148+8:36 tight glyph ]

149+9:3 INDENT

150+9:3 glyph ^-

151+9:6 glyph [

152+9:7 tight name a

153+9:8 tight glyph =

154+9:9 tight tvar A

155+9:11 name b

156+9:12 tight glyph =

157+9:13 tight name qath

158+9:17 tight glyph ]

159+9:19 glyph (

160+9:20 tight name proj

161+9:25 glyph [

162+9:26 tight name a

163+9:27 tight glyph =

164+9:28 tight glyph (

165+9:29 tight name dec

166+9:33 wing a.r

167+9:36 tight glyph )

168+9:38 name b

169+9:39 tight glyph =

170+9:40 tight wing b.r

171+9:44 name c

172+9:45 tight glyph =

173+9:46 tight wing c.r

174+9:49 tight glyph ]

175+9:50 tight glyph )

176+10:1 DEDENT

177+10:1 NEWLINE

178+10:1 glyph ++

179+10:4 name wrong-width

180+10:16 glyph ^-

181+10:19 glyph [

182+10:20 tight name a

183+10:21 tight glyph =

184+10:22 tight aura @ud

185+10:26 name b

186+10:27 tight glyph =

187+10:28 tight aura @t

188+10:30 tight glyph ]

189+10:32 glyph [

190+10:33 tight name a

191+10:34 tight glyph =

192+10:35 tight glyph (

193+10:36 tight name add

194+10:40 lit 1

195+10:42 lit 2

196+10:43 tight glyph )

197+10:45 name b

198+10:46 tight glyph =

199+10:47 tight str "x"

200+10:51 name c

201+10:52 tight glyph =

202+10:53 tight lit 0

203+10:54 tight glyph ]

204+11:1 NEWLINE

205+11:1 glyph ++

206+11:4 name select-one

207+11:15 glyph |=

208+11:18 name r

209+11:19 tight glyph =

210+11:20 tight glyph [

211+11:21 tight name a

212+11:22 tight glyph =

213+11:23 tight tvar A

214+11:25 name b

215+11:26 tight glyph =

216+11:27 tight aura @t

217+11:29 tight glyph ]

218+12:3 INDENT

219+12:3 glyph ^-

220+12:6 glyph [

221+12:7 tight name a

222+12:8 tight glyph =

223+12:9 tight tvar A

224+12:10 tight glyph ]

225+12:12 glyph (

226+12:13 tight name proj

227+12:18 glyph [

228+12:19 tight name a

229+12:20 tight glyph =

230+12:21 tight glyph (

231+12:22 tight name add

232+12:26 wing a.r

233+12:30 lit 1

234+12:31 tight glyph )

235+12:33 name b

236+12:34 tight glyph =

237+12:35 tight wing b.r

238+12:38 tight glyph ]

239+12:39 tight glyph )

240+13:1 DEDENT

241+13:1 NEWLINE

242+13:1 glyph ++

243+13:4 name select-one-ux

244+13:18 glyph ^-

245+13:21 glyph [

246+13:22 tight name a

247+13:23 tight glyph =

248+13:24 tight aura @ux

249+13:27 tight glyph ]

250+13:29 glyph (

251+13:30 tight name select-one

252+13:41 glyph [

253+13:42 tight name a

254+13:43 tight glyph =

255+13:44 tight lit 0x7

256+13:48 name b

257+13:49 tight glyph =

258+13:50 tight str "x"

259+13:53 tight glyph ]

260+13:54 tight glyph )

261+14:1 NEWLINE

262+14:1 glyph ++

263+14:4 name select-one-bool

264+14:20 glyph (

265+14:21 tight name select-one

266+14:32 glyph [

267+14:33 tight name a

268+14:34 tight glyph =

269+14:35 tight lit %.y

270+14:39 name b

271+14:40 tight glyph =

272+14:41 tight str "x"

273+14:44 tight glyph ]

274+14:45 tight glyph )

275+15:1 NEWLINE

276+15:1 glyph ++

277+15:4 name scalar

278+15:11 glyph |=

279+15:14 name x

280+15:15 tight glyph =

281+15:16 tight aura @t

282+15:19 name x

283+16:1 NEWLINE

284+16:1 glyph ++

285+16:4 name no-binder-field

286+16:20 glyph (

287+16:21 tight name scalar

288+16:28 glyph (

289+16:29 tight name proj

290+16:34 glyph [

291+16:35 tight name x

292+16:36 tight glyph =

293+16:37 tight str "ok"

294+16:42 name y

295+16:43 tight glyph =

296+16:44 tight lit ~zod

297+16:48 tight glyph ]

298+16:49 tight glyph )

299+16:50 tight glyph )

300+17:1 NEWLINE

301+17:1 glyph ++

302+17:4 name select-one-nested

303+17:22 glyph |=

304+17:25 name r

305+17:26 tight glyph =

306+17:27 tight glyph [

307+17:28 tight name a

308+17:29 tight glyph =

309+17:30 tight tvar A

310+17:32 name b

311+17:33 tight glyph =

312+17:34 tight aura @t

313+17:36 tight glyph ]

314+18:3 INDENT

315+18:3 glyph ^-

316+18:6 glyph [

317+18:7 tight name outer

318+18:12 tight glyph =

319+18:13 tight glyph [

320+18:14 tight name a

321+18:15 tight glyph =

322+18:16 tight tvar A

323+18:17 tight glyph ]

324+18:19 name marker

325+18:25 tight glyph =

326+18:26 tight aura @ud

327+18:29 tight glyph ]

328+18:31 glyph [

329+18:32 tight name outer

330+18:37 tight glyph =

331+18:38 tight glyph (

332+18:39 tight name proj

333+18:44 glyph [

334+18:45 tight name a

335+18:46 tight glyph =

336+18:47 tight glyph (

337+18:48 tight name add

338+18:52 wing a.r

339+18:56 lit 1

340+18:57 tight glyph )

341+18:59 name b

342+18:60 tight glyph =

343+18:61 tight wing b.r

344+18:64 tight glyph ]

345+18:65 tight glyph )

346+18:67 name marker

347+18:73 tight glyph =

348+18:74 tight lit 0

349+18:75 tight glyph ]

350+18:76 DEDENT

351+18:76 NEWLINE

tests/golden/types-arithmetic-proj-qath/tree.txtnew file+164

@@ -0,0 +1,164 @@

1+(module

2+ (value 1:1 project-increment

3+ (gate 1:22

4+ (face 1:25 r

5+ (cell 1:27

6+ (face 1:28 a (tvar 1:30 A))

7+ (face 1:32 b (aura 1:34 @t))

8+ (face 1:37 c (aura 1:39 @ud))))

9+ (body 2:3

10+ (cast 2:3

11+ (cell 2:6

12+ (face 2:7 a (tvar 2:9 A))

13+ (face 2:11 b (aura 2:13 @t)))

14+ (group 2:17

15+ (call 2:18

16+ (wing 2:18 proj)

17+ (tuple 2:23

18+ (face 2:24 a

19+ (group 2:26

20+ (call 2:27 (wing 2:27 add) (wing 2:31 a.r) (lit 2:35 1))))

21+ (face 2:38 b (wing 2:40 b.r))

22+ (face 2:44 c (wing 2:46 c.r)))))))))

23+ (value 3:1 good

24+ (cast 3:9

25+ (cell 3:12

26+ (face 3:13 a (aura 3:15 @ux))

27+ (face 3:19 b (aura 3:21 @t)))

28+ (group 3:25

29+ (call 3:26

30+ (wing 3:26 project-increment)

31+ (tuple 3:44

32+ (face 3:45 a (lit 3:47 0x7))

33+ (face 3:51 b (str 3:53 "x"))

34+ (face 3:57 c (lit 3:59 0)))))))

35+ (value 4:1 flag

36+ (group 4:9

37+ (call 4:10

38+ (wing 4:10 project-increment)

39+ (tuple 4:28

40+ (face 4:29 a (lit 4:31 %.y))

41+ (face 4:35 b (str 4:37 "x"))

42+ (face 4:41 c (lit 4:43 0))))))

43+ (value 5:1 mixed

44+ (group 5:10

45+ (call 5:11 (wing 5:11 add) (lit 5:15 ~zod) (str 5:20 "x"))))

46+ (value 6:1 path-and-number

47+ (tuple 6:20

48+ (face 6:21 path (qath 6:26 foo))

49+ (face 6:32 number

50+ (group 6:39

51+ (call 6:40 (wing 6:40 add) (lit 6:44 1) (lit 6:46 2))))))

52+ (value 7:1 path-value

53+ (gate 7:15

54+ (face 7:18 p (ref 7:20 qath))

55+ (tuple 7:25

56+ (face 7:26 path (wing 7:31 p))

57+ (face 7:33 number

58+ (group 7:40

59+ (call 7:41 (wing 7:41 add) (lit 7:45 1) (lit 7:47 2)))))))

60+ (value 8:1 with-path

61+ (gate 8:14

62+ (face 8:17 r

63+ (cell 8:19

64+ (face 8:20 a (tvar 8:22 A))

65+ (face 8:24 b (ref 8:26 qath))

66+ (face 8:31 c (aura 8:33 @ud))))

67+ (body 9:3

68+ (cast 9:3

69+ (cell 9:6

70+ (face 9:7 a (tvar 9:9 A))

71+ (face 9:11 b (ref 9:13 qath)))

72+ (group 9:19

73+ (call 9:20

74+ (wing 9:20 proj)

75+ (tuple 9:25

76+ (face 9:26 a

77+ (group 9:28

78+ (call 9:29 (wing 9:29 dec) (wing 9:33 a.r))))

79+ (face 9:38 b (wing 9:40 b.r))

80+ (face 9:44 c (wing 9:46 c.r)))))))))

81+ (value 10:1 wrong-width

82+ (cast 10:16

83+ (cell 10:19

84+ (face 10:20 a (aura 10:22 @ud))

85+ (face 10:26 b (aura 10:28 @t)))

86+ (tuple 10:32

87+ (face 10:33 a

88+ (group 10:35

89+ (call 10:36 (wing 10:36 add) (lit 10:40 1) (lit 10:42 2))))

90+ (face 10:45 b (str 10:47 "x"))

91+ (face 10:51 c (lit 10:53 0)))))

92+ (value 11:1 select-one

93+ (gate 11:15

94+ (face 11:18 r

95+ (cell 11:20

96+ (face 11:21 a (tvar 11:23 A))

97+ (face 11:25 b (aura 11:27 @t))))

98+ (body 12:3

99+ (cast 12:3

100+ (cell 12:6

101+ (face 12:7 a (tvar 12:9 A)))

102+ (group 12:12

103+ (call 12:13

104+ (wing 12:13 proj)

105+ (tuple 12:18

106+ (face 12:19 a

107+ (group 12:21

108+ (call 12:22 (wing 12:22 add) (wing 12:26 a.r) (lit 12:30 1))))

109+ (face 12:33 b (wing 12:35 b.r)))))))))

110+ (value 13:1 select-one-ux

111+ (cast 13:18

112+ (cell 13:21

113+ (face 13:22 a (aura 13:24 @ux)))

114+ (group 13:29

115+ (call 13:30

116+ (wing 13:30 select-one)

117+ (tuple 13:41

118+ (face 13:42 a (lit 13:44 0x7))

119+ (face 13:48 b (str 13:50 "x")))))))

120+ (value 14:1 select-one-bool

121+ (group 14:20

122+ (call 14:21

123+ (wing 14:21 select-one)

124+ (tuple 14:32

125+ (face 14:33 a (lit 14:35 %.y))

126+ (face 14:39 b (str 14:41 "x"))))))

127+ (value 15:1 scalar

128+ (gate 15:11

129+ (face 15:14 x (aura 15:16 @t))

130+ (wing 15:19 x)))

131+ (value 16:1 no-binder-field

132+ (group 16:20

133+ (call 16:21

134+ (wing 16:21 scalar)

135+ (group 16:28

136+ (call 16:29

137+ (wing 16:29 proj)

138+ (tuple 16:34

139+ (face 16:35 x (str 16:37 "ok"))

140+ (face 16:42 y (lit 16:44 ~zod))))))))

141+ (value 17:1 select-one-nested

142+ (gate 17:22

143+ (face 17:25 r

144+ (cell 17:27

145+ (face 17:28 a (tvar 17:30 A))

146+ (face 17:32 b (aura 17:34 @t))))

147+ (body 18:3

148+ (cast 18:3

149+ (cell 18:6

150+ (face 18:7 outer

151+ (cell 18:13

152+ (face 18:14 a (tvar 18:16 A))))

153+ (face 18:19 marker (aura 18:26 @ud)))

154+ (tuple 18:31

155+ (face 18:32 outer

156+ (group 18:38

157+ (call 18:39

158+ (wing 18:39 proj)

159+ (tuple 18:44

160+ (face 18:45 a

161+ (group 18:47

162+ (call 18:48 (wing 18:48 add) (wing 18:52 a.r) (lit 18:56 1))))

163+ (face 18:59 b (wing 18:61 b.r))))))

164+ (face 18:67 marker (lit 18:74 0))))))))

tests/golden/types-arithmetic-proj-qath/types.txtnew file+33

@@ -0,0 +1,33 @@

1+partial inference; module not checked

2+++ project-increment: $-([a=A [b=@t c=@ud]] [a=A b=@t]) where A is an atom other than ?

3+++ good: [a=@ux b=@t]

4+++ flag: call's sample and argument types do not unify

5+/tests/golden/types-arithmetic-proj-qath/source.jibb:4:10: called gate has type $-([a=A [b=@t c=@ud]] [a=A b=@t]) where A is an atom other than ?

6+++ flag (project-increment [a=%.y b="x" c=0])

7+ ^

8+/tests/golden/types-arithmetic-proj-qath/source.jibb:4:28: argument

9+++ flag (project-increment [a=%.y b="x" c=0])

10+ ^

11+++ mixed: call's sample and argument types do not unify

12+/tests/golden/types-arithmetic-proj-qath/source.jibb:5:11: called gate has type $-([A A] A) where A is an atom other than ?

13+++ mixed (add ~zod "x")

14+ ^

15+/tests/golden/types-arithmetic-proj-qath/source.jibb:5:15: argument has type [@p @t]

16+++ mixed (add ~zod "x")

17+ ^

18+++ path-and-number: [path=qath number=@ud]

19+++ path-value: unresolved aura-variable inference

20+++ with-path: $-([a=A [b=qath c=@ud]] [a=A b=qath]) where A is an atom other than ?

21+++ wrong-width: record width constraint needs unsupported inference

22+++ select-one: $-([a=A b=@t] [a=A]) where A is an atom other than ?

23+++ select-one-ux: [a=@ux]

24+++ select-one-bool: call's sample and argument types do not unify

25+/tests/golden/types-arithmetic-proj-qath/source.jibb:14:21: called gate has type $-([a=A b=@t] [a=A]) where A is an atom other than ?

26+++ select-one-bool (select-one [a=%.y b="x"])

27+ ^

28+/tests/golden/types-arithmetic-proj-qath/source.jibb:14:32: argument has type [a=? b=@t]

29+++ select-one-bool (select-one [a=%.y b="x"])

30+ ^

31+++ scalar: $-(@t @t)

32+++ no-binder-field: proj needs an expected record type

33+++ select-one-nested: $-([a=A b=@t] [outer=[a=A] marker=@ud]) where A is an atom other than ?

tests/golden/types-arithmetic-scopes/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: docs/spec/grammar.md, Molds, Atoms: "Arithmetic rejects loobean operands: `?` contains only 0 and 1, while an arithmetic result need not."

2+tests: Independent aura instantiation, shared and distinct capitals, nested/local captures, pending literals and direct/mutual recursion preserve the constraint or fail closed.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-arithmetic-scopes/modules.txtnew file+1

@@ -0,0 +1 @@

1+# Opt in to the actual source-backed prelude.

tests/golden/types-arithmetic-scopes/source.jibbnew file+22

@@ -0,0 +1,22 @@

1+++ inc |= n=A (add n 1)

2+++ inc-r |= n=A (add 1 n)

3+++ text-case ^- @t (inc "x")

4+++ ship-case ^- @p (inc ~zod)

5+++ shared-case |= [a=A b=A] (add a b)

6+++ distinct |= [a=A b=B] (add a b)

7+++ nested |= n=A |= x=A (add n 1)

8+++ local-fresh |= outer=@t

9+ ++ inner |= n=A (add n 1)

10+ [(inner "a") (inner ~zod)]

11+++ local-capture |= outer=A

12+ ++ inner |= n=A (add outer 1)

13+ (inner outer)

14+++ trace-tag

15+ ~& %dangling

16+ (add 1 2)

17+++ trace-number

18+ ~& 4

19+ (add 1 2)

20+++ recurse |= n=A (add n (recurse n))

21+++ mutual-a |= n=A (add n (mutual-b n))

22+++ mutual-b |= n=A (add n (mutual-a n))

tests/golden/types-arithmetic-scopes/tokens.txtnew file+221

@@ -0,0 +1,221 @@

1+1:1 glyph ++

2+1:4 name inc

3+1:8 glyph |=

4+1:11 name n

5+1:12 tight glyph =

6+1:13 tight tvar A

7+1:15 glyph (

8+1:16 tight name add

9+1:20 name n

10+1:22 lit 1

11+1:23 tight glyph )

12+2:1 NEWLINE

13+2:1 glyph ++

14+2:4 name inc-r

15+2:10 glyph |=

16+2:13 name n

17+2:14 tight glyph =

18+2:15 tight tvar A

19+2:17 glyph (

20+2:18 tight name add

21+2:22 lit 1

22+2:24 name n

23+2:25 tight glyph )

24+3:1 NEWLINE

25+3:1 glyph ++

26+3:4 name text-case

27+3:14 glyph ^-

28+3:17 aura @t

29+3:20 glyph (

30+3:21 tight name inc

31+3:25 str "x"

32+3:28 tight glyph )

33+4:1 NEWLINE

34+4:1 glyph ++

35+4:4 name ship-case

36+4:14 glyph ^-

37+4:17 aura @p

38+4:20 glyph (

39+4:21 tight name inc

40+4:25 lit ~zod

41+4:29 tight glyph )

42+5:1 NEWLINE

43+5:1 glyph ++

44+5:4 name shared-case

45+5:16 glyph |=

46+5:19 glyph [

47+5:20 tight name a

48+5:21 tight glyph =

49+5:22 tight tvar A

50+5:24 name b

51+5:25 tight glyph =

52+5:26 tight tvar A

53+5:27 tight glyph ]

54+5:29 glyph (

55+5:30 tight name add

56+5:34 name a

57+5:36 name b

58+5:37 tight glyph )

59+6:1 NEWLINE

60+6:1 glyph ++

61+6:4 name distinct

62+6:13 glyph |=

63+6:16 glyph [

64+6:17 tight name a

65+6:18 tight glyph =

66+6:19 tight tvar A

67+6:21 name b

68+6:22 tight glyph =

69+6:23 tight tvar B

70+6:24 tight glyph ]

71+6:26 glyph (

72+6:27 tight name add

73+6:31 name a

74+6:33 name b

75+6:34 tight glyph )

76+7:1 NEWLINE

77+7:1 glyph ++

78+7:4 name nested

79+7:11 glyph |=

80+7:14 name n

81+7:15 tight glyph =

82+7:16 tight tvar A

83+7:18 glyph |=

84+7:21 name x

85+7:22 tight glyph =

86+7:23 tight tvar A

87+7:25 glyph (

88+7:26 tight name add

89+7:30 name n

90+7:32 lit 1

91+7:33 tight glyph )

92+8:1 NEWLINE

93+8:1 glyph ++

94+8:4 name local-fresh

95+8:16 glyph |=

96+8:19 name outer

97+8:24 tight glyph =

98+8:25 tight aura @t

99+9:3 INDENT

100+9:3 glyph ++

101+9:6 name inner

102+9:12 glyph |=

103+9:15 name n

104+9:16 tight glyph =

105+9:17 tight tvar A

106+9:19 glyph (

107+9:20 tight name add

108+9:24 name n

109+9:26 lit 1

110+9:27 tight glyph )

111+10:3 NEWLINE

112+10:3 glyph [

113+10:4 tight glyph (

114+10:5 tight name inner

115+10:11 str "a"

116+10:14 tight glyph )

117+10:16 glyph (

118+10:17 tight name inner

119+10:23 lit ~zod

120+10:27 tight glyph )

121+10:28 tight glyph ]

122+11:1 DEDENT

123+11:1 NEWLINE

124+11:1 glyph ++

125+11:4 name local-capture

126+11:18 glyph |=

127+11:21 name outer

128+11:26 tight glyph =

129+11:27 tight tvar A

130+12:3 INDENT

131+12:3 glyph ++

132+12:6 name inner

133+12:12 glyph |=

134+12:15 name n

135+12:16 tight glyph =

136+12:17 tight tvar A

137+12:19 glyph (

138+12:20 tight name add

139+12:24 name outer

140+12:30 lit 1

141+12:31 tight glyph )

142+13:3 NEWLINE

143+13:3 glyph (

144+13:4 tight name inner

145+13:10 name outer

146+13:15 tight glyph )

147+14:1 DEDENT

148+14:1 NEWLINE

149+14:1 glyph ++

150+14:4 name trace-tag

151+15:3 INDENT

152+15:3 glyph ~&

153+15:6 lit %dangling

154+16:5 INDENT

155+16:5 glyph (

156+16:6 tight name add

157+16:10 lit 1

158+16:12 lit 2

159+16:13 tight glyph )

160+17:1 DEDENT

161+17:1 DEDENT

162+17:1 NEWLINE

163+17:1 glyph ++

164+17:4 name trace-number

165+18:3 INDENT

166+18:3 glyph ~&

167+18:6 lit 4

168+19:5 INDENT

169+19:5 glyph (

170+19:6 tight name add

171+19:10 lit 1

172+19:12 lit 2

173+19:13 tight glyph )

174+20:1 DEDENT

175+20:1 DEDENT

176+20:1 NEWLINE

177+20:1 glyph ++

178+20:4 name recurse

179+20:12 glyph |=

180+20:15 name n

181+20:16 tight glyph =

182+20:17 tight tvar A

183+20:19 glyph (

184+20:20 tight name add

185+20:24 name n

186+20:26 glyph (

187+20:27 tight name recurse

188+20:35 name n

189+20:36 tight glyph )

190+20:37 tight glyph )

191+21:1 NEWLINE

192+21:1 glyph ++

193+21:4 name mutual-a

194+21:13 glyph |=

195+21:16 name n

196+21:17 tight glyph =

197+21:18 tight tvar A

198+21:20 glyph (

199+21:21 tight name add

200+21:25 name n

201+21:27 glyph (

202+21:28 tight name mutual-b

203+21:37 name n

204+21:38 tight glyph )

205+21:39 tight glyph )

206+22:1 NEWLINE

207+22:1 glyph ++

208+22:4 name mutual-b

209+22:13 glyph |=

210+22:16 name n

211+22:17 tight glyph =

212+22:18 tight tvar A

213+22:20 glyph (

214+22:21 tight name add

215+22:25 name n

216+22:27 glyph (

217+22:28 tight name mutual-a

218+22:37 name n

219+22:38 tight glyph )

220+22:39 tight glyph )

221+22:40 NEWLINE

tests/golden/types-arithmetic-scopes/tree.txtnew file+108

@@ -0,0 +1,108 @@

1+(module

2+ (value 1:1 inc

3+ (gate 1:8

4+ (face 1:11 n (tvar 1:13 A))

5+ (group 1:15

6+ (call 1:16 (wing 1:16 add) (wing 1:20 n) (lit 1:22 1)))))

7+ (value 2:1 inc-r

8+ (gate 2:10

9+ (face 2:13 n (tvar 2:15 A))

10+ (group 2:17

11+ (call 2:18 (wing 2:18 add) (lit 2:22 1) (wing 2:24 n)))))

12+ (value 3:1 text-case

13+ (cast 3:14

14+ (aura 3:17 @t)

15+ (group 3:20

16+ (call 3:21 (wing 3:21 inc) (str 3:25 "x")))))

17+ (value 4:1 ship-case

18+ (cast 4:14

19+ (aura 4:17 @p)

20+ (group 4:20

21+ (call 4:21 (wing 4:21 inc) (lit 4:25 ~zod)))))

22+ (value 5:1 shared-case

23+ (gate 5:16

24+ (cell 5:19

25+ (face 5:20 a (tvar 5:22 A))

26+ (face 5:24 b (tvar 5:26 A)))

27+ (group 5:29

28+ (call 5:30 (wing 5:30 add) (wing 5:34 a) (wing 5:36 b)))))

29+ (value 6:1 distinct

30+ (gate 6:13

31+ (cell 6:16

32+ (face 6:17 a (tvar 6:19 A))

33+ (face 6:21 b (tvar 6:23 B)))

34+ (group 6:26

35+ (call 6:27 (wing 6:27 add) (wing 6:31 a) (wing 6:33 b)))))

36+ (value 7:1 nested

37+ (gate 7:11

38+ (face 7:14 n (tvar 7:16 A))

39+ (gate 7:18

40+ (face 7:21 x (tvar 7:23 A))

41+ (group 7:25

42+ (call 7:26 (wing 7:26 add) (wing 7:30 n) (lit 7:32 1))))))

43+ (value 8:1 local-fresh

44+ (gate 8:16

45+ (face 8:19 outer (aura 8:25 @t))

46+ (body 9:3

47+ (value 9:3 inner

48+ (gate 9:12

49+ (face 9:15 n (tvar 9:17 A))

50+ (group 9:19

51+ (call 9:20 (wing 9:20 add) (wing 9:24 n) (lit 9:26 1)))))

52+ (tuple 10:3

53+ (group 10:4

54+ (call 10:5 (wing 10:5 inner) (str 10:11 "a")))

55+ (group 10:16

56+ (call 10:17 (wing 10:17 inner) (lit 10:23 ~zod)))))))

57+ (value 11:1 local-capture

58+ (gate 11:18

59+ (face 11:21 outer (tvar 11:27 A))

60+ (body 12:3

61+ (value 12:3 inner

62+ (gate 12:12

63+ (face 12:15 n (tvar 12:17 A))

64+ (group 12:19

65+ (call 12:20 (wing 12:20 add) (wing 12:24 outer) (lit 12:30 1)))))

66+ (group 13:3

67+ (call 13:4 (wing 13:4 inner) (wing 13:10 outer))))))

68+ (value 14:1 trace-tag

69+ (body 15:3

70+ (trace 15:3

71+ (lit 15:6 %dangling)

72+ (body 16:5

73+ (group 16:5

74+ (call 16:6 (wing 16:6 add) (lit 16:10 1) (lit 16:12 2)))))))

75+ (value 17:1 trace-number

76+ (body 18:3

77+ (trace 18:3

78+ (lit 18:6 4)

79+ (body 19:5

80+ (group 19:5

81+ (call 19:6 (wing 19:6 add) (lit 19:10 1) (lit 19:12 2)))))))

82+ (value 20:1 recurse

83+ (gate 20:12

84+ (face 20:15 n (tvar 20:17 A))

85+ (group 20:19

86+ (call 20:20

87+ (wing 20:20 add)

88+ (wing 20:24 n)

89+ (group 20:26

90+ (call 20:27 (wing 20:27 recurse) (wing 20:35 n)))))))

91+ (value 21:1 mutual-a

92+ (gate 21:13

93+ (face 21:16 n (tvar 21:18 A))

94+ (group 21:20

95+ (call 21:21

96+ (wing 21:21 add)

97+ (wing 21:25 n)

98+ (group 21:27

99+ (call 21:28 (wing 21:28 mutual-b) (wing 21:37 n)))))))

100+ (value 22:1 mutual-b

101+ (gate 22:13

102+ (face 22:16 n (tvar 22:18 A))

103+ (group 22:20

104+ (call 22:21

105+ (wing 22:21 add)

106+ (wing 22:25 n)

107+ (group 22:27

108+ (call 22:28 (wing 22:28 mutual-a) (wing 22:37 n))))))))

tests/golden/types-arithmetic-scopes/types.txtnew file+21

@@ -0,0 +1,21 @@

1+partial inference; module not checked

2+++ inc: $-(A A) where A is an atom other than ?

3+++ inc-r: $-(A A) where A is an atom other than ?

4+++ text-case: @t

5+++ ship-case: @p

6+++ shared-case: $-([a=A b=A] A) where A is an atom other than ?

7+++ distinct: distinct type variables `A` and `B` must not be forced equal; use the same capital for a shared type

8+/tests/golden/types-arithmetic-scopes/source.jibb:6:19: first type variable

9+++ distinct |= [a=A b=B] (add a b)

10+ ^

11+/tests/golden/types-arithmetic-scopes/source.jibb:6:23: second type variable

12+++ distinct |= [a=A b=B] (add a b)

13+ ^

14+++ nested: $-(A $-(A A)) where A is an atom other than ?

15+++ local-fresh: $-(@t [@t @p])

16+++ local-capture: explicit capital constraints are not supported by partial inference

17+++ trace-tag: tag needs context in partial inference

18+++ trace-number: @ud

19+++ recurse: $-(A A) where A is an atom other than ?

20+++ mutual-a: $-(A A) where A is an atom other than ?

21+++ mutual-b: $-(A A) where A is an atom other than ?

tests/golden/types-cell-pattern-many/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Patterns: a name binds anew and the last position of a cell pattern binds the rest; Modules: no name may shadow one already in scope.

2+tests: A complete single-arm cell pattern of binders follows the right-nested cell spine, preserving polymorphism and the final tail. Duplicate or shadowed binders and definite non-cell subjects fail; uncertain union/collection spines and other patterns stay unsupported.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-cell-pattern-many/modules.txtnew file+1

@@ -0,0 +1 @@

1+# Use the prepared prelude.

tests/golden/types-cell-pattern-many/source.jibbnew file+41

@@ -0,0 +1,41 @@

1+++ three |= args=[@t @p ?]

2+ ?- args

3+ [a b c] c

4+++ four |= args=[@t @p ? @ux]

5+ ?- args

6+ [a b c d] d

7+++ rest |= args=[@t @p [? @ux]]

8+ ?- args

9+ [a b c] c

10+++ infer |= x

11+ ?- x

12+ [a b c] [c b a]

13+++ duplicate |= args=[@t @p ?]

14+ ?- args

15+ [a b a] a

16+++ shadow |= args=[@t @p ?]

17+ ?- args

18+ [args b c] b

19+++ prelude-shadow |= args=[@t @p ?]

20+ ?- args

21+ [a not c] c

22+++ atom |= args=@t

23+ ?- args

24+ [a b c] a

25+++ too-many |= args=[@t @p]

26+ ?- args

27+ [a b c] a

28+++ record |= args=[a=@t b=@p c=?]

29+ ?- args

30+ [a b c] a

31+++ nested |= args=[@t [@p ?] @ux]

32+ ?- args

33+ [a [b c] d] d

34+++ wildcard |= args=[@t @p ?]

35+ ?- args

36+ [a * c] c

37+++ pending |= args=[@t @p ?]

38+ ?- args

39+ [a b c]

40+ ~& %unused

41+ c

tests/golden/types-cell-pattern-many/tokens.txtnew file+315

@@ -0,0 +1,315 @@

1+1:1 glyph ++

2+1:4 name three

3+1:10 glyph |=

4+1:13 name args

5+1:17 tight glyph =

6+1:18 tight glyph [

7+1:19 tight aura @t

8+1:22 aura @p

9+1:25 glyph ?

10+1:26 tight glyph ]

11+2:3 INDENT

12+2:3 glyph ?-

13+2:6 name args

14+3:5 INDENT

15+3:5 glyph [

16+3:6 tight name a

17+3:8 name b

18+3:10 name c

19+3:11 tight glyph ]

20+3:13 name c

21+4:1 DEDENT

22+4:1 DEDENT

23+4:1 NEWLINE

24+4:1 glyph ++

25+4:4 name four

26+4:9 glyph |=

27+4:12 name args

28+4:16 tight glyph =

29+4:17 tight glyph [

30+4:18 tight aura @t

31+4:21 aura @p

32+4:24 glyph ?

33+4:26 aura @ux

34+4:29 tight glyph ]

35+5:3 INDENT

36+5:3 glyph ?-

37+5:6 name args

38+6:5 INDENT

39+6:5 glyph [

40+6:6 tight name a

41+6:8 name b

42+6:10 name c

43+6:12 name d

44+6:13 tight glyph ]

45+6:15 name d

46+7:1 DEDENT

47+7:1 DEDENT

48+7:1 NEWLINE

49+7:1 glyph ++

50+7:4 name rest

51+7:9 glyph |=

52+7:12 name args

53+7:16 tight glyph =

54+7:17 tight glyph [

55+7:18 tight aura @t

56+7:21 aura @p

57+7:24 glyph [

58+7:25 tight glyph ?

59+7:27 aura @ux

60+7:30 tight glyph ]

61+7:31 tight glyph ]

62+8:3 INDENT

63+8:3 glyph ?-

64+8:6 name args

65+9:5 INDENT

66+9:5 glyph [

67+9:6 tight name a

68+9:8 name b

69+9:10 name c

70+9:11 tight glyph ]

71+9:13 name c

72+10:1 DEDENT

73+10:1 DEDENT

74+10:1 NEWLINE

75+10:1 glyph ++

76+10:4 name infer

77+10:10 glyph |=

78+10:13 name x

79+11:3 INDENT

80+11:3 glyph ?-

81+11:6 name x

82+12:5 INDENT

83+12:5 glyph [

84+12:6 tight name a

85+12:8 name b

86+12:10 name c

87+12:11 tight glyph ]

88+12:13 glyph [

89+12:14 tight name c

90+12:16 name b

91+12:18 name a

92+12:19 tight glyph ]

93+13:1 DEDENT

94+13:1 DEDENT

95+13:1 NEWLINE

96+13:1 glyph ++

97+13:4 name duplicate

98+13:14 glyph |=

99+13:17 name args

100+13:21 tight glyph =

101+13:22 tight glyph [

102+13:23 tight aura @t

103+13:26 aura @p

104+13:29 glyph ?

105+13:30 tight glyph ]

106+14:3 INDENT

107+14:3 glyph ?-

108+14:6 name args

109+15:5 INDENT

110+15:5 glyph [

111+15:6 tight name a

112+15:8 name b

113+15:10 name a

114+15:11 tight glyph ]

115+15:13 name a

116+16:1 DEDENT

117+16:1 DEDENT

118+16:1 NEWLINE

119+16:1 glyph ++

120+16:4 name shadow

121+16:11 glyph |=

122+16:14 name args

123+16:18 tight glyph =

124+16:19 tight glyph [

125+16:20 tight aura @t

126+16:23 aura @p

127+16:26 glyph ?

128+16:27 tight glyph ]

129+17:3 INDENT

130+17:3 glyph ?-

131+17:6 name args

132+18:5 INDENT

133+18:5 glyph [

134+18:6 tight name args

135+18:11 name b

136+18:13 name c

137+18:14 tight glyph ]

138+18:16 name b

139+19:1 DEDENT

140+19:1 DEDENT

141+19:1 NEWLINE

142+19:1 glyph ++

143+19:4 name prelude-shadow

144+19:19 glyph |=

145+19:22 name args

146+19:26 tight glyph =

147+19:27 tight glyph [

148+19:28 tight aura @t

149+19:31 aura @p

150+19:34 glyph ?

151+19:35 tight glyph ]

152+20:3 INDENT

153+20:3 glyph ?-

154+20:6 name args

155+21:5 INDENT

156+21:5 glyph [

157+21:6 tight name a

158+21:8 name not

159+21:12 name c

160+21:13 tight glyph ]

161+21:15 name c

162+22:1 DEDENT

163+22:1 DEDENT

164+22:1 NEWLINE

165+22:1 glyph ++

166+22:4 name atom

167+22:9 glyph |=

168+22:12 name args

169+22:16 tight glyph =

170+22:17 tight aura @t

171+23:3 INDENT

172+23:3 glyph ?-

173+23:6 name args

174+24:5 INDENT

175+24:5 glyph [

176+24:6 tight name a

177+24:8 name b

178+24:10 name c

179+24:11 tight glyph ]

180+24:13 name a

181+25:1 DEDENT

182+25:1 DEDENT

183+25:1 NEWLINE

184+25:1 glyph ++

185+25:4 name too-many

186+25:13 glyph |=

187+25:16 name args

188+25:20 tight glyph =

189+25:21 tight glyph [

190+25:22 tight aura @t

191+25:25 aura @p

192+25:27 tight glyph ]

193+26:3 INDENT

194+26:3 glyph ?-

195+26:6 name args

196+27:5 INDENT

197+27:5 glyph [

198+27:6 tight name a

199+27:8 name b

200+27:10 name c

201+27:11 tight glyph ]

202+27:13 name a

203+28:1 DEDENT

204+28:1 DEDENT

205+28:1 NEWLINE

206+28:1 glyph ++

207+28:4 name record

208+28:11 glyph |=

209+28:14 name args

210+28:18 tight glyph =

211+28:19 tight glyph [

212+28:20 tight name a

213+28:21 tight glyph =

214+28:22 tight aura @t

215+28:25 name b

216+28:26 tight glyph =

217+28:27 tight aura @p

218+28:30 name c

219+28:31 tight glyph =

220+28:32 tight glyph ?

221+28:33 tight glyph ]

222+29:3 INDENT

223+29:3 glyph ?-

224+29:6 name args

225+30:5 INDENT

226+30:5 glyph [

227+30:6 tight name a

228+30:8 name b

229+30:10 name c

230+30:11 tight glyph ]

231+30:13 name a

232+31:1 DEDENT

233+31:1 DEDENT

234+31:1 NEWLINE

235+31:1 glyph ++

236+31:4 name nested

237+31:11 glyph |=

238+31:14 name args

239+31:18 tight glyph =

240+31:19 tight glyph [

241+31:20 tight aura @t

242+31:23 glyph [

243+31:24 tight aura @p

244+31:27 glyph ?

245+31:28 tight glyph ]

246+31:30 aura @ux

247+31:33 tight glyph ]

248+32:3 INDENT

249+32:3 glyph ?-

250+32:6 name args

251+33:5 INDENT

252+33:5 glyph [

253+33:6 tight name a

254+33:8 glyph [

255+33:9 tight name b

256+33:11 name c

257+33:12 tight glyph ]

258+33:14 name d

259+33:15 tight glyph ]

260+33:17 name d

261+34:1 DEDENT

262+34:1 DEDENT

263+34:1 NEWLINE

264+34:1 glyph ++

265+34:4 name wildcard

266+34:13 glyph |=

267+34:16 name args

268+34:20 tight glyph =

269+34:21 tight glyph [

270+34:22 tight aura @t

271+34:25 aura @p

272+34:28 glyph ?

273+34:29 tight glyph ]

274+35:3 INDENT

275+35:3 glyph ?-

276+35:6 name args

277+36:5 INDENT

278+36:5 glyph [

279+36:6 tight name a

280+36:8 glyph *

281+36:10 name c

282+36:11 tight glyph ]

283+36:13 name c

284+37:1 DEDENT

285+37:1 DEDENT

286+37:1 NEWLINE

287+37:1 glyph ++

288+37:4 name pending

289+37:12 glyph |=

290+37:15 name args

291+37:19 tight glyph =

292+37:20 tight glyph [

293+37:21 tight aura @t

294+37:24 aura @p

295+37:27 glyph ?

296+37:28 tight glyph ]

297+38:3 INDENT

298+38:3 glyph ?-

299+38:6 name args

300+39:5 INDENT

301+39:5 glyph [

302+39:6 tight name a

303+39:8 name b

304+39:10 name c

305+39:11 tight glyph ]

306+40:7 INDENT

307+40:7 glyph ~&

308+40:10 lit %unused

309+41:9 INDENT

310+41:9 name c

311+41:10 DEDENT

312+41:10 DEDENT

313+41:10 DEDENT

314+41:10 DEDENT

315+41:10 NEWLINE

tests/golden/types-cell-pattern-many/tree.txtnew file+144

@@ -0,0 +1,144 @@

1+(module

2+ (value 1:1 three

3+ (gate 1:10

4+ (face 1:13 args

5+ (cell 1:18 (aura 1:19 @t) (aura 1:22 @p) (flag 1:25)))

6+ (body 2:3

7+ (branch 2:3

8+ (wing 2:6 args)

9+ (arm 3:5

10+ (cell 3:5 (bind 3:6 a) (bind 3:8 b) (bind 3:10 c))

11+ (wing 3:13 c))))))

12+ (value 4:1 four

13+ (gate 4:9

14+ (face 4:12 args

15+ (cell 4:17 (aura 4:18 @t) (aura 4:21 @p) (flag 4:24) (aura 4:26 @ux)))

16+ (body 5:3

17+ (branch 5:3

18+ (wing 5:6 args)

19+ (arm 6:5

20+ (cell 6:5 (bind 6:6 a) (bind 6:8 b) (bind 6:10 c) (bind 6:12 d))

21+ (wing 6:15 d))))))

22+ (value 7:1 rest

23+ (gate 7:9

24+ (face 7:12 args

25+ (cell 7:17

26+ (aura 7:18 @t)

27+ (aura 7:21 @p)

28+ (cell 7:24 (flag 7:25) (aura 7:27 @ux))))

29+ (body 8:3

30+ (branch 8:3

31+ (wing 8:6 args)

32+ (arm 9:5

33+ (cell 9:5 (bind 9:6 a) (bind 9:8 b) (bind 9:10 c))

34+ (wing 9:13 c))))))

35+ (value 10:1 infer

36+ (gate 10:10

37+ (bind 10:13 x)

38+ (body 11:3

39+ (branch 11:3

40+ (wing 11:6 x)

41+ (arm 12:5

42+ (cell 12:5 (bind 12:6 a) (bind 12:8 b) (bind 12:10 c))

43+ (tuple 12:13 (wing 12:14 c) (wing 12:16 b) (wing 12:18 a)))))))

44+ (value 13:1 duplicate

45+ (gate 13:14

46+ (face 13:17 args

47+ (cell 13:22 (aura 13:23 @t) (aura 13:26 @p) (flag 13:29)))

48+ (body 14:3

49+ (branch 14:3

50+ (wing 14:6 args)

51+ (arm 15:5

52+ (cell 15:5 (bind 15:6 a) (bind 15:8 b) (bind 15:10 a))

53+ (wing 15:13 a))))))

54+ (value 16:1 shadow

55+ (gate 16:11

56+ (face 16:14 args

57+ (cell 16:19 (aura 16:20 @t) (aura 16:23 @p) (flag 16:26)))

58+ (body 17:3

59+ (branch 17:3

60+ (wing 17:6 args)

61+ (arm 18:5

62+ (cell 18:5 (bind 18:6 args) (bind 18:11 b) (bind 18:13 c))

63+ (wing 18:16 b))))))

64+ (value 19:1 prelude-shadow

65+ (gate 19:19

66+ (face 19:22 args

67+ (cell 19:27 (aura 19:28 @t) (aura 19:31 @p) (flag 19:34)))

68+ (body 20:3

69+ (branch 20:3

70+ (wing 20:6 args)

71+ (arm 21:5

72+ (cell 21:5 (bind 21:6 a) (bind 21:8 not) (bind 21:12 c))

73+ (wing 21:15 c))))))

74+ (value 22:1 atom

75+ (gate 22:9

76+ (face 22:12 args (aura 22:17 @t))

77+ (body 23:3

78+ (branch 23:3

79+ (wing 23:6 args)

80+ (arm 24:5

81+ (cell 24:5 (bind 24:6 a) (bind 24:8 b) (bind 24:10 c))

82+ (wing 24:13 a))))))

83+ (value 25:1 too-many

84+ (gate 25:13

85+ (face 25:16 args

86+ (cell 25:21 (aura 25:22 @t) (aura 25:25 @p)))

87+ (body 26:3

88+ (branch 26:3

89+ (wing 26:6 args)

90+ (arm 27:5

91+ (cell 27:5 (bind 27:6 a) (bind 27:8 b) (bind 27:10 c))

92+ (wing 27:13 a))))))

93+ (value 28:1 record

94+ (gate 28:11

95+ (face 28:14 args

96+ (cell 28:19

97+ (face 28:20 a (aura 28:22 @t))

98+ (face 28:25 b (aura 28:27 @p))

99+ (face 28:30 c (flag 28:32))))

100+ (body 29:3

101+ (branch 29:3

102+ (wing 29:6 args)

103+ (arm 30:5

104+ (cell 30:5 (bind 30:6 a) (bind 30:8 b) (bind 30:10 c))

105+ (wing 30:13 a))))))

106+ (value 31:1 nested

107+ (gate 31:11

108+ (face 31:14 args

109+ (cell 31:19

110+ (aura 31:20 @t)

111+ (cell 31:23 (aura 31:24 @p) (flag 31:27))

112+ (aura 31:30 @ux)))

113+ (body 32:3

114+ (branch 32:3

115+ (wing 32:6 args)

116+ (arm 33:5

117+ (cell 33:5

118+ (bind 33:6 a)

119+ (cell 33:8 (bind 33:9 b) (bind 33:11 c))

120+ (bind 33:14 d))

121+ (wing 33:17 d))))))

122+ (value 34:1 wildcard

123+ (gate 34:13

124+ (face 34:16 args

125+ (cell 34:21 (aura 34:22 @t) (aura 34:25 @p) (flag 34:28)))

126+ (body 35:3

127+ (branch 35:3

128+ (wing 35:6 args)

129+ (arm 36:5

130+ (cell 36:5 (bind 36:6 a) (any 36:8) (bind 36:10 c))

131+ (wing 36:13 c))))))

132+ (value 37:1 pending

133+ (gate 37:12

134+ (face 37:15 args

135+ (cell 37:20 (aura 37:21 @t) (aura 37:24 @p) (flag 37:27)))

136+ (body 38:3

137+ (branch 38:3

138+ (wing 38:6 args)

139+ (arm 39:5

140+ (cell 39:5 (bind 39:6 a) (bind 39:8 b) (bind 39:10 c))

141+ (body 40:7

142+ (trace 40:7

143+ (lit 40:10 %unused)

144+ (body 41:9 (wing 41:9 c))))))))))

tests/golden/types-cell-pattern-many/types.txtnew file+14

@@ -0,0 +1,14 @@

1+partial inference; module not checked

2+++ three: $-([@t [@p ?]] ?)

3+++ four: $-([@t [@p [? @ux]]] @ux)

4+++ rest: $-([@t [@p [? @ux]]] [? @ux])

5+++ infer: $-([A [B C]] [C [B A]])

6+++ duplicate: pattern shadows a name

7+++ shadow: pattern shadows a name

8+++ prelude-shadow: pattern shadows a name

9+++ atom: cell pattern does not match the subject type

10+++ too-many: cell pattern does not match the subject type

11+++ record: record patterns are not supported by partial inference

12+++ nested: $-([@t [[@p ?] @ux]] @ux)

13+++ wildcard: $-([@t [@p ?]] ?)

14+++ pending: tag needs context in partial inference

tests/golden/types-cell-pattern-schemes/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Patterns: a name binds anew and the last position of a cell pattern binds the rest; Modules: no name may shadow one already in scope.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-cell-pattern-schemes/modules.txtnew file+1

@@ -0,0 +1 @@

1+# Use the prepared prelude.

tests/golden/types-cell-pattern-schemes/source.jibbnew file+23

@@ -0,0 +1,23 @@

1++$ union

2+ [%go @t @p]

3+ %stop

4+++ maybe-union |= x=union

5+ ?- x

6+ [a b c] a

7+++ maybe-list |= x=(list @t)

8+ ?- x

9+ [a b c] a

10+++ identity |= x

11+ ?- x

12+ [a b c] [a b c]

13+++ text (identity "hi" ~zod %.y)

14+++ ship (identity ~zod "hi" %.n)

15+++ shared |= x=[A A A]

16+ ?- x

17+ [a b c] [a b c]

18+++ wrong (shared "hi" ~zod "ok")

19+++ local-shadow |= outer=@t

20+ ++ local |= x=[@t @p ?]

21+ ?- x

22+ [a outer c] c

23+ (local ["x" ~zod %.n])

tests/golden/types-cell-pattern-schemes/tokens.txtnew file+168

@@ -0,0 +1,168 @@

1+1:1 glyph +$

2+1:4 name union

3+2:3 INDENT

4+2:3 glyph [

5+2:4 tight lit %go

6+2:8 aura @t

7+2:11 aura @p

8+2:13 tight glyph ]

9+3:3 NEWLINE

10+3:3 lit %stop

11+4:1 DEDENT

12+4:1 NEWLINE

13+4:1 glyph ++

14+4:4 name maybe-union

15+4:16 glyph |=

16+4:19 name x

17+4:20 tight glyph =

18+4:21 tight name union

19+5:3 INDENT

20+5:3 glyph ?-

21+5:6 name x

22+6:5 INDENT

23+6:5 glyph [

24+6:6 tight name a

25+6:8 name b

26+6:10 name c

27+6:11 tight glyph ]

28+6:13 name a

29+7:1 DEDENT

30+7:1 DEDENT

31+7:1 NEWLINE

32+7:1 glyph ++

33+7:4 name maybe-list

34+7:15 glyph |=

35+7:18 name x

36+7:19 tight glyph =

37+7:20 tight glyph (

38+7:21 tight name list

39+7:26 aura @t

40+7:28 tight glyph )

41+8:3 INDENT

42+8:3 glyph ?-

43+8:6 name x

44+9:5 INDENT

45+9:5 glyph [

46+9:6 tight name a

47+9:8 name b

48+9:10 name c

49+9:11 tight glyph ]

50+9:13 name a

51+10:1 DEDENT

52+10:1 DEDENT

53+10:1 NEWLINE

54+10:1 glyph ++

55+10:4 name identity

56+10:13 glyph |=

57+10:16 name x

58+11:3 INDENT

59+11:3 glyph ?-

60+11:6 name x

61+12:5 INDENT

62+12:5 glyph [

63+12:6 tight name a

64+12:8 name b

65+12:10 name c

66+12:11 tight glyph ]

67+12:13 glyph [

68+12:14 tight name a

69+12:16 name b

70+12:18 name c

71+12:19 tight glyph ]

72+13:1 DEDENT

73+13:1 DEDENT

74+13:1 NEWLINE

75+13:1 glyph ++

76+13:4 name text

77+13:9 glyph (

78+13:10 tight name identity

79+13:19 str "hi"

80+13:24 lit ~zod

81+13:29 lit %.y

82+13:32 tight glyph )

83+14:1 NEWLINE

84+14:1 glyph ++

85+14:4 name ship

86+14:9 glyph (

87+14:10 tight name identity

88+14:19 lit ~zod

89+14:24 str "hi"

90+14:29 lit %.n

91+14:32 tight glyph )

92+15:1 NEWLINE

93+15:1 glyph ++

94+15:4 name shared

95+15:11 glyph |=

96+15:14 name x

97+15:15 tight glyph =

98+15:16 tight glyph [

99+15:17 tight tvar A

100+15:19 tvar A

101+15:21 tvar A

102+15:22 tight glyph ]

103+16:3 INDENT

104+16:3 glyph ?-

105+16:6 name x

106+17:5 INDENT

107+17:5 glyph [

108+17:6 tight name a

109+17:8 name b

110+17:10 name c

111+17:11 tight glyph ]

112+17:13 glyph [

113+17:14 tight name a

114+17:16 name b

115+17:18 name c

116+17:19 tight glyph ]

117+18:1 DEDENT

118+18:1 DEDENT

119+18:1 NEWLINE

120+18:1 glyph ++

121+18:4 name wrong

122+18:10 glyph (

123+18:11 tight name shared

124+18:18 str "hi"

125+18:23 lit ~zod

126+18:28 str "ok"

127+18:32 tight glyph )

128+19:1 NEWLINE

129+19:1 glyph ++

130+19:4 name local-shadow

131+19:17 glyph |=

132+19:20 name outer

133+19:25 tight glyph =

134+19:26 tight aura @t

135+20:3 INDENT

136+20:3 glyph ++

137+20:6 name local

138+20:12 glyph |=

139+20:15 name x

140+20:16 tight glyph =

141+20:17 tight glyph [

142+20:18 tight aura @t

143+20:21 aura @p

144+20:24 glyph ?

145+20:25 tight glyph ]

146+21:5 INDENT

147+21:5 glyph ?-

148+21:8 name x

149+22:7 INDENT

150+22:7 glyph [

151+22:8 tight name a

152+22:10 name outer

153+22:16 name c

154+22:17 tight glyph ]

155+22:19 name c

156+23:3 DEDENT

157+23:3 DEDENT

158+23:3 NEWLINE

159+23:3 glyph (

160+23:4 tight name local

161+23:10 glyph [

162+23:11 tight str "x"

163+23:15 lit ~zod

164+23:20 lit %.n

165+23:23 tight glyph ]

166+23:24 tight glyph )

167+23:25 DEDENT

168+23:25 NEWLINE

tests/golden/types-cell-pattern-schemes/tree.txtnew file+70

@@ -0,0 +1,70 @@

1+(module

2+ (mold 1:1 union

3+ (union 2:3

4+ (cell 2:3 (const 2:4 %go) (aura 2:8 @t) (aura 2:11 @p))

5+ (const 3:3 %stop)))

6+ (value 4:1 maybe-union

7+ (gate 4:16

8+ (face 4:19 x (ref 4:21 union))

9+ (body 5:3

10+ (branch 5:3

11+ (wing 5:6 x)

12+ (arm 6:5

13+ (cell 6:5 (bind 6:6 a) (bind 6:8 b) (bind 6:10 c))

14+ (wing 6:13 a))))))

15+ (value 7:1 maybe-list

16+ (gate 7:15

17+ (face 7:18 x

18+ (apply 7:20 list (aura 7:26 @t)))

19+ (body 8:3

20+ (branch 8:3

21+ (wing 8:6 x)

22+ (arm 9:5

23+ (cell 9:5 (bind 9:6 a) (bind 9:8 b) (bind 9:10 c))

24+ (wing 9:13 a))))))

25+ (value 10:1 identity

26+ (gate 10:13

27+ (bind 10:16 x)

28+ (body 11:3

29+ (branch 11:3

30+ (wing 11:6 x)

31+ (arm 12:5

32+ (cell 12:5 (bind 12:6 a) (bind 12:8 b) (bind 12:10 c))

33+ (tuple 12:13 (wing 12:14 a) (wing 12:16 b) (wing 12:18 c)))))))

34+ (value 13:1 text

35+ (group 13:9

36+ (call 13:10 (wing 13:10 identity) (str 13:19 "hi") (lit 13:24 ~zod) (lit 13:29 %.y))))

37+ (value 14:1 ship

38+ (group 14:9

39+ (call 14:10 (wing 14:10 identity) (lit 14:19 ~zod) (str 14:24 "hi") (lit 14:29 %.n))))

40+ (value 15:1 shared

41+ (gate 15:11

42+ (face 15:14 x

43+ (cell 15:16 (tvar 15:17 A) (tvar 15:19 A) (tvar 15:21 A)))

44+ (body 16:3

45+ (branch 16:3

46+ (wing 16:6 x)

47+ (arm 17:5

48+ (cell 17:5 (bind 17:6 a) (bind 17:8 b) (bind 17:10 c))

49+ (tuple 17:13 (wing 17:14 a) (wing 17:16 b) (wing 17:18 c)))))))

50+ (value 18:1 wrong

51+ (group 18:10

52+ (call 18:11 (wing 18:11 shared) (str 18:18 "hi") (lit 18:23 ~zod) (str 18:28 "ok"))))

53+ (value 19:1 local-shadow

54+ (gate 19:17

55+ (face 19:20 outer (aura 19:26 @t))

56+ (body 20:3

57+ (value 20:3 local

58+ (gate 20:12

59+ (face 20:15 x

60+ (cell 20:17 (aura 20:18 @t) (aura 20:21 @p) (flag 20:24)))

61+ (body 21:5

62+ (branch 21:5

63+ (wing 21:8 x)

64+ (arm 22:7

65+ (cell 22:7 (bind 22:8 a) (bind 22:10 outer) (bind 22:16 c))

66+ (wing 22:19 c))))))

67+ (group 23:3

68+ (call 23:4

69+ (wing 23:4 local)

70+ (tuple 23:10 (str 23:11 "x") (lit 23:15 ~zod) (lit 23:20 %.n))))))))

tests/golden/types-cell-pattern-schemes/types.txtnew file+16

@@ -0,0 +1,16 @@

1+partial inference; module not checked

2++$ union: cases proven disjoint; mold not checked

3+++ maybe-union: cell pattern subject is not supported by partial inference

4+++ maybe-list: cell pattern subject is not supported by partial inference

5+++ identity: $-([A [B C]] [A [B C]])

6+++ text: [@t [@p ?]]

7+++ ship: [@p [@t ?]]

8+++ shared: $-([A [A A]] [A [A A]])

9+++ wrong: call's sample and argument types do not unify

10+/tests/golden/types-cell-pattern-schemes/source.jibb:18:11: called gate has type $-([A [A A]] [A [A A]])

11+++ wrong (shared "hi" ~zod "ok")

12+ ^

13+/tests/golden/types-cell-pattern-schemes/source.jibb:18:23: argument has type @p

14+++ wrong (shared "hi" ~zod "ok")

15+ ^

16+++ local-shadow: local definitions need unsupported inference

tests/golden/types-cell-pattern-tail/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Patterns: a name binds anew and the last position of a cell pattern binds the rest; Modules: no name may shadow one already in scope.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-cell-pattern-tail/modules.txtnew file+1

@@ -0,0 +1 @@

1+# Use the prepared prelude.

tests/golden/types-cell-pattern-tail/source.jibbnew file+18

@@ -0,0 +1,18 @@

1+++ pair |= x=[@t (list @p)]

2+ ?- x

3+ [first rest] rest

4+++ split |= x=[@t (list @p)]

5+ ?- x

6+ [first second third] third

7++$ either

8+ [%go @p @t]

9+ %stop

10+++ pair-union |= x=[@t either]

11+ ?- x

12+ [first rest] rest

13+++ split-union |= x=[@t either]

14+ ?- x

15+ [first second third] third

16+++ malformed |= x=[@t @p]

17+ ?- x

18+ [first second third] third

tests/golden/types-cell-pattern-tail/tokens.txtnew file+126

@@ -0,0 +1,126 @@

1+1:1 glyph ++

2+1:4 name pair

3+1:9 glyph |=

4+1:12 name x

5+1:13 tight glyph =

6+1:14 tight glyph [

7+1:15 tight aura @t

8+1:18 glyph (

9+1:19 tight name list

10+1:24 aura @p

11+1:26 tight glyph )

12+1:27 tight glyph ]

13+2:3 INDENT

14+2:3 glyph ?-

15+2:6 name x

16+3:5 INDENT

17+3:5 glyph [

18+3:6 tight name first

19+3:12 name rest

20+3:16 tight glyph ]

21+3:18 name rest

22+4:1 DEDENT

23+4:1 DEDENT

24+4:1 NEWLINE

25+4:1 glyph ++

26+4:4 name split

27+4:10 glyph |=

28+4:13 name x

29+4:14 tight glyph =

30+4:15 tight glyph [

31+4:16 tight aura @t

32+4:19 glyph (

33+4:20 tight name list

34+4:25 aura @p

35+4:27 tight glyph )

36+4:28 tight glyph ]

37+5:3 INDENT

38+5:3 glyph ?-

39+5:6 name x

40+6:5 INDENT

41+6:5 glyph [

42+6:6 tight name first

43+6:12 name second

44+6:19 name third

45+6:24 tight glyph ]

46+6:26 name third

47+7:1 DEDENT

48+7:1 DEDENT

49+7:1 NEWLINE

50+7:1 glyph +$

51+7:4 name either

52+8:3 INDENT

53+8:3 glyph [

54+8:4 tight lit %go

55+8:8 aura @p

56+8:11 aura @t

57+8:13 tight glyph ]

58+9:3 NEWLINE

59+9:3 lit %stop

60+10:1 DEDENT

61+10:1 NEWLINE

62+10:1 glyph ++

63+10:4 name pair-union

64+10:15 glyph |=

65+10:18 name x

66+10:19 tight glyph =

67+10:20 tight glyph [

68+10:21 tight aura @t

69+10:24 name either

70+10:30 tight glyph ]

71+11:3 INDENT

72+11:3 glyph ?-

73+11:6 name x

74+12:5 INDENT

75+12:5 glyph [

76+12:6 tight name first

77+12:12 name rest

78+12:16 tight glyph ]

79+12:18 name rest

80+13:1 DEDENT

81+13:1 DEDENT

82+13:1 NEWLINE

83+13:1 glyph ++

84+13:4 name split-union

85+13:16 glyph |=

86+13:19 name x

87+13:20 tight glyph =

88+13:21 tight glyph [

89+13:22 tight aura @t

90+13:25 name either

91+13:31 tight glyph ]

92+14:3 INDENT

93+14:3 glyph ?-

94+14:6 name x

95+15:5 INDENT

96+15:5 glyph [

97+15:6 tight name first

98+15:12 name second

99+15:19 name third

100+15:24 tight glyph ]

101+15:26 name third

102+16:1 DEDENT

103+16:1 DEDENT

104+16:1 NEWLINE

105+16:1 glyph ++

106+16:4 name malformed

107+16:14 glyph |=

108+16:17 name x

109+16:18 tight glyph =

110+16:19 tight glyph [

111+16:20 tight aura @t

112+16:23 aura @p

113+16:25 tight glyph ]

114+17:3 INDENT

115+17:3 glyph ?-

116+17:6 name x

117+18:5 INDENT

118+18:5 glyph [

119+18:6 tight name first

120+18:12 name second

121+18:19 name third

122+18:24 tight glyph ]

123+18:26 name third

124+18:31 DEDENT

125+18:31 DEDENT

126+18:31 NEWLINE

tests/golden/types-cell-pattern-tail/tree.txtnew file+59

@@ -0,0 +1,59 @@

1+(module

2+ (value 1:1 pair

3+ (gate 1:9

4+ (face 1:12 x

5+ (cell 1:14

6+ (aura 1:15 @t)

7+ (apply 1:18 list (aura 1:24 @p))))

8+ (body 2:3

9+ (branch 2:3

10+ (wing 2:6 x)

11+ (arm 3:5

12+ (cell 3:5 (bind 3:6 first) (bind 3:12 rest))

13+ (wing 3:18 rest))))))

14+ (value 4:1 split

15+ (gate 4:10

16+ (face 4:13 x

17+ (cell 4:15

18+ (aura 4:16 @t)

19+ (apply 4:19 list (aura 4:25 @p))))

20+ (body 5:3

21+ (branch 5:3

22+ (wing 5:6 x)

23+ (arm 6:5

24+ (cell 6:5 (bind 6:6 first) (bind 6:12 second) (bind 6:19 third))

25+ (wing 6:26 third))))))

26+ (mold 7:1 either

27+ (union 8:3

28+ (cell 8:3 (const 8:4 %go) (aura 8:8 @p) (aura 8:11 @t))

29+ (const 9:3 %stop)))

30+ (value 10:1 pair-union

31+ (gate 10:15

32+ (face 10:18 x

33+ (cell 10:20 (aura 10:21 @t) (ref 10:24 either)))

34+ (body 11:3

35+ (branch 11:3

36+ (wing 11:6 x)

37+ (arm 12:5

38+ (cell 12:5 (bind 12:6 first) (bind 12:12 rest))

39+ (wing 12:18 rest))))))

40+ (value 13:1 split-union

41+ (gate 13:16

42+ (face 13:19 x

43+ (cell 13:21 (aura 13:22 @t) (ref 13:25 either)))

44+ (body 14:3

45+ (branch 14:3

46+ (wing 14:6 x)

47+ (arm 15:5

48+ (cell 15:5 (bind 15:6 first) (bind 15:12 second) (bind 15:19 third))

49+ (wing 15:26 third))))))

50+ (value 16:1 malformed

51+ (gate 16:14

52+ (face 16:17 x

53+ (cell 16:19 (aura 16:20 @t) (aura 16:23 @p)))

54+ (body 17:3

55+ (branch 17:3

56+ (wing 17:6 x)

57+ (arm 18:5

58+ (cell 18:5 (bind 18:6 first) (bind 18:12 second) (bind 18:19 third))

59+ (wing 18:26 third)))))))

tests/golden/types-cell-pattern-tail/types.txtnew file+7

@@ -0,0 +1,7 @@

1+partial inference; module not checked

2+++ pair: $-([@t (list @p)] (list @p))

3+++ split: cell pattern subject is not supported by partial inference

4++$ either: cases proven disjoint; mold not checked

5+++ pair-union: $-([@t either] either)

6+++ split-union: cell pattern subject is not supported by partial inference

7+++ malformed: cell pattern does not match the subject type

tests/golden/types-constructor-context/about.txtnew file+1

@@ -0,0 +1 @@

1+Constructor callback results require a known contextual union. This case checks unknown, matching, missing and wrong payload cases, aliases, written capitals and pending obligations.

tests/golden/types-constructor-context/source.jibbnew file+37

@@ -0,0 +1,37 @@

1++$ msg

2+ [%got value=@t]

3+ %other

4++$ alias msg

5++$ wrong-payload

6+ [%got value=@p]

7+ %other

8++$ missing

9+ [%different value=@t]

10+ %other

11++$ maybe |$ [A]

12+ [%got value=A]

13+ %other

14+++ call |= callback=$-(@t M) (callback "payload")

15+++ call-ship |= callback=$-(@p M) (callback ~zod)

16+++ unknown (call |=%got)

17+++ later-context ^- msg (call |=%got)

18+++ named-alias ^- alias (call |=%got)

19+++ wrong-context ^- wrong-payload (call |=%got)

20+++ missing-case ^- missing (call |=%got)

21+++ generic-context ^- (maybe @t) (call |=%got)

22+++ generic-wrong ^- (maybe @p) (call |=%got)

23+++ generic-right-ship ^- (maybe @p) (call-ship |=%got)

24+++ named-capital |= value=A

25+ ^- (maybe A)

26+ (|=(callback=$-(A M) (callback value)) |=%got)

27+++ discarded-pending

28+ ~& %unrelated

29+ ^- msg (call |=%got)

30+++ discarded-constructor

31+ ~& |=%missing

32+ ^- msg (call |=%got)

33+++ existing-no-context ^- $-(@t msg) |=%got

34+++ wrong-existing ^- $-(@p msg) |=%got

35+++ later-use ^- msg unknown

36+++ noun-context ^- * (call |=%got)

37+++ other-known-origin ^- (ask @t) (call |=%got)

tests/golden/types-constructor-context/tokens.txtnew file+289

@@ -0,0 +1,289 @@

1+1:1 glyph +$

2+1:4 name msg

3+2:3 INDENT

4+2:3 glyph [

5+2:4 tight lit %got

6+2:9 name value

7+2:14 tight glyph =

8+2:15 tight aura @t

9+2:17 tight glyph ]

10+3:3 NEWLINE

11+3:3 lit %other

12+4:1 DEDENT

13+4:1 NEWLINE

14+4:1 glyph +$

15+4:4 name alias

16+4:10 name msg

17+5:1 NEWLINE

18+5:1 glyph +$

19+5:4 name wrong-payload

20+6:3 INDENT

21+6:3 glyph [

22+6:4 tight lit %got

23+6:9 name value

24+6:14 tight glyph =

25+6:15 tight aura @p

26+6:17 tight glyph ]

27+7:3 NEWLINE

28+7:3 lit %other

29+8:1 DEDENT

30+8:1 NEWLINE

31+8:1 glyph +$

32+8:4 name missing

33+9:3 INDENT

34+9:3 glyph [

35+9:4 tight lit %different

36+9:15 name value

37+9:20 tight glyph =

38+9:21 tight aura @t

39+9:23 tight glyph ]

40+10:3 NEWLINE

41+10:3 lit %other

42+11:1 DEDENT

43+11:1 NEWLINE

44+11:1 glyph +$

45+11:4 name maybe

46+11:10 glyph |$

47+11:13 glyph [

48+11:14 tight tvar A

49+11:15 tight glyph ]

50+12:3 INDENT

51+12:3 glyph [

52+12:4 tight lit %got

53+12:9 name value

54+12:14 tight glyph =

55+12:15 tight tvar A

56+12:16 tight glyph ]

57+13:3 NEWLINE

58+13:3 lit %other

59+14:1 DEDENT

60+14:1 NEWLINE

61+14:1 glyph ++

62+14:4 name call

63+14:9 glyph |=

64+14:12 name callback

65+14:20 tight glyph =

66+14:21 tight glyph $-(

67+14:24 tight aura @t

68+14:27 tvar M

69+14:28 tight glyph )

70+14:30 glyph (

71+14:31 tight name callback

72+14:40 str "payload"

73+14:49 tight glyph )

74+15:1 NEWLINE

75+15:1 glyph ++

76+15:4 name call-ship

77+15:14 glyph |=

78+15:17 name callback

79+15:25 tight glyph =

80+15:26 tight glyph $-(

81+15:29 tight aura @p

82+15:32 tvar M

83+15:33 tight glyph )

84+15:35 glyph (

85+15:36 tight name callback

86+15:45 lit ~zod

87+15:49 tight glyph )

88+16:1 NEWLINE

89+16:1 glyph ++

90+16:4 name unknown

91+16:12 glyph (

92+16:13 tight name call

93+16:18 glyph |=

94+16:20 tight lit %got

95+16:24 tight glyph )

96+17:1 NEWLINE

97+17:1 glyph ++

98+17:4 name later-context

99+17:18 glyph ^-

100+17:21 name msg

101+17:25 glyph (

102+17:26 tight name call

103+17:31 glyph |=

104+17:33 tight lit %got

105+17:37 tight glyph )

106+18:1 NEWLINE

107+18:1 glyph ++

108+18:4 name named-alias

109+18:16 glyph ^-

110+18:19 name alias

111+18:25 glyph (

112+18:26 tight name call

113+18:31 glyph |=

114+18:33 tight lit %got

115+18:37 tight glyph )

116+19:1 NEWLINE

117+19:1 glyph ++

118+19:4 name wrong-context

119+19:18 glyph ^-

120+19:21 name wrong-payload

121+19:35 glyph (

122+19:36 tight name call

123+19:41 glyph |=

124+19:43 tight lit %got

125+19:47 tight glyph )

126+20:1 NEWLINE

127+20:1 glyph ++

128+20:4 name missing-case

129+20:17 glyph ^-

130+20:20 name missing

131+20:28 glyph (

132+20:29 tight name call

133+20:34 glyph |=

134+20:36 tight lit %got

135+20:40 tight glyph )

136+21:1 NEWLINE

137+21:1 glyph ++

138+21:4 name generic-context

139+21:20 glyph ^-

140+21:23 glyph (

141+21:24 tight name maybe

142+21:30 aura @t

143+21:32 tight glyph )

144+21:34 glyph (

145+21:35 tight name call

146+21:40 glyph |=

147+21:42 tight lit %got

148+21:46 tight glyph )

149+22:1 NEWLINE

150+22:1 glyph ++

151+22:4 name generic-wrong

152+22:18 glyph ^-

153+22:21 glyph (

154+22:22 tight name maybe

155+22:28 aura @p

156+22:30 tight glyph )

157+22:32 glyph (

158+22:33 tight name call

159+22:38 glyph |=

160+22:40 tight lit %got

161+22:44 tight glyph )

162+23:1 NEWLINE

163+23:1 glyph ++

164+23:4 name generic-right-ship

165+23:23 glyph ^-

166+23:26 glyph (

167+23:27 tight name maybe

168+23:33 aura @p

169+23:35 tight glyph )

170+23:37 glyph (

171+23:38 tight name call-ship

172+23:48 glyph |=

173+23:50 tight lit %got

174+23:54 tight glyph )

175+24:1 NEWLINE

176+24:1 glyph ++

177+24:4 name named-capital

178+24:18 glyph |=

179+24:21 name value

180+24:26 tight glyph =

181+24:27 tight tvar A

182+25:3 INDENT

183+25:3 glyph ^-

184+25:6 glyph (

185+25:7 tight name maybe

186+25:13 tvar A

187+25:14 tight glyph )

188+26:5 INDENT

189+26:5 glyph (

190+26:6 tight glyph |=(

191+26:9 tight name callback

192+26:17 tight glyph =

193+26:18 tight glyph $-(

194+26:21 tight tvar A

195+26:23 tvar M

196+26:24 tight glyph )

197+26:26 glyph (

198+26:27 tight name callback

199+26:36 name value

200+26:41 tight glyph )

201+26:42 tight glyph )

202+26:44 glyph |=

203+26:46 tight lit %got

204+26:50 tight glyph )

205+27:1 DEDENT

206+27:1 DEDENT

207+27:1 NEWLINE

208+27:1 glyph ++

209+27:4 name discarded-pending

210+28:3 INDENT

211+28:3 glyph ~&

212+28:6 lit %unrelated

213+29:5 INDENT

214+29:5 glyph ^-

215+29:8 name msg

216+29:12 glyph (

217+29:13 tight name call

218+29:18 glyph |=

219+29:20 tight lit %got

220+29:24 tight glyph )

221+30:1 DEDENT

222+30:1 DEDENT

223+30:1 NEWLINE

224+30:1 glyph ++

225+30:4 name discarded-constructor

226+31:3 INDENT

227+31:3 glyph ~&

228+31:6 glyph |=

229+31:8 tight lit %missing

230+32:5 INDENT

231+32:5 glyph ^-

232+32:8 name msg

233+32:12 glyph (

234+32:13 tight name call

235+32:18 glyph |=

236+32:20 tight lit %got

237+32:24 tight glyph )

238+33:1 DEDENT

239+33:1 DEDENT

240+33:1 NEWLINE

241+33:1 glyph ++

242+33:4 name existing-no-context

243+33:24 glyph ^-

244+33:27 glyph $-(

245+33:30 tight aura @t

246+33:33 name msg

247+33:36 tight glyph )

248+33:38 glyph |=

249+33:40 tight lit %got

250+34:1 NEWLINE

251+34:1 glyph ++

252+34:4 name wrong-existing

253+34:19 glyph ^-

254+34:22 glyph $-(

255+34:25 tight aura @p

256+34:28 name msg

257+34:31 tight glyph )

258+34:33 glyph |=

259+34:35 tight lit %got

260+35:1 NEWLINE

261+35:1 glyph ++

262+35:4 name later-use

263+35:14 glyph ^-

264+35:17 name msg

265+35:21 name unknown

266+36:1 NEWLINE

267+36:1 glyph ++

268+36:4 name noun-context

269+36:17 glyph ^-

270+36:20 glyph *

271+36:22 glyph (

272+36:23 tight name call

273+36:28 glyph |=

274+36:30 tight lit %got

275+36:34 tight glyph )

276+37:1 NEWLINE

277+37:1 glyph ++

278+37:4 name other-known-origin

279+37:23 glyph ^-

280+37:26 glyph (

281+37:27 tight name ask

282+37:31 aura @t

283+37:33 tight glyph )

284+37:35 glyph (

285+37:36 tight name call

286+37:41 glyph |=

287+37:43 tight lit %got

288+37:47 tight glyph )

289+37:48 NEWLINE

tests/golden/types-constructor-context/tree.txtnew file+130

@@ -0,0 +1,130 @@

1+(module

2+ (mold 1:1 msg

3+ (union 2:3

4+ (cell 2:3

5+ (const 2:4 %got)

6+ (face 2:9 value (aura 2:15 @t)))

7+ (const 3:3 %other)))

8+ (mold 4:1 alias (ref 4:10 msg))

9+ (mold 5:1 wrong-payload

10+ (union 6:3

11+ (cell 6:3

12+ (const 6:4 %got)

13+ (face 6:9 value (aura 6:15 @p)))

14+ (const 7:3 %other)))

15+ (mold 8:1 missing

16+ (union 9:3

17+ (cell 9:3

18+ (const 9:4 %different)

19+ (face 9:15 value (aura 9:21 @t)))

20+ (const 10:3 %other)))

21+ (mold 11:1 maybe

22+ (generic 11:10 A

23+ (union 12:3

24+ (cell 12:3

25+ (const 12:4 %got)

26+ (face 12:9 value (tvar 12:15 A)))

27+ (const 13:3 %other))))

28+ (value 14:1 call

29+ (gate 14:9

30+ (face 14:12 callback

31+ (fn 14:21 (aura 14:24 @t) (tvar 14:27 M)))

32+ (group 14:30

33+ (call 14:31 (wing 14:31 callback) (str 14:40 "payload")))))

34+ (value 15:1 call-ship

35+ (gate 15:14

36+ (face 15:17 callback

37+ (fn 15:26 (aura 15:29 @p) (tvar 15:32 M)))

38+ (group 15:35

39+ (call 15:36 (wing 15:36 callback) (lit 15:45 ~zod)))))

40+ (value 16:1 unknown

41+ (group 16:12

42+ (call 16:13 (wing 16:13 call) (ctor 16:18 %got))))

43+ (value 17:1 later-context

44+ (cast 17:18

45+ (ref 17:21 msg)

46+ (group 17:25

47+ (call 17:26 (wing 17:26 call) (ctor 17:31 %got)))))

48+ (value 18:1 named-alias

49+ (cast 18:16

50+ (ref 18:19 alias)

51+ (group 18:25

52+ (call 18:26 (wing 18:26 call) (ctor 18:31 %got)))))

53+ (value 19:1 wrong-context

54+ (cast 19:18

55+ (ref 19:21 wrong-payload)

56+ (group 19:35

57+ (call 19:36 (wing 19:36 call) (ctor 19:41 %got)))))

58+ (value 20:1 missing-case

59+ (cast 20:17

60+ (ref 20:20 missing)

61+ (group 20:28

62+ (call 20:29 (wing 20:29 call) (ctor 20:34 %got)))))

63+ (value 21:1 generic-context

64+ (cast 21:20

65+ (apply 21:23 maybe (aura 21:30 @t))

66+ (group 21:34

67+ (call 21:35 (wing 21:35 call) (ctor 21:40 %got)))))

68+ (value 22:1 generic-wrong

69+ (cast 22:18

70+ (apply 22:21 maybe (aura 22:28 @p))

71+ (group 22:32

72+ (call 22:33 (wing 22:33 call) (ctor 22:38 %got)))))

73+ (value 23:1 generic-right-ship

74+ (cast 23:23

75+ (apply 23:26 maybe (aura 23:33 @p))

76+ (group 23:37

77+ (call 23:38 (wing 23:38 call-ship) (ctor 23:48 %got)))))

78+ (value 24:1 named-capital

79+ (gate 24:18

80+ (face 24:21 value (tvar 24:27 A))

81+ (body 25:3

82+ (cast 25:3

83+ (apply 25:6 maybe (tvar 25:13 A))

84+ (body 26:5

85+ (group 26:5

86+ (call 26:6

87+ (gate-wide 26:6

88+ (face 26:9 callback

89+ (fn 26:18 (tvar 26:21 A) (tvar 26:23 M)))

90+ (group 26:26

91+ (call 26:27 (wing 26:27 callback) (wing 26:36 value))))

92+ (ctor 26:44 %got))))))))

93+ (value 27:1 discarded-pending

94+ (body 28:3

95+ (trace 28:3

96+ (lit 28:6 %unrelated)

97+ (body 29:5

98+ (cast 29:5

99+ (ref 29:8 msg)

100+ (group 29:12

101+ (call 29:13 (wing 29:13 call) (ctor 29:18 %got))))))))

102+ (value 30:1 discarded-constructor

103+ (body 31:3

104+ (trace 31:3

105+ (ctor 31:6 %missing)

106+ (body 32:5

107+ (cast 32:5

108+ (ref 32:8 msg)

109+ (group 32:12

110+ (call 32:13 (wing 32:13 call) (ctor 32:18 %got))))))))

111+ (value 33:1 existing-no-context

112+ (cast 33:24

113+ (fn 33:27 (aura 33:30 @t) (ref 33:33 msg))

114+ (ctor 33:38 %got)))

115+ (value 34:1 wrong-existing

116+ (cast 34:19

117+ (fn 34:22 (aura 34:25 @p) (ref 34:28 msg))

118+ (ctor 34:33 %got)))

119+ (value 35:1 later-use

120+ (cast 35:14 (ref 35:17 msg) (wing 35:21 unknown)))

121+ (value 36:1 noun-context

122+ (cast 36:17

123+ (noun 36:20)

124+ (group 36:22

125+ (call 36:23 (wing 36:23 call) (ctor 36:28 %got)))))

126+ (value 37:1 other-known-origin

127+ (cast 37:23

128+ (apply 37:26 ask (aura 37:31 @t))

129+ (group 37:35

130+ (call 37:36 (wing 37:36 call) (ctor 37:41 %got))))))

tests/golden/types-constructor-context/types.txtnew file+54

@@ -0,0 +1,54 @@

1+partial inference; module not checked

2++$ msg: cases proven disjoint; mold not checked

3++$ alias: not checked

4++$ wrong-payload: cases proven disjoint; mold not checked

5++$ missing: cases proven disjoint; mold not checked

6++$ maybe: cases proven disjoint; mold not checked

7+++ call: $-($-(@t A) A)

8+++ call-ship: $-($-(@p A) A)

9+++ unknown: call constraint is not supported by partial inference

10+++ later-context: msg

11+++ named-alias: msg

12+++ wrong-context: call's sample and argument types do not unify

13+/tests/golden/types-constructor-context/source.jibb:19:36: called gate

14+++ wrong-context ^- wrong-payload (call |=%got)

15+ ^

16+/tests/golden/types-constructor-context/source.jibb:19:41: argument

17+++ wrong-context ^- wrong-payload (call |=%got)

18+ ^

19+++ missing-case: call's sample and argument types do not unify

20+/tests/golden/types-constructor-context/source.jibb:20:29: called gate

21+++ missing-case ^- missing (call |=%got)

22+ ^

23+/tests/golden/types-constructor-context/source.jibb:20:34: argument

24+++ missing-case ^- missing (call |=%got)

25+ ^

26+++ generic-context: (maybe @t)

27+++ generic-wrong: call's sample and argument types do not unify

28+/tests/golden/types-constructor-context/source.jibb:22:33: called gate

29+++ generic-wrong ^- (maybe @p) (call |=%got)

30+ ^

31+/tests/golden/types-constructor-context/source.jibb:22:38: argument

32+++ generic-wrong ^- (maybe @p) (call |=%got)

33+ ^

34+++ generic-right-ship: (maybe @p)

35+++ named-capital: explicit capital constraints are not supported by partial inference

36+++ discarded-pending: tag needs context in partial inference

37+++ discarded-constructor: tag needs context in partial inference

38+++ existing-no-context: $-(@t msg)

39+++ wrong-existing: cast mold and expression type do not unify

40+/tests/golden/types-constructor-context/source.jibb:34:22: cast mold

41+++ wrong-existing ^- $-(@p msg) |=%got

42+ ^

43+/tests/golden/types-constructor-context/source.jibb:34:33: expression

44+++ wrong-existing ^- $-(@p msg) |=%got

45+ ^

46+++ later-use: name is not available to partial inference

47+++ noun-context: call's sample and argument types do not unify

48+/tests/golden/types-constructor-context/source.jibb:36:23: called gate has type $-($-(@t *) *)

49+++ noun-context ^- * (call |=%got)

50+ ^

51+/tests/golden/types-constructor-context/source.jibb:36:28: argument

52+++ noun-context ^- * (call |=%got)

53+ ^

54+++ other-known-origin: cast mold is not supported by partial inference

tests/golden/types-deferred-call-context/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, literals by context and type variables: calls can receive expected result types while preserving shared type variables and pending constraints.

2+tests: A known identity-like gate receives list, null, unit, union and nested record contexts. Incorrect items, tags, auras and repeated arguments report errors; unrelated pending literals and explicit capital restrictions remain. Generic list and union results instantiate independently, captured variables retain their scope, and unsupported recursive inference fails closed. The module report remains partial.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-deferred-call-context/modules.txtnew file+1

@@ -0,0 +1 @@

1+# no module fixtures

tests/golden/types-deferred-call-context/source.jibbnew file+56

@@ -0,0 +1,56 @@

1++$ msg

2+ %good

3+ %other

4+++ local-id |= x x

5+++ empty-list ^- (list @t) (local-id ~)

6+++ filled-list ^- (list @t) (local-id ~["hi"])

7+++ wrong-list ^- (list @t) (local-id ~[~zod])

8+++ unit-value ^- (unit msg) (local-id `%good)

9+++ union-value ^- msg (local-id %good)

10+++ union-bad ^- msg (local-id %wrong)

11+++ nested ^- (list (unit msg)) (local-id ~[`%good])

12+++ rec-value ^- [field=(list @t)] (local-id [field=~])

13+++ already |= x=@ud ^- @u (local-id x)

14+++ bad-aura |= x=@p ^- @t (local-id x)

15+++ capital |= x=A ^- A (local-id "text")

16+++ trace-tag ^- (list @t)

17+ ~& %dangling

18+ (local-id ~)

19+++ trace-null ^- (list @t)

20+ ~& ~

21+ (local-id ~)

22+++ unresolved (local-id %dangling)

23+++ no-context (local-id ~)

24+++ local-keep |= [a=A b=A] a

25+++ repeated-good ^- @t (local-keep "hi" "bye")

26+++ repeated-bad ^- @t (local-keep "hi" ~zod)

27+++ rec-good ^- [field=(list @t) flag=?] (local-id [field=~ flag=%.y])

28+++ rec-bad ^- [field=(list @t) flag=?] (local-id [field=~[~zod] flag=%.y])

29+++ wrap-identity |= x=A ^- A (local-id x)

30+++ wrap-forced |= x=A ^- @t (local-id x)

31+++ retain |= x=@t (local-id x)

32+++ result-later |= x ^- (list @t) (local-id x)

33+++ result-repeated ^- (list @t) (local-keep ~ ~)

34+++ result-repeated-bad ^- (list @t) (local-keep ~ ~[~zod])

35+++ recursive |= [flag=? value]

36+ ^- (list @t)

37+ ?- flag

38+ %.y (local-id value)

39+ %.n (recursive flag value)

40+++ captured |= sample

41+ ++ local |= ignored sample

42+ ^- (list @t) (local ~zod)

43+++ captured-bad |= sample

44+ ++ local |= ignored sample

45+ ~& ^- @t sample

46+ ^- @p (local ~zod)

47++$ choice |$ [A]

48+ [%one value=A]

49+ %none

50+++ param-list |= x=(list A) ^- (list A) (local-id ~)

51+++ param-list-text (param-list ~["hi"])

52+++ param-list-ship (param-list ~[~zod])

53+++ param-union |= x=A ^- (choice A) (local-id [%one x])

54+++ param-union-text (param-union "hi")

55+++ param-union-ship (param-union ~zod)

56+++ nested-tag-unknown (local-id [%one %dangling])

tests/golden/types-deferred-call-context/tokens.txtnew file+557

@@ -0,0 +1,557 @@

1+1:1 glyph +$

2+1:4 name msg

3+2:3 INDENT

4+2:3 lit %good

5+3:3 NEWLINE

6+3:3 lit %other

7+4:1 DEDENT

8+4:1 NEWLINE

9+4:1 glyph ++

10+4:4 name local-id

11+4:13 glyph |=

12+4:16 name x

13+4:18 name x

14+5:1 NEWLINE

15+5:1 glyph ++

16+5:4 name empty-list

17+5:15 glyph ^-

18+5:18 glyph (

19+5:19 tight name list

20+5:24 aura @t

21+5:26 tight glyph )

22+5:28 glyph (

23+5:29 tight name local-id

24+5:38 lit ~

25+5:39 tight glyph )

26+6:1 NEWLINE

27+6:1 glyph ++

28+6:4 name filled-list

29+6:16 glyph ^-

30+6:19 glyph (

31+6:20 tight name list

32+6:25 aura @t

33+6:27 tight glyph )

34+6:29 glyph (

35+6:30 tight name local-id

36+6:39 glyph ~[

37+6:41 tight str "hi"

38+6:45 tight glyph ]

39+6:46 tight glyph )

40+7:1 NEWLINE

41+7:1 glyph ++

42+7:4 name wrong-list

43+7:15 glyph ^-

44+7:18 glyph (

45+7:19 tight name list

46+7:24 aura @t

47+7:26 tight glyph )

48+7:28 glyph (

49+7:29 tight name local-id

50+7:38 glyph ~[

51+7:40 tight lit ~zod

52+7:44 tight glyph ]

53+7:45 tight glyph )

54+8:1 NEWLINE

55+8:1 glyph ++

56+8:4 name unit-value

57+8:15 glyph ^-

58+8:18 glyph (

59+8:19 tight name unit

60+8:24 name msg

61+8:27 tight glyph )

62+8:29 glyph (

63+8:30 tight name local-id

64+8:39 glyph `

65+8:40 tight lit %good

66+8:45 tight glyph )

67+9:1 NEWLINE

68+9:1 glyph ++

69+9:4 name union-value

70+9:16 glyph ^-

71+9:19 name msg

72+9:23 glyph (

73+9:24 tight name local-id

74+9:33 lit %good

75+9:38 tight glyph )

76+10:1 NEWLINE

77+10:1 glyph ++

78+10:4 name union-bad

79+10:14 glyph ^-

80+10:17 name msg

81+10:21 glyph (

82+10:22 tight name local-id

83+10:31 lit %wrong

84+10:37 tight glyph )

85+11:1 NEWLINE

86+11:1 glyph ++

87+11:4 name nested

88+11:11 glyph ^-

89+11:14 glyph (

90+11:15 tight name list

91+11:20 glyph (

92+11:21 tight name unit

93+11:26 name msg

94+11:29 tight glyph )

95+11:30 tight glyph )

96+11:32 glyph (

97+11:33 tight name local-id

98+11:42 glyph ~[

99+11:44 tight glyph `

100+11:45 tight lit %good

101+11:50 tight glyph ]

102+11:51 tight glyph )

103+12:1 NEWLINE

104+12:1 glyph ++

105+12:4 name rec-value

106+12:14 glyph ^-

107+12:17 glyph [

108+12:18 tight name field

109+12:23 tight glyph =

110+12:24 tight glyph (

111+12:25 tight name list

112+12:30 aura @t

113+12:32 tight glyph )

114+12:33 tight glyph ]

115+12:35 glyph (

116+12:36 tight name local-id

117+12:45 glyph [

118+12:46 tight name field

119+12:51 tight glyph =

120+12:52 tight lit ~

121+12:53 tight glyph ]

122+12:54 tight glyph )

123+13:1 NEWLINE

124+13:1 glyph ++

125+13:4 name already

126+13:12 glyph |=

127+13:15 name x

128+13:16 tight glyph =

129+13:17 tight aura @ud

130+13:21 glyph ^-

131+13:24 aura @u

132+13:27 glyph (

133+13:28 tight name local-id

134+13:37 name x

135+13:38 tight glyph )

136+14:1 NEWLINE

137+14:1 glyph ++

138+14:4 name bad-aura

139+14:13 glyph |=

140+14:16 name x

141+14:17 tight glyph =

142+14:18 tight aura @p

143+14:21 glyph ^-

144+14:24 aura @t

145+14:27 glyph (

146+14:28 tight name local-id

147+14:37 name x

148+14:38 tight glyph )

149+15:1 NEWLINE

150+15:1 glyph ++

151+15:4 name capital

152+15:12 glyph |=

153+15:15 name x

154+15:16 tight glyph =

155+15:17 tight tvar A

156+15:19 glyph ^-

157+15:22 tvar A

158+15:24 glyph (

159+15:25 tight name local-id

160+15:34 str "text"

161+15:40 tight glyph )

162+16:1 NEWLINE

163+16:1 glyph ++

164+16:4 name trace-tag

165+16:14 glyph ^-

166+16:17 glyph (

167+16:18 tight name list

168+16:23 aura @t

169+16:25 tight glyph )

170+17:3 INDENT

171+17:3 glyph ~&

172+17:6 lit %dangling

173+18:5 INDENT

174+18:5 glyph (

175+18:6 tight name local-id

176+18:15 lit ~

177+18:16 tight glyph )

178+19:1 DEDENT

179+19:1 DEDENT

180+19:1 NEWLINE

181+19:1 glyph ++

182+19:4 name trace-null

183+19:15 glyph ^-

184+19:18 glyph (

185+19:19 tight name list

186+19:24 aura @t

187+19:26 tight glyph )

188+20:3 INDENT

189+20:3 glyph ~&

190+20:6 lit ~

191+21:5 INDENT

192+21:5 glyph (

193+21:6 tight name local-id

194+21:15 lit ~

195+21:16 tight glyph )

196+22:1 DEDENT

197+22:1 DEDENT

198+22:1 NEWLINE

199+22:1 glyph ++

200+22:4 name unresolved

201+22:15 glyph (

202+22:16 tight name local-id

203+22:25 lit %dangling

204+22:34 tight glyph )

205+23:1 NEWLINE

206+23:1 glyph ++

207+23:4 name no-context

208+23:15 glyph (

209+23:16 tight name local-id

210+23:25 lit ~

211+23:26 tight glyph )

212+24:1 NEWLINE

213+24:1 glyph ++

214+24:4 name local-keep

215+24:15 glyph |=

216+24:18 glyph [

217+24:19 tight name a

218+24:20 tight glyph =

219+24:21 tight tvar A

220+24:23 name b

221+24:24 tight glyph =

222+24:25 tight tvar A

223+24:26 tight glyph ]

224+24:28 name a

225+25:1 NEWLINE

226+25:1 glyph ++

227+25:4 name repeated-good

228+25:18 glyph ^-

229+25:21 aura @t

230+25:24 glyph (

231+25:25 tight name local-keep

232+25:36 str "hi"

233+25:41 str "bye"

234+25:46 tight glyph )

235+26:1 NEWLINE

236+26:1 glyph ++

237+26:4 name repeated-bad

238+26:17 glyph ^-

239+26:20 aura @t

240+26:23 glyph (

241+26:24 tight name local-keep

242+26:35 str "hi"

243+26:40 lit ~zod

244+26:44 tight glyph )

245+27:1 NEWLINE

246+27:1 glyph ++

247+27:4 name rec-good

248+27:13 glyph ^-

249+27:16 glyph [

250+27:17 tight name field

251+27:22 tight glyph =

252+27:23 tight glyph (

253+27:24 tight name list

254+27:29 aura @t

255+27:31 tight glyph )

256+27:33 name flag

257+27:37 tight glyph =

258+27:38 tight glyph ?

259+27:39 tight glyph ]

260+27:41 glyph (

261+27:42 tight name local-id

262+27:51 glyph [

263+27:52 tight name field

264+27:57 tight glyph =

265+27:58 tight lit ~

266+27:60 name flag

267+27:64 tight glyph =

268+27:65 tight lit %.y

269+27:68 tight glyph ]

270+27:69 tight glyph )

271+28:1 NEWLINE

272+28:1 glyph ++

273+28:4 name rec-bad

274+28:12 glyph ^-

275+28:15 glyph [

276+28:16 tight name field

277+28:21 tight glyph =

278+28:22 tight glyph (

279+28:23 tight name list

280+28:28 aura @t

281+28:30 tight glyph )

282+28:32 name flag

283+28:36 tight glyph =

284+28:37 tight glyph ?

285+28:38 tight glyph ]

286+28:40 glyph (

287+28:41 tight name local-id

288+28:50 glyph [

289+28:51 tight name field

290+28:56 tight glyph =

291+28:57 tight glyph ~[

292+28:59 tight lit ~zod

293+28:63 tight glyph ]

294+28:65 name flag

295+28:69 tight glyph =

296+28:70 tight lit %.y

297+28:73 tight glyph ]

298+28:74 tight glyph )

299+29:1 NEWLINE

300+29:1 glyph ++

301+29:4 name wrap-identity

302+29:18 glyph |=

303+29:21 name x

304+29:22 tight glyph =

305+29:23 tight tvar A

306+29:25 glyph ^-

307+29:28 tvar A

308+29:30 glyph (

309+29:31 tight name local-id

310+29:40 name x

311+29:41 tight glyph )

312+30:1 NEWLINE

313+30:1 glyph ++

314+30:4 name wrap-forced

315+30:16 glyph |=

316+30:19 name x

317+30:20 tight glyph =

318+30:21 tight tvar A

319+30:23 glyph ^-

320+30:26 aura @t

321+30:29 glyph (

322+30:30 tight name local-id

323+30:39 name x

324+30:40 tight glyph )

325+31:1 NEWLINE

326+31:1 glyph ++

327+31:4 name retain

328+31:11 glyph |=

329+31:14 name x

330+31:15 tight glyph =

331+31:16 tight aura @t

332+31:19 glyph (

333+31:20 tight name local-id

334+31:29 name x

335+31:30 tight glyph )

336+32:1 NEWLINE

337+32:1 glyph ++

338+32:4 name result-later

339+32:17 glyph |=

340+32:20 name x

341+32:22 glyph ^-

342+32:25 glyph (

343+32:26 tight name list

344+32:31 aura @t

345+32:33 tight glyph )

346+32:35 glyph (

347+32:36 tight name local-id

348+32:45 name x

349+32:46 tight glyph )

350+33:1 NEWLINE

351+33:1 glyph ++

352+33:4 name result-repeated

353+33:20 glyph ^-

354+33:23 glyph (

355+33:24 tight name list

356+33:29 aura @t

357+33:31 tight glyph )

358+33:33 glyph (

359+33:34 tight name local-keep

360+33:45 lit ~

361+33:47 lit ~

362+33:48 tight glyph )

363+34:1 NEWLINE

364+34:1 glyph ++

365+34:4 name result-repeated-bad

366+34:24 glyph ^-

367+34:27 glyph (

368+34:28 tight name list

369+34:33 aura @t

370+34:35 tight glyph )

371+34:37 glyph (

372+34:38 tight name local-keep

373+34:49 lit ~

374+34:51 glyph ~[

375+34:53 tight lit ~zod

376+34:57 tight glyph ]

377+34:58 tight glyph )

378+35:1 NEWLINE

379+35:1 glyph ++

380+35:4 name recursive

381+35:14 glyph |=

382+35:17 glyph [

383+35:18 tight name flag

384+35:22 tight glyph =

385+35:23 tight glyph ?

386+35:25 name value

387+35:30 tight glyph ]

388+36:3 INDENT

389+36:3 glyph ^-

390+36:6 glyph (

391+36:7 tight name list

392+36:12 aura @t

393+36:14 tight glyph )

394+37:5 INDENT

395+37:5 glyph ?-

396+37:8 name flag

397+38:7 INDENT

398+38:7 lit %.y

399+38:11 glyph (

400+38:12 tight name local-id

401+38:21 name value

402+38:26 tight glyph )

403+39:7 NEWLINE

404+39:7 lit %.n

405+39:11 glyph (

406+39:12 tight name recursive

407+39:22 name flag

408+39:27 name value

409+39:32 tight glyph )

410+40:1 DEDENT

411+40:1 DEDENT

412+40:1 DEDENT

413+40:1 NEWLINE

414+40:1 glyph ++

415+40:4 name captured

416+40:13 glyph |=

417+40:16 name sample

418+41:3 INDENT

419+41:3 glyph ++

420+41:6 name local

421+41:12 glyph |=

422+41:15 name ignored

423+41:23 name sample

424+42:3 NEWLINE

425+42:3 glyph ^-

426+42:6 glyph (

427+42:7 tight name list

428+42:12 aura @t

429+42:14 tight glyph )

430+42:16 glyph (

431+42:17 tight name local

432+42:23 lit ~zod

433+42:27 tight glyph )

434+43:1 DEDENT

435+43:1 NEWLINE

436+43:1 glyph ++

437+43:4 name captured-bad

438+43:17 glyph |=

439+43:20 name sample

440+44:3 INDENT

441+44:3 glyph ++

442+44:6 name local

443+44:12 glyph |=

444+44:15 name ignored

445+44:23 name sample

446+45:3 NEWLINE

447+45:3 glyph ~&

448+45:6 glyph ^-

449+45:9 aura @t

450+45:12 name sample

451+46:5 INDENT

452+46:5 glyph ^-

453+46:8 aura @p

454+46:11 glyph (

455+46:12 tight name local

456+46:18 lit ~zod

457+46:22 tight glyph )

458+47:1 DEDENT

459+47:1 DEDENT

460+47:1 NEWLINE

461+47:1 glyph +$

462+47:4 name choice

463+47:11 glyph |$

464+47:14 glyph [

465+47:15 tight tvar A

466+47:16 tight glyph ]

467+48:3 INDENT

468+48:3 glyph [

469+48:4 tight lit %one

470+48:9 name value

471+48:14 tight glyph =

472+48:15 tight tvar A

473+48:16 tight glyph ]

474+49:3 NEWLINE

475+49:3 lit %none

476+50:1 DEDENT

477+50:1 NEWLINE

478+50:1 glyph ++

479+50:4 name param-list

480+50:15 glyph |=

481+50:18 name x

482+50:19 tight glyph =

483+50:20 tight glyph (

484+50:21 tight name list

485+50:26 tvar A

486+50:27 tight glyph )

487+50:29 glyph ^-

488+50:32 glyph (

489+50:33 tight name list

490+50:38 tvar A

491+50:39 tight glyph )

492+50:41 glyph (

493+50:42 tight name local-id

494+50:51 lit ~

495+50:52 tight glyph )

496+51:1 NEWLINE

497+51:1 glyph ++

498+51:4 name param-list-text

499+51:20 glyph (

500+51:21 tight name param-list

501+51:32 glyph ~[

502+51:34 tight str "hi"

503+51:38 tight glyph ]

504+51:39 tight glyph )

505+52:1 NEWLINE

506+52:1 glyph ++

507+52:4 name param-list-ship

508+52:20 glyph (

509+52:21 tight name param-list

510+52:32 glyph ~[

511+52:34 tight lit ~zod

512+52:38 tight glyph ]

513+52:39 tight glyph )

514+53:1 NEWLINE

515+53:1 glyph ++

516+53:4 name param-union

517+53:16 glyph |=

518+53:19 name x

519+53:20 tight glyph =

520+53:21 tight tvar A

521+53:23 glyph ^-

522+53:26 glyph (

523+53:27 tight name choice

524+53:34 tvar A

525+53:35 tight glyph )

526+53:37 glyph (

527+53:38 tight name local-id

528+53:47 glyph [

529+53:48 tight lit %one

530+53:53 name x

531+53:54 tight glyph ]

532+53:55 tight glyph )

533+54:1 NEWLINE

534+54:1 glyph ++

535+54:4 name param-union-text

536+54:21 glyph (

537+54:22 tight name param-union

538+54:34 str "hi"

539+54:38 tight glyph )

540+55:1 NEWLINE

541+55:1 glyph ++

542+55:4 name param-union-ship

543+55:21 glyph (

544+55:22 tight name param-union

545+55:34 lit ~zod

546+55:38 tight glyph )

547+56:1 NEWLINE

548+56:1 glyph ++

549+56:4 name nested-tag-unknown

550+56:23 glyph (

551+56:24 tight name local-id

552+56:33 glyph [

553+56:34 tight lit %one

554+56:39 lit %dangling

555+56:48 tight glyph ]

556+56:49 tight glyph )

557+56:50 NEWLINE

tests/golden/types-deferred-call-context/tree.txtnew file+272

@@ -0,0 +1,272 @@

1+(module

2+ (mold 1:1 msg

3+ (union 2:3 (const 2:3 %good) (const 3:3 %other)))

4+ (value 4:1 local-id

5+ (gate 4:13 (bind 4:16 x) (wing 4:18 x)))

6+ (value 5:1 empty-list

7+ (cast 5:15

8+ (apply 5:18 list (aura 5:24 @t))

9+ (group 5:28

10+ (call 5:29 (wing 5:29 local-id) (lit 5:38 ~)))))

11+ (value 6:1 filled-list

12+ (cast 6:16

13+ (apply 6:19 list (aura 6:25 @t))

14+ (group 6:29

15+ (call 6:30

16+ (wing 6:30 local-id)

17+ (list 6:39 (str 6:41 "hi"))))))

18+ (value 7:1 wrong-list

19+ (cast 7:15

20+ (apply 7:18 list (aura 7:24 @t))

21+ (group 7:28

22+ (call 7:29

23+ (wing 7:29 local-id)

24+ (list 7:38 (lit 7:40 ~zod))))))

25+ (value 8:1 unit-value

26+ (cast 8:15

27+ (apply 8:18 unit (ref 8:24 msg))

28+ (group 8:29

29+ (call 8:30

30+ (wing 8:30 local-id)

31+ (unit 8:39 (lit 8:40 %good))))))

32+ (value 9:1 union-value

33+ (cast 9:16

34+ (ref 9:19 msg)

35+ (group 9:23

36+ (call 9:24 (wing 9:24 local-id) (lit 9:33 %good)))))

37+ (value 10:1 union-bad

38+ (cast 10:14

39+ (ref 10:17 msg)

40+ (group 10:21

41+ (call 10:22 (wing 10:22 local-id) (lit 10:31 %wrong)))))

42+ (value 11:1 nested

43+ (cast 11:11

44+ (apply 11:14 list

45+ (apply 11:20 unit (ref 11:26 msg)))

46+ (group 11:32

47+ (call 11:33

48+ (wing 11:33 local-id)

49+ (list 11:42

50+ (unit 11:44 (lit 11:45 %good)))))))

51+ (value 12:1 rec-value

52+ (cast 12:14

53+ (cell 12:17

54+ (face 12:18 field

55+ (apply 12:24 list (aura 12:30 @t))))

56+ (group 12:35

57+ (call 12:36

58+ (wing 12:36 local-id)

59+ (tuple 12:45

60+ (face 12:46 field (lit 12:52 ~)))))))

61+ (value 13:1 already

62+ (gate 13:12

63+ (face 13:15 x (aura 13:17 @ud))

64+ (cast 13:21

65+ (aura 13:24 @u)

66+ (group 13:27

67+ (call 13:28 (wing 13:28 local-id) (wing 13:37 x))))))

68+ (value 14:1 bad-aura

69+ (gate 14:13

70+ (face 14:16 x (aura 14:18 @p))

71+ (cast 14:21

72+ (aura 14:24 @t)

73+ (group 14:27

74+ (call 14:28 (wing 14:28 local-id) (wing 14:37 x))))))

75+ (value 15:1 capital

76+ (gate 15:12

77+ (face 15:15 x (tvar 15:17 A))

78+ (cast 15:19

79+ (tvar 15:22 A)

80+ (group 15:24

81+ (call 15:25 (wing 15:25 local-id) (str 15:34 "text"))))))

82+ (value 16:1 trace-tag

83+ (cast 16:14

84+ (apply 16:17 list (aura 16:23 @t))

85+ (body 17:3

86+ (trace 17:3

87+ (lit 17:6 %dangling)

88+ (body 18:5

89+ (group 18:5

90+ (call 18:6 (wing 18:6 local-id) (lit 18:15 ~))))))))

91+ (value 19:1 trace-null

92+ (cast 19:15

93+ (apply 19:18 list (aura 19:24 @t))

94+ (body 20:3

95+ (trace 20:3

96+ (lit 20:6 ~)

97+ (body 21:5

98+ (group 21:5

99+ (call 21:6 (wing 21:6 local-id) (lit 21:15 ~))))))))

100+ (value 22:1 unresolved

101+ (group 22:15

102+ (call 22:16 (wing 22:16 local-id) (lit 22:25 %dangling))))

103+ (value 23:1 no-context

104+ (group 23:15

105+ (call 23:16 (wing 23:16 local-id) (lit 23:25 ~))))

106+ (value 24:1 local-keep

107+ (gate 24:15

108+ (cell 24:18

109+ (face 24:19 a (tvar 24:21 A))

110+ (face 24:23 b (tvar 24:25 A)))

111+ (wing 24:28 a)))

112+ (value 25:1 repeated-good

113+ (cast 25:18

114+ (aura 25:21 @t)

115+ (group 25:24

116+ (call 25:25 (wing 25:25 local-keep) (str 25:36 "hi") (str 25:41 "bye")))))

117+ (value 26:1 repeated-bad

118+ (cast 26:17

119+ (aura 26:20 @t)

120+ (group 26:23

121+ (call 26:24 (wing 26:24 local-keep) (str 26:35 "hi") (lit 26:40 ~zod)))))

122+ (value 27:1 rec-good

123+ (cast 27:13

124+ (cell 27:16

125+ (face 27:17 field

126+ (apply 27:23 list (aura 27:29 @t)))

127+ (face 27:33 flag (flag 27:38)))

128+ (group 27:41

129+ (call 27:42

130+ (wing 27:42 local-id)

131+ (tuple 27:51

132+ (face 27:52 field (lit 27:58 ~))

133+ (face 27:60 flag (lit 27:65 %.y)))))))

134+ (value 28:1 rec-bad

135+ (cast 28:12

136+ (cell 28:15

137+ (face 28:16 field

138+ (apply 28:22 list (aura 28:28 @t)))

139+ (face 28:32 flag (flag 28:37)))

140+ (group 28:40

141+ (call 28:41

142+ (wing 28:41 local-id)

143+ (tuple 28:50

144+ (face 28:51 field

145+ (list 28:57 (lit 28:59 ~zod)))

146+ (face 28:65 flag (lit 28:70 %.y)))))))

147+ (value 29:1 wrap-identity

148+ (gate 29:18

149+ (face 29:21 x (tvar 29:23 A))

150+ (cast 29:25

151+ (tvar 29:28 A)

152+ (group 29:30

153+ (call 29:31 (wing 29:31 local-id) (wing 29:40 x))))))

154+ (value 30:1 wrap-forced

155+ (gate 30:16

156+ (face 30:19 x (tvar 30:21 A))

157+ (cast 30:23

158+ (aura 30:26 @t)

159+ (group 30:29

160+ (call 30:30 (wing 30:30 local-id) (wing 30:39 x))))))

161+ (value 31:1 retain

162+ (gate 31:11

163+ (face 31:14 x (aura 31:16 @t))

164+ (group 31:19

165+ (call 31:20 (wing 31:20 local-id) (wing 31:29 x)))))

166+ (value 32:1 result-later

167+ (gate 32:17

168+ (bind 32:20 x)

169+ (cast 32:22

170+ (apply 32:25 list (aura 32:31 @t))

171+ (group 32:35

172+ (call 32:36 (wing 32:36 local-id) (wing 32:45 x))))))

173+ (value 33:1 result-repeated

174+ (cast 33:20

175+ (apply 33:23 list (aura 33:29 @t))

176+ (group 33:33

177+ (call 33:34 (wing 33:34 local-keep) (lit 33:45 ~) (lit 33:47 ~)))))

178+ (value 34:1 result-repeated-bad

179+ (cast 34:24

180+ (apply 34:27 list (aura 34:33 @t))

181+ (group 34:37

182+ (call 34:38

183+ (wing 34:38 local-keep)

184+ (lit 34:49 ~)

185+ (list 34:51 (lit 34:53 ~zod))))))

186+ (value 35:1 recursive

187+ (gate 35:14

188+ (cell 35:17

189+ (face 35:18 flag (flag 35:23))

190+ (bind 35:25 value))

191+ (body 36:3

192+ (cast 36:3

193+ (apply 36:6 list (aura 36:12 @t))

194+ (body 37:5

195+ (branch 37:5

196+ (wing 37:8 flag)

197+ (arm 38:7

198+ (lit 38:7 %.y)

199+ (group 38:11

200+ (call 38:12 (wing 38:12 local-id) (wing 38:21 value))))

201+ (arm 39:7

202+ (lit 39:7 %.n)

203+ (group 39:11

204+ (call 39:12 (wing 39:12 recursive) (wing 39:22 flag) (wing 39:27 value))))))))))

205+ (value 40:1 captured

206+ (gate 40:13

207+ (bind 40:16 sample)

208+ (body 41:3

209+ (value 41:3 local

210+ (gate 41:12 (bind 41:15 ignored) (wing 41:23 sample)))

211+ (cast 42:3

212+ (apply 42:6 list (aura 42:12 @t))

213+ (group 42:16

214+ (call 42:17 (wing 42:17 local) (lit 42:23 ~zod)))))))

215+ (value 43:1 captured-bad

216+ (gate 43:17

217+ (bind 43:20 sample)

218+ (body 44:3

219+ (value 44:3 local

220+ (gate 44:12 (bind 44:15 ignored) (wing 44:23 sample)))

221+ (trace 45:3

222+ (cast 45:6 (aura 45:9 @t) (wing 45:12 sample))

223+ (body 46:5

224+ (cast 46:5

225+ (aura 46:8 @p)

226+ (group 46:11

227+ (call 46:12 (wing 46:12 local) (lit 46:18 ~zod)))))))))

228+ (mold 47:1 choice

229+ (generic 47:11 A

230+ (union 48:3

231+ (cell 48:3

232+ (const 48:4 %one)

233+ (face 48:9 value (tvar 48:15 A)))

234+ (const 49:3 %none))))

235+ (value 50:1 param-list

236+ (gate 50:15

237+ (face 50:18 x

238+ (apply 50:20 list (tvar 50:26 A)))

239+ (cast 50:29

240+ (apply 50:32 list (tvar 50:38 A))

241+ (group 50:41

242+ (call 50:42 (wing 50:42 local-id) (lit 50:51 ~))))))

243+ (value 51:1 param-list-text

244+ (group 51:20

245+ (call 51:21

246+ (wing 51:21 param-list)

247+ (list 51:32 (str 51:34 "hi")))))

248+ (value 52:1 param-list-ship

249+ (group 52:20

250+ (call 52:21

251+ (wing 52:21 param-list)

252+ (list 52:32 (lit 52:34 ~zod)))))

253+ (value 53:1 param-union

254+ (gate 53:16

255+ (face 53:19 x (tvar 53:21 A))

256+ (cast 53:23

257+ (apply 53:26 choice (tvar 53:34 A))

258+ (group 53:37

259+ (call 53:38

260+ (wing 53:38 local-id)

261+ (tuple 53:47 (lit 53:48 %one) (wing 53:53 x)))))))

262+ (value 54:1 param-union-text

263+ (group 54:21

264+ (call 54:22 (wing 54:22 param-union) (str 54:34 "hi"))))

265+ (value 55:1 param-union-ship

266+ (group 55:21

267+ (call 55:22 (wing 55:22 param-union) (lit 55:34 ~zod))))

268+ (value 56:1 nested-tag-unknown

269+ (group 56:23

270+ (call 56:24

271+ (wing 56:24 local-id)

272+ (tuple 56:33 (lit 56:34 %one) (lit 56:39 %dangling))))))

tests/golden/types-deferred-call-context/types.txtnew file+82

@@ -0,0 +1,82 @@

1+partial inference; module not checked

2++$ msg: cases proven disjoint; mold not checked

3+++ local-id: $-(A A)

4+++ empty-list: (list @t)

5+++ filled-list: (list @t)

6+++ wrong-list: list item does not fit its expected type

7+/tests/golden/types-deferred-call-context/source.jibb:7:29: expected item has type @t

8+++ wrong-list ^- (list @t) (local-id ~[~zod])

9+ ^

10+/tests/golden/types-deferred-call-context/source.jibb:7:40: list item has type @p

11+++ wrong-list ^- (list @t) (local-id ~[~zod])

12+ ^

13+++ unit-value: (unit msg)

14+++ union-value: msg

15+++ union-bad: msg has no case `%wrong`

16+/tests/golden/types-deferred-call-context/source.jibb:10:22: expected union

17+++ union-bad ^- msg (local-id %wrong)

18+ ^

19+/tests/golden/types-deferred-call-context/source.jibb:10:31: tag

20+++ union-bad ^- msg (local-id %wrong)

21+ ^

22+++ nested: (list (unit msg))

23+++ rec-value: cons shape is not supported by partial inference

24+++ already: $-(@ud @u)

25+++ bad-aura: call's sample and argument types do not unify

26+/tests/golden/types-deferred-call-context/source.jibb:14:28: called gate has type $-(@t @t)

27+++ bad-aura |= x=@p ^- @t (local-id x)

28+ ^

29+/tests/golden/types-deferred-call-context/source.jibb:14:37: argument has type @p

30+++ bad-aura |= x=@p ^- @t (local-id x)

31+ ^

32+++ capital: explicit capital constraints are not supported by partial inference

33+++ trace-tag: tag needs context in partial inference

34+++ trace-null: `~` needs context in partial inference

35+++ unresolved: tag needs context in partial inference

36+++ no-context: `~` needs context in partial inference

37+++ local-keep: $-([a=A b=A] A)

38+++ repeated-good: @t

39+++ repeated-bad: call's sample and argument types do not unify

40+/tests/golden/types-deferred-call-context/source.jibb:26:24: called gate has type $-([a=@t b=@t] @t)

41+++ repeated-bad ^- @t (local-keep "hi" ~zod)

42+ ^

43+/tests/golden/types-deferred-call-context/source.jibb:26:35: argument has type [@t @p]

44+++ repeated-bad ^- @t (local-keep "hi" ~zod)

45+ ^

46+++ rec-good: [field=(list @t) flag=?]

47+++ rec-bad: list item does not fit its expected type

48+/tests/golden/types-deferred-call-context/source.jibb:28:41: expected item has type @t

49+++ rec-bad ^- [field=(list @t) flag=?] (local-id [field=~[~zod] flag=%.y])

50+ ^

51+/tests/golden/types-deferred-call-context/source.jibb:28:59: list item has type @p

52+++ rec-bad ^- [field=(list @t) flag=?] (local-id [field=~[~zod] flag=%.y])

53+ ^

54+++ wrap-identity: $-(A A)

55+++ wrap-forced: explicit capital constraints are not supported by partial inference

56+++ retain: $-(@t @t)

57+++ result-later: $-((list @t) (list @t))

58+++ result-repeated: (list @t)

59+++ result-repeated-bad: list item does not fit its expected type

60+/tests/golden/types-deferred-call-context/source.jibb:34:38: expected item has type @t

61+++ result-repeated-bad ^- (list @t) (local-keep ~ ~[~zod])

62+ ^

63+/tests/golden/types-deferred-call-context/source.jibb:34:53: list item has type @p

64+++ result-repeated-bad ^- (list @t) (local-keep ~ ~[~zod])

65+ ^

66+++ recursive: call constraint is not supported by partial inference

67+++ captured: $-((list @t) (list @t))

68+++ captured-bad: cast mold and expression type do not unify

69+/tests/golden/types-deferred-call-context/source.jibb:46:8: cast mold has type @p

70+ ^- @p (local ~zod)

71+ ^

72+/tests/golden/types-deferred-call-context/source.jibb:46:11: expression has type @t

73+ ^- @p (local ~zod)

74+ ^

75++$ choice: cases proven disjoint; mold not checked

76+++ param-list: $-((list A) (list A))

77+++ param-list-text: (list @t)

78+++ param-list-ship: (list @p)

79+++ param-union: $-(A (choice A))

80+++ param-union-text: (choice @t)

81+++ param-union-ship: (choice @p)

82+++ nested-tag-unknown: tag needs context in partial inference

tests/golden/types-equal-head-disjoint/about.txtnew file+2

@@ -0,0 +1,2 @@

1+source: equal literal heads may have disjoint payloads and are compared by noun.

2+tests: Singleton payloads %alpha and %beta select distinct same-head cases; @t and @p cases overlap at zero. Incompatible samples and unrelated pending literals fail closed.

tests/golden/types-equal-head-disjoint/source.jibbnew file+25

@@ -0,0 +1,25 @@

1++$ split

2+ [%one value=@t]

3+ [%one value=@p]

4++$ split-zero

5+ [~ value=@t]

6+ [%.y value=@p]

7++$ nullable

8+ ~

9+ [~ value=@t]

10+++ cord ^- $-(@t split) |=%one

11+++ ship ^- $-(@p split) |=%one

12+++ neither ^- $-(@ud split) |=%one

13+++ zero-cord ^- $-(@t split-zero) |=%$

14+++ zero-ship ^- $-(@p split-zero) |=%$

15+++ zero-neither ^- $-(@ud split-zero) |=%$

16+++ contextual ^- $-(@t nullable) |=%$

17+++ pending

18+ ~& %orphan

19+ ^- $-(@t split) |=%one

20++$ exact

21+ [%same %alpha]

22+ [%same %beta]

23+++ first ^- $-(%alpha exact) |=%same

24+++ second ^- $-(%beta exact) |=%same

25+++ no-case ^- $-(%other exact) |=%same

tests/golden/types-equal-head-disjoint/tokens.txtnew file+179