0ea700d..master · jibb

git.iko.soy/jibb

593 files changed+32588−4889

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

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

4646

4747### The doc's examples

4848

docs/compiler.md+59−5

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

6070

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

6272

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

6474

65−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 literals specialize against a loobean singleton. Open `%f`, other values, and other forks containing loobean singletons remain unsupported; recursive Hoon molds containing flags can also fail closed.

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

6676

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

6878

@@ -80,25 +90,49 @@ A backtick constructs a unit when the supplied prelude has the validated standar

8090

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

8292

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

94+

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

8496

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

8698

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

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

100+

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

88102

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

90104

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

92106

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

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

108+

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

110+

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

94112

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

96114

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

98116

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

118+

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

120+

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

122+

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

124+

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

126+

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

128+

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

130+

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

132+

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

100134

101−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`, `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 an atom-constrained private comparison scheme for a Jibb-written `gth` wrapper. 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. Addition, decrement and length remain unavailable until arithmetic constraints distinguish their results from loobeans. The partial checker resolves its supported source shape, preserves its public name, and rejects ordinary imports of the private internal path. 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, `ask`, `pure`, 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.

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

102136

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

104138

@@ -111,6 +145,14 @@ And the design notes:

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

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

113147

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

149+

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

151+

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

153+

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

155+

114156## The tree

115157

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

@@ -147,3 +189,15 @@ Note 4 has examples of each.

147189## Speed

148190

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

192+

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

194+

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

196+

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

198+

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

200+

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

202+

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

docs/development.md+67

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

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

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

1616

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

18+

1719## Setting up a machine

1820

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

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

6062| --- | --- |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@@ -85,18 +117,51 @@ git clone https://github.com/urbit/tools /root/src/tools

85117```

86118tools/golden # all cases pass

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

95134tools/type-list-alias-test # prelude list-alias guards pass

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

148213## Commits

149214

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

216+

217+`tools/type-deferred-test` exercises the bounded, source-owned constructor transaction and low-level freshness/replay guards. `tools/type-deferred-resolver-test` checks the experimental import-free library resolver, report consistency, atomic failure, and that both source orders of a late face constraint decline. These checks do not establish island-kind or watchability support.

docs/open-questions.md+6−2

@@ -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 and 18 remain open; the field-order detail in question 32 is being clarified. 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,7 +37,7 @@ 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.

@@ -62,6 +62,10 @@ Found while writing [prompts/milestone-2.md](prompts/milestone-2.md), checking i

6262

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

6464

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.

68+

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

6670

6771In milestone 1 the parser met about thirty places where the doc could be read more than one way. Twelve went to @iko on 2026-10-30 and are rows of the Decisions tab. These were not asked. For each, the parser follows the reading below, and some are marked "(doc question)" in the library's notes. None changes what a valid program means, except where a reading makes something an error.

docs/prelude-inventory.md+10−8

@@ -4,9 +4,9 @@ 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. `ask` is not yet defined there.

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 related `sub` declaration awaits the source representation and checking of `ask`.

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.

1010

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

1212

@@ -14,7 +14,7 @@ Hoon `+$` arms are marked **mold** below; `++` arms can be gates, doors or mold

1414

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

1616

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. `add` and `dec` are not yet exposed: treating every atom-constrained type as closed under arithmetic would incorrectly infer loobean results for operations that can produce other atoms.

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.

1818

1919## 1c

2020

@@ -26,7 +26,7 @@ The source-backed `gth` gate calls a compiler-supplied private comparison interf

2626

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

2828

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. 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. Backend validation and jet recognition remain outstanding for all of them.

3030

3131| Name | Hoon behavior | Jibb status |

3232| --- | --- | --- |

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

4949

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

5151

52−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`, `turn`, `flop`, `rear`, `skim`, `skip`, `murn`, `join`, `snip`, `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.

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

5353

5454## 2c

5555

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

9999

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

101101

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.

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. `succ` increments an atom through `add`; the partial checker infers a shared atom type excluding loobeans. A Hoon translation agrees with Hoon on ten selected inputs; Jibb execution and jet recognition remain unverified. `lead` and `late` are curried pair constructors: `((lead a) b)` returns `[a b]`, and `((late a) b)` returns `[b a]`. Their arguments may have independent types, including gate values, and neither constructor invokes a gate. The partial checker infers their polymorphic types. A Hoon translation agrees with Hoon’s helpers on selected inputs, but this is not Jibb execution; lowering and jet recognition remain to be validated by a backend.

103103

104104## 2o

105105

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

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

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

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

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

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

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

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

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

152152 [%2 p=(list tank)]

153153```

154154

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

156156

157157## 4a

158158

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

162162

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

164164

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

166+

165167## 4k

166168

167169`co`.

docs/prompts/milestone-2.md+5−5

@@ -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. The source-backed internal module defines `poke`; the public prelude re-exports it as an ordinary transparent type that modules can construct and inspect, as question 24 records. This decision does not specify the representation of `ask` or `qath`.

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.

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

7575

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

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

78−- `|=%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."

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

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

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

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

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

110110

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

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

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

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

115115

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

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

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

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

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

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

122122

123123**Errors**

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

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

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

127127- 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/decisions.md+3−2

@@ -24,7 +24,7 @@ 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 |

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

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

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 |

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

3535| 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 watching such a request has a type error; typed segments by aura | Decided 2026-10-30 |

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

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

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

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

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

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

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

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

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

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

8788| 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+2−2

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

@@ -141,7 +141,7 @@ A mold is only a type: never called on a noun, and with no default. Types are in

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

142142

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

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

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

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

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

docs/spec/overview.md+3−1

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

@@ -152,7 +154,7 @@ Loads and renders run in Nock.

152154

153155- `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+107−10

@@ -19,15 +19,61 @@ 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 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; `ask` remains outstanding.

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−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 repository spec records this change; projection-aware type checking and lowering are not implemented yet.

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.

2525

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. 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. `ask` is still unfinished.

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.

2727

28−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 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 a private comparison scheme to the Jibb-written `gth` wrapper; ordinary imports cannot access them. Primitive execution and jet recognition are unfinished, and addition, decrement and length remain unavailable until arithmetic constraints distinguish their results from loobeans. 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 create requests or check an API module. Complete private module checking, other API shapes, request gates, root API and kind checking, stores, `ask`, `pure`, lowering 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. 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. 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 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.

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

2929

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

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

31+

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

33+

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

35+

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

37+

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

39+

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

41+

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

43+

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

45+

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

47+

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

49+

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

51+

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

53+

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

55+

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

57+

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

59+

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

61+

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

63+

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

65+

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

67+

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

69+

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

71+

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

73+

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

75+

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

3177

3278## Milestone 1: parser and mark

3379

@@ -45,8 +91,8 @@ What the plan asks for, and where it is:

4591

4692Besides the plan's list:

4793

48−- 608 golden cases: 388 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.

49−- The 608-case corpus passed under `urbit eval` in 80.7 s while other checks were running. The fake ship passed all 621 tests, including the importer, importer/checker and mark/checker bridges, module scope, unification, hole and qath guards, with 49.9 s for sync and 65.2 s for tests. 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.

94+- 659 golden cases: 439 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.

95+- The 659-case corpus passed under `urbit eval` in 103.2 s while other checks were running. The fake ship passed all 705 tests, including the source-overlap, structural-overlap, generic-union source and alias-overlap, full-module overlap, deferred-context, generic-recursion, generic-construction, generic-pattern, deferred-inference, empty-mold and cell-branch fixtures, importer, importer/checker and mark/checker bridges, module scope, unification, hole, qath, ask, default-wrapper importer, projection, arithmetic, generic-alias, positional-face, API-evidence, request, closed-gate, todo API, constructor, sub, nested-union, gate-free and direct-gate guards and the unchanged todo report. Desk sync took 99.8 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.

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

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

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

@@ -127,30 +173,81 @@ Besides the plan's list:

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

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

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

130−| This change | 2026-10-31 | Infer a source-defined recursive `qath` subset and record the explicit `proj` decision |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

201+| 30b0a9e | 2026-10-31 | Match source-proven recursive tree cases |

202+| 72d85ab | 2026-10-31 | Add bounded deferred inference and expand runtime equality coverage |

203+| 22f3788 | 2026-10-31 | Check empty molds and propagate closed cell context into branches |

204+| 341bcb4 | 2026-10-31 | Keep deferred fits stable under later substitutions |

205+| b93a94b | 2026-10-31 | Prove local generic-alias union tags and add successor |

206+| 2826c93 | 2026-10-31 | Report generic-alias overlaps and retain deferred branch contexts |

207+| b5cdc80 | 2026-10-31 | Preserve full-module overlap source evidence |

208+| This change | 2026-10-31 | Add source-backed text conversion wrappers |

131209

132210## Checking it

133211

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

135213

136214```

137−tools/golden # 608 cases under urbit eval

215+tools/golden # 659 cases under urbit eval

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

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

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

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

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

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

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

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

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

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

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

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

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

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

145230tools/type-list-alias-test # prelude list-alias guards

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

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

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

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

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

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

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

238+tools/type-empty-test # empty molds and coverage guards

239+tools/type-cell-branch-test # branch context and rollback guards

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

146241tools/type-qath-guards-test # qath source and unfolding guards

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

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

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

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

149246tools/testdata/selftest # the tools themselves

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

151248tools/ship start

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

153−tools/ship test # the same 608 cases as -test arms on the ship

250+tools/ship test # the same 659 cases as -test arms on the ship

154251tools/testdata/ship-selftest

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

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

jibb-dev/lib/jibb-import.hoon+196−9

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

4747 ==

4848+$ import-diagnostic

4949 $% [%ok value=imported]

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

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

5151 [%unsupported message=@t]

5252 ==

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

@@ -132,6 +132,35 @@

132132 =/ rest $(cases t.cases, tags [u.tag tags])

133133 ?~ rest ~

134134 `[[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]

135164::

136165:: Benign source annotations have different typed representations on

137166:: Clay and under eval. Inspect the wrapper as a noun, and validate the

@@ -151,19 +180,38 @@

151180 ?: =(left 0) ~

152181 $(raw u.wrapper, left (dec left))

153182::

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

154195++ tagged-source-code

155196 |= [code=hoon name=term]

156197 ^- (unit (list tagged-case))

157198 =/ found=(unit spec) (local-mold-spec code name)

158199 ?~ found ~

159− =/ plain=(unit *) (source-unwrap u.found 4)

160− ?~ plain ~

161− =/ body=spec ;;(spec u.plain)

162− ?. ?=([%bccn *] body) ~

163− =/ cases=(list spec) p.body

164− ?~ cases ~

165− ?~ t.cases ~

166− (tagged-cases cases ~)

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

167215::

168216:: Source proof for dependencies of an explicitly tagged union. Only

169217:: simple local molds, standard collections and distinct term enums are

@@ -250,6 +298,7 @@

250298 ?+ shape ~

251299 [%base *] ?:(|(?=([%atom *] p.shape) =(%flag p.shape) =(%null p.shape)) `fuel ~)

252300 [%leaf *] `fuel

301+ [%bcsg *] $(shape q.shape)

253302 [%bcts *] ?@ p.shape $(shape q.shape)

254303 ~

255304 [%bccl *] (safe-source-specs-mode p.shape cor seen fuel allow-nested)

@@ -334,6 +383,140 @@

334383 ?. ?=([%cell [%atom %tas [~ @]] *] i.ys) ~

335384 ?. =(tag.i.xs u.value.head.i.ys) ~

336385 $(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)

337520::

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

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

@@ -349,6 +532,8 @@

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

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

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

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

353538 ?: ?=([%& *] result) result

354539 =/ fallback=(each (unit (each imported @t)) tang)

@@ -449,6 +634,8 @@

449634 [%unsupported p.result]

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

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

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

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

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

jibb-dev/lib/jibb.hoon+3337−187

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

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

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

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

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

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

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

@@ -4614,20 +4616,64 @@

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

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

46164618::

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

46174659+$ itype

46184660 $~ [%var 0]

46194661 $% [%var id=@ud]

46204662 [%avar id=@ud]

4663+ [%rvar id=@ud]

46214664 [%nvar id=@ud]

4665+ [%rnvar id=@ud]

46224666 [%atom aura=@ta]

46234667 [%any-atom ~]

46244668 [%flag ~]

46254669 [%noun ~]

4670+ [%empty ~]

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

46274672 [%const literal=lit]

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

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

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

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

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

46324678 [%face name=term body=itype]

46334679 [%fn sample=itype product=itype]

@@ -4651,21 +4697,117 @@

46514697 %var

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

46534699 ?~ found t

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

46544701 $(t u.found)

46554702 %avar

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

46574704 ?~ found t

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

4706+ $(t u.found)

4707+ %rvar

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

4709+ ?~ found t

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

46584711 $(t u.found)

46594712 %nvar

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

46614714 ?~ found t

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

4716+ $(t u.found)

4717+ %rnvar

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

4719+ ?~ found t

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

46624721 $(t u.found)

46634722 %tag

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

46654724 ?~ found t

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

46664726 $(t u.found)

46674727 ==

46684728::

4729+:: Prove only emptiness; unknown types are never treated as empty.

4730+:: A shared node budget bounds each proof attempt.

4731+++ itype-empty-cases

4732+ |= [xs=(list itype) sub=isub fuel=@ud]

4733+ ^- (unit [empty=? left=@ud])

4734+ ?~ xs `[& fuel]

4735+ =/ first=(unit [empty=? left=@ud]) (itype-empty-proof i.xs sub fuel)

4736+ ?~ first ~

4737+ ?. empty.u.first `[| left.u.first]

4738+ $(xs t.xs, fuel left.u.first)

4739+++ itype-empty-proof

4740+ |= [typ=itype sub=isub fuel=@ud]

4741+ ^- (unit [empty=? left=@ud])

4742+ ?: =(0 fuel) ~

4743+ =. fuel (dec fuel)

4744+ =. typ (itype-walk typ sub)

4745+ ?- -.typ

4746+ %empty `[& fuel]

4747+ %face $(typ body.typ)

4748+ %cell

4749+ =/ left=(unit [empty=? left=@ud]) $(typ hed.typ)

4750+ ?~ left ~

4751+ ?: empty.u.left `[& left.u.left]

4752+ $(typ tal.typ, fuel left.u.left)

4753+ %union (itype-empty-cases cases.typ sub fuel)

4754+ * `[| fuel]

4755+ ==

4756+:: Prove reachability separately from emptiness. An unresolved fixed

4757+:: recursive type is not presumed inhabited. A written, still-unconstrained

4758+:: capital is existentially inhabited for pattern reachability; the normal

4759+:: definition-boundary checks reject subsequently constrained capitals.

4760+++ itype-inhabited-cases

4761+ |= [xs=(list itype) sub=isub caps=icaps fuel=@ud pending=?]

4762+ ^- (unit [result=?(%yes %no %unknown) left=@ud])

4763+ ?~ xs `[?:(pending %unknown %no) fuel]

4764+ =/ first=(unit [result=?(%yes %no %unknown) left=@ud])

4765+ (itype-inhabited-proof i.xs sub caps fuel)

4766+ ?~ first ~

4767+ ?: =(%yes result.u.first) first

4768+ $(xs t.xs, fuel left.u.first, pending |(pending =(%unknown result.u.first)))

4769+++ itype-inhabited-proof

4770+ |= [typ=itype sub=isub caps=icaps fuel=@ud]

4771+ ^- (unit [result=?(%yes %no %unknown) left=@ud])

4772+ ?: =(0 fuel) ~

4773+ =. fuel (dec fuel)

4774+ =. typ (itype-walk typ sub)

4775+ ?- -.typ

4776+ %empty `[%no fuel]

4777+ ?(%atom %any-atom %flag %const %noun %avar %rvar %nvar %rnvar %fn %jrec) `[%yes fuel]

4778+ %var

4779+ ?: (lien caps |=(c=icap (hole-same-variable typ (itype-walk [%var id.c] sub)))) `[%yes fuel]

4780+ `[%unknown fuel]

4781+ %face $(typ body.typ)

4782+ %cell

4783+ =/ head=(unit [result=?(%yes %no %unknown) left=@ud]) $(typ hed.typ)

4784+ ?~ head ~

4785+ ?: =(%no result.u.head) head

4786+ =/ tail=(unit [result=?(%yes %no %unknown) left=@ud]) $(typ tal.typ, fuel left.u.head)

4787+ ?~ tail ~

4788+ ?: =(%no result.u.tail) tail

4789+ ?: |(=(%unknown result.u.head) =(%unknown result.u.tail)) `[%unknown left.u.tail]

4790+ `[%yes left.u.tail]

4791+ %union (itype-inhabited-cases cases.typ sub caps fuel |)

4792+ %collection

4793+ ?. &(|(=(%list name.typ) =(%unit name.typ)) ?=([* ~] args.typ)) `[%unknown fuel]

4794+ `[%yes fuel]

4795+ %grec ?:((grec-tree-proof name.typ proof.typ) `[%yes fuel] `[%unknown fuel])

4796+ * `[%unknown fuel]

4797+ ==

4798+++ itype-live-cases

4799+ |= [xs=(list itype) sub=isub caps=icaps fuel=@ud]

4800+ ^- (unit (list itype))

4801+ ?~ xs `~

4802+ =/ first=(unit [result=?(%yes %no %unknown) left=@ud])

4803+ (itype-inhabited-proof i.xs sub caps fuel)

4804+ ?~ first ~

4805+ ?: =(%unknown result.u.first) ~

4806+ =/ rest=(unit (list itype)) $(xs t.xs, fuel left.u.first)

4807+ ?~ rest ~

4808+ ?: =(%no result.u.first) rest

4809+ `[i.xs u.rest]

4810+::

46694811++ itype-occurs

46704812 |= [n=@ud t=itype sub=isub]

46714813 ^- ?

@@ -4673,16 +4815,20 @@

46734815 ?- -.t

46744816 %var =(n id.t)

46754817 %avar =(n id.t)

4818+ %rvar =(n id.t)

46764819 %nvar =(n id.t)

4820+ %rnvar =(n id.t)

46774821 %atom |

46784822 %any-atom |

46794823 %flag |

46804824 %noun |

4825+ %empty |

46814826 %tag =(n id.t)

46824827 %const |

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

46844829 %recursive |

46854830 %jrec |

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

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

46874833 %face $(t body.t)

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

@@ -4701,6 +4847,9 @@

47014847 =. a (itype-walk a sub)

47024848 =. b (itype-walk b sub)

47034849 ?: =(a b) `sub

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

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

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

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

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

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

@@ -4719,6 +4868,32 @@

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

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

47214870 `[[id.b a] sub]

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

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

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

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

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

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

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

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

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

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

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

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

4883+ ?: ?=(%rnvar -.a)

4884+ ?. |(?=(%rnvar -.b) ?=(%atom -.b)) ~

4885+ `[[id.a b] sub]

4886+ ?: ?=(%rnvar -.b)

4887+ ?. ?=(%atom -.a) ~

4888+ `[[id.b a] sub]

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

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

4891+ ?: ?=(%rvar -.a)

4892+ ?. |(?=(%rvar -.b) ?=(%atom -.b)) ~

4893+ `[[id.a b] sub]

4894+ ?: ?=(%rvar -.b)

4895+ ?. ?=(%atom -.a) ~

4896+ `[[id.b a] sub]

47224897 :: The narrower decimal constraint survives a match with an atom

47234898 :: variable; decimal syntax alone does not make it a loobean.

47244899 ?: &(?=(%nvar -.a) ?=(%avar -.b)) `[[id.b a] sub]

@@ -4773,16 +4948,20 @@

47734948 ?- -.t

47744949 %var |

47754950 %avar |

4951+ %rvar |

47764952 %nvar |

4953+ %rnvar |

47774954 %atom |

47784955 %any-atom &

47794956 %flag |

47804957 %noun |

4958+ %empty |

47814959 %tag |

47824960 %const |

47834961 %union |((lien cases.t |=(c=itype (itype-has-any-atom c sub))) (lien args.t |=(c=itype (itype-has-any-atom c sub))))

47844962 %recursive |

47854963 %jrec |

4964+ %grec (lien args.t |=(c=itype (itype-has-any-atom c sub)))

47864965 %collection (lien args.t |=(c=itype (itype-has-any-atom c sub)))

47874966 %face $(t body.t)

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

@@ -4845,16 +5024,20 @@

48455024 ?- -.typ

48465025 %var |

48475026 %avar |

5027+ %rvar |

48485028 %nvar |

5029+ %rnvar |

48495030 %atom &

48505031 %any-atom &

48515032 %flag &

48525033 %noun |

5034+ %empty |

48535035 %tag &

48545036 %const &

48555037 %union |((lien cases.typ |=(c=itype (itype-has-fixed-atom c))) (lien args.typ |=(c=itype (itype-has-fixed-atom c))))

48565038 %recursive |

48575039 %jrec |

5040+ %grec (lien args.typ |=(c=itype (itype-has-fixed-atom c)))

48585041 %collection (lien args.typ |=(c=itype (itype-has-fixed-atom c)))

48595042 %face $(typ body.typ)

48605043 %fn |($(typ sample.typ) $(typ product.typ))

@@ -4883,6 +5066,7 @@

48835066 ^- ?

48845067 =. t (itype-walk t sub)

48855068 ?- -.t

5069+ %grec (lien args.t |=(c=itype (itype-has-face c sub)))

48865070 %collection (lien args.t |=(c=itype (itype-has-face c sub)))

48875071 %face &

48885072 %cell |($(t hed.t) $(t tal.t))

@@ -4890,6 +5074,42 @@

48905074 * |

48915075 ==

48925076::

5077+:: Closed function samples may omit a slot face, but a known name must

5078+:: match another known name. Keep nested value faces and require exact

5079+:: invariant compatibility; a faced tail against a cell is ambiguous.

5080+++ itype-closed-slot-match

5081+ |= [a=itype b=itype]

5082+ ^- ?

5083+ ?: &(?=(%face -.a) ?=(%face -.b))

5084+ ?. =(name.a name.b) |

5085+ ?=(^ (itype-unify body.a body.b ~))

5086+ ?: ?=(%face -.a) ?=(^ (itype-unify body.a b ~))

5087+ ?: ?=(%face -.b) ?=(^ (itype-unify a body.b ~))

5088+ ?=(^ (itype-unify a b ~))

5089+++ itype-closed-sample-match

5090+ |= [a=itype b=itype fuel=@ud]

5091+ ^- ?

5092+ ?: =(0 fuel) |

5093+ ?. &(?=(%cell -.a) ?=(%cell -.b)) |

5094+ ?. (itype-closed-slot-match hed.a hed.b) |

5095+ =/ x=itype tal.a

5096+ =/ y=itype tal.b

5097+ ?: &(?=(%cell -.x) ?=(%cell -.y))

5098+ ?=(^ (itype-unify x y ~))

5099+ ?: |(&(?=(%face -.x) ?=(%cell -.y)) &(?=(%cell -.x) ?=(%face -.y))) |

5100+ (itype-closed-slot-match x y)

5101+++ itype-closed-gates-match

5102+ |= [a=itype b=itype]

5103+ ^- ?

5104+ ?. &(?=(%fn -.a) ?=(%fn -.b)) |

5105+ ?. &(?=(%cell -.sample.a) ?=(%cell -.sample.b)) |

5106+ ?. =(product.a product.b) |

5107+ ?^ (itype-vars a) |

5108+ ?^ (itype-vars b) |

5109+ ?: |((itype-has-tag a) (itype-has-tag b)) |

5110+ ?. (itype-closed-sample-match sample.a sample.b 1.024) |

5111+ ?=(^ (itype-unify product.a product.b ~))

5112+::

48935113++ itype-face-asym-collection-args

48945114 |= [as=(list itype) bs=(list itype) sub=isub]

48955115 ^- ?

@@ -4903,12 +5123,15 @@

49035123 ^- ?

49045124 =. a (itype-walk a sub)

49055125 =. b (itype-walk b sub)

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

5127+ ?. &(=(at.a at.b) =(name.a name.b)) |

5128+ (itype-face-asym-collection-args args.a args.b sub)

49065129 ?: &(?=(%collection -.a) ?=(%collection -.b))

49075130 ?. =(name.a name.b) |

49085131 (itype-face-asym-collection-args args.a args.b sub)

49095132 ?: &(?=(%face -.a) ?=(%face -.b)) $(a body.a, b body.b)

4910− ?: ?=(%face -.a) !|(?=(%var -.b) ?=(%avar -.b) ?=(%nvar -.b))

4911− ?: ?=(%face -.b) !|(?=(%var -.a) ?=(%avar -.a) ?=(%nvar -.a))

5133+ ?: ?=(%face -.a) !|(?=(%var -.b) ?=(%avar -.b) ?=(%rvar -.b) |(?=(%nvar -.b) ?=(%rnvar -.b)))

5134+ ?: ?=(%face -.b) !|(?=(%var -.a) ?=(%avar -.a) ?=(%rvar -.a) |(?=(%nvar -.a) ?=(%rnvar -.a)))

49125135 ?: &(?=(%cell -.a) ?=(%cell -.b)) |($(a hed.a, b hed.b) $(a tal.a, b tal.b))

49135136 ?: &(?=(%fn -.a) ?=(%fn -.b)) |($(a sample.a, b sample.b) $(a product.a, b product.b))

49145137 |

@@ -4931,6 +5154,30 @@

49315154 [%cell $(actual hed.actual, expected hed.expected) $(actual tal.actual, expected tal.expected)]

49325155 expected

49335156::

5157+:: Positional call arguments do not write the sample's enclosing field

5158+:: labels. Ignore one raw sample-slot face per written argument while

5159+:: checking value faces as usual. An unknown or variable-bound cell spine

5160+:: cannot justify this distinction, so keep the existing conservative guard.

5161+++ itype-positional-slot-face-asym

5162+ |= [actual=itype expected=itype sub=isub]

5163+ ^- ?

5164+ ?: &(?=(%fn -.actual) ?=(%fn -.expected) (itype-closed-gates-match actual expected)) |

5165+ (itype-face-asym actual expected sub)

5166+::

5167+++ itype-positional-face-asym

5168+ |= [args=(list expr) actual=itype expected=itype sub=isub]

5169+ ^- ?

5170+ ?~ args &

5171+ ?~ t.args

5172+ =/ slot=itype expected

5173+ =? slot ?=(%face -.slot) body.slot

5174+ (itype-positional-slot-face-asym actual slot sub)

5175+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) &

5176+ =/ slot=itype hed.expected

5177+ =? slot ?=(%face -.slot) body.slot

5178+ ?: (itype-positional-slot-face-asym hed.actual slot sub) &

5179+ $(args t.args, actual tal.actual, expected tal.expected)

5180+::

49345181++ itype-output-may-be-cell

49355182 |= [t=itype sub=isub]

49365183 ^- ?

@@ -4941,6 +5188,7 @@

49415188 %union &

49425189 %recursive &

49435190 %jrec &

5191+ %grec &

49445192 %noun &

49455193 %collection &

49465194 %face $(t body.t)

@@ -4970,6 +5218,7 @@

49705218 ^- ?

49715219 ?- -.t

49725220 %tag &

5221+ %grec (lien args.t |=(c=itype (itype-has-tag c)))

49735222 %collection (lien args.t |=(c=itype (itype-has-tag c)))

49745223 %face $(t body.t)

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

@@ -4983,6 +5232,7 @@

49835232 ^- ?

49845233 ?- -.t

49855234 %union &

5235+ %grec (lien args.t |=(c=itype (itype-has-union c)))

49865236 %collection (lien args.t |=(c=itype (itype-has-union c)))

49875237 %face $(t body.t)

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

@@ -5001,6 +5251,7 @@

50015251 %union

50025252 ?: &(?=(~ label.t) ?=(^ args.t)) &

50035253 (lien (weld args.t cases.t) |=(c=itype (itype-has-hidden-generic c)))

5254+ %grec |(?=(~ label.t) (lien args.t |=(c=itype (itype-has-hidden-generic c))))

50045255 %collection (lien args.t |=(c=itype (itype-has-hidden-generic c)))

50055256 %face $(t body.t)

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

@@ -5014,6 +5265,7 @@

50145265 ?- -.t

50155266 %recursive &

50165267 %jrec &

5268+ %grec &

50175269 %collection (lien args.t |=(c=itype (itype-has-recursive c)))

50185270 %union (lien (weld args.t cases.t) |=(c=itype (itype-has-recursive c)))

50195271 %face $(t body.t)

@@ -5028,6 +5280,7 @@

50285280 ?- -.t

50295281 %recursive ?=(~ label.t)

50305282 %jrec ?=(~ label.t)

5283+ %grec |(?=(~ label.t) (lien args.t |=(c=itype (itype-has-hidden-recursive c))))

50315284 %collection (lien args.t |=(c=itype (itype-has-hidden-recursive c)))

50325285 %union (lien (weld args.t cases.t) |=(c=itype (itype-has-hidden-recursive c)))

50335286 %face $(t body.t)

@@ -5055,36 +5308,85 @@

50555308 $(cases t.cases, good `trial)

50565309 ==

50575310::

5058−:: A constructor needs a case with its tag at the head and a payload

5059−:: compatible with the expected gate sample. Other case forms do not

5060−:: identify a constructor.

5311+:: A constructor needs a case whose head has the same literal noun as its

5312+:: tag. An unresolved or opaque case may reveal one later, so it cannot

5313+:: prove a mismatch or a unique match. A broad atom mold is not a case.

50615314::

50625315++ itype-fit-ctor-cases

50635316 |= [tag=lit sample=itype cases=(list itype) sub=isub next=@ud]

50645317 ^- ifit

50655318 =/ found=(unit ifit) ~

5319+ =/ pending=? |

50665320 |-

5067− ?~ cases ?~(found [%bad ~] u.found)

5068− =/ c=itype (itype-walk i.cases sub)

5321+ ?~ cases

5322+ ?: pending [%unknown ~]

5323+ ?~ found [%bad ~]

5324+ u.found

5325+ =/ raw=itype i.cases

5326+ ?: ?=(%var -.raw)

5327+ $(cases t.cases, pending &)

5328+ =/ c=itype (itype-walk raw sub)

5329+ ?: ?=(?(%var %tag %recursive %jrec %grec %union %face) -.c)

5330+ $(cases t.cases, pending &)

50695331 ?. ?=(%cell -.c) $(cases t.cases)

5070− =/ head=itype (itype-walk hed.c sub)

5332+ =/ raw-head=itype hed.c

5333+ ?: ?=(%var -.raw-head)

5334+ $(cases t.cases, pending &)

5335+ =/ head=itype (itype-walk raw-head sub)

5336+ :: A single faced, explicitly atom-only head cannot be the tag case.

5337+ :: Do not follow variables or peel nested faces for this negative proof.

5338+ ?: ?=(%face -.head)

5339+ ?: ?=(?(%atom %any-atom %flag %avar %rvar %nvar %rnvar) -.body.head)

5340+ $(cases t.cases)

5341+ $(cases t.cases, pending &)

5342+ ?: ?=(?(%var %tag %recursive %jrec %grec %union) -.head)

5343+ $(cases t.cases, pending &)

50715344 ?. ?=(%const -.head) $(cases t.cases)

5072− ?. =(%term form.literal.head) $(cases t.cases)

50735345 ?. =(val.literal.head val.tag) $(cases t.cases)

5074− ?^ found [%unknown ~]

5346+ :: Equal heads can have disjoint payloads. Test each from the original

5347+ :: substitution; a unique success is usable only with no unknown rival.

50755348 =/ trial=ifit (itype-fit sample tal.c sub next)

5076− $(cases t.cases, found `trial)

5349+ ?- -.trial

5350+ %bad $(cases t.cases)

5351+ %unknown $(cases t.cases, pending &)

5352+ %ok

5353+ ?^ found [%unknown ~]

5354+ $(cases t.cases, found `trial)

5355+ ==

50775356::

50785357++ itype-fit

50795358 |= [actual=itype expected=itype sub=isub next=@ud]

50805359 ^- ifit

5360+ =/ result=ifit (itype-fit-inner actual expected sub next | |)

5361+ ?: ?=(%ok -.result) result

5362+ =/ source=itype (itype-walk actual sub)

5363+ ?. ?=(?(%empty %face %cell %union) -.source) result

5364+ =/ empty=(unit [empty=? left=@ud]) (itype-empty-proof actual sub 256)

5365+ ?~ empty [%unknown ~]

5366+ ?: empty.u.empty [%ok sub next]

5367+ result

5368+++ itype-fit-inner

5369+ |= [actual=itype expected=itype sub=isub next=@ud skip-width=? spine-proof=?]

5370+ ^- ifit

5371+ ?: &(!skip-width ?=(%cell -.actual) ?=(%cell -.expected) |((width-spine-exhausted actual 1.024) (width-spine-exhausted expected 1.024)))

5372+ [%unknown ~]

5373+ =/ known=(unit [source=iwfields target=iwfields])

5374+ ?: skip-width ~

5375+ (width-known-shape actual expected sub)

5376+ =/ too-wide=? ?~(known | (gth (lent order.source.u.known) (lent order.target.u.known)))

5377+ ?: too-wide [%unknown ~]

5378+ =/ spine-checked=? |(spine-proof ?=(^ known))

50815379 =/ uncertain=?

5082− |(?=(%var -.actual) ?=(%avar -.actual) ?=(%nvar -.actual) ?=(%var -.expected) ?=(%avar -.expected) ?=(%nvar -.expected))

5380+ |(?=(%var -.actual) ?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)) ?=(%var -.expected) ?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected)))

50835381 =/ actual-open=?

5084− |(?=(%var -.actual) ?=(%avar -.actual) ?=(%nvar -.actual))

5382+ |(?=(%var -.actual) ?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)))

50855383 =. actual (itype-walk actual sub)

50865384 =. expected (itype-walk expected sub)

50875385 ?: =(actual expected) [%ok sub next]

5386+ ?: &(?=(%empty -.expected) |(?=(%cell -.actual) ?=(%face -.actual) ?=(%union -.actual) ?=(%grec -.actual) ?=(%recursive -.actual))) [%unknown ~]

5387+ :: The relation of the source loobean mold to explicit @f is not yet

5388+ :: established. Keep it unsupported rather than asserting a mismatch.

5389+ ?: &(?=(%flag -.actual) ?=(%atom -.expected) =(%f aura.expected)) [%unknown ~]

50885390 :: Any value can be used where a noun is expected. An unresolved

50895391 :: bare tag is fixed as a constant; a constructor still needs a gate.

50905392 ?: ?=(%noun -.expected)

@@ -5094,6 +5396,14 @@

50945396 [%ok sub next]

50955397 :: An arbitrary noun is not known to fit a narrower type.

50965398 ?: &(?=(%noun -.actual) !?=(%var -.expected)) [%unknown ~]

5399+ ?: &(!uncertain ?=(%grec -.actual) ?=(%face -.expected)) $(expected body.expected)

5400+ ?: &(!uncertain ?=(%face -.actual) ?=(%grec -.expected)) $(actual body.actual)

5401+ ?: &(?=(%grec -.actual) ?=(%grec -.expected))

5402+ ?. &(=(at.actual at.expected) =(name.actual name.expected)) [%unknown ~]

5403+ =/ matched=(unit isub) (itype-unify-args args.actual args.expected sub)

5404+ ?~ matched [%unknown ~]

5405+ [%ok u.matched next]

5406+ ?: &(|(?=(%grec -.actual) ?=(%grec -.expected)) !|(?=(%var -.actual) ?=(%var -.expected))) [%unknown ~]

50975407 ?: &(!uncertain ?=(%jrec -.actual) ?=(%face -.expected)) $(expected body.expected)

50985408 ?: &(!uncertain ?=(%face -.actual) ?=(%jrec -.expected)) $(actual body.actual)

50995409 ?: &(?=(%jrec -.actual) ?=(%jrec -.expected))

@@ -5124,7 +5434,7 @@

51245434 ?: &(!uncertain ?=(%union -.actual) ?=(%face -.expected))

51255435 $(expected body.expected)

51265436 ?: ?=(%union -.actual) [%unknown ~]

5127− ?: &(?=(%union -.expected) |(?=(%avar -.actual) ?=(%nvar -.actual))) [%unknown ~]

5437+ ?: &(?=(%union -.expected) |(?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)))) [%unknown ~]

51285438 ?: &(?=(%union -.expected) !?=(%var -.actual))

51295439 (itype-fit-cases actual cases.expected sub next)

51305440 ?: ?=(%tag -.actual)

@@ -5132,7 +5442,7 @@

51325442 =/ u=(unit isub) (itype-unify actual expected sub)

51335443 ?~ u [%bad ~]

51345444 [%ok u.u next]

5135− ?: |(?=(%avar -.expected) ?=(%nvar -.expected)) [%unknown ~]

5445+ ?: |(?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected))) [%unknown ~]

51365446 ?: ?=(%face -.expected) $(expected body.expected)

51375447 ?: constructor.actual

51385448 ?. ?=(%fn -.expected) [%bad ~]

@@ -5160,13 +5470,17 @@

51605470 =/ u=(unit isub) (itype-unify actual expected sub)

51615471 ?~ u [%bad ~]

51625472 [%ok u.u next]

5163− ?: |(?=(%avar -.expected) ?=(%nvar -.expected)) [%unknown ~]

5473+ ?: |(?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected))) [%unknown ~]

51645474 ?: ?=(%face -.expected) $(expected body.expected)

51655475 ?: &(?=(%collection -.expected) =(%list name.expected) =(0 val.literal.actual))

51665476 [%unknown ~]

51675477 ?: ?=(%const -.expected)

51685478 ?:(=(val.literal.actual val.literal.expected) [%ok sub next] [%bad ~])

51695479 ?: ?=(%atom -.expected)

5480+ :: A loobean singleton must not silently widen into another aura.

5481+ ?: =(%loobean form.literal.actual)

5482+ ?: =(%f aura.expected) [%unknown ~]

5483+ [%bad ~]

51705484 ?: |(=(%tas aura.expected) =(%ta aura.expected)) [%ok sub next]

51715485 [%bad ~]

51725486 ?: ?=(%flag -.expected)

@@ -5174,8 +5488,14 @@

51745488 ?: ?=(%any-atom -.expected) [%ok sub next]

51755489 [%bad ~]

51765490 ?: &(uncertain (itype-face-asym actual expected sub)) [%unknown ~]

5491+ :: A known face labels the same noun. Peel it before applying the

5492+ :: directional unrestricted-atom rule, preserving raw-variable guards.

5493+ ?: &(!uncertain ?=(%any-atom -.actual) ?=(%face -.expected))

5494+ $(expected body.expected, skip-width |, spine-proof |)

5495+ ?: &(!uncertain ?=(%any-atom -.expected) ?=(%face -.actual))

5496+ $(actual body.actual, skip-width |, spine-proof |)

51775497 ?: ?=(%any-atom -.expected)

5178− ?: |(?=(%atom -.actual) ?=(%avar -.actual) ?=(%nvar -.actual) ?=(%flag -.actual)) [%ok sub next]

5498+ ?: |(?=(%atom -.actual) ?=(%avar -.actual) ?=(%rvar -.actual) |(?=(%nvar -.actual) ?=(%rnvar -.actual)) ?=(%flag -.actual)) [%ok sub next]

51795499 ?: ?=(%var -.actual)

51805500 =/ unified=(unit isub) (itype-unify actual [%avar next] sub)

51815501 ?~ unified [%bad ~]

@@ -5186,16 +5506,16 @@

51865506 =/ unified=(unit isub) (itype-unify actual expected sub)

51875507 ?~ unified [%bad ~]

51885508 [%ok u.unified next]

5189− ?: |(?=(%avar -.expected) ?=(%nvar -.expected)) [%unknown ~]

5509+ ?: |(?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected))) [%unknown ~]

51905510 [%bad ~]

51915511 ?: &(?=(%atom -.actual) ?=(%atom -.expected))

51925512 ?: (aura-prefix aura.expected aura.actual) [%ok sub next]

51935513 ?: &((aura-prefix aura.actual aura.expected) uncertain) [%unknown ~]

51945514 [%bad ~]

51955515 ?: &(?=(%cell -.actual) ?=(%cell -.expected))

5196− =/ first=ifit $(actual hed.actual, expected hed.expected)

5516+ =/ first=ifit $(actual hed.actual, expected hed.expected, skip-width |, spine-proof |)

51975517 ?. ?=(%ok -.first) first

5198− $(actual tal.actual, expected tal.expected, sub sub.first, next next.first)

5518+ $(actual tal.actual, expected tal.expected, sub sub.first, next next.first, skip-width spine-checked, spine-proof spine-checked)

51995519 :: A field may add a face to an occurrence of the very same type

52005520 :: variable. Binding that variable to a face around itself would fail

52015521 :: the occurs check, but its underlying type has already matched.

@@ -5217,9 +5537,10 @@

52175537 [%ok u.unified next]

52185538 ?: &(?=(%face -.actual) ?=(%face -.expected))

52195539 ?. =(name.actual name.expected) [%bad ~]

5220− $(actual body.actual, expected body.expected)

5221− ?: ?=(%face -.actual) $(actual body.actual)

5222− ?: ?=(%face -.expected) $(expected body.expected)

5540+ $(actual body.actual, expected body.expected, skip-width |, spine-proof |)

5541+ ?: ?=(%face -.actual) $(actual body.actual, skip-width |, spine-proof |)

5542+ ?: ?=(%face -.expected) $(expected body.expected, skip-width |, spine-proof |)

5543+ ?: &(!uncertain (itype-closed-gates-match actual expected)) [%ok sub next]

52235544 ?: (itype-face-asym actual expected sub) [%unknown ~]

52245545 ?: |((itype-has-any-atom actual sub) (itype-has-any-atom expected sub))

52255546 [%unknown ~]

@@ -5296,7 +5617,17 @@

52965617+$ ienv (list [name=term scheme=ischeme])

52975618+$ imold-types (list [name=term template=ischeme])

52985619+$ iderived [name=term agent=term mark=term]

5299−+$ ifile [values=ienv molds=imold-types at=path derived=(list iderived)]

5620++$ iwidth-definition [name=term original=expr typ=itype sub=isub projections=(list iwprojection)]

5621++$ iwidth-dependency [at=path source=(unit @t) definitions=(list iwidth-definition)]

5622+:: Nonrecursive request evidence is compiler-owned metadata, not a property

5623+:: of an arbitrary ask value. Reader graphs and source inputs are trusted.

5624++$ irequest-evidence

5625+ [api-at=path name=term path=iapi-path-typed api-source=@t public-source=@t internal-source=@t prelude-values=(list term) prelude-molds=(list term) externals=iexternals marks=imark-externals]

5626+:: A unit distinguishes a verified empty closure from a detached legacy file.

5627+:: The opaque prelude is an exact trusted input, not a recursive interface mold.

5628++$ irequest-graph

5629+ [paths=(set path) requests=(list irequest-evidence) bundle-input=* prelude-input=* prelude-values=(list term) prelude-molds=(list term) externals=iexternals marks=imark-externals]

5630++$ ifile [values=ienv molds=imold-types at=path derived=(list iderived) elaborations=(list iwidth-definition) dependencies=(list iwidth-dependency) source=(unit @t) graph=(unit irequest-graph)]

53005631+$ ijimports (list [face=term interface=ifile])

53015632+$ icap [name=@t id=@ud at=span]

53025633+$ icaps (list icap)

@@ -5312,7 +5643,164 @@

53125643:: Recursive-mold unfolding spends fuel in the threaded inference state.

53135644:: Retries can restart from an earlier state, so this bounds an attempt,

53145645:: not all parsing or module-checking work.

5315−+$ 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]

5646+:: Experimental: only closed, uniquely faced records have known axes.

5647++$ iwfield [name=term axis=@ud typ=itype]

5648++$ iwfields [order=(list iwfield) index=(map term iwfield)]

5649++$ iwstep [name=term axis=@ud]

5650++$ iwidth-result [steps=(list iwstep) sub=isub next=@ud]

5651++$ iwprojection [at=span original=expr source=itype target=itype steps=(list iwstep)]

5652+++ width-scan

5653+ |= [typ=itype sub=isub axis=@ud fuel=@ud]

5654+ ^- (unit iwfields)

5655+ =/ order=(list iwfield) ~

5656+ =/ index=(map term iwfield) *(map term iwfield)

5657+ |-

5658+ ?: =(0 fuel) ~

5659+ ?: |(?=(%var -.typ) ?=(%avar -.typ) ?=(%rvar -.typ) ?=(%nvar -.typ) ?=(%rnvar -.typ)) ~

5660+ ?: ?=(%face -.typ)

5661+ =/ entry=iwfield [name.typ axis body.typ]

5662+ ?: ?=(^ (~(get by index) name.entry)) ~

5663+ `[(flop [entry order]) (~(put by index) name.entry entry)]

5664+ ?. ?=(%cell -.typ) ~

5665+ =/ head=itype hed.typ

5666+ ?: |(?=(%var -.head) ?=(%avar -.head) ?=(%rvar -.head) ?=(%nvar -.head) ?=(%rnvar -.head)) ~

5667+ ?. ?=(%face -.head) ~

5668+ =/ entry=iwfield [name.head (mul 2 axis) body.head]

5669+ ?: ?=(^ (~(get by index) name.entry)) ~

5670+ $(typ tal.typ, axis +((mul 2 axis)), fuel (dec fuel), order [entry order], index (~(put by index) name.entry entry))

5671+++ width-in-order

5672+ |= [source=(list iwfield) target=(list iwfield)]

5673+ ^- ?

5674+ ?~ target &

5675+ ?~ source |

5676+ ?: =(name.i.source name.i.target) $(source t.source, target t.target)

5677+ $(source t.source)

5678+++ width-fit-fields

5679+ |= [source=(map term iwfield) target=(list iwfield) sub=isub next=@ud]

5680+ ^- (unit iwidth-result)

5681+ ?~ target `[~ sub next]

5682+ =/ found=(unit iwfield) (~(get by source) name.i.target)

5683+ ?~ found ~

5684+ =/ fit=ifit (itype-fit typ.u.found typ.i.target sub next)

5685+ ?. ?=(%ok -.fit) ~

5686+ =/ rest=(unit iwidth-result) $(target t.target, sub sub.fit, next next.fit)

5687+ ?~ rest ~

5688+ `[[[name.i.target axis.u.found] steps.u.rest] sub.u.rest next.u.rest]

5689+++ width-spine-exhausted

5690+ |= [t=itype fuel=@ud]

5691+ ^- ?

5692+ ?: =(0 fuel) &

5693+ ?. ?=(%cell -.t) |

5694+ ?. ?=(%face -.hed.t) |

5695+ $(t tal.t, fuel (dec fuel))

5696+++ width-known-shape

5697+ |= [actual=itype expected=itype sub=isub]

5698+ ^- (unit [source=iwfields target=iwfields])

5699+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

5700+ =/ source=(unit iwfields) (width-scan actual sub 1 1.024)

5701+ =/ target=(unit iwfields) (width-scan expected sub 1 1.024)

5702+ ?~ source ~

5703+ ?~ target ~

5704+ `[u.source u.target]

5705+::

5706+++ width-shape

5707+ |= [actual=itype expected=itype sub=isub]

5708+ ^- (unit [source=iwfields target=iwfields])

5709+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

5710+ =/ source=(unit iwfields) (width-scan actual sub 1 4.096)

5711+ =/ target=(unit iwfields) (width-scan expected sub 1 4.096)

5712+ ?~ source ~

5713+ ?~ target ~

5714+ ?. (gth (lent order.u.source) (lent order.u.target)) ~

5715+ `[u.source u.target]

5716+++ width-proj-shape

5717+ |= [actual=itype expected=itype sub=isub]

5718+ ^- (unit [source=iwfields target=iwfields])

5719+ ?. &(|(?=(%cell -.actual) ?=(%face -.actual)) |(?=(%cell -.expected) ?=(%face -.expected))) ~

5720+ =/ source=(unit iwfields) (width-scan actual sub 1 4.096)

5721+ =/ target=(unit iwfields) (width-scan expected sub 1 4.096)

5722+ ?~ source ~

5723+ ?~ target ~

5724+ ?: (lth (lent order.u.source) (lent order.u.target)) ~

5725+ `[u.source u.target]

5726+::

5727+++ width-project

5728+ |= [shape=[source=iwfields target=iwfields] sub=isub next=@ud]

5729+ ^- (unit iwidth-result)

5730+ ?. (width-in-order order.source.shape order.target.shape) ~

5731+ (width-fit-fields index.source.shape order.target.shape sub next)

5732+::

5733+:: Provisional, globally budgeted gate-free proof. %no includes a

5734+:: gate-bearing witness; an uninhabited sibling could invalidate it.

5735+:: Input types must be resolved and normalized under valid substitutions,

5736+:: from trusted source-backed interfaces and reader results. Collection

5737+:: list/unit names rely on their existing identity invariant; this arm

5738+:: does not validate fabricated internal types.

5739++$ igf-segment

5740+ $% [%field name=term]

5741+ [%head ~]

5742+ [%tail ~]

5743+ [%item ~]

5744+ [%case index=@ud]

5745+ ==

5746++$ igate-free [verdict=?(%yes %no %unknown) inhabited=? left=@ud path=(unit (list igf-segment))]

5747+++ gate-free-types

5748+ |= [types=(list itype) fuel=@ud path=(list igf-segment) index=@ud]

5749+ ^- igate-free

5750+ ?~ types [%yes | fuel ~]

5751+ ?: =(0 fuel) [%unknown | 0 ~]

5752+ =/ first=igate-free (gate-free-type i.types fuel [[%case index] path])

5753+ ?: =(%no verdict.first) first

5754+ =/ rest=igate-free $(types t.types, fuel left.first, index +(index))

5755+ ?: =(%no verdict.rest) rest

5756+ =/ inhabited=? |(inhabited.first inhabited.rest)

5757+ ?: |(=(%unknown verdict.first) =(%unknown verdict.rest)) [%unknown inhabited left.rest ~]

5758+ [%yes inhabited left.rest ~]

5759+++ gate-free-type

5760+ |= [typ=itype fuel=@ud path=(list igf-segment)]

5761+ ^- igate-free

5762+ ?: =(0 fuel) [%unknown | 0 ~]

5763+ =. fuel (dec fuel)

5764+ ?- -.typ

5765+ %fn [%no & fuel `(flop path)]

5766+ %atom [%yes & fuel ~]

5767+ %any-atom [%yes & fuel ~]

5768+ %flag [%yes & fuel ~]

5769+ %const [%yes & fuel ~]

5770+ %face $(typ body.typ, path [[%field name.typ] path])

5771+ %cell

5772+ =/ head=igate-free $(typ hed.typ, path [[%head ~] path])

5773+ =/ tail=igate-free $(typ tal.typ, fuel left.head, path [[%tail ~] path])

5774+ =/ inhabited=? &(inhabited.head inhabited.tail)

5775+ ?: |(&(=(%yes verdict.head) !inhabited.head) &(=(%yes verdict.tail) !inhabited.tail)) [%yes | left.tail ~]

5776+ ?: &(=(%no verdict.head) inhabited.tail) head(left left.tail)

5777+ ?: &(=(%no verdict.tail) inhabited.head) tail

5778+ ?: |(!=(%yes verdict.head) !=(%yes verdict.tail)) [%unknown inhabited left.tail ~]

5779+ [%yes inhabited left.tail ~]

5780+ %collection

5781+ ?. |(=(%list name.typ) =(%unit name.typ)) [%unknown | fuel ~]

5782+ ?. ?=([* ~] args.typ) [%unknown | fuel ~]

5783+ =/ item=igate-free $(typ i.args.typ, path [[%item ~] path])

5784+ item(inhabited &)

5785+ %union

5786+ ?~ cases.typ [%unknown | fuel ~]

5787+ (gate-free-types cases.typ fuel path 0)

5788+ %noun [%unknown & fuel ~]

5789+ %empty [%yes | fuel ~]

5790+ %var [%unknown | fuel ~]

5791+ %avar [%yes & fuel ~]

5792+ %rvar [%yes & fuel ~]

5793+ %nvar [%yes & fuel ~]

5794+ %rnvar [%yes & fuel ~]

5795+ %tag [%unknown | fuel ~]

5796+ %recursive [%unknown | fuel ~]

5797+ %jrec [%yes & fuel ~]

5798+ %grec [%unknown | fuel ~]

5799+ ==

5800+::

5801++$ igate-prelude-evidence [iface=ifile gates=(map term def)]

5802++$ dgo [left=itype right=itype at=span context=span]

5803++$ istate [next=@ud sub=isub caps=icaps binders=(list @ud) molds=imolds globals=(list term) externals=iexternals surs=(list term) mark-externals=imark-externals marks=(list term) jimports=ijimports reserved-molds=(list term) params=iparams active=(list term) tags=(list ipending) in-mold=? at=path top-molds=(list term) prelude=(unit ifile) holes=(list ihole) jrec-fuel=@ud projections=(list iwprojection) gate-defs=(map term def) head-evidence=(unit igate-prelude-evidence) grec-index=(unit [at=path source=@t prelude=ifile shapes=(map term shape)]) defer=(unit ~) obligations=(list dgo)]

53165804+$ idiag [msg=tape sites=(list [at=span note=tape])]

53175805+$ iresult (each [typ=itype state=istate] idiag)

53185806+$ isample-result (each [typ=itype env=ienv state=istate] tape)

@@ -5332,6 +5820,7 @@

53325820 |= [t=itype sub=isub]

53335821 ^- itype

53345822 =. t (itype-walk t sub)

5823+ ?: ?=(%grec -.t) t(args (turn args.t |=(c=itype (itype-normalize c sub))))

53355824 ?: ?=(%collection -.t) [%collection name.t (turn args.t |=(c=itype (itype-normalize c sub)))]

53365825 ?: ?=(%union -.t)

53375826 [%union (turn cases.t |=(c=itype (itype-normalize c sub))) origin.t label.t (turn args.t |=(c=itype (itype-normalize c sub)))]

@@ -5358,6 +5847,7 @@

53585847 %cell |($(t hed.t) $(t tal.t))

53595848 %recursive |

53605849 %jrec |

5850+ %grec &

53615851 %collection (lien args.t |=(c=itype (itype-has-gate c)))

53625852 %face $(t body.t)

53635853 %union (lien cases.t |=(c=itype (itype-has-gate c)))

@@ -5365,11 +5855,14 @@

53655855 %const |

53665856 %var |

53675857 %avar |

5858+ %rvar |

53685859 %nvar |

5860+ %rnvar |

53695861 %atom |

53705862 %any-atom |

53715863 %flag |

53725864 %noun |

5865+ %empty |

53735866 ==

53745867::

53755868++ default-decimals

@@ -5378,6 +5871,8 @@

53785871 ?: (itype-has-gate t) t

53795872 ?- -.t

53805873 %nvar [%atom %ud]

5874+ %rnvar [%atom %ud]

5875+ %grec t(args (turn args.t |=(c=itype (default-decimals c))))

53815876 %collection [%collection name.t (turn args.t |=(c=itype (default-decimals c)))]

53825877 %face [%face name.t $(t body.t)]

53835878 %cell [%cell $(t hed.t) $(t tal.t)]

@@ -5394,7 +5889,9 @@

53945889 ?- -.t

53955890 %var `id.t

53965891 %avar `id.t

5892+ %rvar `id.t

53975893 %nvar `id.t

5894+ %rnvar `id.t

53985895 %tag `id.t

53995896 * ~

54005897 ==

@@ -5411,18 +5908,33 @@

54115908 ^- ?

54125909 =. t (itype-walk t sub.state)

54135910 ?- -.t

5414− ?(%var %avar %nvar)

5911+ ?(%var %avar %rvar %nvar %rnvar)

54155912 ?: (lien caps.state |=(c=icap (hole-same-variable t (itype-walk [%var id.c] sub.state)))) &

54165913 (lien params.state |=(p=[name=@t typ=itype] (hole-same-variable t (itype-walk typ.p sub.state))))

54175914 %tag |

54185915 %any-atom &

54195916 %union &((levy cases.t |=(c=itype (hole-known c state))) (levy args.t |=(c=itype (hole-known c state))))

5917+ %grec (levy args.t |=(c=itype (hole-known c state)))

54205918 %collection (levy args.t |=(c=itype (hole-known c state)))

54215919 %face $(t body.t)

54225920 %fn &($(t sample.t) $(t product.t))

54235921 %cell &($(t hed.t) $(t tal.t))

54245922 * &

54255923 ==

5924+++ promote-restricted-numbers

5925+ |= [state=istate env=ienv]

5926+ ^- istate

5927+ :: With no written capitals, there is nothing to promote.

5928+ ?~ caps.state state

5929+ =/ ids=(list @ud) (turn caps.state |=(c=icap id.c))

5930+ =/ free=(list @ud) (free-env-vars env sub.state)

5931+ |-

5932+ ?~ ids state

5933+ =/ t=itype (itype-walk [%var i.ids] sub.state)

5934+ ?: &(?=(%rnvar -.t) !(lien free |=(n=@ud =(n +.t))))

5935+ $(ids t.ids, state state(sub [[+.t [%rvar +.t]] sub.state]))

5936+ $(ids t.ids)

5937+::

54265938++ default-hole-numbers

54275939 |= [all=(list ihole) prior=(list ihole) state=istate env=ienv permit=?]

54285940 ^- istate

@@ -5432,7 +5944,7 @@

54325944 ?~ all state

54335945 =/ t=itype (itype-walk [%var id.i.all] sub.state)

54345946 =/ free=(list @ud) (free-env-vars env sub.state)

5435− =? state &(?=(%nvar -.t) !(hole-known t state) !(lien free |=(id=@ud =(id id.t))))

5947+ =? state &(?=(?(%nvar %rnvar) -.t) !(hole-known t state) !(lien free |=(id=@ud =(id id.t))))

54365948 state(sub [[id.t [%atom %ud]] sub.state])

54375949 $(all t.all)

54385950::

@@ -5448,8 +5960,9 @@

54485960 ^- ?

54495961 =. t (itype-walk t sub.state)

54505962 ?- -.t

5451− ?(%tag %nvar %avar) !(hole-known t state)

5963+ ?(%tag %nvar %rnvar %avar %rvar) !(hole-known t state)

54525964 %union |((lien cases.t |=(c=itype (hole-uncertain c state))) (lien args.t |=(c=itype (hole-uncertain c state))))

5965+ %grec (lien args.t |=(c=itype (hole-uncertain c state)))

54535966 %collection (lien args.t |=(c=itype (hole-uncertain c state)))

54545967 %face $(t body.t)

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

@@ -5474,16 +5987,20 @@

54745987 ?- -.t

54755988 %var ~[id.t]

54765989 %avar ~[id.t]

5990+ %rvar ~[id.t]

54775991 %nvar ~[id.t]

5992+ %rnvar ~[id.t]

54785993 %atom ~

54795994 %any-atom ~

54805995 %flag ~

54815996 %noun ~

5997+ %empty ~

54825998 %tag ~

54835999 %const ~

54846000 %union (zing (turn (weld args.t cases.t) |=(c=itype (itype-vars c))))

54856001 %recursive ~

54866002 %jrec ~

6003+ %grec (zing (turn args.t |=(c=itype (itype-vars c))))

54876004 %collection (zing (turn args.t |=(c=itype (itype-vars c))))

54886005 %face $(t body.t)

54896006 %fn (weld $(t sample.t) $(t product.t))

@@ -5511,19 +6028,29 @@

55116028 =/ found=(unit itype) (itype-lookup id.t ren)

55126029 ?~ found t

55136030 u.found

6031+ %rvar

6032+ =/ found=(unit itype) (itype-lookup id.t ren)

6033+ ?~ found t

6034+ u.found

55146035 %nvar

55156036 =/ found=(unit itype) (itype-lookup id.t ren)

55166037 ?~ found t

55176038 u.found

6039+ %rnvar

6040+ =/ found=(unit itype) (itype-lookup id.t ren)

6041+ ?~ found t

6042+ u.found

55186043 %atom t

55196044 %any-atom t

55206045 %flag t

55216046 %noun t

6047+ %empty t

55226048 %tag t

55236049 %const t

55246050 %union [%union (turn cases.t |=(c=itype (itype-rename c ren))) origin.t label.t (turn args.t |=(c=itype (itype-rename c ren)))]

55256051 %recursive t

55266052 %jrec t

6053+ %grec t(args (turn args.t |=(c=itype (itype-rename c ren))))

55276054 %collection [%collection name.t (turn args.t |=(c=itype (itype-rename c ren)))]

55286055 %face [%face name.t $(t body.t)]

55296056 %fn [%fn $(t sample.t) $(t product.t)]

@@ -5539,21 +6066,50 @@

55396066 ?- -.t

55406067 %var |

55416068 %avar =(n id.t)

6069+ %rvar =(n id.t)

55426070 %nvar =(n id.t)

6071+ %rnvar =(n id.t)

55436072 %atom |

55446073 %any-atom |

55456074 %flag |

55466075 %noun |

6076+ %empty |

55476077 %tag |

55486078 %const |

55496079 %union |((lien cases.t |=(c=itype (itype-var-is-atom n c))) (lien args.t |=(c=itype (itype-var-is-atom n c))))

55506080 %recursive |

55516081 %jrec |

6082+ %grec (lien args.t |=(c=itype (itype-var-is-atom n c)))

55526083 %collection (lien args.t |=(c=itype (itype-var-is-atom n c)))

55536084 %face $(t body.t)

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

55556086 %cell |($(t hed.t) $(t tal.t))

55566087 ==

6088+++ itype-var-is-restricted

6089+ |= [n=@ud t=itype]

6090+ ^- ?

6091+ ?- -.t

6092+ %var |

6093+ %avar |

6094+ %rvar =(n id.t)

6095+ %nvar |

6096+ %rnvar |

6097+ %atom |

6098+ %any-atom |

6099+ %flag |

6100+ %noun |

6101+ %empty |

6102+ %tag |

6103+ %const |

6104+ %union |((lien cases.t |=(c=itype (itype-var-is-restricted n c))) (lien args.t |=(c=itype (itype-var-is-restricted n c))))

6105+ %recursive |

6106+ %jrec |

6107+ %grec (lien args.t |=(c=itype (itype-var-is-restricted n c)))

6108+ %collection (lien args.t |=(c=itype (itype-var-is-restricted n c)))

6109+ %face $(t body.t)

6110+ %fn |($(t sample.t) $(t product.t))

6111+ %cell |($(t hed.t) $(t tal.t))

6112+ ==

55576113::

55586114:: Canonical numbering makes printed variables independent of the order

55596115:: the unifier happened to allocate intermediates.

@@ -5565,7 +6121,7 @@

55656121 =/ n=@ud 0

55666122 |-

55676123 ?~ vars (itype-rename t ren)

5568− =/ replacement=itype ?:((itype-var-is-atom i.vars t) [%avar n] [%var n])

6124+ =/ replacement=itype ?:((itype-var-is-restricted i.vars t) [%rvar n] ?:((itype-var-is-atom i.vars t) [%avar n] [%var n]))

55696125 $(vars t.vars, ren [[i.vars replacement] ren], n +(n))

55706126::

55716127++ instantiate-scheme

@@ -5576,11 +6132,11 @@

55766132 |-

55776133 ?~ vars [(itype-rename typ.scheme ren) state]

55786134 =/ replacement=itype

5579− ?:((itype-var-is-atom i.vars typ.scheme) [%avar next.state] [%var next.state])

6135+ ?:((itype-var-is-restricted i.vars typ.scheme) [%rvar next.state] ?:((itype-var-is-atom i.vars typ.scheme) [%avar next.state] [%var next.state]))

55806136 :: A generalized atom variable is a valid origin for re-generalizing

55816137 :: an alias, just as a sample binder is.

55826138 =/ st=istate state(next +(next.state))

5583− =? binders.st ?=(%avar -.replacement) [next.state binders.state]

6139+ =? binders.st |(?=(%avar -.replacement) ?=(%rvar -.replacement)) [next.state binders.state]

55846140 $(vars t.vars, ren [[i.vars replacement] ren], state st)

55856141::

55866142++ icap-lookup

@@ -5845,6 +6401,7 @@

58456401 ^- upat

58466402 ?- -.typ

58476403 %noun [%all ~]

6404+ %empty [%empty ~]

58486405 %atom [%atom ~]

58496406 %flag [%or ~[[%atom `0] [%atom `1]]]

58506407 %const [%atom `val.literal.typ]

@@ -5941,16 +6498,31 @@

59416498 ?:(=(`origin origin.typ.template) `name.i.molds $(molds t.molds))

59426499 $(molds t.molds)

59436500::

5944−:: A public non-generic alias names exactly its origin and arguments.

5945−:: Reusing only an origin could print a different generic instantiation.

6501+:: A prelude union alias is a display name, not a new union identity. An

6502+:: identity-generic alias can carry the origin's arguments only when the

6503+:: origin, arity and ordered parameters match. Swapped, repeated, fixed

6504+:: or phantom parameters cannot be printed that way and remain unsupported

6505+:: when their only available name is private. A nongeneric alias of a

6506+:: generic instantiation cannot be printed with the origin's arguments.

6507+++ identity-union-parameters

6508+ |= [vars=(list @ud) args=(list itype)]

6509+ ^- ?

6510+ ?~ vars ?=(~ args)

6511+ ?~ args |

6512+ ?. =([%var i.vars] i.args) |

6513+ $(vars t.vars, args t.args)

59466514++ prelude-union-alias

59476515 |= [origin=[at=path name=term] args=(list itype) molds=imold-types]

59486516 ^- (unit term)

5949− ?^ args ~

59506517 ?~ molds ~

59516518 =/ template=ischeme template.i.molds

5952− ?: &(?=(~ vars.template) ?=(%union -.typ.template))

5953− ?:(&(=(`origin origin.typ.template) =(args args.typ.template)) `name.i.molds $(molds t.molds))

6519+ ?. ?=(%union -.typ.template) $(molds t.molds)

6520+ ?. =(`origin origin.typ.template) $(molds t.molds)

6521+ ?~ vars.template

6522+ ?^ args $(molds t.molds)

6523+ ?:(=(args args.typ.template) `name.i.molds $(molds t.molds))

6524+ ?: &((identity-union-parameters vars.template args.typ.template) =((lent vars.template) (lent args)))

6525+ `name.i.molds

59546526 $(molds t.molds)

59556527::

59566528:: Names exported by the directly imported module are visible through its

@@ -5964,6 +6536,16 @@

59646536 ?: &(?=(~ vars.template) ?=(%jrec -.typ.template) =(at.typ.template origin) =(name.typ.template name)) `name.i.molds

59656537 $(molds t.molds)

59666538::

6539+++ grec-visible-alias

6540+ |= [origin=path name=term proof=shape args=(list itype) molds=imold-types]

6541+ ^- (unit term)

6542+ ?~ molds ~

6543+ =/ template=ischeme template.i.molds

6544+ ?. ?=(%grec -.typ.template) $(molds t.molds)

6545+ ?. &(=(at.typ.template origin) =(name.typ.template name) =(proof.typ.template proof)) $(molds t.molds)

6546+ ?. &((identity-union-parameters vars.template args.typ.template) =((lent vars.template) (lent args))) $(molds t.molds)

6547+ `name.i.molds

6548+::

59676549++ itype-in-import

59686550 |= [t=itype iface=ifile face=term prelude=(unit ifile)]

59696551 ^- itype

@@ -5983,6 +6565,11 @@

59836565 `(crip "{(trip u.alias)}.{(trip face)}")

59846566 [%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)))]

59856567 %recursive [%recursive module.t name.t ~]

6568+ %grec

6569+ =/ public=(unit term) ?~(prelude ~ (grec-visible-alias at.t name.t proof.t args.t molds.u.prelude))

6570+ =/ alias=(unit term) ?~(public (grec-visible-alias at.t name.t proof.t args.t molds.iface) public)

6571+ =/ label=(unit @t) ?~(alias ~ ?~(public `(crip "{(trip u.alias)}.{(trip face)}") `u.alias))

6572+ t(label label, args (turn args.t |=(c=itype (itype-in-import c iface face prelude))))

59866573 %jrec

59876574 =/ public=(unit term) ?~(prelude ~ (jrec-alias at.t name.t molds.u.prelude))

59886575 ?^ public t(label `u.public)

@@ -6095,9 +6682,29 @@

60956682 ?. =(names.tail ~[name]) ~

60966683 `[%jrec at.state name `name name.i.fs aura.shape.i.fs name.i.t.fs]

60976684::

6685+++ simple-source-generic-recursive

6686+ |= [name=term sh=shape args=(list itype) state=istate]

6687+ ^- (unit itype)

6688+ ?. ?=(%generic -.sh) ~

6689+ ?. ?=([@ ~] vars.sh) ~

6690+ ?. ?=([* ~] args) ~

6691+ ?~ grec-index.state ~

6692+ ?. =(at.u.grec-index.state at.state) ~

6693+ ?~ prelude.state ~

6694+ ?. =(prelude.u.grec-index.state u.prelude.state) ~

6695+ =/ proof=(unit shape) (~(get by shapes.u.grec-index.state) name)

6696+ ?~ proof ~

6697+ ?. =(u.proof sh) ~

6698+ `[%grec at.state name `name sh args]

6699+::

6700+

60986701++ infer-mold-template

60996702 |= [sh=shape state=istate]

61006703 ^- (unit [template=ischeme state=istate])

6704+ =/ generic=(unit itype)

6705+ ?. ?=([@ ~] active.state) ~

6706+ (simple-source-generic-recursive i.active.state sh ~[[%var next.state]] state)

6707+ ?^ generic `[[u.generic ~[next.state]] state(next +(next.state))]

61016708 =/ direct=(unit itype)

61026709 ?. ?=([@ ~] active.state) ~

61036710 (simple-source-recursive i.active.state sh state)

@@ -6155,7 +6762,7 @@

61556762 ?~ found ~

61566763 ?^ t.found ~

61576764 result.i.found

6158− ?. ?=([%invalid ?(%aura %core) @] raw) ~

6765+ ?. ?=([%invalid ?(%aura %core %overlap) @] raw) ~

61596766 `["{(trip +>.raw)}" ~[[at.sh "invalid imported mold"]]]

61606767::

61616768:: Replay only the shape branches whose evaluation order we can prove.

@@ -6230,12 +6837,18 @@

62306837 `[[%atom aura.sh] state]

62316838 %flag `[[%flag ~] state]

62326839 %noun `[[%noun ~] state]

6840+ %void `[[%empty ~] state]

62336841 %const

6234− ?. |(=(%term form.lit.sh) =(%null form.lit.sh)) ~

6842+ ?. |(=(%term form.lit.sh) =(%null form.lit.sh) =(%loobean form.lit.sh)) ~

6843+ ?: &(=(%loobean form.lit.sh) !|(=(0 val.lit.sh) =(1 val.lit.sh))) ~

62356844 `[[%const lit.sh] state]

62366845 %union

62376846 =/ pairs=(list upair) (union-pairs cases.sh molds.state)

6238− ?. (levy pairs |=(p=upair =(%disjoint relation.p))) ~

6847+ ?: (lien pairs |=(p=upair =(%overlap relation.p))) ~

6848+ =/ source-proof=?

6849+ ?: (levy pairs |=(p=upair =(%disjoint relation.p))) &

6850+ &((union-source-state-safe state 256) (union-source-distinct-tags cases.sh molds.state 256))

6851+ ?. source-proof ~

62396852 =/ cs=(unit [types=(list itype) state=istate]) (infer-shape-args cases.sh state)

62406853 ?~ cs ~

62416854 `[[%union types.u.cs ~ ~ ~] state.u.cs]

@@ -6309,6 +6922,8 @@

63096922 ?~ applied ~

63106923 `[u.applied state.u.args]

63116924 ?. ?=(%generic -.u.found) ~

6925+ =/ grec=(unit itype) (simple-source-generic-recursive n u.found types.u.args state.u.args)

6926+ ?^ grec `[u.grec state.u.args]

63126927 ?. (distinct-params vars.u.found) ~

63136928 =/ params=(unit iparams) (bind-params vars.u.found types.u.args)

63146929 ?~ params ~

@@ -6360,12 +6975,12 @@

63606975 ^- isample-result

63616976 ?- -.s

63626977 %bind

6363− ?: |(?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

6978+ ?: |(=(name.s %proj) ?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

63646979 [%| "sample shadows a name"]

63656980 =/ t=itype [%var next.state]

63666981 [%& t [[name.s [t ~]] env] state(next +(next.state), binders [next.state binders.state])]

63676982 %face

6368− ?: |(?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

6983+ ?: |(=(name.s %proj) ?=(^ (ienv-lookup name.s env)) (lien globals.state |=(x=term =(x name.s))))

63696984 [%| "sample shadows a name"]

63706985 =/ t=(unit [typ=itype state=istate]) (infer-simple-shape shape.s state)

63716986 ?~ t [%| "sample mold is not supported by partial inference"]

@@ -6433,6 +7048,7 @@

64337048 |-

64347049 ?~ ds &

64357050 ?: ?=(%mold -.i.ds) $(ds t.ds)

7051+ ?: =(name.i.ds %proj) |

64367052 ?. (unique-value-name name.i.ds names) |

64377053 ?: ?=(^ (ienv-lookup name.i.ds env)) |

64387054 ?: (lien globals.state |=(n=term =(n name.i.ds))) |

@@ -6456,6 +7072,7 @@

64567072 |-

64577073 ?~ locals &

64587074 =/ n=term name.i.locals

7075+ ?: =(n %proj) |

64597076 ?. (unique-value-name n names) |

64607077 ?: (lien molds.state |=(m=[name=term body=shape] =(n name.m))) |

64617078 ?: (lien marks.state |=(m=term =(n m))) |

@@ -6635,6 +7252,8 @@

66357252 =/ retried=? ?=(%| -.inferred)

66367253 =? inferred retried (infer-recursive-gate d env local-state)

66377254 ?: ?=(%| -.inferred) $(ds t.ds, remaining [d remaining])

7255+ ?: !=(obligations.state.p.inferred obligations.state) [%| ["deferred local definition needs unsupported inference" ~]]

7256+ =. state.p.inferred (promote-restricted-numbers state.p.inferred env)

66387257 =. 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)))

66397258 =/ hole=(unit idiag) (unresolved-hole holes.state.p.inferred holes.state state.p.inferred)

66407259 ?^ hole [%| u.hole]

@@ -6743,6 +7362,8 @@

67437362 ?: &(?=(%collection -.expected) =(%list name.expected) (context-list-expression e))

67447363 (infer-list-context e expected env state context)

67457364 ?: ?=(%branch -.e)

7365+ =/ empty-list=(unit iresult) (empty-list-null-branch e env state `[expected context])

7366+ ?^ empty-list u.empty-list

67467367 ?~ arms.e [%| ["branch is not supported by partial inference" ~]]

67477368 ?~ t.arms.e [%| ["branch pattern is not supported by partial inference" ~]]

67487369 ?^ t.t.arms.e [%| ["branch is not supported by partial inference" ~]]

@@ -6960,6 +7581,11 @@

69607581 [%| ["list pattern needs the standard prelude in partial inference" ~]]

69617582 ?~ args.typ [%| ["list pattern is not supported by partial inference" ~]]

69627583 ?^ t.args.typ [%| ["list pattern is not supported by partial inference" ~]]

7584+ =/ item-live=(unit [result=?(%yes %no %unknown) left=@ud])

7585+ (itype-inhabited-proof i.args.typ sub.state caps.state 256)

7586+ ?~ item-live [%| ["list element reachability needs unsupported inference" ~]]

7587+ ?: =(%unknown result.u.item-live) [%| ["list element reachability needs unsupported inference" ~]]

7588+ ?: =(%no result.u.item-live) [%| ["list nonempty pattern is unreachable" ~]]

69637589 ?~ arms.e [%| ["list branch is not supported by partial inference" ~]]

69647590 ?~ t.arms.e [%| ["list branch is not supported by partial inference" ~]]

69657591 ?^ t.t.arms.e [%| ["list branch is not supported by partial inference" ~]]

@@ -6972,7 +7598,7 @@

69727598 [%| ["list branch pattern is not supported by partial inference" ~]]

69737599 =/ binder=(unit [head=term tail=term]) ?:(first-empty second-name first-name)

69747600 ?~ binder [%| ["list branch pattern is not supported by partial inference" ~]]

6975− ?: |(=(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)))))

7601+ ?: |(=(head.u.binder %proj) =(tail.u.binder %proj) =(head.u.binder tail.u.binder) ?=(^ (ienv-lookup head.u.binder env)) ?=(^ (ienv-lookup tail.u.binder env)) (lien globals.state |=(n=term |(=(n head.u.binder) =(n tail.u.binder)))))

69767602 [%| ["pattern binder shadows a name" ~]]

69777603 =/ extended=ienv [[head.u.binder [i.args.typ ~]] [tail.u.binder [typ ~]] env]

69787604 =/ left=iresult

@@ -7009,10 +7635,15 @@

70097635 [%| ["unit branch pattern is not supported by partial inference" ~]]

70107636 =/ binder=(unit term) ?:(first-empty second-name first-name)

70117637 ?~ binder [%| ["unit branch pattern is not supported by partial inference" ~]]

7012− ?: |(?=(^ (ienv-lookup u.binder env)) (lien globals.state |=(n=term =(n u.binder))))

7638+ ?: |(=(u.binder %proj) ?=(^ (ienv-lookup u.binder env)) (lien globals.state |=(n=term =(n u.binder))))

70137639 [%| ["pattern binder shadows a name" ~]]

70147640 =/ payload=(unit itype) (unit-union-payload typ)

70157641 ?~ payload [%| ["unit branch subject is not supported by partial inference" ~]]

7642+ =/ payload-live=(unit [result=?(%yes %no %unknown) left=@ud])

7643+ (itype-inhabited-proof u.payload sub.state.p.subject caps.state.p.subject 256)

7644+ ?~ payload-live [%| ["unit payload reachability needs unsupported inference" ~]]

7645+ ?: =(%unknown result.u.payload-live) [%| ["unit payload reachability needs unsupported inference" ~]]

7646+ ?: =(%no result.u.payload-live) [%| ["unit present pattern is unreachable" ~]]

70167647 =/ extended=ienv [[u.binder [u.payload ~]] env]

70177648 =/ left=iresult

70187649 ?~ expected (infer-fragment val.x ?:(first-empty env extended) state.p.subject)

@@ -7041,12 +7672,14 @@

70417672 =/ t=itype (itype-normalize typ.p.item sub.state.p.item)

70427673 ?: |(?=(%atom -.t) ?=(%any-atom -.t))

70437674 $(ps t.ps, state state.p.item)

7044− ?: &(?=(%nvar -.t) ?=(%lit -.p.i.ps) =(%number form.lit.p.i.ps))

7675+ ?: &(|(?=(%nvar -.t) ?=(%rnvar -.t)) ?=(%lit -.p.i.ps) =(%number form.lit.p.i.ps))

70457676 $(ps t.ps, state state.p.item)

70467677 ?: &(?=(%collection -.t) =(%list name.t) =(~[[%atom 'tD']] args.t))

70477678 $(ps t.ps, state state.p.item)

70487679 ?: &(?=(%avar -.t) (atom-var-from-cap id.t caps.state.p.item sub.state.p.item))

70497680 [%| ["a generic atom in interpolation needs an aura" ~[[(span-of p.i.ps) "atom with a generic aura"]]]]

7681+ ?: &(?=(%rvar -.t) (atom-var-from-cap id.t caps.state.p.item sub.state.p.item))

7682+ [%| ["a generic atom in interpolation needs an aura" ~[[(span-of p.i.ps) "atom with a generic aura"]]]]

70507683 ?: ?=(%cell -.t)

70517684 [%| ["a cell in interpolation needs a printer" ~[[(span-of p.i.ps) "cell without a printer"]]]]

70527685 [%| ["interpolation type needs unsupported inference" ~]]

@@ -7109,7 +7742,7 @@

71097742 ^- (unit ienv)

71107743 =. t ?:(?=(%face -.t) body.t t)

71117744 ?: ?=(%bind -.p)

7112− ?: |(?=(^ (ienv-lookup name.p env)) (lien globals |=(n=term =(n name.p)))) ~

7745+ ?: |(=(name.p %proj) ?=(^ (ienv-lookup name.p env)) (lien globals |=(n=term =(n name.p)))) ~

71137746 `[[name.p [t ~]] env]

71147747 ?: ?=(%cell -.p) (union-pattern-bind-items items.p t env globals)

71157748 `env

@@ -7163,7 +7796,9 @@

71637796 ?: ?=(%| -.subject) `subject

71647797 =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

71657798 ?. ?=(%union -.typ) `[%| ["branch is not supported by partial inference" ~]]

7166− =/ cases=(list itype) cases.typ

7799+ =/ live=(unit (list itype)) (itype-live-cases cases.typ sub.state.p.subject caps.state.p.subject 4.096)

7800+ ?~ live ~

7801+ =/ cases=(list itype) u.live

71677802 =/ remaining=(list itype) cases

71687803 =/ arms=(list arm) arms.e

71697804 =/ st=istate state.p.subject

@@ -7200,7 +7835,9 @@

72007835 ?: ?=(%| -.subject) `subject

72017836 =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

72027837 ?. ?=(%union -.typ) `[%| ["branch is not supported by partial inference" ~]]

7203− =/ cases=(list itype) cases.typ

7838+ =/ live=(unit (list itype)) (itype-live-cases cases.typ sub.state.p.subject caps.state.p.subject 4.096)

7839+ ?~ live ~

7840+ =/ cases=(list itype) u.live

72047841 =/ remaining=(list itype) cases

72057842 =/ arms=(list arm) arms.e

72067843 =/ st=istate state.p.subject

@@ -7244,7 +7881,9 @@

72447881 ?: ?=(%| -.subject) subject

72457882 =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

72467883 ?. ?=(%union -.typ) [%| ["branch is not supported by partial inference" ~]]

7247− =/ expanded=(unit (list ifinite)) (finite-cases cases.typ ~ 0)

7884+ =/ live=(unit (list itype)) (itype-live-cases cases.typ sub.state.p.subject caps.state.p.subject 4.096)

7885+ ?~ live [%| ["union emptiness needs unsupported inference" ~]]

7886+ =/ expanded=(unit (list ifinite)) (finite-cases u.live ~ 0)

72487887 ?~ expanded [%| ["union pattern expansion needs unsupported inference" ~]]

72497888 =/ cases=(list ifinite) u.expanded

72507889 =/ remaining=(list ifinite) cases

@@ -7365,9 +8004,65 @@

73658004 =/ cell=itype [%cell [%face head.typ [%atom aura.typ]] [%face tail.typ typ]]

73668005 [%& [%union ~[nil cell] ~ ~ ~] state.p.subject(jrec-fuel (dec jrec-fuel.state.p.subject))]

73678006::

8007+:: A bounded source-proven tree match permits flat tag patterns and

8008+:: nonbinding catch-alls. Whole-case binders cannot consume the temporary

8009+:: structural view. Pattern count and field arity are checked first.

8010+++ grec-simple-pattern

8011+ |= [pat=pattern view=itype]

8012+ ^- ?

8013+ ?. ?=(%cell -.pat) |

8014+ ?~ items.pat |

8015+ =/ first=pattern i.items.pat

8016+ ?. ?=(%lit -.first) |

8017+ ?. =(%term form.lit.first) |

8018+ =/ chosen=(unit itype) (contextual-tagged-case view val.lit.first ~)

8019+ ?~ chosen |

8020+ ?> ?=(%cell -.u.chosen)

8021+ =/ rest=(list pattern) t.items.pat

8022+ =/ arity=? ?:(?=(%cell -.tal.u.chosen) ?=([* [* ~]] rest) ?=([* ~] rest))

8023+ ?. arity |

8024+ (levy rest |=(p=pattern |(?=(%bind -.p) ?=(%any -.p))))

8025+::

8026+:: A catch-all with no binder is safe even when it covers both cases.

8027+:: A bound whole case still declines to avoid exporting the analysis view.

8028+++ grec-patterns-eligible

8029+ |= [arms=(list arm) view=itype left=@ud]

8030+ ^- ?

8031+ ?~ arms &

8032+ ?: =(0 left) |

8033+ =/ pat=pattern pat.i.arms

8034+ ?. |(?=(%any -.pat) (grec-simple-pattern pat view)) |

8035+ $(arms t.arms, left (dec left))

8036+++ grec-match-view

8037+ |= [e=expr subject=iresult]

8038+ ^- iresult

8039+ ?: ?=(%| -.subject) subject

8040+ ?. ?=(%branch -.e) subject

8041+ ?. (grec-direct-context typ.p.subject sub.state.p.subject) subject

8042+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

8043+ ?. ?=(%grec -.typ) subject

8044+ ?~ arms.e subject

8045+ =/ view=(unit [view=itype left=@ud]) (grec-unfold-view typ jrec-fuel.state.p.subject)

8046+ ?~ view [%| ["recursive mold unfolding needs unsupported inference" ~]]

8047+ ?. (grec-patterns-eligible arms.e view.u.view 128) subject

8048+ [%& view.u.view state.p.subject(jrec-fuel left.u.view)]

8049+::

8050+:: A single-arm diagnostic only probes a direct, source-typed in-scope wing;

8051+:: other subjects retain the prior single-pattern inference path.

8052+++ grec-single-wing-subject

8053+ |= [e=expr env=ienv state=istate]

8054+ ^- (unit iresult)

8055+ ?. ?=(%wing -.e) ~

8056+ ?. ?=([@ ~] names.e) ~

8057+ =/ scheme=(unit ischeme) (ienv-lookup i.names.e env)

8058+ ?~ scheme ~

8059+ ?. (grec-direct-context typ.u.scheme sub.state) ~

8060+ `(infer-fragment e env state)

8061+::

73688062++ infer-known-union-branch-subject

73698063 |= [e=expr env=ienv subject=iresult]

73708064 ^- iresult

8065+ =. subject (grec-match-view e subject)

73718066 =. subject (jrec-match-view e subject)

73728067 =/ whole=(unit iresult) (infer-known-union-whole e env subject)

73738068 ?~ whole (infer-known-union-finite e env subject ~)

@@ -7382,6 +8077,7 @@

73828077++ infer-known-union-context-subject

73838078 |= [e=expr expected=itype env=ienv subject=iresult context=span]

73848079 ^- iresult

8080+ =. subject (grec-match-view e subject)

73858081 =. subject (jrec-match-view e subject)

73868082 =/ whole=(unit iresult) (infer-known-union-context-whole e expected env subject context)

73878083 ?~ whole (infer-known-union-finite e env subject `[expected context])

@@ -7434,9 +8130,67 @@

74348130 =/ subject=iresult (infer-fragment e env state)

74358131 ?: ?=(%| -.subject) ?:((union-subject-call e) `subject ~)

74368132 =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

7437− ?. |(?=(%union -.typ) ?=(%jrec -.typ)) ~

8133+ ?. |(?=(%union -.typ) ?=(%jrec -.typ) &(?=(%grec -.typ) (grec-direct-context typ.p.subject sub.state.p.subject))) ~

74388134 `subject

74398135::

8136+:: A direct wing with an already-known union may skip genuinely empty cases

8137+:: when checking a one-arm match. Other subjects keep their existing path.

8138+:: A directly known canonical list of an empty element contains only null.

8139+:: This helper never refines an opaque or variable-bound subject.

8140+++ empty-list-null-branch

8141+ |= [e=expr env=ienv state=istate expected=(unit [typ=itype context=span])]

8142+ ^- (unit iresult)

8143+ ?. ?=(%branch -.e) ~

8144+ ?~ arms.e ~

8145+ ?^ t.arms.e ~

8146+ ?. (unit-empty-pattern pat.i.arms.e) ~

8147+ ?. ?=(%wing -.subject.e) ~

8148+ ?. ?=([@ ~] names.subject.e) ~

8149+ =/ scheme=(unit ischeme) (ienv-lookup i.names.subject.e env)

8150+ ?~ scheme ~

8151+ ?. ?=(%collection -.typ.u.scheme) ~

8152+ ?. =(%list name.typ.u.scheme) ~

8153+ ?~ prelude.state ~

8154+ ?. =(at.u.prelude.state /lib/jibb/prelude/jibb) ~

8155+ =/ standard=(unit ischeme) (find-jibb-mold %list u.prelude.state)

8156+ ?~ standard ~

8157+ ?. =(u.standard [[%collection %list ~[[%var 0]]] ~[0]]) ~

8158+ =/ subject=iresult (infer-fragment subject.e env state)

8159+ ?: ?=(%| -.subject) ~

8160+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

8161+ ?. ?=(%collection -.typ) ~

8162+ ?. =(%list name.typ) ~

8163+ ?~ args.typ ~

8164+ ?^ t.args.typ ~

8165+ =/ proof=(unit [empty=? left=@ud]) (itype-empty-proof i.args.typ sub.state.p.subject 256)

8166+ ?~ proof ~

8167+ ?. empty.u.proof ~

8168+ ?~ expected `(infer-fragment val.i.arms.e env state.p.subject)

8169+ =/ body=iresult (infer-call-context-arg val.i.arms.e typ.u.expected env state.p.subject context.u.expected)

8170+ ?: ?=(%| -.body) `body

8171+ =/ fit=ifit (itype-fit typ.p.body typ.u.expected sub.state.p.body next.state.p.body)

8172+ ?: ?=(%unknown -.fit) `[%| ["single-case branch result constraint is not supported by partial inference" ~]]

8173+ ?: ?=(%bad -.fit) `[%| ["single-case branch arm does not fit its expected type" ~[[context.u.expected "expected type"] [(span-of val.i.arms.e) "branch arm"]]]]

8174+ ?: (itype-has-tag (itype-normalize typ.u.expected sub.fit))

8175+ `[%| ["single-case branch result needs context in partial inference" ~]]

8176+ `[%& typ.p.body state.p.body(sub sub.fit, next next.fit)]

8177+::

8178+++ known-empty-union-wing

8179+ |= [e=expr env=ienv state=istate]

8180+ ^- (unit iresult)

8181+ ?. ?=(%wing -.e) ~

8182+ ?. ?=([@ ~] names.e) ~

8183+ =/ scheme=(unit ischeme) (ienv-lookup i.names.e env)

8184+ ?~ scheme ~

8185+ ?. (contextual-direct-union typ.u.scheme) ~

8186+ =/ subject=iresult (infer-fragment e env state)

8187+ ?: ?=(%| -.subject) ~

8188+ =/ typ=itype (itype-normalize typ.p.subject sub.state.p.subject)

8189+ ?. ?=(%union -.typ) ~

8190+ =/ live=(unit (list itype)) (itype-live-cases cases.typ sub.state.p.subject caps.state.p.subject 4.096)

8191+ ?~ live ~

8192+ ?: =(u.live cases.typ) ~

8193+ `subject

74408194::

74418195:: Infer changes only against a fully known record spine. Retain the

74428196:: target type; unknown spines and repeated edits remain unsupported.

@@ -7543,7 +8297,7 @@

75438297 |= [e=expr actual=itype expected=itype sub=isub next=@ud context=span]

75448298 ^- (unit idiag)

75458299 =/ original=[left=itype right=itype] [actual expected]

7546− ?: |(?=(%var -.left.original) ?=(%avar -.left.original) ?=(%nvar -.left.original) ?=(%var -.right.original) ?=(%avar -.right.original) ?=(%nvar -.right.original)) ~

8300+ ?: |(?=(%var -.left.original) ?=(%avar -.left.original) ?=(%rvar -.left.original) |(?=(%nvar -.left.original) ?=(%rnvar -.left.original)) ?=(%var -.right.original) ?=(%avar -.right.original) ?=(%rvar -.right.original) |(?=(%nvar -.right.original) ?=(%rnvar -.right.original))) ~

75478301 =/ fit=ifit (itype-fit actual expected sub next)

75488302 ?. ?=(%bad -.fit) ~

75498303 =. actual (itype-walk actual sub)

@@ -7564,7 +8318,7 @@

75648318 ?~ items ~

75658319 ?~ t.items (nested-missing-tag val.i.items actual expected sub next context)

75668320 =/ original=[left=itype right=itype] [actual expected]

7567− ?: |(?=(%var -.left.original) ?=(%avar -.left.original) ?=(%nvar -.left.original) ?=(%var -.right.original) ?=(%avar -.right.original) ?=(%nvar -.right.original)) ~

8321+ ?: |(?=(%var -.left.original) ?=(%avar -.left.original) ?=(%rvar -.left.original) |(?=(%nvar -.left.original) ?=(%rnvar -.left.original)) ?=(%var -.right.original) ?=(%avar -.right.original) ?=(%rvar -.right.original) |(?=(%nvar -.right.original) ?=(%rnvar -.right.original))) ~

75688322 =. actual (itype-walk actual sub)

75698323 =. expected (itype-walk expected sub)

75708324 ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

@@ -7704,8 +8458,15 @@

77048458 ?: ?=(%| -.result) result

77058459 [%& typ.p.result state.p.result(globals globals.state, molds molds.state)]

77068460 %branch

8461+ ?^ defer.state (dg-boolean-branch e env state)

77078462 ?~ arms.e [%| ["branch is not supported by partial inference" ~]]

77088463 ?~ t.arms.e

8464+ =/ empty-list=(unit iresult) (empty-list-null-branch e env state ~)

8465+ ?^ empty-list u.empty-list

8466+ =/ empty-union=(unit iresult) (known-empty-union-wing subject.e env state)

8467+ ?^ empty-union (infer-known-union-branch-subject e env u.empty-union)

8468+ =/ single=(unit iresult) (grec-single-wing-subject subject.e env state)

8469+ ?^ single (infer-known-union-branch-subject e env u.single)

77098470 ?: (single-structured-pattern e) (infer-single-case-branch e env state ~)

77108471 (infer-cell-branch e env state ~)

77118472 ?^ t.t.arms.e (infer-known-union-branch e env state)

@@ -7762,6 +8523,9 @@

77628523 =/ value=iresult

77638524 (infer-call-context-arg val.e typ.u.target env state.u.target at.shape.e)

77648525 ?: ?=(%| -.value) value

8526+ =/ shape=(unit [source=iwfields target=iwfields])

8527+ (width-shape typ.p.value typ.u.target sub.state.p.value)

8528+ ?^ shape [%| ["record width constraint needs unsupported inference" ~]]

77658529 =/ fit=ifit (itype-fit typ.p.value typ.u.target sub.state.p.value next.state.p.value)

77668530 ?: ?=(%unknown -.fit) [%| ["cast constraint is not supported by partial inference" ~]]

77678531 ?: ?=(%bad -.fit)

@@ -7770,6 +8534,8 @@

77708534 =/ 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)

77718535 ?^ nested [%| u.nested]

77728536 [%| ["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)]]]]

8537+ ?: &(?=(^ defer.state.p.value) !(dg-stable-fit typ.p.value typ.u.target sub.fit))

8538+ [%| ["deferred cast fit needs stable inference" ~]]

77738539 =/ merged=itype (itype-merge-faces typ.p.value typ.u.target sub.fit)

77748540 [%& merged state.p.value(sub sub.fit, next next.fit)]

77758541 %crash [%& [%var next.state] state(next +(next.state))]

@@ -7793,6 +8559,8 @@

77938559 [%& [%fn typ.p.sam typ.p.body] state.p.body]

77948560 %call

77958561 ?~ args.e [%| ["call has no argument" ~]]

8562+ ?: (explicit-proj-call e env state)

8563+ [%| ["proj needs an expected record type" ~]]

77968564 (infer-call-with-head e env state (infer-fragment head.e env state))

77978565 * [%| ["expression is not supported by partial inference" ~]]

77988566 ==

@@ -7803,6 +8571,248 @@

78038571::

78048572:: Check a call using the head already inferred in this state. Keeping

78058573:: this shared avoids evaluating or instantiating a contextual head twice.

8574+++ width-has-projections

8575+ |= ps=(list iwprojection)

8576+ ^- ?

8577+ ?~ ps |

8578+ &

8579+::

8580++$ iwidth-elaboration [original=expr typ=itype sub=isub projections=(list iwprojection)]

8581+++ infer-width-elaboration

8582+ |= [e=expr env=ienv state=istate]

8583+ ^- (each iwidth-elaboration idiag)

8584+ =/ out=iresult (infer-fragment e env state)

8585+ ?: ?=(%| -.out) [%| p.out]

8586+ [%& [e typ.p.out sub.state.p.out (flop projections.state.p.out)]]

8587+::

8588+:: Source-bound gate-layout evidence, confined to checked root gate

8589+:: definitions and direct unshadowed prelude calls. The prepared prelude

8590+:: interface and its retained source are trusted as a matching artifact.

8591+:: Layouts identify sample binder faces; they do not change call arity or

8592+:: authorize stripping nested value faces. Unknown origins use ordinary fit.

8593+++ direct-written-gates

8594+ |= [ds=(list def) out=ivisited]

8595+ ^- ivisited

8596+ ?~ ds out

8597+ ?: ?=(%mold -.i.ds) $(ds t.ds)

8598+ ?. |(?=(%gate -.val.i.ds) ?=(%gate-wide -.val.i.ds)) $(ds t.ds)

8599+ $(ds t.ds, out (~(put by out) name.i.ds &))

8600+++ direct-may-use-prelude

8601+ |= [ds=(list def) root=ivisited heads=ivisited]

8602+ ^- ?

8603+ ?~ ds |

8604+ ?: ?=(%mold -.i.ds) $(ds t.ds)

8605+ =/ refs=(list term) (dependency-expr val.i.ds)

8606+ =/ has-root=? (lien refs |=(n=term ?=(^ (~(get by root) n))))

8607+ =/ has-head=? (lien refs |=(n=term ?=(^ (~(get by heads) n))))

8608+ ?: &(has-root has-head) &

8609+ $(ds t.ds)

8610+++ direct-unique-names

8611+ |= [names=(list term) seen=ivisited]

8612+ ^- ?

8613+ ?~ names &

8614+ ?: ?=(^ (~(get by seen) i.names)) |

8615+ $(names t.names, seen (~(put by seen) i.names &))

8616+++ direct-prelude-evidence

8617+ |= [ds=(list def) prelude=(unit ifile)]

8618+ ^- (unit igate-prelude-evidence)

8619+ ?~ prelude ~

8620+ ?~ source.u.prelude ~

8621+ =/ root=ivisited (direct-written-gates ds ~)

8622+ =/ names=(list term) (turn values.u.prelude |=(e=[name=term scheme=ischeme] name.e))

8623+ =/ heads=ivisited (graph-nameset names ~)

8624+ ?. (direct-may-use-prelude ds root heads) ~

8625+ =/ parsed (parse at.u.prelude u.source.u.prelude)

8626+ ?: ?=(%| -.parsed) ~

8627+ ?^ (duplicate-defs defs.p.parsed) ~

8628+ ?. (direct-unique-names (global-value-names defs.p.parsed) ~) ~

8629+ =/ gates=(map term def) (direct-checked-gates defs.p.parsed values.u.prelude)

8630+ `[u.prelude gates]

8631+++ direct-checked-gates

8632+ |= [ds=(list def) env=ienv]

8633+ ^- (map term def)

8634+ =/ names=(list term) (turn env |=(e=[name=term scheme=ischeme] name.e))

8635+ =/ known=ivisited (graph-nameset names ~)

8636+ =/ out=(map term def) ~

8637+ |-

8638+ ?~ ds out

8639+ =/ d=def i.ds

8640+ ?: ?=(%mold -.d) $(ds t.ds)

8641+ ?. ?=(^ (~(get by known) name.d)) $(ds t.ds)

8642+ ?. |(?=(%gate -.val.d) ?=(%gate-wide -.val.d)) $(ds t.ds)

8643+ $(ds t.ds, out (~(put by out) name.d d))

8644+++ direct-find-gate

8645+ |= [n=term ds=(list def)]

8646+ ^- (unit def)

8647+ ?~ ds ~

8648+ ?: &(?=(%value -.i.ds) =(n name.i.ds)) `i.ds

8649+ $(ds t.ds)

8650+++ direct-gate-sample

8651+ |= d=def

8652+ ^- (unit sample)

8653+ ?. ?=(%value -.d) ~

8654+ ?- -.val.d

8655+ %gate `sample.val.d

8656+ %gate-wide `sample.val.d

8657+ * ~

8658+ ==

8659+++ direct-sample-name

8660+ |= sam=sample

8661+ ^- (unit term)

8662+ ?- -.sam

8663+ %bind `name.sam

8664+ %face `name.sam

8665+ %pun `name.sam

8666+ * ~

8667+ ==

8668+++ direct-field-name

8669+ |= f=field

8670+ ^- (unit term)

8671+ ?- -.f

8672+ %face `name.f

8673+ %pun `name.f

8674+ * ~

8675+ ==

8676+++ direct-slot-body

8677+ |= [typ=itype name=(unit term)]

8678+ ^- (unit itype)

8679+ ?~ name `typ

8680+ ?. ?=(%face -.typ) ~

8681+ ?. =(name.typ u.name) ~

8682+ `body.typ

8683+++ direct-invariant

8684+ |= [a=itype b=itype sub=isub next=@ud]

8685+ ^- ifit

8686+ ?: (itype-face-asym a b sub) [%unknown ~]

8687+ =/ forward=ifit (itype-fit a b sub next)

8688+ ?. ?=(%ok -.forward) [%unknown ~]

8689+ ?: (itype-face-asym a b sub.forward) [%unknown ~]

8690+ =/ reverse=ifit (itype-fit b a sub.forward next.forward)

8691+ ?. ?=(%ok -.reverse) [%unknown ~]

8692+ reverse

8693+++ direct-function-fit

8694+ |= [a=itype b=itype sam=sample sh=shape sub=isub next=@ud]

8695+ ^- ifit

8696+ ?. &(?=(%fn -.a) ?=(%fn -.b) ?=(%cell -.sam) ?=(%fn -.sh)) [%unknown ~]

8697+ ?. ?=(%cell -.sample.sh) [%unknown ~]

8698+ =/ as=(list sample) items.sam

8699+ =/ bs=(list field) fields.sample.sh

8700+ ?~ as [%unknown ~]

8701+ ?~ t.as [%unknown ~]

8702+ ?^ t.t.as [%unknown ~]

8703+ ?~ bs [%unknown ~]

8704+ ?~ t.bs [%unknown ~]

8705+ ?^ t.t.bs [%unknown ~]

8706+ ?. &(?=(%cell -.sample.a) ?=(%cell -.sample.b)) [%unknown ~]

8707+ =/ an=(unit term) (direct-sample-name i.as)

8708+ =/ bn=(unit term) (direct-field-name i.bs)

8709+ ?: &(?=(^ an) ?=(^ bn) !=(u.an u.bn)) [%unknown ~]

8710+ =/ x=(unit itype) (direct-slot-body hed.sample.a an)

8711+ =/ y=(unit itype) (direct-slot-body hed.sample.b bn)

8712+ ?~ x [%unknown ~]

8713+ ?~ y [%unknown ~]

8714+ =/ first=ifit (direct-invariant u.x u.y sub next)

8715+ ?. ?=(%ok -.first) [%unknown ~]

8716+ =. an (direct-sample-name i.t.as)

8717+ =. bn (direct-field-name i.t.bs)

8718+ ?: &(?=(^ an) ?=(^ bn) !=(u.an u.bn)) [%unknown ~]

8719+ =/ x2=(unit itype) (direct-slot-body tal.sample.a an)

8720+ =/ y2=(unit itype) (direct-slot-body tal.sample.b bn)

8721+ ?~ x2 [%unknown ~]

8722+ ?~ y2 [%unknown ~]

8723+ =/ second=ifit (direct-invariant u.x2 u.y2 sub.first next.first)

8724+ ?. ?=(%ok -.second) [%unknown ~]

8725+ (direct-invariant product.a product.b sub.second next.second)

8726+:: This is a tentative proof: its caller must require closed call samples

8727+:: and repeat every positional check under the stable final substitution.

8728+++ direct-positional-fit

8729+ |= [args=(list expr) slots=(list sample) actual=itype expected=itype env=ienv state=istate sub=isub next=@ud]

8730+ ^- ifit

8731+ ?~ args [%unknown ~]

8732+ ?~ slots [%unknown ~]

8733+ =/ last=? ?=(~ t.args)

8734+ ?: !=(last ?=(~ t.slots)) [%unknown ~]

8735+ =/ split=(unit [left=itype right=itype])

8736+ ?: last `[actual expected]

8737+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

8738+ `[hed.actual hed.expected]

8739+ ?~ split [%unknown ~]

8740+ =/ x=itype left.u.split

8741+ =/ y=itype right.u.split

8742+ =/ expected-name=(unit term) (direct-sample-name i.slots)

8743+ =/ expected-body=(unit itype) (direct-slot-body y expected-name)

8744+ ?~ expected-body [%unknown ~]

8745+ =. y u.expected-body

8746+ =/ fit=ifit (itype-fit x y sub next)

8747+ =/ accepted=? &(?=(%ok -.fit) !(itype-positional-slot-face-asym x y sub.fit))

8748+ =/ result=(unit ifit)

8749+ ?: accepted `fit

8750+ ?. &(?=(%face -.i.slots) ?=(%fn -.shape.i.slots)) ~

8751+ ?. ?=(%wing -.i.args) ~

8752+ ?. ?=([@ ~] names.i.args) ~

8753+ ?. (unique-value-name i.names.i.args globals.state) ~

8754+ =/ source=(unit def) (~(get by gate-defs.state) i.names.i.args)

8755+ ?~ source ~

8756+ =/ sample=(unit sample) (direct-gate-sample u.source)

8757+ ?~ sample ~

8758+ =/ trial=ifit (direct-function-fit x y u.sample shape.i.slots sub next)

8759+ ?. ?=(%ok -.trial) ~

8760+ `trial

8761+ ?~ result [%unknown ~]

8762+ =. fit u.result

8763+ ?: last fit

8764+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) [%unknown ~]

8765+ ?. ?=(%ok -.fit) [%unknown ~]

8766+ $(args t.args, slots t.slots, actual tal.actual, expected tal.expected, sub sub.fit, next next.fit)

8767+++ direct-any-gate-arg

8768+ |= [args=(list expr) defs=(map term def)]

8769+ ^- ?

8770+ ?~ args |

8771+ =/ found=?

8772+ ?. ?=(%wing -.i.args) |

8773+ ?. ?=([@ ~] names.i.args) |

8774+ ?=(^ (~(get by defs) i.names.i.args))

8775+ ?: found &

8776+ $(args t.args)

8777+++ direct-gate-call-fit

8778+ |= [e=expr actual=itype expected=itype env=ienv state=istate]

8779+ ^- (unit ifit)

8780+ ?. ?=(%call -.e) ~

8781+ ?~ args.e ~

8782+ ?~ t.args.e ~

8783+ ?. &(?=(%cell -.actual) ?=(%cell -.expected)) ~

8784+ ?. ?=(%wing -.head.e) ~

8785+ ?. ?=([@ ~] names.head.e) ~

8786+ ?. ?=(~ (ienv-lookup i.names.head.e env)) ~

8787+ ?. (unique-value-name i.names.head.e globals.state) ~

8788+ ?. (direct-any-gate-arg args.e gate-defs.state) ~

8789+ ?~ prelude.state ~

8790+ ?~ source.u.prelude.state ~

8791+ ?~ head-evidence.state ~

8792+ ?. =(u.prelude.state iface.u.head-evidence.state) ~

8793+ ?. ?=(^ (ienv-lookup i.names.head.e values.u.prelude.state)) ~

8794+ =/ head=(unit def) (~(get by gates.u.head-evidence.state) i.names.head.e)

8795+ ?~ head ~

8796+ =/ sam=(unit sample) (direct-gate-sample u.head)

8797+ ?~ sam ~

8798+ ?. ?=(%cell -.u.sam) ~

8799+ =/ fit=ifit (direct-positional-fit args.e items.u.sam actual expected env state sub.state next.state)

8800+ ?. ?=(%ok -.fit) ~

8801+ :: Enclosing inference may add constraints after this call. Only a

8802+ :: closed call-sample proof can remain stable under those later bindings.

8803+ =/ actual-final=itype (itype-normalize actual sub.fit)

8804+ =/ expected-final=itype (itype-normalize expected sub.fit)

8805+ ?^ (itype-vars actual-final) ~

8806+ ?^ (itype-vars expected-final) ~

8807+ ?: |((itype-has-tag actual-final) (itype-has-tag expected-final)) ~

8808+ :: A later argument may resolve a variable used by an earlier slot.

8809+ :: Recheck every fit and face against the completed substitution; no

8810+ :: additional binding or fresh variable is permitted in the second pass.

8811+ =/ verified=ifit (direct-positional-fit args.e items.u.sam actual expected env state sub.fit next.fit)

8812+ ?. ?=(%ok -.verified) ~

8813+ ?. &(=(sub.fit sub.verified) =(next.fit next.verified)) ~

8814+ `fit

8815+::

78068816++ infer-call-with-head

78078817 |= [e=expr env=ienv state=istate head=iresult]

78088818 ^- iresult

@@ -7822,8 +8832,24 @@

78228832 =/ st=istate state.p.arg

78238833 =/ ht=itype (itype-walk typ.p.head sub.st)

78248834 ?: ?=(%fn -.ht)

7825− =/ fit=ifit (itype-fit typ.p.arg sample.ht sub.st next.st)

7826− ?: ?=(%unknown -.fit) [%| ["call constraint is not supported by partial inference" ~]]

8835+ =/ shape=(unit [source=iwfields target=iwfields])

8836+ ?^ t.args.e ~

8837+ (width-shape typ.p.arg sample.ht sub.st)

8838+ ?^ shape [%| ["record width constraint needs unsupported inference" ~]]

8839+ =/ fit=ifit

8840+ ?^ t.args.e (itype-fit-inner typ.p.arg sample.ht sub.st next.st & |)

8841+ (itype-fit typ.p.arg sample.ht sub.st next.st)

8842+ =/ direct=(unit ifit)

8843+ ?: ?=(%ok -.fit) ~

8844+ (direct-gate-call-fit e typ.p.arg sample.ht env st)

8845+ =. fit ?~(direct fit u.direct)

8846+ ?: ?=(%unknown -.fit)

8847+ ?~ defer.st [%| ["call constraint is not supported by partial inference" ~]]

8848+ =/ edge=(unit dgo) (dg-eligible-ctor e typ.p.head typ.p.arg sample.ht st)

8849+ ?~ edge [%| ["call constraint is not supported by partial inference" ~]]

8850+ ?: (gth (lent obligations.st) 63) [%| ["call constraint is not supported by partial inference" ~]]

8851+ [%& product.ht st(obligations [u.edge obligations.st])]

8852+

78278853 ?: ?=(%bad -.fit)

78288854 ?~ t.args.e

78298855 =/ missing=(unit idiag) (missing-union-tag i.args.e sample.ht sub.st (span-of head.e))

@@ -7838,7 +8864,13 @@

78388864 =/ arg-at=span ?~(bad whole-args at.u.bad)

78398865 =/ arg-type=itype ?~(bad typ.p.arg typ.u.bad)

78408866 [%| ["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)]]]]

7841− ?: &((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))

8867+ ?: &(?=(^ defer.st) !(dg-stable-call-fit typ.p.arg sample.ht product.ht sub.fit ?=(^ t.args.e)))

8868+ [%| ["deferred call fit needs stable inference" ~]]

8869+ =/ face-asym=?

8870+ ?^ direct |

8871+ ?^ t.args.e (itype-positional-face-asym args.e typ.p.arg sample.ht sub.fit)

8872+ (itype-face-asym typ.p.arg sample.ht sub.fit)

8873+ ?: &((itype-has-face typ.p.arg sub.fit) face-asym (itype-output-may-be-cell product.ht sub.fit))

78428874 [%| ["call result face propagation is not supported by partial inference" ~]]

78438875 [%& product.ht st(sub sub.fit, next next.fit)]

78448876 =/ result=itype [%var next.st]

@@ -7852,7 +8884,7 @@

78528884 ^- (unit [at=span typ=itype])

78538885 ?~ args ~

78548886 =/ original=[left=itype right=itype] [actual expected]

7855− ?: |(?=(%var -.left.original) ?=(%avar -.left.original) ?=(%nvar -.left.original) ?=(%var -.right.original) ?=(%avar -.right.original) ?=(%nvar -.right.original)) ~

8887+ ?: |(?=(%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))) ~

78568888 =. actual (itype-walk actual sub)

78578889 =. expected (itype-walk expected sub)

78588890 ?: &(?=(%face -.expected) !?=(%face -.actual))

@@ -7902,9 +8934,10 @@

79028934 [%| ["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)]]]]

79038935 [%& expected state.p.value(sub sub.fit, next next.fit)]

79048936::

7905−:: A known gate whose result is still an inference variable can receive

7906−:: an enclosing target before its argument is inferred. Other products

7907−:: and unresolved calls use the existing directional path unchanged.

8937+:: A known gate may receive an enclosing target before its argument is

8938+:: inferred when its result is open or a direct, matching named generic

8939+:: union. Opaque, recursive, tag-constrained and variable-bound union

8940+:: results keep the existing directional path.

79088941++ infer-contextual-call

79098942 |= [e=expr expected=itype env=ienv state=istate]

79108943 ^- iresult

@@ -7915,64 +8948,374 @@

79158948 =/ ht=itype (itype-walk typ.p.head sub.state.p.head)

79168949 ?. ?=(%fn -.ht) (infer-call-with-head e env state head)

79178950 =/ result=itype (itype-walk product.ht sub.state.p.head)

7918− ?. ?=(%var -.result) (infer-call-with-head e env state head)

7919− ?: |(?=(%var -.expected) ?=(%avar -.expected) ?=(%nvar -.expected) (itype-has-tag (itype-normalize expected sub.state.p.head)))

8951+ =/ eligible=?

8952+ ?: ?=(%var -.result) &

8953+ :: A direct known generic union may receive the same nominal result

8954+ :: context before its arguments are checked. Variable-bound origins,

8955+ :: pending tags, recursive identities and unknown atoms stay open.

8956+ ?. &(?=(%union -.product.ht) ?=(%union -.result) ?=(%union -.expected)) |

8957+ ?~ origin.result |

8958+ ?. =(origin.result origin.expected) |

8959+ ?~ args.result |

8960+ ?. =((lent args.result) (lent args.expected)) |

8961+ ?: |((itype-has-tag (itype-normalize result sub.state.p.head)) (itype-has-tag (itype-normalize expected sub.state.p.head))) |

8962+ ?: |((itype-has-recursive (itype-normalize result sub.state.p.head)) (itype-has-recursive (itype-normalize expected sub.state.p.head))) |

8963+ ?: |((itype-has-any-atom result sub.state.p.head) (itype-has-any-atom expected sub.state.p.head)) |

8964+ &

8965+ ?. eligible (infer-call-with-head e env state head)

8966+ ?: |(?=(%var -.expected) ?=(%avar -.expected) ?=(%rvar -.expected) |(?=(%nvar -.expected) ?=(%rnvar -.expected)) (itype-has-tag (itype-normalize expected sub.state.p.head)))

79208967 (infer-call-with-head e env state head)

79218968 =/ sub=(unit isub) (itype-unify result expected sub.state.p.head)

79228969 ?~ sub (infer-call-with-head e env state head)

79238970 (infer-call-with-head e env state [%& typ.p.head state.p.head(sub u.sub)])

79248971::

7925−++ infer-call-context-arg

8972+:: An eligible fully faced literal receives context by name, in source order.

8973+++ width-literal-fields

8974+ |= [items=(list item) axis=@ud fuel=@ud]

8975+ ^- (unit iwfields)

8976+ =/ order=(list iwfield) ~

8977+ =/ index=(map term iwfield) *(map term iwfield)

8978+ |-

8979+ ?~ items ~

8980+ ?: =(0 fuel) ~

8981+ ?~ face.i.items ~

8982+ =/ at-axis=@ud ?~(t.items axis (mul 2 axis))

8983+ =/ entry=iwfield [u.face.i.items at-axis [%noun ~]]

8984+ ?: ?=(^ (~(get by index) name.entry)) ~

8985+ =. index (~(put by index) name.entry entry)

8986+ =. order [entry order]

8987+ ?~ t.items `[(flop order) index]

8988+ $(items t.items, axis +((mul 2 axis)), fuel (dec fuel))

8989+++ width-infer-items

8990+ |= [items=(list item) expected=(map term iwfield) env=ienv state=istate context=span]

8991+ ^- iresult

8992+ ?~ items [%| ["empty record is not supported" ~]]

8993+ ?~ face.i.items [%| ["record face needs unsupported inference" ~]]

8994+ =/ field=(unit iwfield) (~(get by expected) u.face.i.items)

8995+ =/ head=iresult

8996+ ?~ field (infer-fragment val.i.items env state)

8997+ (infer-call-context-arg val.i.items typ.u.field env state context)

8998+ ?: ?=(%| -.head) head

8999+ =/ typ=itype [%face u.face.i.items typ.p.head]

9000+ ?~ t.items [%& typ state.p.head]

9001+ =/ tail=iresult $(items t.items, state state.p.head)

9002+ ?: ?=(%| -.tail) tail

9003+ [%& [%cell typ typ.p.tail] state.p.tail]

9004+++ width-infer-literal

9005+ |= [e=expr expected=itype env=ienv state=istate context=span]

9006+ ^- (unit iresult)

9007+ ?. ?=(%tuple -.e) ~

9008+ ?. |(?=(%cell -.expected) ?=(%face -.expected)) ~

9009+ =/ source=(unit iwfields) (width-literal-fields items.e 1 4.096)

9010+ =/ target=(unit iwfields) (width-scan expected sub.state 1 4.096)

9011+ ?~ source ~

9012+ ?~ target ~

9013+ ?: (lth (lent order.u.source) (lent order.u.target)) ~

9014+ ?. (width-in-order order.u.source order.u.target)

9015+ `(infer-simple-items items.e env state)

9016+ `(width-infer-items items.e index.u.target env state context)

9017+::

9018+:: Experimental intrinsic recognition; real bindings retain normal calls.

9019+++ explicit-proj-call

9020+ |= [e=expr env=ienv state=istate]

9021+ ^- ?

9022+ ?. ?=(%call -.e) |

9023+ ?. ?=([* ~] args.e) |

9024+ ?. ?=(%wing -.head.e) |

9025+ ?. =(names.head.e ~[%proj]) |

9026+ ?: ?=(^ (ienv-lookup %proj env)) |

9027+ ?: (lien globals.state |=(n=term =(n %proj))) |

9028+ ?~ prelude.state &

9029+ ?:(?=(^ (ienv-lookup %proj values.u.prelude.state)) | &)

9030+++ infer-proj-source

79269031 |= [e=expr expected=itype env=ienv state=istate context=span]

79279032 ^- iresult

7928− ?: ?=(%pair -.e) $(e (pair-as-cell e))

79299033 ?: ?=(%group -.e) $(e inner.e)

7930− ?: &(?=(%body -.e) ?=(~ defs.e)) $(e final.e)

7931− ?: ?=(%trace -.e)

7932− =/ traced=iresult (infer-fragment val.e env state)

7933− ?: ?=(%| -.traced) traced

7934− $(e then.e, state state.p.traced)

7935− =/ target=itype (itype-walk expected sub.state)

9034+ =/ literal=(unit iresult) (width-infer-literal e expected env state context)

9035+ ?^ literal u.literal

9036+ (infer-fragment e env state)

9037+++ infer-proj-context

9038+ |= [e=expr expected=itype env=ienv state=istate context=span]

9039+ ^- iresult

9040+ ?> ?=(%call -.e)

9041+ ?~ args.e [%| ["proj needs one record" ~]]

9042+ ?. |(?=(%cell -.expected) ?=(%face -.expected)) [%| ["proj needs an expected record type" ~]]

9043+ =/ value=iresult (infer-proj-source i.args.e expected env state context)

9044+ ?: ?=(%| -.value) value

9045+ =/ shape=(unit [source=iwfields target=iwfields])

9046+ (width-proj-shape typ.p.value expected sub.state.p.value)

9047+ ?~ shape [%| ["proj needs a known record containing its expected fields" ~]]

9048+ =/ project=(unit iwidth-result) (width-project u.shape sub.state.p.value next.state.p.value)

9049+ ?~ project [%| ["proj constraint needs unsupported inference" ~]]

9050+ =/ st=istate state.p.value(sub sub.u.project, next next.u.project)

9051+ [%& expected st(projections [[at.e e typ.p.value expected steps.u.project] projections.st])]

9052+::

9053+:: A known literal singleton in a direct union can contextualize a

9054+:: loobean literal of the same noun. Only explicit singleton and cell

9055+:: competitors are considered; opaque or variable cases stay unknown.

9056+++ explicit-singleton-in-union

9057+ |= [t=itype noun=@]

9058+ ^- ?

9059+ ?. ?=(%union -.t) |

9060+ =/ cases=(list itype) cases.t

9061+ =/ found=? |

79369062 |-

7937− ?: ?=(%face -.target) $(target (itype-walk body.target sub.state))

7938− :: Only the source-proven one-layer cell is exposed. Each recursive

7939− :: descent consumes one written tuple; named values use ordinary fit.

7940− ?: &(?=(%jrec -.target) ?=(%lit -.e) =(%null form.lit.e))

7941− ?: =(0 jrec-fuel.state) [%| ["recursive mold unfolding needs unsupported inference" ~]]

7942− [%& target state(jrec-fuel (dec jrec-fuel.state))]

7943− ?: &(?=(%jrec -.target) ?=(%tuple -.e))

7944− ?: =(0 jrec-fuel.state) [%| ["recursive mold unfolding needs unsupported inference" ~]]

7945− =. state state(jrec-fuel (dec jrec-fuel.state))

7946− =/ shape=itype

7947− [%cell [%face head.target [%atom aura.target]] [%face tail.target target]]

7948− =/ value=iresult (infer-call-context-items items.e shape env state context)

7949− ?: ?=(%| -.value) value

7950− =/ fit=ifit (itype-fit typ.p.value shape sub.state.p.value next.state.p.value)

7951− ?: ?=(%unknown -.fit) [%| ["recursive mold cell constraint needs unsupported inference" ~]]

7952− ?: ?=(%bad -.fit) [%| ["recursive mold cell does not fit its source shape" ~]]

7953− [%& target state.p.value(sub sub.fit, next next.fit)]

7954− ?: ?=(%call -.e) (infer-contextual-call e target env state)

7955− ?: (single-structured-pattern e)

7956− (infer-single-case-branch e env state `[target context])

7957− ?: (cell-binder-pattern e)

7958− (infer-cell-branch e env state `[target context])

7959− :: In a loobean-singleton context retain the written loobean noun;

7960− :: the usual final fit decides whether that value is permitted.

7961− =/ singleton=(unit itype)

7962− ?. ?=(%lit -.e) ~

7963− ?. =(%loobean form.lit.e) ~

7964− ?. ?=(%const -.target) ~

7965− ?. =(%loobean form.literal.target) ~

7966− `[%const lit.e]

7967− ?^ singleton [%& u.singleton state]

7968− =/ known=(unit iresult)

7969− ?: ?=(%branch -.e) (known-union-subject subject.e env state)

7970− ~

7971− ?: &(?=(^ known) ?=(%| -.u.known) !(duplicate-loobean-arms e)) u.known

7972− ?: &(?=(^ known) ?=(%& -.u.known) ?=(~ (unit-union-payload (itype-normalize typ.p.u.known sub.state.p.u.known))))

7973− (infer-known-union-context-subject e target env u.known context)

9063+ ?~ cases found

9064+ =/ c=itype i.cases

9065+ ?: ?=(%cell -.c) $(cases t.cases)

9066+ ?. ?=(%const -.c) |

9067+ ?: =(noun val.literal.c)

9068+ ?: found |

9069+ $(cases t.cases, found &)

9070+ $(cases t.cases)

9071+::

9072+:: Select a written literal-headed case only when every competing case is

9073+:: also an explicit singleton-headed cell and exactly one matches. Opaque,

9074+:: variable-bound and differently shaped cases keep inference unchanged.

9075+:: This first slice supplies context to a directly called payload. Plain

9076+:: literal data and other expressions retain their existing inference path.

9077+++ contextual-atomic-arguments

9078+ |= args=(list expr)

9079+ ^- ?

9080+ ?~ args &

9081+ ?. ?=(?(%lit %wing %ctor) -.i.args) |

9082+ $(args t.args)

9083+++ contextual-direct-payload-call

9084+ |= e=expr

9085+ ^- ?

9086+ ?: ?=(%group -.e) $(e inner.e)

9087+ ?. ?=(%call -.e) |

9088+ ?. ?=(%wing -.head.e) |

9089+ ?~ args.e |

9090+ (contextual-atomic-arguments args.e)

9091+::

9092+:: A walked variable may have concealed a union inside a substituted

9093+:: structure before this arm was called. Decline in that case rather than

9094+:: deriving provenance from the already-walked type.

9095+++ contextual-simple-sub

9096+ |= sub=isub

9097+ ^- ?

9098+ ?~ sub &

9099+ ?: ?=(?(%cell %face %fn %union %collection) -.val.i.sub) |

9100+ $(sub t.sub)

9101+::

9102+:: Check the syntactic root before scanning; scan substitutions once.

9103+++ grec-direct-context

9104+ |= [expected=itype sub=isub]

9105+ ^- ?

9106+ =/ left=@ud 4.096

9107+ |-

9108+ ?: ?=(%face -.expected)

9109+ ?: =(0 left) |

9110+ $(expected body.expected, left (dec left))

9111+ ?. ?=(%grec -.expected) |

9112+ ?~ sub &

9113+ ?: =(0 left) |

9114+ ?: ?=(?(%cell %face %fn %union %collection %grec) -.val.i.sub) |

9115+ $(sub t.sub, left (dec left))

9116+++ contextual-direct-union

9117+ |= target=itype

9118+ ^- ?

9119+ ?: ?=(%face -.target) $(target body.target)

9120+ ?=(%union -.target)

9121+++ contextual-tagged-case

9122+ |= [target=itype tag=@ sub=isub]

9123+ ^- (unit itype)

9124+ ?. ?=(%union -.target) ~

9125+ =/ remaining=(list itype) cases.target

9126+ =/ found=(unit itype) ~

9127+ =/ seen=(set @) *(set @)

9128+ |-

9129+ ?~ remaining found

9130+ =/ c=itype i.remaining

9131+ ?. ?=(%cell -.c) ~

9132+ =/ head=itype hed.c

9133+ ?. ?=(%const -.head) ~

9134+ ?: (~(has in:..zuse seen) val.literal.head) ~

9135+ =. seen (~(put in:..zuse seen) val.literal.head)

9136+ ?: =(tag val.literal.head)

9137+ $(remaining t.remaining, found `c)

9138+ $(remaining t.remaining)

9139+::

9140+:: A bounded syntactic screen: no nested branch, cast, gate or local body

9141+:: can re-enter cell-branch retry during either inference attempt.

9142+++ closed-cell-retry-safe

9143+ |= [todo=(list expr) fuel=@ud]

9144+ ^- ?

9145+ ?~ todo &

9146+ ?: =(0 fuel) |

9147+ =/ e=expr i.todo

9148+ =. fuel (dec fuel)

9149+ ?+ -.e |

9150+ %lit $(todo t.todo)

9151+ %wing $(todo t.todo)

9152+ %ctor $(todo t.todo)

9153+ %path $(todo t.todo)

9154+ %crash $(todo t.todo)

9155+ %str

9156+ ?. (levy pieces.e |=(p=piece ?=(%text -.p))) |

9157+ $(todo t.todo)

9158+ %group $(todo [inner.e t.todo])

9159+ %pair $(todo [val.e t.todo])

9160+ %unit $(todo [val.e t.todo])

9161+ %list $(todo (weld items.e t.todo))

9162+ %tuple $(todo (weld (turn items.e |=(i=item val.i)) t.todo))

9163+ %change $(todo (weld (turn edits.e |=(ed=edit val.ed)) t.todo))

9164+ %call $(todo [head.e (weld args.e t.todo)])

9165+ %trace $(todo [val.e then.e t.todo])

9166+ ==

9167+::

9168+++ closed-cell-sub-safe

9169+ |= [sub=isub fuel=@ud]

9170+ ^- ?

9171+ ?~ sub &

9172+ ?: =(0 fuel) |

9173+ ?: ?=(?(%cell %face %fn %union %collection %grec %jrec %recursive) -.val.i.sub) |

9174+ $(sub t.sub, fuel (dec fuel))

9175+::

9176+++ closed-cell-branch-eligible

9177+ |= [e=expr expected=itype sub=isub]

9178+ ^- ?

9179+ ?. &(?=(%branch -.e) ?=(%cell -.expected) (closed-cell-sub-safe sub 512)) |

9180+ ?~ arms.e |

9181+ ?~ t.arms.e |

9182+ ?^ t.t.arms.e |

9183+ =/ x=arm i.arms.e

9184+ =/ y=arm i.t.arms.e

9185+ ?. &(?=(%lit -.pat.x) ?=(%lit -.pat.y)) |

9186+ ?. &(=(%loobean form.lit.pat.x) =(%loobean form.lit.pat.y)) |

9187+ ?: =(val.lit.pat.x val.lit.pat.y) |

9188+ (closed-cell-retry-safe ~[subject.e val.x val.y] 512)

9189+::

9190+:: Attempt ordinary inference first; retry from the same state only for

9191+:: the bounded non-reentrant syntax above. Preserve original value faces.

9192+++ infer-closed-cell-branch

9193+ |= [e=expr expected=itype env=ienv state=istate context=span]

9194+ ^- iresult

9195+ ?> (closed-cell-branch-eligible e expected sub.state)

9196+ ?> ?=(%branch -.e)

9197+ ?> ?=(^ arms.e)

9198+ ?> ?=(^ t.arms.e)

9199+ =/ ordinary=iresult (infer-fragment e env state)

9200+ =/ ordinary-good=?

9201+ ?: ?=(%| -.ordinary) |

9202+ =/ fit=ifit (itype-fit typ.p.ordinary expected sub.state.p.ordinary next.state.p.ordinary)

9203+ ?=(%ok -.fit)

9204+ ?: ordinary-good ordinary

9205+ =/ attempt=(unit iresult)

9206+ =/ x=arm i.arms.e

9207+ =/ y=arm i.t.arms.e

9208+ =/ subject=iresult (infer-fragment subject.e env state)

9209+ ?: ?=(%| -.subject) ~

9210+ =/ subject-type=itype (itype-normalize typ.p.subject sub.state.p.subject)

9211+ ?: ?=(%union -.subject-type) ~

9212+ =/ su=(unit isub) (itype-unify typ.p.subject [%flag ~] sub.state.p.subject)

9213+ ?~ su ~

9214+ =/ left=iresult (infer-call-context-arg val.x expected env state.p.subject(sub u.su) context)

9215+ ?: ?=(%| -.left) ~

9216+ =/ lf=ifit (itype-fit typ.p.left expected sub.state.p.left next.state.p.left)

9217+ ?. ?=(%ok -.lf) ~

9218+ =/ right=iresult (infer-call-context-arg val.y expected env state.p.left(sub sub.lf, next next.lf) context)

9219+ ?: ?=(%| -.right) ~

9220+ =/ rf=ifit (itype-fit typ.p.right expected sub.state.p.right next.state.p.right)

9221+ ?. ?=(%ok -.rf) ~

9222+ =/ sub=isub sub.rf

9223+ =/ next=@ud next.rf

9224+ =/ lt=itype (itype-normalize typ.p.left sub)

9225+ =/ rt=itype (itype-normalize typ.p.right sub)

9226+ =/ et=itype (itype-normalize expected sub)

9227+ ?. =(lt rt) ~

9228+ ?: |(?=(^ (itype-vars lt)) ?=(^ (itype-vars rt)) ?=(^ (itype-vars et))) ~

9229+ ?: |((itype-has-tag lt) (itype-has-tag rt) (itype-has-tag et)) ~

9230+ =/ lcheck=ifit (itype-fit typ.p.left expected sub next)

9231+ ?. ?=(%ok -.lcheck) ~

9232+ ?. &(=(sub.lcheck sub) =(next.lcheck next)) ~

9233+ =/ rcheck=ifit (itype-fit typ.p.right expected sub next)

9234+ ?. ?=(%ok -.rcheck) ~

9235+ ?. &(=(sub.rcheck sub) =(next.rcheck next)) ~

9236+ `[%& typ.p.left state.p.right(sub sub, next next)]

9237+ ?~ attempt ordinary

9238+ u.attempt

9239+::

9240+++ infer-call-context-arg

9241+ |= [e=expr expected=itype env=ienv state=istate context=span]

9242+ ^- iresult

9243+ ?: &(?=(^ defer.state) ?=(%branch -.e)) (infer-fragment e env state)

9244+ ?: ?=(%pair -.e) $(e (pair-as-cell e))

9245+ ?: ?=(%group -.e) $(e inner.e)

9246+ ?: &(?=(%body -.e) ?=(~ defs.e)) $(e final.e)

9247+ ?: ?=(%trace -.e)

9248+ =/ traced=iresult (infer-fragment val.e env state)

9249+ ?: ?=(%| -.traced) traced

9250+ $(e then.e, state state.p.traced)

9251+ =/ target=itype (itype-walk expected sub.state)

9252+ |-

9253+ ?: ?=(%face -.target) $(target (itype-walk body.target sub.state))

9254+ ?: (explicit-proj-call e env state)

9255+ (infer-proj-context e expected env state context)

9256+ :: Experimental construction only for a source-proven direct target.

9257+ :: Decline any walked structural binding to retain raw-variable provenance.

9258+ ?: &(?=(%grec -.target) ?=(%tuple -.e) (grec-direct-context expected sub.state))

9259+ =/ unfolded=(unit [view=itype left=@ud]) (grec-unfold-view target jrec-fuel.state)

9260+ ?~ unfolded [%| ["recursive mold unfolding needs unsupported inference" ~]]

9261+ ?~ items.e [%| ["recursive mold constructor needs unsupported inference" ~]]

9262+ =/ first=item i.items.e

9263+ ?. &(?=(~ face.first) ?=(%lit -.val.first) =(%term form.lit.val.first))

9264+ [%| ["recursive mold constructor needs unsupported inference" ~]]

9265+ =/ chosen=(unit itype) (contextual-tagged-case view.u.unfolded val.lit.val.first sub.state)

9266+ ?~ chosen [%| ["recursive mold constructor has no matching case" ~]]

9267+ =/ value=iresult (infer-call-context-items items.e u.chosen env state(jrec-fuel left.u.unfolded) context)

9268+ ?: ?=(%| -.value) value

9269+ =/ fit=ifit (itype-fit typ.p.value u.chosen sub.state.p.value next.state.p.value)

9270+ ?: ?=(%unknown -.fit) [%| ["recursive mold case needs unsupported inference" ~]]

9271+ ?: ?=(%bad -.fit) [%| ["recursive mold case does not fit its source shape" ~]]

9272+ [%& target state.p.value(sub sub.fit, next next.fit)]

9273+ :: Only the source-proven one-layer cell is exposed. Each recursive

9274+ :: descent consumes one written tuple; named values use ordinary fit.

9275+ ?: &(?=(%jrec -.target) ?=(%lit -.e) =(%null form.lit.e))

9276+ ?: =(0 jrec-fuel.state) [%| ["recursive mold unfolding needs unsupported inference" ~]]

9277+ [%& target state(jrec-fuel (dec jrec-fuel.state))]

9278+ ?: &(?=(%jrec -.target) ?=(%tuple -.e))

9279+ ?: =(0 jrec-fuel.state) [%| ["recursive mold unfolding needs unsupported inference" ~]]

9280+ =. state state(jrec-fuel (dec jrec-fuel.state))

9281+ =/ shape=itype

9282+ [%cell [%face head.target [%atom aura.target]] [%face tail.target target]]

9283+ =/ value=iresult (infer-call-context-items items.e shape env state context)

9284+ ?: ?=(%| -.value) value

9285+ =/ fit=ifit (itype-fit typ.p.value shape sub.state.p.value next.state.p.value)

9286+ ?: ?=(%unknown -.fit) [%| ["recursive mold cell constraint needs unsupported inference" ~]]

9287+ ?: ?=(%bad -.fit) [%| ["recursive mold cell does not fit its source shape" ~]]

9288+ [%& target state.p.value(sub sub.fit, next next.fit)]

9289+ ?: ?=(%call -.e) (infer-contextual-call e target env state)

9290+ =/ empty-list=(unit iresult) (empty-list-null-branch e env state `[target context])

9291+ ?^ empty-list u.empty-list

9292+ ?: (single-structured-pattern e)

9293+ ?> ?=(%branch -.e)

9294+ =/ empty-union=(unit iresult) (known-empty-union-wing subject.e env state)

9295+ ?^ empty-union (infer-known-union-context-subject e target env u.empty-union context)

9296+ =/ single=(unit iresult) (grec-single-wing-subject subject.e env state)

9297+ ?^ single (infer-known-union-context-subject e target env u.single context)

9298+ (infer-single-case-branch e env state `[target context])

9299+ ?: (cell-binder-pattern e)

9300+ (infer-cell-branch e env state `[target context])

9301+ :: In an explicit singleton context retain the written loobean noun;

9302+ :: the ordinary singleton fit compares its noun, not its spelling.

9303+ =/ singleton=(unit itype)

9304+ ?. ?=(%lit -.e) ~

9305+ ?. =(%loobean form.lit.e) ~

9306+ ?. |(?=(%const -.target) &(?=(%union -.expected) (explicit-singleton-in-union expected val.lit.e))) ~

9307+ `[%const lit.e]

9308+ ?^ singleton [%& u.singleton state]

9309+ =/ known=(unit iresult)

9310+ ?: ?=(%branch -.e) (known-union-subject subject.e env state)

9311+ ~

9312+ ?: &(?=(^ known) ?=(%| -.u.known) !(duplicate-loobean-arms e)) u.known

9313+ ?: &(?=(^ known) ?=(%& -.u.known) ?=(~ (unit-union-payload (itype-normalize typ.p.u.known sub.state.p.u.known))))

9314+ (infer-known-union-context-subject e target env u.known context)

79749315 ?: &(?=(%union -.target) ?=(%unit -.e))

79759316 (infer-unit-context e target env state context)

9317+ ?: (closed-cell-branch-eligible e expected sub.state)

9318+ (infer-closed-cell-branch e expected env state context)

79769319 ?: &(?=(%flag -.target) (context-union-branch e))

79779320 (infer-union-context e target env state context)

79789321 ?: &(?=(%union -.target) (context-union-branch e))

@@ -7981,17 +9324,53 @@

79819324 (infer-union-context e target env state context)

79829325 ?: &(?=(%collection -.target) =(%list name.target) (context-list-expression e))

79839326 (infer-list-context e target env state context)

9327+ :: A literal-headed tuple can receive the unique case's payload

9328+ :: context. The ordinary final fit still checks the complete union.

9329+ =/ selected=(unit itype)

9330+ ?. &((contextual-simple-sub sub.state) (contextual-direct-union expected) ?=(%union -.target) ?=(%tuple -.e) ?=(^ items.e)) ~

9331+ ?~ t.items.e ~

9332+ ?^ t.t.items.e ~

9333+ ?. (contextual-direct-payload-call val.i.t.items.e) ~

9334+ =/ first=item i.items.e

9335+ ?. &(?=(~ face.first) ?=(%lit -.val.first) |(=(%term form.lit.val.first) =(%null form.lit.val.first) =(%loobean form.lit.val.first))) ~

9336+ (contextual-tagged-case target val.lit.val.first sub.state)

9337+ ?^ selected

9338+ ?> ?=(%tuple -.e)

9339+ :: On this bounded shallow-call shape, preserve any inference that

9340+ :: already fits before trying the new contextual path. Neither pass

9341+ :: can recursively select a nested tuple from the atomic arguments.

9342+ =/ ordinary=(unit iresult)

9343+ =/ initial=iresult (infer-fragment e env state)

9344+ ?: ?=(%| -.initial) ~

9345+ =/ fit=ifit (itype-fit typ.p.initial target sub.state.p.initial next.state.p.initial)

9346+ ?. ?=(%ok -.fit) ~

9347+ `initial

9348+ ?^ ordinary u.ordinary

9349+ =/ value=iresult (infer-call-context-items items.e u.selected env state context)

9350+ ?: ?=(%| -.value) value

9351+ =/ fit=ifit (itype-fit typ.p.value u.selected sub.state.p.value next.state.p.value)

9352+ ?: ?=(%unknown -.fit) [%| ["tagged case needs unsupported inference" ~]]

9353+ ?: ?=(%bad -.fit) [%| ["tagged case does not fit its expected type" ~[[context "expected union case"] [(span-of e) "value"]]]]

9354+ [%& typ.p.value state.p.value(sub sub.fit, next next.fit)]

79849355 ?: &(?=(%cell -.target) ?=(%tuple -.e))

79859356 (infer-call-context-items items.e target env state context)

79869357 (infer-fragment e env state)

79879358::

79889359:: Preserve each written face; the final complete sample fit checks faces.

9360+:: A tuple or positional field face belongs to the enclosing sample,

9361+:: not to the expression at that position. A second face, if present,

9362+:: is part of the value's own expected type.

9363+++ projection-field-target

9364+ |= expected=itype

9365+ ^- itype

9366+ ?:(?=(%face -.expected) body.expected expected)

9367+::

79899368++ infer-call-context-items

79909369 |= [items=(list item) expected=itype env=ienv state=istate context=span]

79919370 ^- iresult

79929371 ?~ items [%| ["empty cell is not supported by partial inference" ~]]

79939372 ?~ t.items

7994− =/ last=iresult (infer-call-context-arg val.i.items expected env state context)

9373+ =/ last=iresult (infer-call-context-arg val.i.items (projection-field-target expected) env state context)

79959374 ?: ?=(%| -.last) last

79969375 =/ typ=itype typ.p.last

79979376 =. typ ?~(face.i.items typ [%face u.face.i.items typ])

@@ -8000,7 +9379,7 @@

80009379 |-

80019380 ?: ?=(%face -.target) $(target (itype-walk body.target sub.state))

80029381 ?. ?=(%cell -.target) (infer-simple-items items env state)

8003− =/ head=iresult (infer-call-context-arg val.i.items hed.target env state context)

9382+ =/ head=iresult (infer-call-context-arg val.i.items (projection-field-target hed.target) env state context)

80049383 ?: ?=(%| -.head) head

80059384 =/ typ=itype typ.p.head

80069385 =. typ ?~(face.i.items typ [%face u.face.i.items typ])

@@ -8012,13 +9391,13 @@

80129391 |= [args=(list expr) expected=itype env=ienv state=istate context=span]

80139392 ^- iresult

80149393 ?~ args [%| ["call has no argument" ~]]

8015− ?~ t.args (infer-call-context-arg i.args expected env state context)

9394+ ?~ t.args (infer-call-context-arg i.args (projection-field-target expected) env state context)

80169395 =/ target=itype (itype-walk expected sub.state)

80179396 |-

80189397 ?: ?=(%face -.target) $(target (itype-walk body.target sub.state))

80199398 ?. ?=(%cell -.target)

80209399 (infer-simple-items (turn args |=(a=expr [(span-of a) ~ a])) env state)

8021− =/ head=iresult (infer-call-context-arg i.args hed.target env state context)

9400+ =/ head=iresult (infer-call-context-arg i.args (projection-field-target hed.target) env state context)

80229401 ?: ?=(%| -.head) head

80239402 =/ tail=iresult (infer-call-context-args t.args tal.target env state.p.head context)

80249403 ?: ?=(%| -.tail) tail

@@ -8050,7 +9429,7 @@

80509429 ?~ pats [%& ~]

80519430 ?. ?=(%bind -.i.pats) [%| 'branch pattern is not supported by partial inference']

80529431 =/ name=term name.i.pats

8053− ?: |(?=(^ (ienv-lookup name env)) (lien globals |=(n=term =(n name))) (lien seen |=(n=term =(n name))))

9432+ ?: |(=(name %proj) ?=(^ (ienv-lookup name env)) (lien globals |=(n=term =(n name))) (lien seen |=(n=term =(n name))))

80549433 [%| 'pattern shadows a name']

80559434 =/ rest=(each (list term) @t) $(pats t.pats, seen [name seen])

80569435 ?: ?=(%| -.rest) rest

@@ -8075,7 +9454,7 @@

80759454 ?~ t.names |

80769455 =. typ (itype-walk typ sub)

80779456 ?: ?=(%cell -.typ) $(typ tal.typ, names t.names)

8078− |(?=(%union -.typ) ?=(%collection -.typ) ?=(%recursive -.typ) ?=(%jrec -.typ) ?=(%noun -.typ) ?=(%fn -.typ) ?=(%tag -.typ))

9457+ |(?=(%union -.typ) ?=(%collection -.typ) ?=(%recursive -.typ) ?=(%jrec -.typ) ?=(%grec -.typ) ?=(%noun -.typ) ?=(%fn -.typ) ?=(%tag -.typ))

80799458::

80809459++ cell-binder-pattern

80819460 |= e=expr

@@ -8133,13 +9512,20 @@

81339512 %avar

81349513 ?: (lth id.t 26) [(add 65 id.t) ~]

81359514 "T{<id.t>}"

9515+ %rvar

9516+ ?: (lth id.t 26) [(add 65 id.t) ~]

9517+ "T{<id.t>}"

81369518 %nvar

81379519 ?: (lth id.t 26) [(add 65 id.t) ~]

81389520 "T{<id.t>}"

9521+ %rnvar

9522+ ?: (lth id.t 26) [(add 65 id.t) ~]

9523+ "T{<id.t>}"

81399524 %atom "@{(trip aura.t)}"

81409525 %any-atom "@"

81419526 %flag "?"

81429527 %noun "*"

9528+ %empty "!!"

81439529 %tag (trip txt.literal.t)

81449530 %const (trip txt.literal.t)

81459531 %union

@@ -8148,6 +9534,7 @@

81489534 "({(trip u.label.t)} {(show-itype-cases args.t sub)})"

81499535 %recursive ?~(label.t "recursive mold" (trip u.label.t))

81509536 %jrec ?~(label.t "recursive mold" (trip u.label.t))

9537+ %grec ?~(label.t "recursive mold" "({(trip u.label.t)} {(show-itype-cases args.t sub)})")

81519538 %collection "({(trip name.t)} {(show-itype-cases args.t sub)})"

81529539 %face "[{(trip name.t)}={(show-itype-context body.t sub)}]"

81539540 %fn "$-({(show-itype-context sample.t sub)} {(show-itype-context product.t sub)})"

@@ -8183,17 +9570,21 @@

81839570 ^- ?

81849571 ?- -.typ

81859572 %nvar &

9573+ %rnvar &

81869574 %var |

81879575 %avar |

9576+ %rvar |

81889577 %atom |

81899578 %any-atom |

81909579 %flag |

81919580 %noun |

9581+ %empty |

81929582 %tag |

81939583 %const |

81949584 %union |((lien cases.typ |=(c=itype (itype-has-nvar c))) (lien args.typ |=(c=itype (itype-has-nvar c))))

81959585 %recursive |

81969586 %jrec |

9587+ %grec (lien args.typ |=(c=itype (itype-has-nvar c)))

81979588 %collection (lien args.typ |=(c=itype (itype-has-nvar c)))

81989589 %face $(typ body.typ)

81999590 %fn |($(typ sample.typ) $(typ product.typ))

@@ -8204,7 +9595,7 @@

82049595 |= [label=tape typ=itype sub=isub]

82059596 ^- tape

82069597 =/ normalized=itype (itype-normalize typ sub)

8207− ?: |(?=(%var -.normalized) ?=(%avar -.normalized) (itype-has-nvar normalized) (itype-has-tag normalized) (itype-has-union normalized)) label

9598+ ?: |(?=(%var -.normalized) ?=(%avar -.normalized) ?=(%rvar -.normalized) (itype-has-nvar normalized) (itype-has-tag normalized) (itype-has-union normalized)) label

82089599 ?: (itype-has-hidden-recursive normalized) label

82099600 =/ vars=(list @ud) (unique-type-vars (itype-vars normalized))

82109601 ?: (gth (lent vars) 26) label

@@ -8226,6 +9617,7 @@

82269617 ?+ -.resolved ~

82279618 %var `id.resolved

82289619 %avar `id.resolved

9620+ %rvar `id.resolved

82299621 ==

82309622 ?~ ident $(caps t.caps)

82319623 ?: =(n u.ident) &

@@ -8240,6 +9632,7 @@

82409632 ?+ -.resolved ~

82419633 %var `id.resolved

82429634 %avar `id.resolved

9635+ %rvar `id.resolved

82439636 ==

82449637 ?~ ident $(caps t.caps)

82459638 ?: =(n u.ident) `i.caps

@@ -8254,6 +9647,7 @@

82549647 ?+ -.resolved ~

82559648 %var `id.resolved

82569649 %avar `id.resolved

9650+ %rvar `id.resolved

82579651 ==

82589652 ?~ ident $(caps t.caps)

82599653 =/ found=(unit icap) (cap-with-id u.ident t.caps sub)

@@ -8269,6 +9663,7 @@

82699663 ?+ -.resolved ~

82709664 %var `id.resolved

82719665 %avar `id.resolved

9666+ %rvar `id.resolved

82729667 ==

82739668 ?~ ident &

82749669 ?: (cap-id-in u.ident t.caps sub) &

@@ -8283,8 +9678,8 @@

82839678 ^- ?

82849679 ?~ caps |

82859680 =/ resolved=itype (itype-walk [%var id.i.caps] sub)

8286− ?: ?=(%avar -.resolved)

8287− ?: =(n id.resolved) &

9681+ ?: |(?=(%avar -.resolved) ?=(%rvar -.resolved))

9682+ ?: =(n +.resolved) &

82889683 $(caps t.caps)

82899684 $(caps t.caps)

82909685::

@@ -8294,16 +9689,20 @@

82949689 ?- -.t

82959690 %var |

82969691 %avar =(n id.t)

9692+ %rvar =(n id.t)

82979693 %nvar |

9694+ %rnvar |

82989695 %atom |

82999696 %any-atom |

83009697 %flag |

83019698 %noun |

9699+ %empty |

83029700 %tag |

83039701 %const |

83049702 %union |((lien cases.t |=(c=itype (has-atom-var n c))) (lien args.t |=(c=itype (has-atom-var n c))))

83059703 %recursive |

83069704 %jrec |

9705+ %grec (lien args.t |=(c=itype (has-atom-var n c)))

83079706 %collection (lien args.t |=(c=itype (has-atom-var n c)))

83089707 %face $(t body.t)

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

@@ -8343,6 +9742,10 @@

83439742 =/ out=tape ""

83449743 |-

83459744 ?~ vars out

9745+ ?: (itype-var-is-restricted i.vars t)

9746+ =/ sep=tape ?:(printed ", " " where ")

9747+ =/ clause=tape "{sep}{(show-itype [%rvar i.vars] ~)} is an atom other than ?"

9748+ $(vars t.vars, printed &, out (weld out clause))

83469749 ?: (itype-var-is-atom i.vars t)

83479750 =/ sep=tape ?:(printed ", " " where ")

83489751 =/ clause=tape "{sep}{(show-itype [%avar i.vars] ~)} is an atom"

@@ -8443,6 +9846,8 @@

84439846++ infer-recursive-gate

84449847 |= [d=def env=ienv state=istate]

84459848 ^- iresult

9849+ ?^ defer.state [%| ["deferred recursive inference is unsupported" ~]]

9850+ =. gate-defs.state ~

84469851 ?. ?=(%value -.d) [%| ["recursive definition is not a gate" ~]]

84479852 ?. |(?=(%gate -.val.d) ?=(%gate-wide -.val.d))

84489853 [%| ["recursive definition is not a gate" ~]]

@@ -8652,6 +10057,7 @@

865210057 ?: (constrained-capitals caps.entry sub.state)

865310058 [%| ["explicit capital constraints are not supported by partial inference" ~]]

865410059 =/ typ=itype (itype-normalize typ.entry sub.state)

10060+ ?: (itype-has-nvar typ) [%| ["recursive group needs unsupported inference" ~]]

865510061 ?: |((itype-has-tag typ) (itype-has-hidden-generic typ) (itype-has-hidden-recursive typ) (unsupported-atom-vars typ caps.entry binders.state sub.state))

865610062 [%| ["recursive group needs unsupported inference" ~]]

865710063 =/ free=(list @ud) (weld (free-env-vars env sub.state) (free-cap-vars caps.outer sub.state))

@@ -8665,18 +10071,21 @@

866510071++ infer-gate-group

866610072 |= [ds=(list def) env=ienv state=istate]

866710073 ^- ilocal-result

10074+ ?^ defer.state [%| ["deferred recursive inference is unsupported" ~]]

866810075 =/ names=(list term) (global-value-names ds)

866910076 ?. (levy names |=(n=term (unique-value-name n names)))

867010077 [%| ["recursive group contains duplicate names" ~]]

867110078 ?: (lien names |=(n=term ?=(^ (ienv-lookup n env))))

867210079 [%| ["recursive group shadows a name" ~]]

8673− =/ scoped=istate state(globals (weld names globals.state))

10080+ =/ scoped=istate state(globals (weld names globals.state), gate-defs ~)

867410081 =/ seeded=igate-seeds (seed-gate-group ds env scoped)

867510082 ?: ?=(%| -.seeded) seeded

867610083 =/ seeds=ienv (group-seed-env entries.p.seeded ~)

867710084 =/ body=igate-seeds (infer-gate-group-bodies entries.p.seeded seeds state.p.seeded)

867810085 ?: ?=(%| -.body) body

867910086 :: Per-member ownership through mutual recursion is not implemented.

10087+ ?: !=(projections.state.p.body projections.state)

10088+ [%| ["record projection in recursive groups needs unsupported inference" ~]]

868010089 ?: !=(holes.state.p.body holes.state)

868110090 [%| ["holes in recursive groups need unsupported inference" ~]]

868210091 ?: (pending-tags tags.state.p.body sub.state.p.body)

@@ -8685,31 +10094,29 @@

868510094 ?: ?=(%| -.schemes) schemes

868610095 [%& [(weld p.schemes env) state.p.body(globals globals.state)]]

868710096::

10097+++ width-finalize

10098+ |= [ps=(list iwprojection) sub=isub visible=(list @ud)]

10099+ ^- (unit (list iwprojection))

10100+ ?~ ps `~

10101+ ?: (lien t.ps |=(p=iwprojection =(at.p at.i.ps))) ~

10102+ =/ src=itype (default-decimals (itype-normalize source.i.ps sub))

10103+ =/ dst=itype (default-decimals (itype-normalize target.i.ps sub))

10104+ ?: |((itype-has-nvar src) (itype-has-nvar dst) (itype-has-tag src) (itype-has-tag dst)) ~

10105+ =/ vars=(list @ud) (weld (itype-vars src) (itype-vars dst))

10106+ ?. (levy vars |=(n=@ud (lien visible |=(v=@ud =(n v))))) ~

10107+ =/ rest=(unit (list iwprojection)) $(ps t.ps)

10108+ ?~ rest ~

10109+ =/ entry=iwprojection i.ps

10110+ =. entry entry(source src, target dst)

10111+ `[entry u.rest]

10112+::

868810113++ add-supported-defs

8689− |= [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)]

8690− ^- ienv

8691− ?~ ds env

8692− =/ d=def i.ds

8693− ?: ?=(%mold -.d) $(ds t.ds)

8694− ?. (unique-value-name name.d globals) $(ds t.ds)

8695− ?^ (ienv-lookup name.d env) $(ds t.ds)

8696− =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

8697− =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | at top prelude ~ 256]

8698− =. initial (reserve-def-caps val.d initial)

8699− =/ result=iresult (infer-fragment val.d env initial)

8700− =? result ?=(%| -.result) (infer-recursive-gate d env initial)

8701− ?: ?=(%| -.result) $(ds t.ds)

8702− =. 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)))

8703− ?^ (unresolved-hole holes.state.p.result holes.initial state.p.result) $(ds t.ds)

8704− ?: (constrained-capitals caps.state.p.result sub.state.p.result) $(ds t.ds)

8705− =/ typ=itype (default-decimals (itype-normalize typ.p.result sub.state.p.result))

8706− ?: |((pending-tags tags.state.p.result sub.state.p.result) (itype-has-tag typ)) $(ds t.ds)

8707− ?: (unsupported-atom-vars typ caps.state.p.result binders.state.p.result sub.state.p.result) $(ds t.ds)

8708− =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

8709− ?: (gth (lent vars) 26) $(ds t.ds)

8710− $(ds t.ds, env [[name.d [typ vars]] env])

10114+ |= [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)]

10115+ ^- [env=ienv artifacts=(list iwidth-definition)]

10116+ (add-supported-defs-core ds all-defs checked heads env molds globals externals surs mark-externals marks jimports reserved-molds at prelude artifacts ~)

871110117::

8712−+$ iresolved [env=ienv grouped=(list term)]

10118+

10119++$ iresolved [env=ienv grouped=(list term) artifacts=(list iwidth-definition)]

871310120+$ iadj (map term (list term))

871410121+$ ivisited (map term ?)

871510122+$ iwork (list [name=term done=?])

@@ -8803,9 +10210,9 @@

880310210 (lien (graph-edges i.component graph) |=(x=term =(x i.component)))

880410211::

880510212++ add-groups

8806− |= [ds=(list def) components=icomponents graph=iadj env=ienv grouped=(list term) state=istate]

10213+ |= [ds=(list def) components=icomponents graph=iadj env=ienv grouped=(list term) artifacts=(list iwidth-definition) state=istate]

880710214 ^- iresolved

8808− ?~ components [env grouped]

10215+ ?~ components [env grouped artifacts]

880910216 =/ component=(list term) i.components

881010217 ?. (graph-cycle component graph) $(components t.components)

881110218 ?: (lien component |=(n=term ?=(^ (ienv-lookup n env)))) $(components t.components)

@@ -8822,19 +10229,63 @@

882210229++ resolve-groups

882310230 |= [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)]

882410231 ^- iresolved

10232+ (resolve-groups-core ds molds globals externals surs mark-externals marks jimports reserved-molds at prelude ~)

10233+::

10234+

10235+++ add-supported-defs-core

10236+ |= [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)])]

10237+ ^- [env=ienv artifacts=(list iwidth-definition)]

10238+ ?~ ds [env artifacts]

10239+ =/ d=def i.ds

10240+ ?: ?=(%mold -.d) $(ds t.ds)

10241+ ?. (unique-value-name name.d globals) $(ds t.ds)

10242+ ?^ (ienv-lookup name.d env) $(ds t.ds)

10243+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

10244+ =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | at top prelude ~ 256 ~ ~ ~ ~ ~ ~]

10245+ =. grec-index.initial index

10246+ =. gate-defs.initial checked

10247+ =. head-evidence.initial heads

10248+ =. initial (reserve-def-caps val.d initial)

10249+ =/ result=iresult (infer-fragment val.d env initial)

10250+ =? result ?=(%| -.result) (infer-recursive-gate d env initial)

10251+ ?: ?=(%| -.result) $(ds t.ds)

10252+ =. state.p.result (promote-restricted-numbers state.p.result env)

10253+ =. 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)))

10254+ ?^ (unresolved-hole holes.state.p.result holes.initial state.p.result) $(ds t.ds)

10255+ ?: (constrained-capitals caps.state.p.result sub.state.p.result) $(ds t.ds)

10256+ =/ typ=itype (default-decimals (itype-normalize typ.p.result sub.state.p.result))

10257+ ?: |((pending-tags tags.state.p.result sub.state.p.result) (itype-has-tag typ)) $(ds t.ds)

10258+ ?: (unsupported-atom-vars typ caps.state.p.result binders.state.p.result sub.state.p.result) $(ds t.ds)

10259+ =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

10260+ ?: (gth (lent vars) 26) $(ds t.ds)

10261+ =/ finalized=(unit (list iwprojection))

10262+ (width-finalize projections.state.p.result sub.state.p.result vars)

10263+ ?~ finalized $(ds t.ds)

10264+ =? artifacts ?=(^ u.finalized)

10265+ [[name.d val.d typ sub.state.p.result (flop u.finalized)] artifacts]

10266+ =? checked |(?=(%gate -.val.d) ?=(%gate-wide -.val.d)) (~(put by checked) name.d d)

10267+ $(ds t.ds, env [[name.d [typ vars]] env], checked checked)

10268+::

10269+++ resolve-groups-core

10270+ |= [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)])]

10271+ ^- iresolved

882510272 =/ env=ienv ~

882610273 =/ grouped=(list term) ~

10274+ =/ artifacts=(list iwidth-definition) ~

882710275 =/ names=(list term) (global-value-names ds)

882810276 =/ nameset=ivisited (graph-nameset names ~)

882910277 =/ graph=iadj (graph-make-forward ds nameset ~)

883010278 =/ components=icomponents (graph-components ds names)

883110279 =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

10280+ =/ heads=(unit igate-prelude-evidence) (direct-prelude-evidence ds prelude)

883210281 |-

8833− =/ next=ienv (add-supported-defs ds env molds globals externals surs mark-externals marks jimports reserved-molds at prelude)

8834− =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | at top prelude ~ 256]

8835− =/ out=iresolved (add-groups ds components graph next grouped initial)

10282+ =/ next=[env=ienv artifacts=(list iwidth-definition)]

10283+ (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)

10284+ =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | at top prelude ~ 256 ~ ~ ~ ~ ~ ~]

10285+ =. grec-index.initial index

10286+ =/ out=iresolved (add-groups ds components graph env.next grouped artifacts.next initial)

883610287 ?: =(env env.out) out

8837− $(env env.out, grouped grouped.out)

10288+ $(env env.out, grouped grouped.out, artifacts artifacts.out)

883810289::

883910290++ resolve-supported-defs

884010291 |= [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)]

@@ -9080,6 +10531,257 @@

908010531 %overlap

908110532 %unknown

908210533::

10534+:: A source-only fallback for literal-tagged cells and one-hop local

10535+:: generic applications. It screens all work before ordinary inference.

10536+++ union-simple-shape-budget

10537+ |= [s=shape fuel=@ud vars=(unit (list @t))]

10538+ ^- (unit @ud)

10539+ ?: =(0 fuel) ~

10540+ =. fuel (dec fuel)

10541+ ?- -.s

10542+ ?(%aura %noun %void %flag) `fuel

10543+ %tvar

10544+ ?~ vars `fuel

10545+ ?:((lien u.vars |=(n=@t =(n name.s))) `fuel ~)

10546+ %const

10547+ ?. |(=(%term form.lit.s) =(%null form.lit.s) =(%loobean form.lit.s)) ~

10548+ ?: &(=(%loobean form.lit.s) !|(=(0 val.lit.s) =(1 val.lit.s))) ~

10549+ `fuel

10550+ %cell (union-simple-fields-budget fields.s fuel vars)

10551+ %fn

10552+ =/ left=(unit @ud) $(s sample.s, fuel fuel)

10553+ ?~ left ~

10554+ $(s product.s, fuel u.left)

10555+ * ~

10556+ ==

10557+++ union-simple-fields-budget

10558+ |= [fields=(list field) fuel=@ud vars=(unit (list @t))]

10559+ ^- (unit @ud)

10560+ ?~ fields `fuel

10561+ ?: =(0 fuel) ~

10562+ =/ field-shape=shape

10563+ ?- -.i.fields

10564+ %bare shape.i.fields

10565+ %face shape.i.fields

10566+ %pun [%ref at.i.fields ~[name.i.fields]]

10567+ ==

10568+ =/ head=(unit @ud) (union-simple-shape-budget field-shape (dec fuel) vars)

10569+ ?~ head ~

10570+ $(fields t.fields, fuel u.head)

10571+++ union-source-find

10572+ |= [n=term molds=imolds fuel=@ud]

10573+ ^- (unit [body=shape left=@ud])

10574+ =/ found=(unit shape) ~

10575+ |-

10576+ ?~ molds

10577+ ?~ found ~

10578+ `[u.found fuel]

10579+ ?: =(0 fuel) ~

10580+ ?: =(n name.i.molds)

10581+ ?^ found ~

10582+ $(molds t.molds, fuel (dec fuel), found `body.i.molds)

10583+ $(molds t.molds, fuel (dec fuel))

10584+++ union-source-args-budget

10585+ |= [vars=(list @t) args=(list shape) fuel=@ud]

10586+ ^- (unit @ud)

10587+ =/ seen=(set @t) *(set @t)

10588+ |-

10589+ ?~ vars ?~(args `fuel ~)

10590+ ?~ args ~

10591+ ?: =(0 fuel) ~

10592+ ?: (~(has in:..zuse seen) i.vars) ~

10593+ =/ arg=(unit @ud) (union-simple-shape-budget i.args (dec fuel) ~)

10594+ ?~ arg ~

10595+ $(vars t.vars, args t.args, fuel u.arg, seen (~(put in:..zuse seen) i.vars))

10596+++ union-source-cell-tag

10597+ |= s=shape

10598+ ^- (unit @)

10599+ ?. ?=(%cell -.s) ~

10600+ ?~ fields.s ~

10601+ ?~ t.fields.s ~

10602+ ?. ?=(%bare -.i.fields.s) ~

10603+ =/ head=shape shape.i.fields.s

10604+ ?. ?=(%const -.head) ~

10605+ ?. |(=(%term form.lit.head) =(%null form.lit.head) =(%loobean form.lit.head)) ~

10606+ ?: &(=(%loobean form.lit.head) !|(=(0 val.lit.head) =(1 val.lit.head))) ~

10607+ `val.lit.head

10608+++ union-source-case-tag

10609+ |= [s=shape molds=imolds fuel=@ud]

10610+ ^- (unit [tag=@ left=@ud])

10611+ ?: ?=(%cell -.s)

10612+ =/ tag=(unit @) (union-source-cell-tag s)

10613+ ?~ tag ~

10614+ =/ left=(unit @ud) (union-simple-shape-budget s fuel ~)

10615+ ?~ left ~

10616+ `[u.tag u.left]

10617+ ?. ?=(%apply -.s) ~

10618+ ?. ?=([@ ~] ref.s) ~

10619+ ?: =(0 fuel) ~

10620+ =/ found=(unit [body=shape left=@ud]) (union-source-find i.ref.s molds (dec fuel))

10621+ ?~ found ~

10622+ ?. ?=(%generic -.body.u.found) ~

10623+ ?~ vars.body.u.found ~

10624+ =/ tag=(unit @) (union-source-cell-tag body.body.u.found)

10625+ ?~ tag ~

10626+ =/ args=(unit @ud) (union-source-args-budget vars.body.u.found args.s left.u.found)

10627+ ?~ args ~

10628+ =/ left=(unit @ud) (union-simple-shape-budget body.body.u.found u.args `vars.body.u.found)

10629+ ?~ left ~

10630+ `[u.tag u.left]

10631+++ union-source-distinct-tags

10632+ |= [cases=(list shape) molds=imolds fuel=@ud]

10633+ ^- ?

10634+ =/ seen=(set @) *(set @)

10635+ =/ has-application=? |

10636+ |-

10637+ ?~ cases has-application

10638+ ?: =(0 fuel) |

10639+ =/ item=(unit [tag=@ left=@ud]) (union-source-case-tag i.cases molds (dec fuel))

10640+ ?~ item |

10641+ ?: (~(has in:..zuse seen) tag.u.item) |

10642+ $(cases t.cases, fuel left.u.item, seen (~(put in:..zuse seen) tag.u.item), has-application |(has-application ?=(%apply -.i.cases)))

10643+::

10644+:: This inference-only screen bounds inherited work that the small source

10645+:: slice may consult. It does not authenticate a caller-created state.

10646+++ union-state-leaf

10647+ |= t=itype

10648+ ^- ?

10649+ ?=(?(%var %avar %rvar %nvar %rnvar %atom %any-atom %flag %noun %empty %const) -.t)

10650+++ union-state-params-budget

10651+ |= [params=iparams fuel=@ud]

10652+ ^- (unit @ud)

10653+ ?~ params `fuel

10654+ ?: =(0 fuel) ~

10655+ ?. (union-state-leaf typ.i.params) ~

10656+ $(params t.params, fuel (dec fuel))

10657+++ union-state-sub-budget

10658+ |= [sub=isub fuel=@ud]

10659+ ^- (unit @ud)

10660+ ?~ sub `fuel

10661+ ?: =(0 fuel) ~

10662+ ?. (union-state-leaf val.i.sub) ~

10663+ $(sub t.sub, fuel (dec fuel))

10664+++ union-state-caps-budget

10665+ |= [caps=icaps fuel=@ud]

10666+ ^- (unit @ud)

10667+ ?~ caps `fuel

10668+ ?: =(0 fuel) ~

10669+ $(caps t.caps, fuel (dec fuel))

10670+++ union-state-active-budget

10671+ |= [active=(list term) fuel=@ud]

10672+ ^- (unit @ud)

10673+ ?~ active `fuel

10674+ ?: =(0 fuel) ~

10675+ $(active t.active, fuel (dec fuel))

10676+++ union-state-tags-budget

10677+ |= [tags=(list ipending) fuel=@ud]

10678+ ^- (unit @ud)

10679+ ?~ tags `fuel

10680+ ?: =(0 fuel) ~

10681+ $(tags t.tags, fuel (dec fuel))

10682+++ union-source-state-safe

10683+ |= [state=istate fuel=@ud]

10684+ ^- ?

10685+ ?^ grec-index.state |

10686+ ?^ holes.state |

10687+ ?^ defer.state |

10688+ ?^ obligations.state |

10689+ =/ params=(unit @ud) (union-state-params-budget params.state fuel)

10690+ ?~ params |

10691+ =/ sub=(unit @ud) (union-state-sub-budget sub.state u.params)

10692+ ?~ sub |

10693+ =/ caps=(unit @ud) (union-state-caps-budget caps.state u.sub)

10694+ ?~ caps |

10695+ =/ active=(unit @ud) (union-state-active-budget active.state u.caps)

10696+ ?~ active |

10697+ ?=(^ (union-state-tags-budget tags.state u.active))

10698+::

10699+:: Positive overlap witnesses from parsed, one-hop local source only.

10700+:: Unknown or exhausted work returns no witness, never disjointness.

10701++$ uow-case [at=span head=@ payload=upat]

10702+++ union-overlap-primitive

10703+ |= s=shape

10704+ ^- (unit upat)

10705+ ?- -.s

10706+ %aura `[%atom ~]

10707+ %noun `[%all ~]

10708+ %void `[%empty ~]

10709+ %flag `[%flag ~]

10710+ %const

10711+ ?. |(=(%term form.lit.s) =(%null form.lit.s) =(%loobean form.lit.s)) ~

10712+ ?: &(=(%loobean form.lit.s) !|(=(0 val.lit.s) =(1 val.lit.s))) ~

10713+ `[%atom `val.lit.s]

10714+ * ~

10715+ ==

10716+++ union-overlap-case

10717+ |= [s=shape molds=imolds fuel=@ud]

10718+ ^- (unit [item=uow-case left=@ud])

10719+ ?: =(0 fuel) ~

10720+ =. fuel (dec fuel)

10721+ :: Each body has exactly two fields; an application has exactly one

10722+ :: parameter and one concrete primitive argument. The full mold table

10723+ :: is scanned to establish unique ownership.

10724+ =/ expanded=(unit [body=shape param=(unit [name=@t pat=upat]) left=@ud])

10725+ ?: ?=(%cell -.s) `[s ~ fuel]

10726+ ?. ?=(%apply -.s) ~

10727+ ?. ?=([@ ~] ref.s) ~

10728+ ?. ?=([* ~] args.s) ~

10729+ ?: =(0 fuel) ~

10730+ =/ found=(unit [body=shape left=@ud]) (union-source-find i.ref.s molds (dec fuel))

10731+ ?~ found ~

10732+ ?. ?=(%generic -.body.u.found) ~

10733+ ?. ?=([@ ~] vars.body.u.found) ~

10734+ ?: =(0 left.u.found) ~

10735+ =/ argument=(unit upat) (union-overlap-primitive i.args.s)

10736+ ?~ argument ~

10737+ `[body.body.u.found `[i.vars.body.u.found u.argument] (dec left.u.found)]

10738+ ?~ expanded ~

10739+ =/ body=shape body.u.expanded

10740+ ?. ?=(%cell -.body) ~

10741+ ?. ?=([* * ~] fields.body) ~

10742+ :: Charge the cell, two fields, and the head and payload nodes.

10743+ ?: (lth left.u.expanded 5) ~

10744+ =/ head=(unit @) (union-source-cell-tag body)

10745+ ?~ head ~

10746+ =/ field=field i.t.fields.body

10747+ =/ payload=shape

10748+ ?- -.field

10749+ %bare shape.field

10750+ %face shape.field

10751+ %pun [%ref at.field ~[name.field]]

10752+ ==

10753+ =/ pattern=(unit upat)

10754+ ?: ?=(%tvar -.payload)

10755+ ?~ param.u.expanded ~

10756+ ?. =(name.payload name.u.param.u.expanded) ~

10757+ `pat.u.param.u.expanded

10758+ (union-overlap-primitive payload)

10759+ ?~ pattern ~

10760+ `[[at.s u.head u.pattern] (sub left.u.expanded 5)]

10761+++ union-overlap-against

10762+ |= [first=uow-case rest=(list shape) molds=imolds fuel=@ud]

10763+ ^- (unit [witness=(unit upair) left=@ud])

10764+ ?~ rest `[~ fuel]

10765+ ?: =(0 fuel) ~

10766+ =/ other=(unit [item=uow-case left=@ud]) (union-overlap-case i.rest molds (dec fuel))

10767+ ?~ other ~

10768+ ?: &(=(head.first head.item.u.other) =(%overlap (union-relate payload.first payload.item.u.other)))

10769+ `[`[at.first at.item.u.other %overlap] left.u.other]

10770+ $(rest t.rest, fuel left.u.other)

10771+++ union-source-overlap

10772+ |= [cases=(list shape) molds=imolds fuel=@ud]

10773+ ^- (unit upair)

10774+ ?~ cases ~

10775+ ?~ t.cases ~

10776+ ?: =(0 fuel) ~

10777+ =/ first=(unit [item=uow-case left=@ud]) (union-overlap-case i.cases molds (dec fuel))

10778+ ?~ first ~

10779+ =/ found=(unit [witness=(unit upair) left=@ud])

10780+ (union-overlap-against item.u.first t.cases molds left.u.first)

10781+ ?~ found ~

10782+ ?^ witness.u.found witness.u.found

10783+ $(cases t.cases, fuel left.u.found)

10784+::

908310785++ union-pairs

908410786 |= [cases=(list shape) molds=imolds]

908510787 ^- (list upair)

@@ -9233,6 +10935,11 @@

923310935 ?. ?=(%union -.sh) (crip "+$ {(trip name.d)}: not checked")

923410936 =/ pairs=(list upair) (union-pairs cases.sh molds)

923510937 =/ overlapping=(list upair) (skim pairs |=(p=upair =(%overlap relation.p)))

10938+ =. overlapping

10939+ ?^ overlapping overlapping

10940+ ?. (lien pairs |=(p=upair =(%unknown relation.p))) ~

10941+ =/ witness=(unit upair) (union-source-overlap cases.sh molds 256)

10942+ ?~(witness ~ ~[u.witness])

923610943 ?^ overlapping

923710944 =/ p=upair i.overlapping

923810945 =/ summary=@t (crip "+$ {(trip name.d)}: overlapping cases; mold not checked")

@@ -9240,7 +10947,9 @@

924010947 =/ second=@t (show-error src [file line.beg.second.p col.beg.second.p "overlapping case"])

924110948 (of-wain:format ~[summary first second])

924210949 ?: (lien pairs |=(p=upair =(%unknown relation.p)))

9243− (crip "+$ {(trip name.d)}: case disjointness unresolved; mold not checked")

10950+ ?. (union-source-distinct-tags cases.sh molds 256)

10951+ (crip "+$ {(trip name.d)}: case disjointness unresolved; mold not checked")

10952+ (crip "+$ {(trip name.d)}: cases proven disjoint; mold not checked")

924410953 (crip "+$ {(trip name.d)}: cases proven disjoint; mold not checked")

924510954::

924610955:: +show-inference-diagnostic: a partial report with both source sites

@@ -9297,7 +11006,14 @@

929711006+$ jbundle (list jsource)

929811007+$ jcache (list [at=path iface=ifile])

929911008+$ jfile-result (each [iface=ifile cache=jcache] @t)

11009+:: Overlap evidence retains the exact source that supplied its spans.

11010+:: Ordinary Jibb imports preserve this evidence through the resolver.

11011++$ jfile-overlap [file=path source=@t name=term cases=upair]

11012++$ jfile-failure [message=@t overlap=(unit jfile-overlap)]

11013++$ jfile-detailed-result (each [iface=ifile cache=jcache] jfile-failure)

930011014+$ jimports-result (each [resolved=ijimports cache=jcache] @t)

11015+:: Preserve an imported overlap's original file and source across the graph.

11016++$ jimports-detailed-result (each [resolved=ijimports cache=jcache] jfile-failure)

930111017::

930211018:: Written record fields each have their own lexical record scope.

930311019+$ written-fields (map term span)

@@ -9485,6 +11201,60 @@

948511201 ==

948611202 [n $(imports t.imports)]

948711203::

11204+++ reserved-proj-sample

11205+ |= sam=sample

11206+ ^- ?

11207+ ?- -.sam

11208+ %bind =(name.sam %proj)

11209+ %face =(name.sam %proj)

11210+ %pun =(name.sam %proj)

11211+ %cell (lien items.sam reserved-proj-sample)

11212+ * |

11213+ ==

11214+++ reserved-proj-pattern

11215+ |= p=pattern

11216+ ^- ?

11217+ ?- -.p

11218+ %bind =(name.p %proj)

11219+ %cell (lien items.p reserved-proj-pattern)

11220+ * |

11221+ ==

11222+++ reserved-proj-def

11223+ |= d=def

11224+ ^- ?

11225+ ?: =(name.d %proj) &

11226+ ?: ?=(%value -.d) (reserved-proj-expr val.d)

11227+ |

11228+++ reserved-proj-expr

11229+ |= e=expr

11230+ ^- ?

11231+ ?- -.e

11232+ %str (lien pieces.e |=(p=piece ?:(?=(%expr -.p) (reserved-proj-expr p.p) |)))

11233+ %qath (lien segs.e |=(p=qseg ?:(?=(%expr -.p) (reserved-proj-expr p.p) |)))

11234+ %change (lien edits.e |=(p=edit (reserved-proj-expr val.p)))

11235+ %pair $(e val.e)

11236+ %unit $(e val.e)

11237+ %group $(e inner.e)

11238+ %list (lien items.e reserved-proj-expr)

11239+ %tuple (lien items.e |=(i=item (reserved-proj-expr val.i)))

11240+ ?(%gate %gate-wide) |((reserved-proj-sample sample.e) $(e body.e))

11241+ %cast $(e val.e)

11242+ %call |($(e head.e) (lien args.e reserved-proj-expr))

11243+ %trace |($(e val.e) $(e then.e))

11244+ %branch |($(e subject.e) (lien arms.e |=(a=arm |((reserved-proj-pattern pat.a) (reserved-proj-expr val.a)))))

11245+ %body |((lien defs.e reserved-proj-def) $(e final.e))

11246+ * |

11247+ ==

11248+::

11249+++ module-has-reserved-proj

11250+ |= mod=module

11251+ ^- ?

11252+ =/ imported=(list term) (import-binding-names imports.mod)

11253+ =/ vals=(list term) (global-value-names defs.mod)

11254+ =/ molds=imolds (collect-simple-molds defs.mod)

11255+ =/ mold-names=(list term) (turn molds |=(m=[name=term body=shape] name.m))

11256+ |((lien (weld imported (weld vals mold-names)) |=(n=term =(n %proj))) (lien defs.mod reserved-proj-def))

11257+::

948811258++ module-scope-valid

948911259 |= [mod=module prelude-values=(list term) prelude-molds=(list term)]

949011260 ^- ?

@@ -9492,6 +11262,7 @@

949211262 =/ vals=(list term) (global-value-names defs.mod)

949311263 =/ molds=imolds (collect-simple-molds defs.mod)

949411264 =/ mold-names=(list term) (turn molds |=(m=[name=term body=shape] name.m))

11265+ ?: (module-has-reserved-proj mod) |

949511266 ?. %+ levy imported

949611267 |= n=term

949711268 &((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))))

@@ -9515,6 +11286,43 @@

951511286 (skim defs.mod |=(d=def !&(?=(%mold -.d) =(%poke name.d))))

951611287 (module-scope-valid mod(defs remaining) prelude-values prelude-molds)

951711288::

11289+:: A detailed failure is attached only to the first mold that actually

11290+:: failed in this check, using that module's checked source mold table.

11291++$ imold-failure [message=@t overlap=(unit [name=term cases=upair])]

11292+:: Validate a generic wrapper without an unbounded duplicate-name pass.

11293+++ module-mold-params-valid

11294+ |= [vars=(list @t) seen=(set @t) fuel=@ud]

11295+ ^- ?

11296+ ?~ vars &

11297+ ?: =(0 fuel) |

11298+ ?: (~(has in:..zuse seen) i.vars) |

11299+ $(vars t.vars, seen (~(put in:..zuse seen) i.vars), fuel (dec fuel))

11300+++ module-mold-overlap

11301+ |= [m=[name=term body=shape] molds=imolds]

11302+ ^- (unit upair)

11303+ =/ sh=shape body.m

11304+ =/ valid=?

11305+ ?. ?=(%generic -.sh) &

11306+ ?~ vars.sh |

11307+ (module-mold-params-valid vars.sh *(set @t) 256)

11308+ ?. valid ~

11309+ =? sh ?=(%generic -.sh) body.sh

11310+ ?. ?=(%union -.sh) ~

11311+ (union-source-overlap cases.sh molds 256)

11312+++ module-mold-types-detail

11313+ |= [molds=imolds state=istate]

11314+ ^- (each imold-types imold-failure)

11315+ ?~ molds [%& ~]

11316+ =/ m=[name=term body=shape] i.molds

11317+ =/ t=(unit [template=ischeme state=istate])

11318+ (infer-mold-template body.m state(active [name.m active.state], in-mold &))

11319+ ?~ t

11320+ =/ overlap=(unit upair) (module-mold-overlap m molds.state)

11321+ [%| ['module mold needs unsupported inference' ?~(overlap ~ `[name.m u.overlap])]]

11322+ =. typ.template.u.t (label-direct-union typ.template.u.t body.m name.m state)

11323+ =/ rest=(each imold-types imold-failure) $(molds t.molds)

11324+ ?: ?=(%| -.rest) rest

11325+ [%& [[name.m template.u.t] p.rest]]

951811326++ module-mold-types

951911327 |= [molds=imolds state=istate]

952011328 ^- (each imold-types @t)

@@ -9573,11 +11381,17 @@

957311381 =(var name.i.args.tail)

957411382::

957511383++ prelude-label

9576− |= [typ=itype name=term]

11384+ |= [typ=itype name=term vars=(list @ud)]

957711385 ^- itype

957811386 ?: ?=(%jrec -.typ) typ(label `name)

11387+ ?: ?=(%grec -.typ)

11388+ ?. (identity-union-parameters vars args.typ) typ(label ~)

11389+ typ(label `name)

957911390 ?. ?=(%union -.typ) typ

9580− ?^ args.typ typ

11391+ ?. (identity-union-parameters vars args.typ)

11392+ ?~ origin.typ typ

11393+ ?: =(at.u.origin.typ /lib/jibb/internal/jibb) typ(label ~)

11394+ typ

958111395 typ(label `name)

958211396::

958311397++ partial-prelude-molds

@@ -9592,7 +11406,7 @@

959211406 (infer-mold-template body.m state(active [name.m active.state], in-mold &))

959311407 ?~ out $(molds t.molds)

959411408 =. typ.template.u.out (label-direct-union typ.template.u.out body.m name.m state)

9595− =. typ.template.u.out (prelude-label typ.template.u.out name.m)

11409+ =. typ.template.u.out (prelude-label typ.template.u.out name.m vars.template.u.out)

959611410 [[name.m template.u.out] $(molds t.molds)]

959711411::

959811412:: A compiler-owned interface available only to the dedicated

@@ -9601,11 +11415,19 @@

960111415 ^- ifile

960211416 =/ a=itype [%avar 0]

960311417 =/ pair=itype [%cell a a]

11418+ =/ b=itype [%rvar 0]

11419+ =/ plus=ischeme [[%fn [%cell b b] b] ~[0]]

11420+ =/ minus=ischeme [[%fn b b] ~[0]]

960411421 =/ greater=ischeme [[%fn pair [%flag ~]] ~[0]]

9605− [~[[%raw-gth greater]] ~ /lib/jibb/primitives/jibb ~]

11422+ =/ utf8=itype [%atom 'tD']

11423+ =/ tape=itype [%collection %list ~[utf8]]

11424+ =/ codepoints=itype [%collection %list ~[[%atom %c]]]

11425+ =/ text-trip=ischeme [[%fn [%atom %t] tape] ~]

11426+ =/ text-tuba=ischeme [[%fn tape codepoints] ~]

11427+ [~[[%raw-add plus] [%raw-dec minus] [%raw-gth greater] [%raw-trip text-trip] [%raw-tuba text-tuba]] ~ /lib/jibb/primitives/jibb ~ ~ ~ ~ ~]

960611428::

960711429++ infer-private-internal

9608− |= src=@t

11430+ |= [src=@t public-source=@t]

960911431 ^- (unit ifile)

961011432 =/ at=path /lib/jibb/internal/jibb

961111433 =/ parsed (parse at src)

@@ -9623,15 +11445,65 @@

962311445 ?: (lien vals |=(n=term =(n %main))) ~

962411446 =/ molds=imolds (collect-simple-molds defs.mod)

962511447 =/ globals=(list term) (weld (import-binding-names imports.mod) vals)

9626− =/ js=ijimports ~[[face.i.imports.mod private-primitive-interface]]

11448+ :: The private source can use the public list and unit molds before the

11449+ :: prelude is otherwise prepared. Re-read the trusted public source here

11450+ :: and admit only its validated canonical templates; do not accept schemes

11451+ :: supplied independently by the caller.

11452+ =/ public=(each module error) (parse /lib/jibb/prelude/jibb public-source)

11453+ ?: ?=(%| -.public) ~

11454+ ?^ (duplicate-defs defs.p.public) ~

11455+ ?. (module-scope-valid p.public ~ ~) ~

11456+ =/ source-molds=imolds (collect-simple-molds defs.p.public)

11457+ =/ written-list=(unit shape) (find-simple-mold %list source-molds)

11458+ =/ source-list=(unit ischeme)

11459+ ?~ written-list ~

11460+ ?. (standard-prelude-list u.written-list) ~

11461+ `[[%collection %list ~[[%var 0]]] ~[0]]

11462+ :: Derive the public unit template from its actual source, then compare

11463+ :: the complete nominal template before making it available privately.

11464+ =/ unit-decl=(unit shape) (find-simple-mold %unit source-molds)

11465+ =/ source-unit=(unit ischeme)

11466+ ?~ unit-decl ~

11467+ =/ unit-molds=imolds ~[[%unit u.unit-decl]]

11468+ =/ unit-state=istate [0 ~ ~ ~ unit-molds ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ | /lib/jibb/prelude/jibb ~[%unit] ~ ~ 256 ~ ~ ~ ~ ~ ~]

11469+ =/ unit-types=imold-types (partial-prelude-molds unit-molds unit-state)

11470+ =/ unit-iface=ifile [~ unit-types /lib/jibb/prelude/jibb ~ ~ ~ ~ ~]

11471+ =/ found=(unit ischeme) (find-jibb-mold %unit unit-iface)

11472+ ?~ found ~

11473+ ?. (standard-unit-template u.found /lib/jibb/prelude/jibb) ~

11474+ found

11475+ =/ primitive=ifile private-primitive-interface

11476+ =? primitive ?=(^ source-list)

11477+ primitive(molds [[%list u.source-list] molds.primitive])

11478+ =? primitive ?=(^ source-unit)

11479+ primitive(molds [[%unit u.source-unit] molds.primitive])

11480+ =/ js=ijimports ~[[face.i.imports.mod primitive]]

962711481 =/ reserved=(list term) ~[face.i.imports.mod]

962811482 =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

9629− =/ state=istate [0 ~ ~ ~ molds globals ~ ~ ~ ~ js reserved ~ ~ ~ | at top ~ ~ 256]

11483+ =/ state=istate [0 ~ ~ ~ molds globals ~ ~ ~ ~ js reserved ~ ~ ~ | at top ~ ~ 256 ~ ~ ~ ~ ~ ~]

963011484 =/ mts=(each imold-types @t) (module-mold-types molds state)

9631− ?: ?=(%| -.mts) ~

9632− =/ env=ienv (resolve-supported-defs defs.mod molds globals ~ ~ ~ ~ js reserved at ~)

11485+ =/ usable=(unit imold-types)

11486+ ?: ?=(%& -.mts) `p.mts

11487+ :: Missing public templates may make an unrelated internal mold

11488+ :: unavailable. Validate all molds once with isolated canonical

11489+ :: templates before admitting only those inferred using the actual

11490+ :: source-backed templates. The proof interface is never exported.

11491+ ?. |(?=(~ source-list) ?=(~ source-unit)) ~

11492+ =/ nil=itype [%const [%null %n 0 '~']]

11493+ =/ canonical-unit=ischeme

11494+ [[%union ~[nil [%cell nil [%face %u [%var 0]]]] `[/lib/jibb/prelude/jibb %unit] `%unit ~[[%var 0]]] ~[0]]

11495+ =/ canonical-list=ischeme [[%collection %list ~[[%var 0]]] ~[0]]

11496+ =/ proof-primitive=ifile private-primitive-interface

11497+ =. molds.proof-primitive ~[[%list canonical-list] [%unit canonical-unit]]

11498+ =/ proof-imports=ijimports ~[[face.i.imports.mod proof-primitive]]

11499+ =/ proof=(each imold-types @t) (module-mold-types molds state(jimports proof-imports))

11500+ ?: ?=(%| -.proof) ~

11501+ `(partial-prelude-molds molds state)

11502+ ?~ usable ~

11503+ =/ resolution=iresolved (resolve-groups defs.mod molds globals ~ ~ ~ ~ js reserved at ~)

11504+ =/ env=ienv env.resolution

963311505 ?. (module-values-complete defs.mod env) ~

9634− `[env p.mts at ~]

11506+ `[env u.usable at ~ artifacts.resolution ~ `src ~]

963511507::

963611508++ partial-prelude-interface-with-internal

963711509 |= [src=@t internal-source=(unit @t)]

@@ -9647,7 +11519,7 @@

964711519 ?. ?=([[%jibb *] ~] imports.p.parsed) ~

964811520 ?. =(path.i.imports.p.parsed /lib/jibb/internal) ~

964911521 ?~ internal-source ~

9650− =/ built=(unit ifile) (infer-private-internal u.internal-source)

11522+ =/ built=(unit ifile) (infer-private-internal u.internal-source src)

965111523 ?~ built ~

965211524 `~[[face.i.imports.p.parsed u.built]]

965311525 ?~ private ~

@@ -9664,16 +11536,16 @@

966411536 =? env-molds declared

966511537 (skim molds |=(m=[name=term body=shape] !=(%list name.m)))

966611538 =/ reserved=(list term) ?:(declared ~[%list] ~)

9667− =/ state=istate [0 ~ ~ ~ env-molds globals ~ ~ ~ ~ u.private reserved ~ ~ ~ | at names ~ ~ 256]

11539+ =/ state=istate [0 ~ ~ ~ env-molds globals ~ ~ ~ ~ u.private reserved ~ ~ ~ | at names ~ ~ 256 ~ ~ ~ ~ ~ ~]

966811540 :: Other prelude molds may use list only after its source has passed

966911541 :: the standard-list check. The raw declaration remains removed.

967011542 =/ declared-list=(unit shape) (find-simple-mold %list molds)

967111543 =/ mold-prelude=(unit ifile)

967211544 ?~ declared-list ~

967311545 ?. (standard-prelude-list u.declared-list) ~

9674− `[~ ~[[%list [[%collection %list ~[[%var 0]]] ~[0]]]] at ~]

11546+ `[~ ~[[%list [[%collection %list ~[[%var 0]]] ~[0]]]] at ~ ~ ~ ~ ~]

967511547 =/ mt=imold-types (partial-prelude-molds molds state(prelude mold-prelude))

9676− =/ partial=ifile [~ mt at ~]

11548+ =/ partial=ifile [~ mt at ~ ~ ~ ~ ~]

967711549 :: An explicitly qualified re-export must resolve. Other unsupported

967811550 :: prelude declarations remain reserved but absent from the interface.

967911551 =/ required=imolds

@@ -9684,9 +11556,13 @@

968411556 ?~ names.sh |

968511557 ?=(^ t.names.sh)

968611558 ?. (levy required |=(m=[name=term body=shape] ?=(^ (find-jibb-mold name.m partial)))) ~

9687− =/ env=ienv (resolve-supported-defs ds env-molds globals ~ ~ ~ ~ u.private reserved at `partial)

11559+ =/ resolution=iresolved (resolve-groups ds env-molds globals ~ ~ ~ ~ u.private reserved at `partial)

11560+ =/ env=ienv env.resolution

968811561 ?. (hole-values-present ds env) ~

9689− `[env mt at ~]

11562+ =/ deps=(list iwidth-dependency)

11563+ ?~ u.private ~

11564+ ~[[at.interface.i.u.private source.interface.i.u.private elaborations.interface.i.u.private]]

11565+ `[env mt at ~ artifacts.resolution deps `src ~]

969011566::

969111567++ partial-prelude-interface

969211568 |= src=@t

@@ -9737,27 +11613,103 @@

973711613 ?: =(at at.i.cache) `iface.i.cache

973811614 $(cache t.cache)

973911615::

11616+:: These certificates retain the complete checked source closure. The

11617+:: trusted host must supply the identical prepared prelude and reader nouns.

11618+:: Exact bundle equality binds all source paths and versions; the set

11619+:: retains transitive paths for active-cycle checks. Request-bearing graphs

11620+:: alone have a size limit; incompatible diamond evidence fails closed.

11621+++ request-graph-requests-add

11622+ |= [pending=(list irequest-evidence) acc=(list irequest-evidence) fuel=@ud]

11623+ ^- (unit (list irequest-evidence))

11624+ ?~ pending `acc

11625+ ?: =(0 fuel) ~

11626+ =/ hit=(list irequest-evidence)

11627+ (skim acc |=(x=irequest-evidence &(=(api-at.x api-at.i.pending) =(name.x name.i.pending))))

11628+ ?^ hit

11629+ ?. ?=([* ~] hit) ~

11630+ ?. =(i.hit i.pending) ~

11631+ $(pending t.pending, fuel (dec fuel))

11632+ $(pending t.pending, acc [i.pending acc], fuel (dec fuel))

11633+++ request-graph-inputs-match

11634+ |= [g=irequest-graph externals=iexternals marks=imark-externals modules=jbundle values=(list term) molds=(list term) prelude=(unit ifile)]

11635+ ^- ?

11636+ ?& =(bundle-input.g modules)

11637+ =(prelude-input.g prelude)

11638+ =(prelude-values.g values)

11639+ =(prelude-molds.g molds)

11640+ =(externals.g externals)

11641+ =(marks.g marks)

11642+ ==

11643+++ request-graph-merge

11644+ |= [imports=ijimports g=irequest-graph fuel=@ud]

11645+ ^- (unit irequest-graph)

11646+ ?~ imports `g

11647+ ?: =(0 fuel) ~

11648+ =/ child=ifile interface.i.imports

11649+ ?~ graph.child ~

11650+ =/ cg=irequest-graph u.graph.child

11651+ ?. ?& =(bundle-input.g bundle-input.cg)

11652+ =(prelude-input.g prelude-input.cg)

11653+ =(prelude-values.g prelude-values.cg)

11654+ =(prelude-molds.g prelude-molds.cg)

11655+ =(externals.g externals.cg)

11656+ =(marks.g marks.cg)

11657+ ==

11658+ ~

11659+ =/ merged=(set path) (~(uni in:..zuse paths.g) paths.cg)

11660+ =/ rs=(unit (list irequest-evidence))

11661+ (request-graph-requests-add requests.cg requests.g (add 1 (lent requests.cg)))

11662+ ?~ rs ~

11663+ ?: &(?=(^ u.rs) |((gth (lent ~(tap in:..zuse merged)) 256) (gth (lent u.rs) 256))) ~

11664+ $(imports t.imports, g g(paths merged, requests u.rs), fuel (dec fuel))

11665+++ request-graph-reusable

11666+ |= [f=ifile src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) values=(list term) molds=(list term) prelude=(unit ifile)]

11667+ ^- ?

11668+ ?~ source.f |

11669+ ?. =(u.source.f src) |

11670+ ?~ graph.f |

11671+ =/ g=irequest-graph u.graph.f

11672+ ?. (request-graph-inputs-match g externals marks modules values molds prelude) |

11673+ ?. (~(has in:..zuse paths.g) at.f) |

11674+ !(lien active |=(p=path (~(has in:..zuse paths.g) p)))

11675+::

974011676++ resolve-jibb-imports

974111677 |= [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)]

974211678 ^- jimports-result

11679+ =/ result=jimports-detailed-result

11680+ (resolve-jibb-imports-detailed imports externals mark-externals modules active prelude-values prelude-molds cache prelude)

11681+ ?: ?=(%| -.result) [%| message.p.result]

11682+ [%& p.result]

11683+++ resolve-jibb-imports-detailed

11684+ |= [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)]

11685+ ^- jimports-detailed-result

974311686 ?~ imports [%& [~ cache]]

974411687 ?. ?=(%jibb -.i.imports) $(imports t.imports)

974511688 =/ at=path (weld path.i.imports `path`~[%jibb])

974611689 ?: =(at /lib/jibb/internal/jibb)

9747− [%| 'the prelude internal module is private']

11690+ [%| ['the prelude internal module is private' ~]]

974811691 ?: =(at /lib/jibb/primitives/jibb)

9749− [%| 'the prelude primitive interface is private']

11692+ [%| ['the prelude primitive interface is private' ~]]

975011693 ?: (lien active |=(p=path =(p at)))

9751− [%| (crip "import cycle at {(spud at)}")]

11694+ [%| [(crip "import cycle at {(spud at)}") ~]]

975211695 =/ found=jbundle (skim modules |=(m=jsource =(at at.m)))

9753− ?~ found [%| (crip "module source missing: {(spud at)}")]

9754− ?^ t.found [%| (crip "duplicate module sources: {(spud at)}")]

11696+ ?~ found [%| [(crip "module source missing: {(spud at)}") ~]]

11697+ ?^ t.found [%| [(crip "duplicate module sources: {(spud at)}") ~]]

975511698 =/ cached=(unit ifile) (find-jibb-cache at cache)

9756− =/ iface=jfile-result

9757− ?^ cached [%& [u.cached cache]]

9758− (infer-jibb-file at source.i.found externals mark-externals modules [at active] prelude-values prelude-molds cache prelude)

11699+ =/ iface=jfile-detailed-result

11700+ ?^ cached

11701+ ?. =(at.u.cached at) [%| ['cached module identity needs unsupported inference' ~]]

11702+ ?~ graph.u.cached

11703+ :: A detached legacy interface has unknown evidence. Rebuild it

11704+ :: against the current graph, without retaining any stale entry.

11705+ =/ clean=jcache (skim cache |=(x=[at=path iface=ifile] !=(at.x at)))

11706+ (infer-jibb-file-detailed at source.i.found externals mark-externals modules [at active] prelude-values prelude-molds clean prelude)

11707+ ?. (request-graph-reusable u.cached source.i.found externals mark-externals modules active prelude-values prelude-molds prelude)

11708+ [%| ['cached module evidence needs unsupported inference' ~]]

11709+ [%& [u.cached cache]]

11710+ (infer-jibb-file-detailed at source.i.found externals mark-externals modules [at active] prelude-values prelude-molds cache prelude)

975911711 ?: ?=(%| -.iface) [%| p.iface]

9760− =/ rest=jimports-result $(imports t.imports, cache cache.p.iface)

11712+ =/ rest=jimports-detailed-result $(imports t.imports, cache cache.p.iface)

976111713 ?: ?=(%| -.rest) rest

976211714 [%& [[[face.i.imports iface.p.iface] resolved.p.rest] cache.p.rest]]

976311715::

@@ -9891,6 +11843,7 @@

989111843 ^- ?

989211844 =/ path-names=(list term) (turn paths |=(p=iapi-path name.p))

989311845 =/ derived=(list term) (weld path-names poke-names)

11846+ ?: (lien derived |=(n=term =(n %proj))) |

989411847 =/ outer=(list term) (weld prelude-values (weld (global-value-names defs.mod) (api-import-faces imports.mod)))

989511848 (levy derived |=(n=term &((unique-value-name n derived) !(lien outer |=(x=term =(n x))))))

989611849::

@@ -9979,6 +11932,346 @@

997911932 ?~ paths [%| 'API path declaration needs unsupported analysis']

998011933 [%& u.paths]

998111934::

11935+:: Analysis evidence retains the API source, the prepared interface, the

11936+:: caller's reader results and the resolved Jibb dependency cache alongside

11937+:: the typed path declarations. Reader results and prepared interfaces are

11938+:: trusted inputs: this does not verify their underlying Hoon source/version,

11939+:: create requests or check the provenance of arbitrary values.

11940++$ iapi-path-evidence

11941+ [at=path source=@t prepared=iprelude externals=iexternals marks=imark-externals dependencies=jcache paths=(list iapi-path-typed)]

11942+++ api-path-evidence-source

11943+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

11944+ ^- (each iapi-path-evidence @t)

11945+ ?. ?=([%ui %api @ %jibb ~] file) [%| 'API path evidence requires /ui/api/<agent>.jibb']

11946+ =/ parsed (parse file src)

11947+ ?: ?=(%| -.parsed) [%| 'API path evidence source does not parse']

11948+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11949+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

11950+ ?~ prepared [%| 'API path evidence needs the prepared prelude']

11951+ =/ public=ifile iface.u.prepared

11952+ =/ deps=jimports-result

11953+ (resolve-jibb-imports imports.p.parsed externals marks modules ~[file] values.u.prepared molds.u.prepared ~ `public)

11954+ ?: ?=(%| -.deps) [%| p.deps]

11955+ =/ paths=(unit (list iapi-path-typed))

11956+ (api-path-analysis p.parsed marks values.u.prepared molds.u.prepared)

11957+ ?~ paths [%| 'API path declaration needs unsupported analysis']

11958+ [%& [file src u.prepared externals marks cache.p.deps u.paths]]

11959+:: Graph-aware variant preserves the caller active stack and cache.

11960+++ api-path-evidence-graph

11961+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

11962+ ^- (each iapi-path-evidence @t)

11963+ ?~ active [%| 'API analysis needs an active graph']

11964+ ?. =(i.active file) [%| 'API analysis active graph does not start at the source']

11965+ ?: (lien t.active |=(p=path =(p file))) [%| 'API analysis active graph contains a cycle']

11966+ ?. ?=([%ui %api @ %jibb ~] file) [%| 'API path evidence requires /ui/api/<agent>.jibb']

11967+ =/ parsed (parse file src)

11968+ ?: ?=(%| -.parsed) [%| 'API path evidence source does not parse']

11969+ =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

11970+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

11971+ ?~ prepared [%| 'API path evidence needs the prepared prelude']

11972+ =/ public=ifile iface.u.prepared

11973+ =/ deps=jimports-result

11974+ (resolve-jibb-imports imports.p.parsed externals marks modules active values.u.prepared molds.u.prepared cache `public)

11975+ ?: ?=(%| -.deps) [%| p.deps]

11976+ =/ paths=(unit (list iapi-path-typed))

11977+ (api-path-analysis p.parsed marks values.u.prepared molds.u.prepared)

11978+ ?~ paths [%| 'API path declaration needs unsupported analysis']

11979+ [%& [file src u.prepared externals marks cache.p.deps u.paths]]

11980+::

11981+:: This query classifies a unique path declaration only. Missing evidence

11982+:: or a nonunique name is unknown; it proves nothing about an ask value.

11983+:: Like prepared interfaces, the supplied evidence is a trusted host input.

11984+++ api-path-watchability

11985+ |= [evidence=(unit iapi-path-evidence) case-name=term]

11986+ ^- ?(%watchable %not-watchable %unknown)

11987+ ?~ evidence %unknown

11988+ =/ found=(list iapi-path-typed)

11989+ (skim paths.u.evidence |=(p=iapi-path-typed =(name.path.p case-name)))

11990+ ?. ?=([* ~] found) %unknown

11991+ ?~ scry.path.i.found %watchable

11992+ %not-watchable

11993+::

11994+:: These are declaration-derived request components, not a callable gate,

11995+:: an ask value, or proof of a value's provenance. Keep the exact trusted

11996+:: source/reader evidence until a later checked interface and lowerer can

11997+:: attach it to a generated request. No argument ordering is claimed here.

11998++$ iapi-request-parameter [name=term typ=itype at=span]

11999++$ iapi-request-parts

12000+ [evidence=iapi-path-evidence path=iapi-path-typed parameters=(list iapi-request-parameter) reply-sample=itype fold=(unit itype) watchability=?(%watchable %not-watchable)]

12001+++ api-request-parameter-types

12002+ |= params=(list iapi-parameter)

12003+ ^- (unit (list iapi-request-parameter))

12004+ ?~ params `~

12005+ =/ aura=@ta aura.i.params

12006+ ?. |(?=(?(%u %ud %ux %uv %t %ta %tas %p %da %dr) aura) =('tD' aura)) ~

12007+ =/ rest=(unit (list iapi-request-parameter)) $(params t.params)

12008+ ?~ rest ~

12009+ `[[name.i.params [%atom aura] at.i.params] u.rest]

12010+::

12011+:: A single diff's fold consumes the tagged diff and the previous full value.

12012+:: Multiple-diff unions need a checked union representation and remain open.

12013+++ api-request-fold-type

12014+ |= p=iapi-path-typed

12015+ ^- (unit (unit itype))

12016+ ?~ diffs.p `~

12017+ ?^ t.diffs.p ~

12018+ =/ d=iapi-mark-type i.diffs.p

12019+ =/ literal=lit [%term %tas name.d (crip ['%' (trip name.d)])]

12020+ =/ sample=itype [%cell [%cell [%const literal] typ.d] full.p]

12021+ ``[%fn sample full.p]

12022+::

12023+++ api-request-parts

12024+ |= [evidence=(unit iapi-path-evidence) case-name=term]

12025+ ^- (unit iapi-request-parts)

12026+ ?~ evidence ~

12027+ =/ found=(list iapi-path-typed)

12028+ (skim paths.u.evidence |=(p=iapi-path-typed =(name.path.p case-name)))

12029+ ?. ?=([* ~] found) ~

12030+ =/ p=iapi-path-typed i.found

12031+ =/ raw=(unit (list iapi-parameter)) (api-path-parameters segments.path.p ~)

12032+ ?~ raw ~

12033+ =/ params=(unit (list iapi-request-parameter)) (api-request-parameter-types u.raw)

12034+ ?~ params ~

12035+ =/ fold=(unit (unit itype)) (api-request-fold-type p)

12036+ ?~ fold ~

12037+ =/ watch=?(%watchable %not-watchable) ?~(scry.path.p %watchable %not-watchable)

12038+ `[u.evidence p u.params full.p u.fold watch]

12039+::

12040+:: Check ordinary API molds and values plus every declared mark type using

12041+:: the same trusted source, prepared prelude and reader inputs as path

12042+:: evidence. Keep elaborations with those inputs for a later interface.

12043+:: This is partial analysis: an unused /- core is not independently checked,

12044+:: definitions needing derived values remain unsupported, and no complete

12045+:: API, request or constructor is exported or given runtime behavior.

12046++$ iapi-support-evidence

12047+ [paths=iapi-path-evidence values=ienv molds=imold-types marks=(list iapi-mark-type) elaborations=(list iwidth-definition)]

12048+++ api-support-analysis-source

12049+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

12050+ ^- (each iapi-support-evidence @t)

12051+ =/ path-result (api-path-evidence-source file src externals marks modules prepared)

12052+ ?: ?=(%| -.path-result) [%| p.path-result]

12053+ =/ evidence=iapi-path-evidence p.path-result

12054+ =/ parsed (parse file src)

12055+ ?: ?=(%| -.parsed) [%| 'API source does not parse']

12056+ =/ mod=module p.parsed

12057+ =/ ordinary=(list def)

12058+ (skim defs.mod |=(d=def !&(?=(%mold -.d) |(=(%paths name.d) =(%poke name.d)))))

12059+ =/ prep=iprelude prepared.evidence

12060+ ?. (module-scope-valid mod(defs ordinary) values.prep molds.prep) [%| 'API ordinary scope needs unsupported inference']

12061+ =/ vals=(list term) (global-value-names ordinary)

12062+ ?: (lien vals |=(n=term =(n %main))) [%| 'API module kind needs unsupported inference']

12063+ =/ declared=(list term) (collect-mark-imports imports.mod)

12064+ =/ mark-types=(unit (list iapi-mark-type)) (api-diff-types declared marks declared)

12065+ ?~ mark-types [%| 'API declared marks need unsupported inference']

12066+ =/ prelude=(unit ifile) `iface.prep

12067+ =/ deps=jimports-result

12068+ (resolve-jibb-imports imports.mod externals marks modules ~[file] values.prep molds.prep dependencies.evidence prelude)

12069+ ?: ?=(%| -.deps) [%| p.deps]

12070+ =/ molds=imolds (collect-simple-molds ordinary)

12071+ =/ globals=(list term) (weld values.prep (weld (import-binding-names imports.mod) vals))

12072+ =/ surs=(list term) (collect-sur-imports imports.mod)

12073+ =/ reserved=(list term) (weld molds.prep (turn resolved.p.deps |=(j=[face=term interface=ifile] face.j)))

12074+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

12075+ =/ state=istate [0 ~ ~ ~ molds globals externals surs marks declared resolved.p.deps reserved ~ ~ ~ | file top prelude ~ 256 ~ ~ ~ ~ ~ ~]

12076+ =/ mts=(each imold-types @t) (module-mold-types molds state)

12077+ ?: ?=(%| -.mts) [%| p.mts]

12078+ =/ resolution=iresolved (resolve-groups ordinary molds globals externals surs marks declared resolved.p.deps reserved file prelude)

12079+ ?. (module-values-complete ordinary env.resolution) [%| 'API ordinary definitions need unsupported inference']

12080+ [%& [evidence env.resolution p.mts u.mark-types artifacts.resolution]]

12081+:: Preserve the same graph context through supporting definitions.

12082+++ api-support-analysis-graph

12083+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

12084+ ^- (each iapi-support-evidence @t)

12085+ =/ path-result (api-path-evidence-graph file src externals marks modules active cache prepared)

12086+ ?: ?=(%| -.path-result) [%| p.path-result]

12087+ =/ evidence=iapi-path-evidence p.path-result

12088+ =/ parsed (parse file src)

12089+ ?: ?=(%| -.parsed) [%| 'API source does not parse']

12090+ =/ mod=module p.parsed

12091+ =/ ordinary=(list def)

12092+ (skim defs.mod |=(d=def !&(?=(%mold -.d) |(=(%paths name.d) =(%poke name.d)))))

12093+ =/ prep=iprelude prepared.evidence

12094+ ?. (module-scope-valid mod(defs ordinary) values.prep molds.prep) [%| 'API ordinary scope needs unsupported inference']

12095+ =/ vals=(list term) (global-value-names ordinary)

12096+ ?: (lien vals |=(n=term =(n %main))) [%| 'API module kind needs unsupported inference']

12097+ =/ declared=(list term) (collect-mark-imports imports.mod)

12098+ =/ mark-types=(unit (list iapi-mark-type)) (api-diff-types declared marks declared)

12099+ ?~ mark-types [%| 'API declared marks need unsupported inference']

12100+ =/ prelude=(unit ifile) `iface.prep

12101+ =/ deps=jimports-result

12102+ (resolve-jibb-imports imports.mod externals marks modules active values.prep molds.prep dependencies.evidence prelude)

12103+ ?: ?=(%| -.deps) [%| p.deps]

12104+ =/ molds=imolds (collect-simple-molds ordinary)

12105+ =/ globals=(list term) (weld values.prep (weld (import-binding-names imports.mod) vals))

12106+ =/ surs=(list term) (collect-sur-imports imports.mod)

12107+ =/ reserved=(list term) (weld molds.prep (turn resolved.p.deps |=(j=[face=term interface=ifile] face.j)))

12108+ =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

12109+ =/ state=istate [0 ~ ~ ~ molds globals externals surs marks declared resolved.p.deps reserved ~ ~ ~ | file top prelude ~ 256 ~ ~ ~ ~ ~ ~]

12110+ =/ mts=(each imold-types @t) (module-mold-types molds state)

12111+ ?: ?=(%| -.mts) [%| p.mts]

12112+ =/ resolution=iresolved (resolve-groups ordinary molds globals externals surs marks declared resolved.p.deps reserved file prelude)

12113+ ?. (module-values-complete ordinary env.resolution) [%| 'API ordinary definitions need unsupported inference']

12114+ [%& [evidence env.resolution p.mts u.mark-types artifacts.resolution]]

12115+::

12116+:: Type-analysis artifact for one plain request. The resolver may publish

12117+:: its interface only together with trusted source and reader evidence.

12118+:: No lowering or runtime validator exists.

12119+:: Value watchability remains unproved even for a watchable declaration.

12120++$ ione-request-interface

12121+ [support=iapi-support-evidence parts=iapi-request-parts iface=ifile]

12122+++ request-compatible-ask

12123+ |= prelude=iprelude

12124+ ^- (unit ischeme)

12125+ =/ public=ifile iface.prelude

12126+ ?. =(at.public /lib/jibb/prelude/jibb) ~

12127+ =/ ask=(unit ischeme) (find-jibb-mold %ask public)

12128+ ?~ ask ~

12129+ ?. ?=([@ ~] vars.u.ask) ~

12130+ ?. ?=(%union -.typ.u.ask) ~

12131+ ?. =(origin.typ.u.ask `[/lib/jibb/internal/jibb %ask]) ~

12132+ ?. (identity-union-parameters vars.u.ask args.typ.u.ask) ~

12133+ =/ m=@ud i.vars.u.ask

12134+ ?: (itype-var-is-atom m typ.u.ask) ~

12135+ ?. (levy (itype-vars typ.u.ask) |=(n=@ud =(n m))) ~

12136+ ?: (itype-has-tag typ.u.ask) ~

12137+ =/ private=(list iwidth-dependency)

12138+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

12139+ ?. ?=([* ~] private) ~

12140+ ?~ source.i.private ~

12141+ =/ path=(unit ischeme) (find-jibb-mold %path public)

12142+ ?~ path ~

12143+ ?^ vars.u.path ~

12144+ =/ path-type=itype [%collection %list ~[[%atom %ta]]]

12145+ ?. =(typ.u.path path-type) ~

12146+ =/ unit-template=(unit ischeme) (find-jibb-mold %unit public)

12147+ ?~ unit-template ~

12148+ ?. (standard-unit-template u.unit-template /lib/jibb/prelude/jibb) ~

12149+ =/ state-unit=(unit itype) (template-apply u.unit-template ~[[%noun ~]])

12150+ ?~ state-unit ~

12151+ =/ path-unit=(unit itype) (template-apply u.unit-template ~[path-type])

12152+ ?~ path-unit ~

12153+ =/ output=itype [%cell [%face %state [%noun ~]] [%face %message [%var m]]]

12154+ =/ agent-input=itype [%cell [%face %mark [%atom %tas]] [%cell [%face %state u.state-unit] [%face %fact [%noun ~]]]]

12155+ =/ store-input=itype [%cell [%face %state u.state-unit] [%face %fact [%noun ~]]]

12156+ =/ pure-case=itype [%cell [%const [%term %tas %pure '%pure']] [%face %value [%var m]]]

12157+ =/ agent-case=itype

12158+ [%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]]]]]]]]

12159+ =/ store-case=itype

12160+ [%cell [%const [%term %tas %store '%store']] [%cell [%face %module [%atom %t]] [%cell [%face %name [%atom %tas]] [%face %receive [%fn store-input output]]]]]

12161+ ?. =(cases.typ.u.ask ~[pure-case agent-case store-case]) ~

12162+ ask

12163+::

12164+:: The first supported standalone API has exactly one mark import and one

12165+:: plain path declaration, with no other definitions or imports. No partial

12166+:: success is published when source, schema, or a required mold is unknown.

12167+++ one-request-interface-source

12168+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude)]

12169+ ^- (each ione-request-interface @t)

12170+ =/ out (api-support-analysis-source file src externals marks modules prepared)

12171+ ?: ?=(%| -.out) [%| p.out]

12172+ =/ support=iapi-support-evidence p.out

12173+ =/ ev=iapi-path-evidence paths.support

12174+ =/ parsed (parse file src)

12175+ ?: ?=(%| -.parsed) [%| 'request source does not parse']

12176+ =/ mod=module p.parsed

12177+ ?. ?=(?([[%mark *] ~] [[%mark *] [%mark *] ~]) imports.mod) [%| 'request imports need unsupported inference']

12178+ ?. ?=([[%mold *] ~] defs.mod) [%| 'request definitions need unsupported inference']

12179+ ?. =(%paths name.i.defs.mod) [%| 'request declaration needs unsupported inference']

12180+ ?. ?=([* ~] paths.ev) [%| 'request count needs unsupported inference']

12181+ =/ p=iapi-path-typed i.paths.ev

12182+ =/ parts=(unit iapi-request-parts) (api-request-parts `ev name.path.p)

12183+ ?~ parts [%| 'request components need unsupported inference']

12184+ ?. ?=(?(~ [* ~]) parameters.u.parts) [%| 'request parameters need unsupported inference']

12185+ ?: &(?=(^ fold.u.parts) ?=(^ parameters.u.parts)) [%| 'request parameter and fold need unsupported inference']

12186+ ?^ scry.path.p [%| 'request scry needs unsupported inference']

12187+ =/ valid-marks=?

12188+ ?~ fold.u.parts ?=([* ~] marks.support)

12189+ ?=([* [* ~]] marks.support)

12190+ ?. valid-marks [%| 'request marks need unsupported inference']

12191+ =/ fold-open=?

12192+ ?~ fold.u.parts |

12193+ |(?=(^ (itype-vars u.fold.u.parts)) (itype-has-tag u.fold.u.parts))

12194+ ?: fold-open [%| 'request fold needs unsupported inference']

12195+ ?^ (itype-vars reply-sample.u.parts) [%| 'request payload needs unsupported inference']

12196+ ?: (itype-has-tag reply-sample.u.parts) [%| 'request payload needs unsupported inference']

12197+ =/ ask=(unit ischeme) (request-compatible-ask prepared.ev)

12198+ ?~ ask [%| 'request ask needs unsupported inference']

12199+ =/ result=(unit itype) (template-apply u.ask ~[[%var 0]])

12200+ ?~ result [%| 'request ask needs unsupported inference']

12201+ =/ callback=itype [%fn reply-sample.u.parts [%var 0]]

12202+ =/ sample=itype

12203+ ?^ fold.u.parts [%cell callback u.fold.u.parts]

12204+ ?~ parameters.u.parts callback

12205+ [%cell typ.i.parameters.u.parts callback]

12206+ =/ scheme=ischeme [[%fn sample u.result] ~[0]]

12207+ =/ exports=imold-types

12208+ (turn marks.support |=(m=iapi-mark-type [name.m [typ.m ~]]))

12209+ =/ prelude=iprelude prepared.ev

12210+ =/ public=ifile iface.prelude

12211+ ?~ source.public [%| 'request prelude source needs unsupported inference']

12212+ =/ private=(list iwidth-dependency)

12213+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

12214+ ?. ?=([* ~] private) [%| 'request internal source needs unsupported inference']

12215+ ?~ source.i.private [%| 'request internal source needs unsupported inference']

12216+ =/ req=irequest-evidence

12217+ [file name.path.p p src u.source.public u.source.i.private values.prelude molds.prelude externals marks]

12218+ =/ interface=ifile [~[[name.path.p scheme]] exports file ~ ~ ~ `src `[(silt `(list path)`~[file]) ~[req] modules `public values.prelude molds.prelude externals marks]]

12219+ [%& [support u.parts interface]]

12220+:: Graph-aware request artifact; resolver use remains type-only.

12221+++ one-request-interface-graph

12222+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

12223+ ^- (each ione-request-interface @t)

12224+ =/ out (api-support-analysis-graph file src externals marks modules active cache prepared)

12225+ ?: ?=(%| -.out) [%| p.out]

12226+ =/ support=iapi-support-evidence p.out

12227+ =/ ev=iapi-path-evidence paths.support

12228+ =/ parsed (parse file src)

12229+ ?: ?=(%| -.parsed) [%| 'request source does not parse']

12230+ =/ mod=module p.parsed

12231+ ?. ?=(?([[%mark *] ~] [[%mark *] [%mark *] ~]) imports.mod) [%| 'request imports need unsupported inference']

12232+ ?. ?=([[%mold *] ~] defs.mod) [%| 'request definitions need unsupported inference']

12233+ ?. =(%paths name.i.defs.mod) [%| 'request declaration needs unsupported inference']

12234+ ?. ?=([* ~] paths.ev) [%| 'request count needs unsupported inference']

12235+ =/ p=iapi-path-typed i.paths.ev

12236+ =/ parts=(unit iapi-request-parts) (api-request-parts `ev name.path.p)

12237+ ?~ parts [%| 'request components need unsupported inference']

12238+ ?. ?=(?(~ [* ~]) parameters.u.parts) [%| 'request parameters need unsupported inference']

12239+ ?: &(?=(^ fold.u.parts) ?=(^ parameters.u.parts)) [%| 'request parameter and fold need unsupported inference']

12240+ ?^ scry.path.p [%| 'request scry needs unsupported inference']

12241+ =/ valid-marks=?

12242+ ?~ fold.u.parts ?=([* ~] marks.support)

12243+ ?=([* [* ~]] marks.support)

12244+ ?. valid-marks [%| 'request marks need unsupported inference']

12245+ =/ fold-open=?

12246+ ?~ fold.u.parts |

12247+ |(?=(^ (itype-vars u.fold.u.parts)) (itype-has-tag u.fold.u.parts))

12248+ ?: fold-open [%| 'request fold needs unsupported inference']

12249+ ?^ (itype-vars reply-sample.u.parts) [%| 'request payload needs unsupported inference']

12250+ ?: (itype-has-tag reply-sample.u.parts) [%| 'request payload needs unsupported inference']

12251+ =/ ask=(unit ischeme) (request-compatible-ask prepared.ev)

12252+ ?~ ask [%| 'request ask needs unsupported inference']

12253+ =/ result=(unit itype) (template-apply u.ask ~[[%var 0]])

12254+ ?~ result [%| 'request ask needs unsupported inference']

12255+ =/ callback=itype [%fn reply-sample.u.parts [%var 0]]

12256+ =/ sample=itype

12257+ ?^ fold.u.parts [%cell callback u.fold.u.parts]

12258+ ?~ parameters.u.parts callback

12259+ [%cell typ.i.parameters.u.parts callback]

12260+ =/ scheme=ischeme [[%fn sample u.result] ~[0]]

12261+ =/ exports=imold-types

12262+ (turn marks.support |=(m=iapi-mark-type [name.m [typ.m ~]]))

12263+ =/ prelude=iprelude prepared.ev

12264+ =/ public=ifile iface.prelude

12265+ ?~ source.public [%| 'request prelude source needs unsupported inference']

12266+ =/ private=(list iwidth-dependency)

12267+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

12268+ ?. ?=([* ~] private) [%| 'request internal source needs unsupported inference']

12269+ ?~ source.i.private [%| 'request internal source needs unsupported inference']

12270+ =/ req=irequest-evidence

12271+ [file name.path.p p src u.source.public u.source.i.private values.prelude molds.prelude externals marks]

12272+ =/ interface=ifile [~[[name.path.p scheme]] exports file ~ ~ ~ `src `[(silt `(list path)`~[file]) ~[req] modules `public values.prelude molds.prelude externals marks]]

12273+ [%& [support u.parts interface]]

12274+::

998212275++ api-mark-exports

998312276 |= [marks=(list term) all=(list term) externals=imark-externals]

998412277 ^- imold-types

@@ -10022,42 +12315,288 @@

1002212315 =/ mark=(unit itype) (find-imported-mark n mark-externals marks)

1002312316 ?~ mark ~

1002412317 =/ sc=ischeme [[%fn u.mark typ.u.poke] ~]

10025− `[~[[n sc]] (api-mark-exports marks marks mark-externals) at ~[[n i.t.t.at n]]]

12318+ `[~[[n sc]] (api-mark-exports marks marks mark-externals) at ~[[n i.t.t.at n]] ~ ~ ~ ~]

12319+::

12320+:: Source-proven ordinary helpers validate each selected /sur dependency.

12321+:: Unused or less direct cores remain unsupported by this first interface.

12322+++ api-sur-covered

12323+ |= [surs=(list term) defs=(list def) externals=iexternals all=(list term)]

12324+ ^- ?

12325+ ?~ surs &

12326+ =/ found=(list def)

12327+ %+ skim defs

12328+ |= d=def

12329+ ?. ?=(%mold -.d) |

12330+ ?. ?=(%ref -.shape.d) |

12331+ ?. ?=([@ [@ ~]] names.shape.d) |

12332+ =(i.t.names.shape.d i.surs)

12333+ ?~ found |

12334+ =/ selected=def i.found

12335+ ?. ?=(%mold -.selected) |

12336+ =/ sh=shape shape.selected

12337+ ?. ?=(%ref -.sh) |

12338+ ?. ?=([@ [@ ~]] names.sh) |

12339+ =/ checked=(unit itype) (find-imported-mold i.surs i.names.sh externals all)

12340+ ?~ checked |

12341+ $(surs t.surs)

12342+::

12343++$ imulti-request-gates [values=ienv requests=(list irequest-evidence)]

12344+++ api-request-gates

12345+ |= [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]

12346+ ^- (unit imulti-request-gates)

12347+ ?~ paths `[~ ~]

12348+ ?: =(0 fuel) ~

12349+ =/ p=iapi-path-typed i.paths

12350+ =/ parts=(unit iapi-request-parts) (api-request-parts `ev name.path.p)

12351+ ?~ parts ~

12352+ ?. ?=(?(~ [* ~]) parameters.u.parts) ~

12353+ ?: &(?=(^ fold.u.parts) ?=(^ parameters.u.parts)) ~

12354+ ?^ scry.path.p ~

12355+ ?^ (itype-vars reply-sample.u.parts) ~

12356+ ?: (itype-has-tag reply-sample.u.parts) ~

12357+ =/ open-fold=?

12358+ ?~ fold.u.parts |

12359+ |(?=(^ (itype-vars u.fold.u.parts)) (itype-has-tag u.fold.u.parts))

12360+ ?: open-fold ~

12361+ =/ result=(unit itype) (template-apply ask ~[[%var 0]])

12362+ ?~ result ~

12363+ =/ callback=itype [%fn reply-sample.u.parts [%var 0]]

12364+ =/ sample=itype

12365+ ?^ fold.u.parts [%cell callback u.fold.u.parts]

12366+ ?~ parameters.u.parts callback

12367+ [%cell typ.i.parameters.u.parts callback]

12368+ =/ scheme=ischeme [[%fn sample u.result] ~[0]]

12369+ =/ prep=iprelude prepared.ev

12370+ =/ req=irequest-evidence

12371+ [file name.path.p p src public internal values.prep molds.prep externals marks]

12372+ =/ rest=(unit imulti-request-gates)

12373+ $(paths t.paths, fuel (dec fuel))

12374+ ?~ rest ~

12375+ `[[[name.path.p scheme] values.u.rest] [req requests.u.rest]]

12376+::

12377+++ api-poke-from-checked

12378+ |= [file=path mod=module marks=imark-externals values=(list term) molds=(list term) prelude=(unit ifile)]

12379+ ^- (unit [values=ienv derived=(list iderived)])

12380+ =/ pokes=(list def)

12381+ (skim defs.mod |=(d=def &(?=(%mold -.d) =(%poke name.d))))

12382+ ?~ pokes `[~ ~]

12383+ ?. ?=([* ~] pokes) ~

12384+ =/ declared=(list term) (collect-mark-imports imports.mod)

12385+ =/ ns=(unit (list term)) (api-poke-mark-names pokes declared)

12386+ ?~ ns ~

12387+ ?. ?=([@ ~] u.ns) ~

12388+ =/ matching=(list import)

12389+ %+ skim imports.mod

12390+ |= i=import

12391+ ?. ?=(%mark -.i) |

12392+ =(mark.i i.u.ns)

12393+ ?. ?=([* ~] matching) ~

12394+ =/ checked=(unit ifile)

12395+ (api-poke-interface file mod(defs pokes, imports matching) marks values molds prelude)

12396+ ?~ checked ~

12397+ `[values.u.checked derived.u.checked]

12398+::

12399+:: The partial interface is published atomically: all paths, ordinary

12400+:: source definitions, declared marks and the poke must check. Unselected

12401+:: /sur bindings, runtime validation and value watchability remain unproved.

12402+++ multi-request-interface-graph

12403+ |= [file=path src=@t externals=iexternals marks=imark-externals modules=jbundle active=(list path) cache=jcache prepared=(unit iprelude)]

12404+ ^- (each [iface=ifile cache=jcache] @t)

12405+ =/ out (api-support-analysis-graph file src externals marks modules active cache prepared)

12406+ ?: ?=(%| -.out) [%| p.out]

12407+ =/ support=iapi-support-evidence p.out

12408+ =/ ev=iapi-path-evidence paths.support

12409+ =/ parsed (parse file src)

12410+ ?: ?=(%| -.parsed) [%| 'request source does not parse']

12411+ =/ mod=module p.parsed

12412+ ?. (levy imports.mod |=(i=import ?=(?(%mark %sur) -.i)))

12413+ [%| 'request imports need unsupported inference']

12414+ =/ surs=(list term) (collect-sur-imports imports.mod)

12415+ ?. (api-sur-covered surs defs.mod externals surs)

12416+ [%| 'API source dependency needs unsupported inference']

12417+ ?~ paths.ev [%| 'request count needs unsupported inference']

12418+ =/ ask=(unit ischeme) (request-compatible-ask prepared.ev)

12419+ ?~ ask [%| 'request ask needs unsupported inference']

12420+ =/ prep=iprelude prepared.ev

12421+ =/ public=ifile iface.prep

12422+ ?~ source.public [%| 'request prelude source needs unsupported inference']

12423+ =/ private=(list iwidth-dependency)

12424+ (skim dependencies.public |=(d=iwidth-dependency =(at.d /lib/jibb/internal/jibb)))

12425+ ?. ?=([* ~] private) [%| 'request internal source needs unsupported inference']

12426+ ?~ source.i.private [%| 'request internal source needs unsupported inference']

12427+ =/ gates=(unit imulti-request-gates)

12428+ (api-request-gates paths.ev ev u.ask file src u.source.public u.source.i.private externals marks 256)

12429+ ?~ gates [%| 'request paths need unsupported inference']

12430+ =/ poke=(unit [values=ienv derived=(list iderived)])

12431+ (api-poke-from-checked file mod marks values.prep molds.prep `public)

12432+ ?~ poke [%| 'API poke needs unsupported inference']

12433+ =/ mark-molds=imold-types

12434+ (turn marks.support |=(m=iapi-mark-type [name.m [typ.m ~]]))

12435+ =/ exports=imold-types (weld mark-molds molds.support)

12436+ =/ names=(list term) (turn exports |=(m=[name=term template=ischeme] name.m))

12437+ ?. (levy names |=(n=term (unique-value-name n names)))

12438+ [%| 'API exported molds need unsupported inference']

12439+ =/ env=ienv (weld values.u.gates (weld values.u.poke values.support))

12440+ =/ graph=irequest-graph

12441+ [(silt `(list path)`~[file]) requests.u.gates modules `public values.prep molds.prep externals marks]

12442+ =/ iface=ifile

12443+ [env exports file derived.u.poke elaborations.support ~ `src `graph]

12444+ [%& [iface dependencies.ev]]

1002612445::

1002712446++ infer-jibb-file

1002812447 |= [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)]

1002912448 ^- jfile-result

12449+ =/ out=jfile-detailed-result

12450+ (infer-jibb-file-detailed at src externals mark-externals modules active prelude-values prelude-molds cache prelude)

12451+ ?: ?=(%| -.out) [%| message.p.out]

12452+ [%& p.out]

12453+:: Returns structured root-source overlap evidence after the same full check.

12454+++ infer-jibb-file-detailed

12455+ |= [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)]

12456+ ^- jfile-detailed-result

1003012457 =/ parsed (parse at src)

10031− ?: ?=(%| -.parsed) [%| (crip "module source does not parse: {(spud at)}")]

12458+ ?: ?=(%| -.parsed) [%| [(crip "module source does not parse: {(spud at)}") ~]]

1003212459 =/ mod=module p.parsed

1003312460 =/ duplicate=(unit idiag) (duplicate-defs defs.mod)

10034− ?^ duplicate [%| (show-duplicate-fields at src u.duplicate)]

12461+ ?^ duplicate [%| [(show-duplicate-fields at src u.duplicate) ~]]

1003512462 ?: ?=([%ui %api *] at)

1003612463 =/ iface=(unit ifile) (api-poke-interface at mod mark-externals prelude-values prelude-molds prelude)

10037− ?~ iface [%| (crip "API module needs unsupported inference: {(spud at)}")]

10038− [%& [u.iface [[at u.iface] cache]]]

12464+ ?^ iface

12465+ =/ checked=ifile u.iface(source `src, graph `[(silt `(list path)`~[at]) ~ modules prelude prelude-values prelude-molds externals mark-externals])

12466+ [%& [checked [[at checked] cache]]]

12467+ ?~ prelude [%| [(crip "API module needs unsupported inference: {(spud at)}") ~]]

12468+ =/ prepared=iprelude [u.prelude prelude-values prelude-molds]

12469+ =/ narrow=?

12470+ ?. ?=([[%mark *] ~] imports.mod) |

12471+ ?. ?=([[%mold *] ~] defs.mod) |

12472+ ?. =(%paths name.i.defs.mod) |

12473+ !?=(%union -.shape.i.defs.mod)

12474+ ?: narrow

12475+ =/ request=(each ione-request-interface @t)

12476+ (one-request-interface-graph at src externals mark-externals modules active cache `prepared)

12477+ ?: ?=(%| -.request) [%| [(crip "API module needs unsupported inference: {(spud at)}") ~]]

12478+ =/ checked=ifile iface.p.request

12479+ [%& [checked [[at checked] dependencies.paths.support.p.request]]]

12480+ =/ multi=(each [iface=ifile cache=jcache] @t)

12481+ (multi-request-interface-graph at src externals mark-externals modules active cache `prepared)

12482+ ?: ?=(%| -.multi) [%| [(crip "API module needs unsupported inference: {(spud at)}") ~]]

12483+ [%& [iface.p.multi [[at iface.p.multi] cache.p.multi]]]

1003912484 ?. (module-scope-valid mod prelude-values prelude-molds)

1004012485 ?: (pending-declared-poke at mod prelude-values prelude-molds)

10041− [%| (crip "module kind or scope needs unsupported inference: {(spud at)}")]

10042− [%| (crip "module has conflicting names: {(spud at)}")]

12486+ [%| [(crip "module kind or scope needs unsupported inference: {(spud at)}") ~]]

12487+ [%| [(crip "module has conflicting names: {(spud at)}") ~]]

1004312488 =/ vals=(list term) (global-value-names defs.mod)

1004412489 ?: (lien vals |=(n=term =(n %main)))

10045− [%| (crip "module kind needs unsupported inference: {(spud at)}")]

10046− =/ js=jimports-result (resolve-jibb-imports imports.mod externals mark-externals modules active prelude-values prelude-molds cache prelude)

12490+ [%| [(crip "module kind needs unsupported inference: {(spud at)}") ~]]

12491+ =/ js=jimports-detailed-result (resolve-jibb-imports-detailed imports.mod externals mark-externals modules active prelude-values prelude-molds cache prelude)

1004712492 ?: ?=(%| -.js) [%| p.js]

10048− =/ molds=imolds (collect-simple-molds defs.mod)

12493+ =/ collected=grec-collected

12494+ ?^ imports.mod [(collect-simple-molds defs.mod) *(map term shape)]

12495+ (grec-collect-molds defs.mod)

12496+ =/ molds=imolds molds.collected

1004912497 =/ globals=(list term) (weld prelude-values (weld (import-binding-names imports.mod) vals))

1005012498 =/ surs=(list term) (collect-sur-imports imports.mod)

1005112499 =/ marks=(list term) (collect-mark-imports imports.mod)

1005212500 =/ reserved=(list term) (weld prelude-molds (turn resolved.p.js |=(j=[face=term interface=ifile] face.j)))

1005312501 =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

10054− =/ state=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks resolved.p.js reserved ~ ~ ~ | at top prelude ~ 256]

10055− =/ mts=(each imold-types @t) (module-mold-types molds state)

10056− ?: ?=(%| -.mts) [%| (crip "{(trip p.mts)}: {(spud at)}")]

10057− =/ env=ienv (resolve-supported-defs defs.mod molds globals externals surs mark-externals marks resolved.p.js reserved at prelude)

12502+ =/ state=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks resolved.p.js reserved ~ ~ ~ | at top prelude ~ 256 ~ ~ ~ ~ ~ ~]

12503+ :: Source and scope were checked above; preserve that exact root and prelude.

12504+ :: This first integration only indexes import-free library sources.

12505+ =/ index=(unit [at=path source=@t prelude=ifile shapes=(map term shape)])

12506+ ?^ imports.mod ~

12507+ ?~ prelude ~

12508+ =/ standard=(unit ischeme) (find-jibb-mold %list u.prelude)

12509+ ?~ standard ~

12510+ ?. =(u.standard [[%collection %list ~[[%var 0]]] ~[0]]) ~

12511+ =/ index=(map term shape) proofs.collected

12512+ ?. !=(index *(map term shape)) ~

12513+ ?: (lien molds |=(m=[name=term body=shape] =(%list name.m))) ~

12514+ `[at src u.prelude index]

12515+ =. grec-index.state index

12516+ =/ mts=(each imold-types imold-failure) (module-mold-types-detail molds state)

12517+ ?: ?=(%| -.mts)

12518+ ?~ overlap.p.mts [%| [(crip "{(trip message.p.mts)}: {(spud at)}") ~]]

12519+ =/ witness=[name=term cases=upair] u.overlap.p.mts

12520+ =/ first=@t (show-error src [at line.beg.first.cases.witness col.beg.first.cases.witness "first union case"])

12521+ =/ second=@t (show-error src [at line.beg.second.cases.witness col.beg.second.cases.witness "overlapping case"])

12522+ =/ msg=@t (of-wain:format ~[(crip "module mold {(trip name.witness)} has overlapping cases") first second])

12523+ [%| [msg `[at src name.witness cases.witness]]]

12524+ =/ resolution=iresolved

12525+ ?~ index

12526+ (resolve-groups defs.mod molds globals externals surs mark-externals marks resolved.p.js reserved at prelude)

12527+ (resolve-groups-core defs.mod molds globals externals surs mark-externals marks resolved.p.js reserved at prelude index)

12528+ =/ env=ienv env.resolution

12529+ =. env

12530+ ?: (module-values-complete defs.mod env) env

12531+ ?: |(?=([%ui %stores *] at) ?=(^ imports.mod) ?=(^ prelude) ?=(^ prelude-values) ?=(^ prelude-molds)) env

12532+ ?: (gth (met 3 src) 65.536) env

12533+ ?: (gth (lent defs.mod) 64) env

12534+ ?. (dg-source-candidate defs.mod 64) env

12535+ =/ transaction=(unit dgcommit) (dg-root-source at src)

12536+ ?~ transaction env

12537+ ?: (dg-interface-safe env.u.transaction) env.u.transaction

12538+ env

1005812539 ?. (module-values-complete defs.mod env)

10059− [%| (crip "module definitions need unsupported inference: {(spud at)}")]

10060− [%& [[env p.mts at ~] [[at [env p.mts at ~]] cache.p.js]]]

12540+ [%| [(crip "module definitions need unsupported inference: {(spud at)}") ~]]

12541+ =/ initial=irequest-graph [(silt `(list path)`~[at]) ~ modules prelude prelude-values prelude-molds externals mark-externals]

12542+ =/ graph=(unit irequest-graph) (request-graph-merge resolved.p.js initial (add 1 (lent resolved.p.js)))

12543+ ?~ graph [%| ['module request evidence needs unsupported inference' ~]]

12544+ =/ iface=ifile [env p.mts at ~ artifacts.resolution ~ `src graph]

12545+ [%& [iface [[at iface] cache.p.js]]]

12546+::

12547+:: A source-bound analysis of one named mold, not a module, island,

12548+:: request, watchability or runtime check. The host owns the trusted

12549+:: prepared prelude, canonical paths and reader/source version identities.

12550+:: The 256-node cap covers only classification, not source/graph work.

12551++$ igate-free-mold

12552+ [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]

12553+++ gate-free-mold-source

12554+ |= [file=path src=@t name=term externals=iexternals marks=imark-externals modules=jbundle prepared=(unit iprelude) fuel=@ud]

12555+ ^- (each igate-free-mold @t)

12556+ ?~ file [%| 'mold analysis needs a path ending in jibb']

12557+ ?. =(%jibb (rear file)) [%| 'mold analysis needs a path ending in jibb']

12558+ ?: |(=(file /lib/jibb/internal/jibb) =(file /lib/jibb/primitives/jibb))

12559+ [%| 'the prelude internal modules are private']

12560+ ?: ?=([%ui %api *] file) [%| 'API declarations need unsupported mold analysis']

12561+ ?: ?=([%ui %stores *] file) [%| 'store declarations need unsupported mold analysis']

12562+ =/ entries=jbundle (skim modules |=(m=jsource =(file at.m)))

12563+ ?: (gth (lent entries) 1) [%| 'duplicate root module sources']

12564+ =/ wrong-root=? ?~(entries | !=(source.i.entries src))

12565+ ?: wrong-root [%| 'root module source does not match bundle']

12566+ =/ parsed (parse file src)

12567+ ?: ?=(%| -.parsed) [%| 'mold source does not parse']

12568+ =/ mod=module p.parsed

12569+ =/ duplicate=(unit idiag) (duplicate-defs defs.mod)

12570+ ?^ duplicate [%| (show-duplicate-fields file src u.duplicate)]

12571+ ?~ prepared [%| 'mold analysis needs the prepared prelude']

12572+ ?. (module-scope-valid mod values.u.prepared molds.u.prepared)

12573+ [%| 'mold source has conflicting or unsupported scope']

12574+ =/ selected=(list def)

12575+ (skim defs.mod |=(d=def &(?=(%mold -.d) =(name.d name))))

12576+ ?~ selected [%| 'selected mold is not declared']

12577+ ?^ t.selected [%| 'selected mold is not unique']

12578+ ?> ?=(%mold -.i.selected)

12579+ =/ public=ifile iface.u.prepared

12580+ =/ js=jimports-result

12581+ (resolve-jibb-imports imports.mod externals marks modules ~[file] values.u.prepared molds.u.prepared ~ `public)

12582+ ?: ?=(%| -.js) [%| p.js]

12583+ =/ ms=imolds (collect-simple-molds defs.mod)

12584+ =/ vals=(list term) (global-value-names defs.mod)

12585+ =/ globals=(list term) (weld values.u.prepared (weld (import-binding-names imports.mod) vals))

12586+ =/ surs=(list term) (collect-sur-imports imports.mod)

12587+ =/ declared=(list term) (collect-mark-imports imports.mod)

12588+ =/ reserved=(list term) (weld molds.u.prepared (turn resolved.p.js |=(j=[face=term interface=ifile] face.j)))

12589+ =/ top=(list term) (turn ms |=(m=[name=term body=shape] name.m))

12590+ =/ state=istate [0 ~ ~ ~ ms globals externals surs marks declared resolved.p.js reserved ~ ~ ~ | file top `public ~ 256 ~ ~ ~ ~ ~ ~]

12591+ =/ inferred=(unit [template=ischeme state=istate])

12592+ (infer-mold-template shape.i.selected state(active ~[name], in-mold &))

12593+ ?~ inferred [%| 'selected mold needs unsupported inference']

12594+ =/ template=ischeme template.u.inferred

12595+ =. typ.template (label-direct-union typ.template shape.i.selected name state)

12596+ =. typ.template (itype-normalize typ.template sub.state.u.inferred)

12597+ =/ cap=@ud (min fuel 256)

12598+ =/ analysis=igate-free (gate-free-type typ.template cap ~)

12599+ [%& [file src name u.prepared externals marks modules cache.p.js template fuel cap analysis]]

1006112600::

1006212601:: +golden-types-with-modules fails closed for imports without prelude

1006312602:: scope. +golden-types-with-prelude resolves supported library graphs;

@@ -10155,6 +12694,8 @@

1015512694 ?: ?=(%| -.parsed) (show-error src p.parsed)

1015612695 =/ duplicate=(unit idiag) (duplicate-defs defs.p.parsed)

1015712696 ?^ duplicate (duplicate-fields-report file src u.duplicate)

12697+ ?: (module-has-reserved-proj p.parsed)

12698+ 'module has reserved proj name'

1015812699 =/ ds=(list def) defs.p.parsed

1015912700 =/ molds=imolds (collect-simple-molds ds)

1016012701 =/ globals=(list term) (weld prelude-values (weld (turn jimports |=(j=[face=term interface=ifile] face.j)) (global-value-names ds)))

@@ -10163,6 +12704,33 @@

1016312704 =/ resolution=iresolved (resolve-groups ds molds globals externals surs mark-externals marks jimports reserved-molds file prelude)

1016412705 =/ cycles=(list icycle) (definite-value-cycles ds globals)

1016512706 =/ env=ienv env.resolution

12707+ =/ recovered=(list term) ~

12708+ =/ eligible=?

12709+ ?& ?=(~ imports.p.parsed)

12710+ ?=(~ jimports)

12711+ ?=(~ prelude)

12712+ ?=(~ prelude-values)

12713+ ?=(~ reserved-molds)

12714+ !?=([%ui %api *] file)

12715+ !?=([%ui %stores *] file)

12716+ !(lien (global-value-names ds) |=(n=term =(n %main)))

12717+ (module-scope-valid p.parsed ~ ~)

12718+ !(module-values-complete ds env)

12719+ (lte (met 3 src) 65.536)

12720+ (lte (lent ds) 64)

12721+ (dg-source-candidate ds 64)

12722+ ==

12723+ =/ transaction=(unit dgcommit) ?:(eligible (dg-root-source file src) ~)

12724+ =. recovered

12725+ ?~ transaction ~

12726+ ?. &((module-values-complete ds env.u.transaction) (dg-interface-safe env.u.transaction)) ~

12727+ (turn (skim env.u.transaction |=(entry=[name=term scheme=ischeme] ?=(~ (ienv-lookup name.entry env)))) |=(entry=[name=term scheme=ischeme] name.entry))

12728+ =. env

12729+ ?~ transaction env

12730+ ?: &((module-values-complete ds env.u.transaction) (dg-interface-safe env.u.transaction)) env.u.transaction

12731+ env

12732+ =/ source-defs=(map term def) (direct-checked-gates ds env)

12733+ =/ heads=(unit igate-prelude-evidence) (direct-prelude-evidence ds prelude)

1016612734 =/ lines=(list @t) ~

1016712735 |-

1016812736 ?~ ds (of-wain:format ['partial inference; module not checked' (flop lines)])

@@ -10175,6 +12743,16 @@

1017512743 ?^ cycle

1017612744 =/ diag=idiag ["non-gate value depends on itself through a cycle" ~[[first.i.cycle "value in cycle"] [next.i.cycle "dependency in cycle"]]]

1017712745 $(ds t.ds, lines [(show-inference-diagnostic file src name.d diag) lines])

12746+ ?: (lien recovered |=(n=term =(n name.d)))

12747+ =/ found=(unit ischeme) (ienv-lookup name.d env)

12748+ ?~ found $(ds t.ds, lines [(crip "++ {(trip name.d)}: committed definition unavailable") lines])

12749+ ?: (itype-has-hidden-recursive typ.u.found)

12750+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: recursive mold name is not available in this scope") lines])

12751+ ?: (itype-has-hidden-generic typ.u.found)

12752+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: generic union name is not available in this scope") lines])

12753+ =/ typ=itype (canonical-itype typ.u.found vars.u.found)

12754+ =/ line=@t (crip "++ {(trip name.d)}: {(show-itype typ ~)}{(show-atom-constraint typ)}")

12755+ $(ds t.ds, lines [line lines])

1017812756 ?: (lien grouped.resolution |=(n=term =(n name.d)))

1017912757 =/ found=(unit ischeme) (ienv-lookup name.d env)

1018012758 ?~ found $(ds t.ds, lines [(crip "++ {(trip name.d)}: recursive group unavailable") lines])

@@ -10182,7 +12760,9 @@

1018212760 =/ line=@t (crip "++ {(trip name.d)}: {(show-itype typ ~)}{(show-atom-constraint typ)}")

1018312761 $(ds t.ds, lines [line lines])

1018412762 =/ top=(list term) (turn molds |=(m=[name=term body=shape] name.m))

10185− =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | file top prelude ~ 256]

12763+ =/ initial=istate [0 ~ ~ ~ molds globals externals surs mark-externals marks jimports reserved-molds ~ ~ ~ | file top prelude ~ 256 ~ ~ ~ ~ ~ ~]

12764+ =. gate-defs.initial source-defs

12765+ =. head-evidence.initial heads

1018612766 =. initial (reserve-def-caps val.d initial)

1018712767 =/ result=iresult

1018812768 ?: |(?=(%gate -.val.d) ?=(%gate-wide -.val.d))

@@ -10190,6 +12770,7 @@

1019012770 (infer-fragment val.d env initial)

1019112771 ?: ?=(%| -.result)

1019212772 $(ds t.ds, lines [(show-inference-diagnostic file src name.d p.result) lines])

12773+ =. state.p.result (promote-restricted-numbers state.p.result env)

1019312774 =. 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)))

1019412775 =/ hole=(unit idiag) (unresolved-hole holes.state.p.result holes.initial state.p.result)

1019512776 ?^ hole

@@ -10216,7 +12797,576 @@

1021612797 =/ vars=(list @ud) (unique-type-vars (itype-vars typ))

1021712798 ?: (gth (lent vars) 26)

1021812799 $(ds t.ds, lines [(crip "++ {(trip name.d)}: too many variables for partial printer") lines])

12800+ ?~ (width-finalize projections.state.p.result sub.state.p.result vars)

12801+ $(ds t.ds, lines [(crip "++ {(trip name.d)}: record projection elaboration needs unsupported inference") lines])

1021912802 =/ printable=itype (canonical-itype typ vars)

1022012803 =/ line=@t (crip "++ {(trip name.d)}: {(show-itype printable ~)}{(show-atom-constraint printable)}")

1022112804 $(ds t.ds, lines [line lines])

12805+:: Experimental module-owned pending-constraint generalization only.

12806+:: Inputs, IDs and substitution come from one checker-owned transaction.

12807++$ dgscan [ids=(list @ud) fuel=@ud]

12808+++ dg-scan

12809+ |= [todo=(list itype) sub=isub fuel=@ud ids=(list @ud)]

12810+ ^- (unit dgscan)

12811+ ?~ todo `[ids fuel]

12812+ ?: =(0 fuel) ~

12813+ =. fuel (dec fuel)

12814+ =/ t=itype i.todo

12815+ ?: ?=(?(%var %avar %rvar %nvar %rnvar %tag) -.t)

12816+ =/ node-id=@ud ?:(?=(%tag -.t) id.t +.t)

12817+ =/ found=(unit itype) (itype-lookup node-id sub)

12818+ ?~ found $(todo t.todo, ids [node-id ids])

12819+ ?: &(?=(?(%rvar %rnvar) -.u.found) =(node-id +.u.found))

12820+ $(todo t.todo, ids [node-id ids])

12821+ $(todo [u.found t.todo])

12822+ ?: ?=(%jrec -.t) $(todo t.todo)

12823+ ?+ -.t ~

12824+ %collection $(todo (weld args.t t.todo))

12825+ %union $(todo (weld args.t (weld cases.t t.todo)))

12826+ %face $(todo [body.t t.todo])

12827+ %fn $(todo [sample.t product.t t.todo])

12828+ %cell $(todo [hed.t tal.t t.todo])

12829+ %atom $(todo t.todo)

12830+ %any-atom $(todo t.todo)

12831+ %flag $(todo t.todo)

12832+ %noun $(todo t.todo)

12833+ %empty $(todo t.todo)

12834+ %const $(todo t.todo)

12835+ ==

12836+::

12837+++ dg-scan-ids

12838+ |= [ids=(list @ud) sub=isub fuel=@ud blocked=(list @ud)]

12839+ ^- (unit dgscan)

12840+ ?~ ids `[blocked fuel]

12841+ =/ one=(unit dgscan) (dg-scan ~[[%var i.ids]] sub fuel blocked)

12842+ ?~ one ~

12843+ $(ids t.ids, fuel fuel.u.one, blocked ids.u.one)

12844+::

12845+++ dg-env

12846+ |= [env=ienv sub=isub fuel=@ud blocked=(list @ud)]

12847+ ^- (unit dgscan)

12848+ ?~ env `[blocked fuel]

12849+ =/ sc=ischeme scheme.i.env

12850+ :: Quantifiers are local to the scheme: first find raw free IDs, then

12851+ :: follow those IDs in the module substitution without capturing them.

12852+ =/ raw=(unit dgscan) (dg-scan ~[typ.sc] ~ fuel ~)

12853+ ?~ raw ~

12854+ =/ free=(list @ud) (skim ids.u.raw |=(n=@ud !(lien vars.sc |=(q=@ud =(q n)))))

12855+ =/ resolved=(unit dgscan) (dg-scan-ids free sub fuel.u.raw blocked)

12856+ ?~ resolved ~

12857+ $(env t.env, fuel fuel.u.resolved, blocked ids.u.resolved)

12858+::

12859+++ dg-obligations

12860+ |= [pending=(list dgo) sub=isub fuel=@ud blocked=(list @ud)]

12861+ ^- (unit dgscan)

12862+ ?~ pending `[blocked fuel]

12863+ =/ found=(unit dgscan) (dg-scan ~[left.i.pending right.i.pending] sub fuel blocked)

12864+ ?~ found ~

12865+ $(pending t.pending, fuel fuel.u.found, blocked ids.u.found)

12866+::

12867+++ dg-tags

12868+ |= [tags=(list ipending) sub=isub fuel=@ud blocked=(list @ud)]

12869+ ^- (unit dgscan)

12870+ ?~ tags `[blocked fuel]

12871+ ?: =(0 fuel) ~

12872+ =/ found=(unit itype) (itype-lookup id.i.tags sub)

12873+ ?~ found $(tags t.tags, fuel (dec fuel), blocked [id.i.tags blocked])

12874+ :: Until this entry is explicitly discharged, retain variables reachable

12875+ :: through its binding; mere existence of a substitution is not proof.

12876+ =/ reached=(unit dgscan) (dg-scan ~[u.found] sub (dec fuel) blocked)

12877+ ?~ reached ~

12878+ $(tags t.tags, fuel fuel.u.reached, blocked ids.u.reached)

12879+::

12880+++ dg-generalize

12881+ |= [typ=itype env=ienv pending=(list dgo) tags=(list ipending) captured=(list @ud) state=istate fuel=@ud]

12882+ ^- (unit ischeme)

12883+ :: Bound the obligation list and all graph/substitution walks. The

12884+ :: substitution is assumed checker-owned and occurs-checked.

12885+ ?: (gth (lent pending) 64) ~

12886+ =/ capt=(unit dgscan) (dg-scan-ids captured sub.state fuel ~)

12887+ ?~ capt ~

12888+ =/ env-free=(unit dgscan) (dg-env env sub.state fuel.u.capt ids.u.capt)

12889+ ?~ env-free ~

12890+ =/ obligations=(unit dgscan) (dg-obligations pending sub.state fuel.u.env-free ids.u.env-free)

12891+ ?~ obligations ~

12892+ =/ tagged=(unit dgscan) (dg-tags tags sub.state fuel.u.obligations ids.u.obligations)

12893+ ?~ tagged ~

12894+ =/ bounded=(unit dgscan) (dg-scan ~[typ] sub.state fuel.u.tagged ~)

12895+ ?~ bounded ~

12896+ =/ normalized=itype (itype-normalize typ sub.state)

12897+ =/ vars=(list @ud) (unique-type-vars (itype-vars normalized))

12898+ =/ quantified=(list @ud) (skim vars |=(n=@ud !(lien ids.u.tagged |=(b=@ud =(b n)))))

12899+ `[[normalized quantified]]

12900+::

12901++$ dgcommit [env=ienv state=istate]

12902+:: A branch literal must not acquire a value face through replay.

12903+++ dg-literal-target-safe

12904+ |= target=itype

12905+ ^- ?

12906+ ?: ?=(%union -.target)

12907+ (levy cases.target |=(c=itype ?=(?(%const %cell) -.c)))

12908+ ?=(?(%const %atom %any-atom %flag %noun) -.target)

12909+::

12910+++ dg-replay-edges

12911+ |= [edges=(list dgo) state=istate fuel=@ud]

12912+ ^- (unit istate)

12913+ ?~ edges `state

12914+ ?: =(0 fuel) ~

12915+ =/ trial=ifit (itype-fit left.i.edges right.i.edges sub.state next.state)

12916+ ?. ?=(%ok -.trial) ~

12917+ =/ valid=?

12918+ ?: ?=(%tag -.left.i.edges)

12919+ ?. constructor.left.i.edges

12920+ =/ closed=(unit dgscan) (dg-scan ~[right.i.edges] sub.trial 512 ~)

12921+ ?~ closed |

12922+ ?^ ids.u.closed |

12923+ (dg-literal-target-safe (itype-normalize right.i.edges sub.trial))

12924+ =((itype-walk left.i.edges sub.trial) (itype-walk right.i.edges sub.trial))

12925+ =((itype-walk left.i.edges sub.trial) (itype-walk right.i.edges sub.trial))

12926+ ?. valid ~

12927+ $(edges t.edges, state state(sub sub.trial, next next.trial), fuel (dec fuel))

12928+::

12929+++ dg-close-env

12930+ |= [env=ienv sub=isub fuel=@ud]

12931+ ^- (unit ienv)

12932+ ?~ env `~

12933+ ?: =(0 fuel) ~

12934+ =/ s=ischeme scheme.i.env

12935+ :: Quantified IDs are scheme-local and cannot be rewritten on publication.

12936+ ?. (levy vars.s |=(n=@ud ?=(~ (itype-lookup n sub)))) ~

12937+ =/ bounded=(unit dgscan) (dg-scan ~[typ.s] sub (dec fuel) ~)

12938+ ?~ bounded ~

12939+ =/ normalized=itype (itype-normalize typ.s sub)

12940+ ?: (itype-has-tag normalized) ~

12941+ =/ vars=(list @ud) (unique-type-vars (itype-vars normalized))

12942+ ?. (levy vars |=(n=@ud (lien vars.s |=(v=@ud =(v n))))) ~

12943+ =/ rest=(unit ienv) (dg-close-env t.env sub fuel.u.bounded)

12944+ ?~ rest ~

12945+ `[[name.i.env [normalized vars.s]] u.rest]

12946+::

12947+:: A deferred boolean branch has exactly the two literal flag patterns.

12948+:: Arms are inferred in order. Equal types are retained; two direct pending

12949+:: literals may instead retain source-owned obligations for later context.

12950+++ dg-boolean-patterns

12951+ |= e=expr

12952+ ^- ?

12953+ ?. ?=(%branch -.e) |

12954+ ?~ arms.e |

12955+ ?~ t.arms.e |

12956+ ?^ t.t.arms.e |

12957+ =/ x=arm i.arms.e

12958+ =/ y=arm i.t.arms.e

12959+ ?. &(?=(%lit -.pat.x) ?=(%lit -.pat.y)) |

12960+ ?. &(=(%loobean form.lit.pat.x) =(%loobean form.lit.pat.y)) |

12961+ !=(val.lit.pat.x val.lit.pat.y)

12962+:: Only a direct source literal which created its own unbound pending tag

12963+:: may create a branch edge. The caller must retain the exact source and state.

12964+++ dg-owned-arm-literal

12965+ |= [e=expr t=itype tags=(list ipending) sub=isub initial=@ud]

12966+ ^- ?

12967+ ?. ?=(%lit -.e) |

12968+ ?. ?=(%tag -.t) |

12969+ ?: constructor.t |

12970+ ?. =(lit.e literal.t) |

12971+ ?: (lth id.t initial) |

12972+ ?^ (itype-lookup id.t sub) |

12973+ (lien tags |=(x=ipending &(=(id.x id.t) =(literal.x literal.t))))

12974+++ dg-boolean-branch

12975+ |= [e=expr env=ienv state=istate]

12976+ ^- iresult

12977+ ?. (dg-boolean-patterns e) [%| ["deferred branch patterns need unsupported inference" ~]]

12978+ ?> ?=(%branch -.e)

12979+ ?> ?=(^ arms.e)

12980+ ?> ?=(^ t.arms.e)

12981+ =/ x=arm i.arms.e

12982+ =/ y=arm i.t.arms.e

12983+ =/ subject=iresult (infer-fragment subject.e env state)

12984+ ?: ?=(%| -.subject) subject

12985+ =/ su=(unit isub) (itype-unify typ.p.subject [%flag ~] sub.state.p.subject)

12986+ ?~ su [%| ["deferred branch subject does not unify with ?" ~]]

12987+ =/ left=iresult (infer-fragment val.x env state.p.subject(sub u.su))

12988+ ?: ?=(%| -.left) left

12989+ =/ right=iresult (infer-fragment val.y env state.p.left)

12990+ ?: ?=(%| -.right) right

12991+ ?. (dg-stable-fit typ.p.left typ.p.right sub.state.p.right)

12992+ =/ st=istate state.p.right

12993+ ?. (dg-owned-arm-literal val.x typ.p.left tags.st sub.st next.state)

12994+ [%| ["deferred branch arm context needs unsupported inference" ~]]

12995+ ?. (dg-owned-arm-literal val.y typ.p.right tags.st sub.st next.state)

12996+ [%| ["deferred branch arm context needs unsupported inference" ~]]

12997+ ?> ?=(%tag -.typ.p.left)

12998+ ?> ?=(%tag -.typ.p.right)

12999+ ?: =(id.typ.p.left id.typ.p.right)

13000+ [%| ["deferred branch arm context needs unsupported inference" ~]]

13001+ ?: (gth (lent obligations.st) 62)

13002+ [%| ["deferred branch arm context needs unsupported inference" ~]]

13003+ =/ result=itype [%var next.st]

13004+ =/ ex=dgo [typ.p.left result (span-of val.x) (span-of e)]

13005+ =/ ey=dgo [typ.p.right result (span-of val.y) (span-of e)]

13006+ [%& result st(next +(next.st), obligations [ex ey obligations.st])]

13007+ [%& typ.p.left state.p.right]

13008+::

13009+:: Deferred inference uses only source forms whose successful fit sites are

13010+:: guarded below; a shared source-node budget bounds this screen.

13011+++ dg-safe-expressions

13012+ |= [todo=(list expr) fuel=@ud]

13013+ ^- (unit @ud)

13014+ ?~ todo `fuel

13015+ =/ first=(unit @ud) (dg-safe-expression i.todo fuel)

13016+ ?~ first ~

13017+ $(todo t.todo, fuel u.first)

13018+++ dg-safe-expression

13019+ |= [e=expr fuel=@ud]

13020+ ^- (unit @ud)

13021+ ?: =(0 fuel) ~

13022+ =. fuel (dec fuel)

13023+ ?+ -.e ~

13024+ ?(%lit %ctor) `fuel

13025+ %wing ?:(?=([@ ~] names.e) `fuel ~)

13026+ %str

13027+ ?. (levy pieces.e |=(p=piece ?=(%text -.p))) ~

13028+ `fuel

13029+ %group $(e inner.e, fuel fuel)

13030+ %body

13031+ ?^ defs.e ~

13032+ $(e final.e, fuel fuel)

13033+ %gate $(e body.e, fuel fuel)

13034+ %gate-wide $(e body.e, fuel fuel)

13035+ %branch

13036+ ?. (dg-boolean-patterns e) ~

13037+ ?> ?=(^ arms.e)

13038+ ?> ?=(^ t.arms.e)

13039+ =/ subject=(unit @ud) $(e subject.e, fuel fuel)

13040+ ?~ subject ~

13041+ (dg-safe-expressions ~[val.i.arms.e val.i.t.arms.e] u.subject)

13042+ %cast $(e val.e, fuel fuel)

13043+ %call

13044+ =/ head=(unit @ud) $(e head.e, fuel fuel)

13045+ ?~ head ~

13046+ (dg-safe-expressions args.e u.head)

13047+ ==

13048+:: Exact normalized equality is preserved by all later substitutions.

13049+:: The bounded scan declines opaque types and oversized inputs.

13050+++ dg-stable-fit

13051+ |= [actual=itype expected=itype sub=isub]

13052+ ^- ?

13053+ ?~ (dg-scan ~[actual expected] sub 512 ~) |

13054+ =((itype-normalize actual sub) (itype-normalize expected sub))

13055+::

13056+:: A positional call peels sample-slot faces during its separate face check.

13057+:: Require its argument, sample and result closed so that check stays valid.

13058+++ dg-stable-call-fit

13059+ |= [actual=itype expected=itype product=itype sub=isub positional=?]

13060+ ^- ?

13061+ =/ checked=(unit dgscan) (dg-scan ~[actual expected product] sub 512 ~)

13062+ ?~ checked |

13063+ ?: &(positional ?=(^ ids.u.checked)) |

13064+ =((itype-normalize actual sub) (itype-normalize expected sub))

13065+::

13066+:: One definition attempt retains state only when inference succeeds.

13067++$ dg-step [env=ienv state=istate pending=(list dgo)]

13068+++ dg-stage-one

13069+ |= [d=def env=ienv state=istate]

13070+ ^- (unit dg-step)

13071+ ?> ?=(%value -.d)

13072+ ?~ (dg-safe-expression val.d 512) ~

13073+ =/ local=istate (reserve-def-caps val.d state)

13074+ :: This first slice declines all written capitals and holes/projections.

13075+ ?^ caps.local ~

13076+ =/ ordinary=iresult (infer-fragment val.d env local)

13077+ ?: ?=(%| -.ordinary) ~

13078+ =/ typ=itype typ.p.ordinary

13079+ =/ after=istate state.p.ordinary

13080+ =/ edges=(list dgo) obligations.after

13081+ ?. =(binders.after binders.state) ~

13082+ ?. =(molds.after molds.state) ~

13083+ ?. =(globals.after globals.state) ~

13084+ ?. =(externals.after externals.state) ~

13085+ ?. =(surs.after surs.state) ~

13086+ ?. =(mark-externals.after mark-externals.state) ~

13087+ ?. =(marks.after marks.state) ~

13088+ ?. =(jimports.after jimports.state) ~

13089+ ?. =(reserved-molds.after reserved-molds.state) ~

13090+ ?. =(params.after params.state) ~

13091+ ?. =(active.after active.state) ~

13092+ ?. =(in-mold.after in-mold.state) ~

13093+ ?. =(at.after at.state) ~

13094+ ?. =(top-molds.after top-molds.state) ~

13095+ ?. =(prelude.after prelude.state) ~

13096+ ?. =(gate-defs.after gate-defs.state) ~

13097+ ?. =(head-evidence.after head-evidence.state) ~

13098+ ?. =(grec-index.after grec-index.state) ~

13099+ ?. =(defer.after defer.state) ~

13100+ ?. =(holes.after holes.state) ~

13101+ ?. =(caps.after caps.state) ~

13102+ ?. =(projections.after projections.state) ~

13103+ ?: (unsupported-atom-vars (itype-normalize typ sub.after) caps.after binders.after sub.after) ~

13104+ ?: (itype-has-nvar (itype-normalize typ sub.after)) ~

13105+ =/ scheme=(unit ischeme) (dg-generalize typ env edges tags.after ~ after 32.768)

13106+ ?~ scheme ~

13107+ `[[[name.d u.scheme] env] after edges]

13108+:: Retry only definitions that did not infer. Successful definitions are

13109+:: committed into the local transaction, never published until all close.

13110+++ dg-stage

13111+ |= [ds=(list def) base=ienv env=ienv state=istate pending=(list dgo) fuel=@ud]

13112+ ^- (unit dgcommit)

13113+ ?: (gth fuel 64) ~

13114+ ?: (gth (lent ds) fuel) ~

13115+ =/ remaining=(list def) ds

13116+ =/ waiting=(list def) ~

13117+ =/ progress=? |

13118+ =/ attempts=@ud (mul fuel fuel)

13119+ |-

13120+ ?~ remaining

13121+ ?^ waiting

13122+ ?. progress ~

13123+ $(remaining (flop waiting), waiting ~, progress |)

13124+ =/ replayed=(unit istate) (dg-replay-edges pending state 64)

13125+ ?~ replayed ~

13126+ ?: (pending-tags tags.u.replayed sub.u.replayed) ~

13127+ =/ closed-edges=(unit dgscan) (dg-obligations pending sub.u.replayed 32.768 ~)

13128+ ?~ closed-edges ~

13129+ ?^ ids.u.closed-edges ~

13130+ =/ rechecked=(unit istate) (dg-replay-edges pending u.replayed 64)

13131+ ?~ rechecked ~

13132+ ?. =(sub.u.rechecked sub.u.replayed) ~

13133+ ?. =(next.u.rechecked next.u.replayed) ~

13134+ =/ closed=(unit ienv) (dg-close-env env sub.u.replayed 32.768)

13135+ ?~ closed ~

13136+ `[[u.closed u.replayed(defer ~, obligations ~)]]

13137+ ?: =(0 attempts) ~

13138+ =. attempts (dec attempts)

13139+ =/ d=def i.remaining

13140+ ?: ?=(%mold -.d) $(remaining t.remaining)

13141+ ?^ (ienv-lookup name.d base) $(remaining t.remaining)

13142+ ?^ (ienv-lookup name.d env) ~

13143+ =/ done=(unit dg-step) (dg-stage-one d env state)

13144+ ?~ done $(remaining t.remaining, waiting [d waiting])

13145+ $(remaining t.remaining, env env.u.done, state state.u.done, pending pending.u.done, progress &)

13146+::

13147+:: Cheap bounded eligibility check on the already parsed source. This

13148+:: deliberately covers only direct constructor calls beneath transparent

13149+:: groups, gates, casts and definition-free bodies. Other shapes decline

13150+:: this fallback without a second parse or resolution pass.

13151+++ dg-direct-source

13152+ |= [e=expr fuel=@ud]

13153+ ^- ?

13154+ ?: =(0 fuel) |

13155+ ?+ -.e |

13156+ %group $(e inner.e, fuel (dec fuel))

13157+ %gate $(e body.e, fuel (dec fuel))

13158+ %gate-wide $(e body.e, fuel (dec fuel))

13159+ %cast $(e val.e, fuel (dec fuel))

13160+ %body ?~(defs.e $(e final.e, fuel (dec fuel)) |)

13161+ %call

13162+ ?. ?=([* ~] args.e) |

13163+ ?=(%ctor -.i.args.e)

13164+ ==

13165+++ dg-source-candidate

13166+ |= [ds=(list def) fuel=@ud]

13167+ ^- ?

13168+ ?~ ds |

13169+ ?: =(0 fuel) |

13170+ ?. ?=(%value -.i.ds) $(ds t.ds, fuel (dec fuel))

13171+ ?: (dg-direct-source val.i.ds 64) &

13172+ $(ds t.ds, fuel (dec fuel))

13173+::

13174+++ dg-interface-safe

13175+ |= [env=ienv]

13176+ ^- ?

13177+ ?~ env &

13178+ =/ sc=ischeme scheme.i.env

13179+ ?: |((itype-has-hidden-recursive typ.sc) (itype-has-hidden-generic typ.sc)) |

13180+ ?: (gth (lent vars.sc) 26) |

13181+ $(env t.env)

13182+:: Parse status and the transaction result come from the same source parse.

13183++$ dgparse [parsed=? result=(unit dgcommit)]

13184+++ dg-root-source

13185+ |= [at=path src=@t]

13186+ ^- (unit dgcommit)

13187+ result:(dg-root-detail at src)

13188+++ dg-root-detail

13189+ |= [at=path src=@t]

13190+ ^- dgparse

13191+ =/ parsed (parse at src)

13192+ ?: ?=(%| -.parsed) [| ~]

13193+ =/ transact

13194+ |.

13195+ ?^ imports.p.parsed ~

13196+ ?. (module-scope-valid p.parsed ~ ~) ~

13197+ ?^ (duplicate-defs defs.p.parsed) ~

13198+ =/ defs=(list def) defs.p.parsed

13199+ ?: (gth (lent defs) 64) ~

13200+ =/ molds=imolds (collect-simple-molds defs)

13201+ =/ globals=(list term) (global-value-names defs)

13202+ =/ resolution=iresolved (resolve-groups defs molds globals ~ ~ ~ ~ ~ ~ at ~)

13203+ ?^ grouped.resolution ~

13204+ ?^ artifacts.resolution ~

13205+ =/ base=ienv env.resolution

13206+ =/ free=(unit dgscan) (dg-env base ~ 32.768 ~)

13207+ ?~ free ~

13208+ ?^ ids.u.free ~

13209+ =/ all=(unit dgscan) (dg-all-env-ids base 32.768 ~)

13210+ ?~ all ~

13211+ =/ fresh=@ud (dg-next-id ids.u.all 0)

13212+ =/ st=istate *istate

13213+ =. st st(next fresh, defer `~, molds molds, globals globals, at at, top-molds (turn molds |=(m=[name=term body=shape] name.m)), in-mold |, jrec-fuel 256)

13214+ =/ checked-molds=(each imold-types @t) (module-mold-types molds st)

13215+ ?: ?=(%| -.checked-molds) ~

13216+ (dg-stage defs base base st ~ 64)

13217+ ::

13218+ [& (transact)]

13219+++ dg-all-env-ids

13220+ |= [env=ienv fuel=@ud ids=(list @ud)]

13221+ ^- (unit dgscan)

13222+ ?~ env `[ids fuel]

13223+ ?: =(0 fuel) ~

13224+ =/ sc=ischeme scheme.i.env

13225+ ?: (itype-has-tag typ.sc) ~

13226+ =/ raw=(unit dgscan) (dg-scan ~[typ.sc] ~ (dec fuel) ids)

13227+ ?~ raw ~

13228+ =/ quant=(unit dgscan) (dg-scan-ids vars.sc ~ fuel.u.raw ids.u.raw)

13229+ ?~ quant ~

13230+ $(env t.env, fuel fuel.u.quant, ids ids.u.quant)

13231+::

13232+++ dg-next-id

13233+ |= [ids=(list @ud) largest=@ud]

13234+ ^- @ud

13235+ ?~ ids +(largest)

13236+ $(ids t.ids, largest (max largest i.ids))

13237+::

13238+++ dg-eligible-ctor

13239+ |= [e=expr head=itype actual=itype expected=itype state=istate]

13240+ ^- (unit dgo)

13241+ ?. ?=(%call -.e) ~

13242+ ?. ?=([* ~] args.e) ~

13243+ ?. ?=(%ctor -.i.args.e) ~

13244+ ?. ?=(%fn -.head) ~

13245+ ?. ?=(%fn -.expected) ~

13246+ ?. ?=(%tag -.actual) ~

13247+ ?. constructor.actual ~

13248+ ?. ?=(%var -.product.expected) ~

13249+ ?^ (itype-lookup id.product.expected sub.state) ~

13250+ =/ bounded=(unit dgscan) (dg-scan ~[sample.expected] sub.state 256 ~)

13251+ ?~ bounded ~

13252+ ?^ ids.u.bounded ~

13253+ `[[actual expected (span-of i.args.e) (span-of head.e)]]

13254+::

13255+:: Experimental per-module, source-derived recursive tree index.

13256+:: The two tags and the exact children/list/self layout are fixed-shape

13257+:: checks, so ordinary definitions incur no type-tree or source scans.

13258+++ grec-tagged-fields

13259+ |= sh=shape

13260+ ^- (unit [tag=@ fields=(list field)])

13261+ ?. ?=(%cell -.sh) ~

13262+ ?~ fields.sh ~

13263+ =/ head=field i.fields.sh

13264+ ?. ?=(%bare -.head) ~

13265+ ?. ?=(%const -.shape.head) ~

13266+ ?. &(?=(%term form.lit.shape.head) =(%tas aura.lit.shape.head)) ~

13267+ `[val.lit.shape.head t.fields.sh]

13268+++ grec-tree-children

13269+ |= [fs=(list field) param=@t]

13270+ ^- (unit field)

13271+ ?~ fs ~

13272+ ?~ t.fs `i.fs

13273+ ?^ t.t.fs ~

13274+ =/ event=field i.fs

13275+ =/ kids=field i.t.fs

13276+ ?. &(?=(%face -.event) ?=(%face -.kids)) ~

13277+ ?. !=(name.event name.kids) ~

13278+ ?. ?=(%fn -.shape.event) ~

13279+ ?. ?=(%aura -.sample.shape.event) ~

13280+ ?. =(%t aura.sample.shape.event) ~

13281+ ?. ?=(%tvar -.product.shape.event) ~

13282+ ?. =(param name.product.shape.event) ~

13283+ `kids

13284+::

13285+++ grec-tree-proof

13286+ |= [name=term sh=shape]

13287+ ^- ?

13288+ ?. ?=(%generic -.sh) |

13289+ ?. ?=([@ ~] vars.sh) |

13290+ =/ param=@t i.vars.sh

13291+ ?. ?=(%union -.body.sh) |

13292+ ?. ?=([* [* ~]] cases.body.sh) |

13293+ =/ a=(unit [tag=@ fields=(list field)]) (grec-tagged-fields i.cases.body.sh)

13294+ =/ b=(unit [tag=@ fields=(list field)]) (grec-tagged-fields i.t.cases.body.sh)

13295+ ?~ a |

13296+ ?~ b |

13297+ ?. !=(tag.u.a tag.u.b) |

13298+ ?. ?=([* ~] fields.u.a) |

13299+ =/ value=field i.fields.u.a

13300+ ?. ?=(%face -.value) |

13301+ ?. ?=(%aura -.shape.value) |

13302+ ?. =(%t aura.shape.value) |

13303+ =/ selected=(unit field) (grec-tree-children fields.u.b param)

13304+ ?~ selected |

13305+ =/ kids=field u.selected

13306+ ?. ?=(%face -.kids) |

13307+ ?. ?=(%apply -.shape.kids) |

13308+ ?. =(ref.shape.kids ~[%list]) |

13309+ ?. ?=([* ~] args.shape.kids) |

13310+ =/ self=shape i.args.shape.kids

13311+ ?. ?=(%apply -.self) |

13312+ ?. =(ref.self ~[name]) |

13313+ ?. ?=([* ~] args.self) |

13314+ ?. ?=(%tvar -.i.args.self) |

13315+ =(name.i.args.self param)

13316++$ grec-collected [molds=imolds proofs=(map term shape)]

13317+:: Experimental one-layer analysis view, never an exported mold identity.

13318+++ grec-unfold-view

13319+ |= [typ=itype fuel=@ud]

13320+ ^- (unit [view=itype left=@ud])

13321+ ?. ?=(%grec -.typ) ~

13322+ ?: =(fuel 0) ~

13323+ ?. ?=([* ~] args.typ) ~

13324+ =/ sh=shape proof.typ

13325+ ?. (grec-tree-proof name.typ sh) ~

13326+ ?> ?=(%generic -.sh)

13327+ ?> ?=([@ ~] vars.sh)

13328+ ?> ?=(%union -.body.sh)

13329+ ?> ?=([* [* ~]] cases.body.sh)

13330+ =/ ca=shape i.cases.body.sh

13331+ =/ cb=shape i.t.cases.body.sh

13332+ ?> ?=(%cell -.ca)

13333+ ?> ?=(%cell -.cb)

13334+ ?> ?=([* [* ~]] fields.ca)

13335+ ?> ?=([* *] fields.cb)

13336+ =/ tag-a=field i.fields.ca

13337+ =/ tag-b=field i.fields.cb

13338+ ?> ?=(%bare -.tag-a)

13339+ ?> ?=(%bare -.tag-b)

13340+ ?> ?=(%const -.shape.tag-a)

13341+ ?> ?=(%const -.shape.tag-b)

13342+ =/ text-field=field i.t.fields.ca

13343+ ?> ?=(%face -.text-field)

13344+ =/ branch=(list field) t.fields.cb

13345+ =/ kids=(unit field) (grec-tree-children branch i.vars.sh)

13346+ ?~ kids ~

13347+ ?> ?=(%face -.u.kids)

13348+ =/ children=itype [%face name.u.kids [%collection %list ~[typ]]]

13349+ ?> ?=(^ branch)

13350+ =/ payload=itype

13351+ ?~ t.branch children

13352+ =/ event=field i.branch

13353+ ?> ?=(%face -.event)

13354+ [%cell [%face name.event [%fn [%atom %t] i.args.typ]] children]

13355+ =/ leaf=itype [%cell [%const lit.shape.tag-a] [%face name.text-field [%atom %t]]]

13356+ =/ node=itype [%cell [%const lit.shape.tag-b] payload]

13357+ `[[%union ~[leaf node] ~ ~ ~] (dec fuel)]

13358+::

13359+++ grec-collect-molds

13360+ |= ds=(list def)

13361+ ^- grec-collected

13362+ ?~ ds [~ *(map term shape)]

13363+ =/ rest=grec-collected $(ds t.ds)

13364+ ?. ?=(%mold -.i.ds) rest

13365+ =/ name=term name.i.ds

13366+ =/ body=shape shape.i.ds

13367+ =/ proofs=(map term shape) proofs.rest

13368+ =? proofs (grec-tree-proof name body) (~(put by proofs) name body)

13369+ [[[name body] molds.rest] proofs]

13370+::

13371+

1022213372--

jibb-dev/lib/jibb/internal.jibb+17

@@ -14,3 +14,20 @@

1414+$ qath

1515 ~

1616 [i=@ta t=qath]

17+

18+:: Private compiler primitive wrappers; execution is a later milestone.

19+++ add-atom |= args=[A A] (raw-add.core args)

20+++ dec-atom |= atom=A (raw-dec.core atom)

21+++ trip-text |= value=@t (raw-trip.core value)

22+++ tuba-text |= values (raw-tuba.core values)

23+

24+:: Transparent request data. Identity and path fields are writable and do not

25+:: prove a schema or watchability. A future executor must bind them to checked

26+:: source evidence and validate facts and state; generated receivers must

27+:: decode before calling typed replies or folds. Runtime validation, watch

28+:: provenance and effect execution are not implemented.

29++$ agent-path (list.core @ta)

30++$ ask |$ [M]

31+ [%pure value=M]

32+ [%agent api=@t case=@tas agent=@tas path=agent-path scry=(unit.core agent-path) receive=$-([mark=@tas state=(unit.core *) fact=*] [state=* message=M])]

33+ [%store module=@t name=@tas receive=$-([state=(unit.core *) fact=*] [state=* message=M])]

jibb-dev/lib/jibb/prelude.jibb+52

@@ -101,6 +101,14 @@

101101

102102+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

103103

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+

104112++ wonk |= veq=(like A)

105113 ?- q.veq

106114 ~ !!

@@ -324,3 +332,47 @@

324332 [%who reply=$-(@p M)]

325333

326334++ gth |= args=[A A] (gth-atom.internal args)

335+++ add |= args=[A A] (add-atom.internal args)

336+++ dec |= atom=A (dec-atom.internal atom)

337+

338++$ ask |$ [M] (ask.internal M)

339+++ pure |= x=M ^- (ask M) [%pure x]

340+

341+:: This mold describes the value; island watchability needs separate proof.

342++$ sub |$ [M]

343+ [%watch a=(ask M)]

344+ [%every gap=@dr reply=$-(@da M)]

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

346+

347+:: Count a finite list with the source-backed addition gate.

348+++ lent |= xs=(list A)

349+ ^- @ud

350+ ?- xs

351+ ~ 0

352+ [item rest] (add 1 (lent rest))

353+

354+++ lth |= args=[A A]

355+ ?- args

356+ [x y] (gth y x)

357+

358+++ gte |= args=[A A]

359+ ?- args

360+ [x y] (not (gth y x))

361+

362+++ lte |= args=[A A]

363+ ?- args

364+ [x y] (not (gth x y))

365+

366+++ zing |= xss=(list (list A))

367+ ^- (list A)

368+ ?- xss

369+ ~ ~

370+ [xs rest] (weld xs (zing rest))

371+

372+++ lead |= first=A |= second=B [first second]

373+++ late |= second=B |= first=A [first second]

374+

375+++ succ |= x=A (add x 1)

376+

377+++ trip |= value=@t (trip-text.internal value)

378+++ tuba |= values=(list @tD) (tuba-text.internal values)

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

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

11/= internal /lib/jibb/internal

22+$ poke poke.internal

3++$ qath qath.internal

45:: Initial prelude functions. The rest of the inventory is still to come.

@@ -100,6 +101,14 @@

100101

101102+$ like |$ [A] [p=hair q=(unit [p=A q=nail])]

102103

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+

103112++ wonk |= veq=(like A)

104113 ?- q.veq

105114 ~ !!

@@ -149,6 +158,12 @@

149158 ~ ~

150159 [~ value] [value ~]

151160

161+++ bond |= fallback=$-(~ A)

162+ |= maybe=(unit A)

163+ ?- maybe

164+ ~ (fallback ~)

165+ [~ value] value

166+

152167++ bind |= args=[(unit A) $-(A B)]

153168 ?- args

154169 [maybe f] ^- (unit B)

@@ -317,3 +332,8 @@

317332 [%who reply=$-(@p M)]

318333

319334++ 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+2175−2008

@@ -10,2058 +10,2225 @@

10102:1 glyph +$

11112:4 name poke

12122:9 wing poke.internal

13−6:1 NEWLINE

14−6:1 glyph ++

15−6:4 name same

16−6:9 glyph |=

17−6:12 name x

18−6:13 tight glyph =

19−6:14 tight tvar A

20−6:16 name x

21−8:1 NEWLINE

22−8:1 glyph ++

23−8:4 name head

24−8:9 glyph |=

25−8:12 name p

26−8:13 tight glyph =

27−8:14 tight glyph [

28−8:15 tight tvar A

29−8:17 tvar B

30−8:18 tight glyph ]

31−9:3 INDENT

32−9:3 glyph ?-

33−9:6 name p

34−10:5 INDENT

35−10:5 glyph [

36−10:6 tight name a

37−10:8 name b

38−10:9 tight glyph ]

39−10:11 name a

40−12:1 DEDENT

41−12:1 DEDENT

42−12:1 NEWLINE

43−12:1 glyph ++

44−12:4 name tail

45−12:9 glyph |=

46−12:12 name p

47−12:13 tight glyph =

48−12:14 tight glyph [

49−12:15 tight tvar A

50−12:17 tvar B

51−12:18 tight glyph ]

52−13:3 INDENT

53−13:3 glyph ?-

54−13:6 name p

55−14:5 INDENT

56−14:5 glyph [

57−14:6 tight name a

58−14:8 name b

59−14:9 tight glyph ]

60−14:11 name b

61−16:1 DEDENT

62−16:1 DEDENT

63−16:1 NEWLINE

64−16:1 glyph ++

65−16:4 name not

66−16:8 glyph |=

67−16:11 name b

68−16:12 tight glyph =

69−16:13 tight glyph ?

70−17:3 INDENT

71−17:3 glyph ?-

72−17:6 name b

73−18:5 INDENT

74−18:5 lit %.y

75−18:9 lit %.n

76−19:5 NEWLINE

77−19:5 lit %.n

78−19:9 lit %.y

79−21:1 DEDENT

80−21:1 DEDENT

81−21:1 NEWLINE

82−21:1 glyph +$

83−21:4 name list

84−21:9 glyph |$

85−21:12 glyph [

86−21:13 tight tvar A

87−21:14 tight glyph ]

88−22:3 INDENT

89−22:3 lit ~

90−23:3 NEWLINE

91−23:3 glyph [

92−23:4 tight name i

93−23:5 tight glyph =

94−23:6 tight tvar A

95−23:8 name t

96−23:9 tight glyph =

97−23:10 tight glyph (

98−23:11 tight name list

99−23:16 tvar A

100−23:17 tight glyph )

101−23:18 tight glyph ]

102−25:1 DEDENT

103−25:1 NEWLINE

104−25:1 glyph +$

105−25:4 name unit

106−25:9 glyph |$

107−25:12 glyph [

108−25:13 tight tvar A

109−25:14 tight glyph ]

110−26:3 INDENT

111−26:3 lit ~

112−27:3 NEWLINE

113−27:3 glyph [

114−27:4 tight lit ~

115−27:6 name u

116−27:7 tight glyph =

117−27:8 tight tvar A

118−27:9 tight glyph ]

119−29:1 DEDENT

120−29:1 NEWLINE

121−29:1 glyph ++

122−29:4 name fall

123−29:9 glyph |=

124−29:12 name args

125−29:16 tight glyph =

126−29:17 tight glyph [

127−29:18 tight glyph (

128−29:19 tight name unit

129−29:24 tvar A

130−29:25 tight glyph )

131−29:27 tvar A

132−29:28 tight glyph ]

133−30:3 INDENT

134−30:3 glyph ?-

135−30:6 name args

136−31:5 INDENT

137−31:5 glyph [

138−31:6 tight name maybe

139−31:12 name fallback

140−31:20 tight glyph ]

141−32:7 INDENT

142−32:7 glyph ?-

143−32:10 name maybe

144−33:9 INDENT

145−33:9 lit ~

146−33:11 name fallback

147−34:9 NEWLINE

148−34:9 glyph [

149−34:10 tight lit ~

150−34:12 name value

151−34:17 tight glyph ]

152−34:19 name value

153−36:1 DEDENT

154−36:1 DEDENT

155−36:1 DEDENT

156−36:1 DEDENT

157−36:1 NEWLINE

158−36:1 glyph ++

159−36:4 name need

160−36:9 glyph |=

161−36:12 name maybe

162−36:17 tight glyph =

163−36:18 tight glyph (

164−36:19 tight name unit

165−36:24 tvar A

166−36:25 tight glyph )

167−37:3 INDENT

168−37:3 glyph ?-

169−37:6 name maybe

170−38:5 INDENT

171−38:5 lit ~

172−38:7 glyph !!

173−39:5 NEWLINE

174−39:5 glyph [

175−39:6 tight lit ~

176−39:8 name value

177−39:13 tight glyph ]

178−39:15 name value

179−41:1 DEDENT

180−41:1 DEDENT

181−41:1 NEWLINE

182−41:1 glyph ++

183−41:4 name weld

184−41:9 glyph |=

185−41:12 name args

186−41:16 tight glyph =

187−41:17 tight glyph [

188−41:18 tight glyph (

189−41:19 tight name list

190−41:24 tvar A

191−41:25 tight glyph )

192−41:27 glyph (

193−41:28 tight name list

194−41:33 tvar A

195−41:34 tight glyph )

196−41:35 tight glyph ]

197−42:3 INDENT

198−42:3 glyph ?-

199−42:6 name args

200−43:5 INDENT

201−43:5 glyph [

202−43:6 tight name xs

203−43:9 name ys

204−43:11 tight glyph ]

205−44:7 INDENT

206−44:7 glyph ^-

207−44:10 glyph (

208−44:11 tight name list

209−44:16 tvar A

210−44:17 tight glyph )

211−45:9 INDENT

212−45:9 glyph ?-

213−45:12 name xs

214−46:11 INDENT

215−46:11 lit ~

216−46:13 name ys

217−47:11 NEWLINE

218−47:11 glyph [

219−47:12 tight name item

220−47:17 name rest

221−47:21 tight glyph ]

222−47:23 glyph [

223−47:24 tight name item

224−47:29 glyph (

225−47:30 tight name weld

226−47:35 name rest

227−47:40 name ys

228−47:42 tight glyph )

229−47:43 tight glyph ]

230−49:1 DEDENT

231−49:1 DEDENT

232−49:1 DEDENT

233−49:1 DEDENT

234−49:1 DEDENT

235−49:1 NEWLINE

236−49:1 glyph ++

237−49:4 name turn

238−49:9 glyph |=

239−49:12 name args

240−49:16 tight glyph =

241−49:17 tight glyph [

242−49:18 tight glyph (

243−49:19 tight name list

244−49:24 tvar A

245−49:25 tight glyph )

246−49:27 glyph $-(

247−49:30 tight tvar A

248−49:32 tvar B

249−49:33 tight glyph )

250−49:34 tight glyph ]

251−50:3 INDENT

252−50:3 glyph ?-

253−50:6 name args

254−51:5 INDENT

255−51:5 glyph [

256−51:6 tight name xs

257−51:9 name f

258−51:10 tight glyph ]

259−52:7 INDENT

260−52:7 glyph ^-

261−52:10 glyph (

262−52:11 tight name list

263−52:16 tvar B

264−52:17 tight glyph )

265−53:9 INDENT

266−53:9 glyph ?-

267−53:12 name xs

268−54:11 INDENT

269−54:11 lit ~

270−54:13 lit ~

271−55:11 NEWLINE

272−55:11 glyph [

273−55:12 tight name item

274−55:17 name rest

275−55:21 tight glyph ]

276−55:23 glyph [

277−55:24 tight glyph (

278−55:25 tight name f

279−55:27 name item

280−55:31 tight glyph )

281−55:33 glyph (

282−55:34 tight name turn

283−55:39 name rest

284−55:44 name f

285−55:45 tight glyph )

286−55:46 tight glyph ]

287−57:1 DEDENT

288−57:1 DEDENT

289−57:1 DEDENT

290−57:1 DEDENT

291−57:1 DEDENT

292−57:1 NEWLINE

293−57:1 glyph +$

294−57:4 name dime

295−57:9 glyph [

296−57:10 tight name p

297−57:11 tight glyph =

298−57:12 tight aura @ta

299−57:16 name q

300−57:17 tight glyph =

301−57:18 tight aura @

302−57:19 tight glyph ]

303−59:1 NEWLINE

304−59:1 glyph +$

305−59:4 name hair

306−59:9 glyph [

307−59:10 tight name p

308−59:11 tight glyph =

309−59:12 tight aura @ud

310−59:16 name q

311−59:17 tight glyph =

312−59:18 tight aura @ud

313−59:21 tight glyph ]

314−61:1 NEWLINE

315−61:1 glyph +$

316−61:4 name pint

317−61:9 glyph [

318−61:10 tight name p

319−61:11 tight glyph =

320−61:12 tight glyph [

321−61:13 tight name p

322−61:14 tight glyph =

323−61:15 tight aura @

324−61:17 name q

325−61:18 tight glyph =

326−61:19 tight aura @

327−61:20 tight glyph ]

328−61:22 name q

329−61:23 tight glyph =

330−61:24 tight glyph [

331−61:25 tight name p

332−61:26 tight glyph =

333−61:27 tight aura @

334−61:29 name q

335−61:30 tight glyph =

336−61:31 tight aura @

337−61:32 tight glyph ]

338−61:33 tight glyph ]

339−63:1 NEWLINE

340−63:1 glyph +$

341−63:4 name coin

342−64:3 INDENT

343−64:3 glyph [

344−64:4 tight lit %$

345−64:7 name p

346−64:8 tight glyph =

347−64:9 tight name dime

348−64:13 tight glyph ]

349−65:3 NEWLINE

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

65+17:1 DEDENT

66+17:1 DEDENT

67+17:1 NEWLINE

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 ?

74+18:3 INDENT

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

159+37:1 DEDENT

160+37:1 DEDENT

161+37:1 NEWLINE

162+37:1 glyph ++

163+37:4 name need

164+37:9 glyph |=

165+37:12 name maybe

166+37:17 tight glyph =

167+37:18 tight glyph (

168+37:19 tight name unit

169+37:24 tvar A

170+37:25 tight glyph )

171+38:3 INDENT

172+38:3 glyph ?-

173+38:6 name maybe

174+39:5 INDENT

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

323+62:11 tight glyph =

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 ]

343+64:1 NEWLINE

344+64:1 glyph +$

345+64:4 name coin

346+65:3 INDENT

35034765:3 glyph [

351−65:4 tight lit %blob

352−65:10 name p

353−65:11 tight glyph =

354−65:12 tight glyph *

348+65:4 tight lit %$

349+65:7 name p

350+65:8 tight glyph =

351+65:9 tight name dime

35535265:13 tight glyph ]

35635366:3 NEWLINE

35735466:3 glyph [

358−66:4 tight lit %many

355+66:4 tight lit %blob

35935666:10 name p

36035766:11 tight glyph =

361−66:12 tight glyph (

362−66:13 tight name list

363−66:18 name coin

364−66:22 tight glyph )

365−66:23 tight glyph ]

366−68:1 DEDENT

367−68:1 NEWLINE

368−68:1 glyph +$

369−68:4 name pair

370−68:9 glyph |$

371−68:12 glyph [

372−68:13 tight tvar A

373−68:15 tvar B

374−68:16 tight glyph ]

375−68:18 glyph [

376−68:19 tight name p

377−68:20 tight glyph =

378−68:21 tight tvar A

379−68:23 name q

380−68:24 tight glyph =

381−68:25 tight tvar B

382−68:26 tight glyph ]

383−70:1 NEWLINE

384−70:1 glyph +$

385−70:4 name trel

386−70:9 glyph |$

387−70:12 glyph [

388−70:13 tight tvar A

389−70:15 tvar B

390−70:17 tvar C

391−70:18 tight glyph ]

392−70:20 glyph [

393−70:21 tight name p

394−70:22 tight glyph =

395−70:23 tight tvar A

396−70:25 name q

397−70:26 tight glyph =

398−70:27 tight tvar B

399−70:29 name r

400−70:30 tight glyph =

401−70:31 tight tvar C

402−70:32 tight glyph ]

403−72:1 NEWLINE

404−72:1 glyph +$

405−72:4 name qual

406−72:9 glyph |$

407−72:12 glyph [

408−72:13 tight tvar A

409−72:15 tvar B

410−72:17 tvar C

411−72:19 tvar D

412−72:20 tight glyph ]

413−72:22 glyph [

414−72:23 tight name p

415−72:24 tight glyph =

416−72:25 tight tvar A

417−72:27 name q

418−72:28 tight glyph =

419−72:29 tight tvar B

420−72:31 name r

421−72:32 tight glyph =

422−72:33 tight tvar C

423−72:35 name s

424−72:36 tight glyph =

425−72:37 tight tvar D

426−72:38 tight glyph ]

427−74:1 NEWLINE

428−74:1 glyph +$

429−74:4 name cord

430−74:9 aura @t

431−76:1 NEWLINE

432−76:1 glyph +$

433−76:4 name knot

434−76:9 aura @ta

435−78:1 NEWLINE

436−78:1 glyph +$

437−78:4 name tape

438−78:9 glyph (

439−78:10 tight name list

440−78:15 aura @tD

441−78:18 tight glyph )

442−80:1 NEWLINE

443−80:1 glyph +$

444−80:4 name path

445−80:9 glyph (

446−80:10 tight name list

447−80:15 name knot

448−80:19 tight glyph )

449−82:1 NEWLINE

450−82:1 glyph +$

451−82:4 name tank

452−83:3 INDENT

453−83:3 name cord

454−84:3 NEWLINE

455−84:3 glyph [

456−84:4 tight lit %leaf

457−84:10 name p

458−84:11 tight glyph =

459−84:12 tight name tape

460−84:16 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

46145885:3 NEWLINE

46245985:3 glyph [

463−85:4 tight lit %palm

460+85:4 tight lit %leaf

46446185:10 name p

46546285:11 tight glyph =

466−85:12 tight glyph (

467−85:13 tight name qual

468−85:18 name tape

469−85:23 name tape

470−85:28 name tape

471−85:33 name tape

472−85:37 tight glyph )

473−85:39 name q

474−85:40 tight glyph =

475−85:41 tight glyph (

476−85:42 tight name list

477−85:47 name tank

478−85:51 tight glyph )

479−85:52 tight glyph ]

463+85:12 tight name tape

464+85:16 tight glyph ]

48046586:3 NEWLINE

48146686:3 glyph [

482−86:4 tight lit %rose

467+86:4 tight lit %palm

48346886:10 name p

48446986:11 tight glyph =

48547086:12 tight glyph (

486−86:13 tight name trel

471+86:13 tight name qual

48747286:18 name tape

48847386:23 name tape

48947486:28 name tape

490−86:32 tight glyph )

491−86:34 name q

492−86:35 tight glyph =

493−86:36 tight glyph (

494−86:37 tight name list

495−86:42 name tank

496−86:46 tight glyph )

497−86:47 tight glyph ]

498−88:1 DEDENT

499−88:1 NEWLINE

500−88:1 glyph +$

501−88:4 name nail

502−88:9 glyph [

503−88:10 tight name p

504−88:11 tight glyph =

505−88:12 tight name hair

506−88:17 name q

507−88:18 tight glyph =

508−88:19 tight name tape

509−88:23 tight glyph ]

510−90:1 NEWLINE

511−90:1 glyph +$

512−90:4 name edge

513−90:9 glyph [

514−90:10 tight name p

515−90:11 tight glyph =

516−90:12 tight name hair

517−90:17 name q

518−90:18 tight glyph =

519−90:19 tight glyph (

520−90:20 tight name unit

521−90:25 glyph [

522−90:26 tight name p

523−90:27 tight glyph =

524−90:28 tight glyph *

525−90:30 name q

526−90:31 tight glyph =

527−90:32 tight name nail

528−90:36 tight glyph ]

529−90:37 tight glyph )

530−90:38 tight glyph ]

531−92:1 NEWLINE

532−92:1 glyph +$

533−92:4 name rule

534−92:9 glyph $-(

535−92:12 tight name nail

536−92:17 name edge

537−92:21 tight glyph )

538−94:1 NEWLINE

539−94:1 glyph +$

540−94:4 name spot

541−94:9 glyph [

542−94:10 tight name p

543−94:11 tight glyph =

544−94:12 tight name path

545−94:17 name q

546−94:18 tight glyph =

547−94:19 tight name pint

548−94:23 tight glyph ]

549−96:1 NEWLINE

550−96:1 glyph +$

551−96:4 name toon

552−97:3 INDENT

553−97:3 glyph [

554−97:4 tight lit %0

555−97:7 name p

556−97:8 tight glyph =

557−97:9 tight glyph *

558−97:10 tight glyph ]

559−98:3 NEWLINE

475+86:33 name tape

476+86:37 tight glyph )

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 ]

553+97:1 NEWLINE

554+97:1 glyph +$

555+97:4 name toon

556+98:3 INDENT

56055798:3 glyph [

561−98:4 tight lit %1

558+98:4 tight lit %0

56255998:7 name p

56356098:8 tight glyph =

56456198:9 tight glyph *

56556298:10 tight glyph ]

56656399:3 NEWLINE

56756499:3 glyph [

568−99:4 tight lit %2

565+99:4 tight lit %1

56956699:7 name p

57056799:8 tight glyph =

571−99:9 tight glyph (

572−99:10 tight name list

573−99:15 name tank

574−99:19 tight glyph )

575−99:20 tight glyph ]

576−101:1 DEDENT

577−101:1 NEWLINE

578−101:1 glyph +$

579−101:4 name like

580−101:9 glyph |$

581−101:12 glyph [

582−101:13 tight tvar A

583−101:14 tight glyph ]

584−101:16 glyph [

585−101:17 tight name p

586−101:18 tight glyph =

587−101:19 tight name hair

588−101:24 name q

589−101:25 tight glyph =

590−101:26 tight glyph (

591−101:27 tight name unit

592−101:32 glyph [

593−101:33 tight name p

594−101:34 tight glyph =

595−101:35 tight tvar A

596−101:37 name q

597−101:38 tight glyph =

598−101:39 tight name nail

599−101:43 tight glyph ]

600−101:44 tight glyph )

601−101:45 tight glyph ]

602−103:1 NEWLINE

603−103:1 glyph ++

604−103:4 name wonk

605−103:9 glyph |=

606−103:12 name veq

607−103:15 tight glyph =

608−103:16 tight glyph (

609−103:17 tight name like

610−103:22 tvar A

611−103:23 tight glyph )

612−104:3 INDENT

613−104:3 glyph ?-

614−104:6 wing q.veq

615−105:5 INDENT

616−105:5 lit ~

617−105:7 glyph !!

618−106:5 NEWLINE

619−106:5 glyph [

620−106:6 tight lit ~

621−106:8 name product

622−106:15 tight glyph ]

623−106:17 wing p.product

624−108:1 DEDENT

625−108:1 DEDENT

626−108:1 NEWLINE

627−108:1 glyph +$

628−108:4 name lone

629−108:9 glyph |$

630−108:12 glyph [

631−108:13 tight tvar A

632−108:14 tight glyph ]

633−108:16 glyph [

634−108:17 tight name p

635−108:18 tight glyph =

636−108:19 tight tvar A

637−108:20 tight glyph ]

638−110:1 NEWLINE

639−110:1 glyph +$

640−110:4 name lest

641−110:9 glyph |$

642−110:12 glyph [

643−110:13 tight tvar A

644−110:14 tight glyph ]

645−110:16 glyph [

646−110:17 tight name i

647−110:18 tight glyph =

648−110:19 tight tvar A

649−110:21 name t

650−110:22 tight glyph =

651−110:23 tight glyph (

652−110:24 tight name list

653−110:29 tvar A

654−110:30 tight glyph )

655−110:31 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 ]

606+104:1 NEWLINE

607+104:1 glyph ++

608+104:4 name like

609+104:9 glyph |=

610+104:12 glyph [

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

666+110:3 NEWLINE

667+110:3 glyph ^-

668+110:6 glyph (

669+110:7 tight name like

670+110:12 tvar B

671+110:13 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 ]

680+112:1 DEDENT

656681112:1 NEWLINE

657−112:1 glyph +$

658−112:4 name pole

659−112:9 glyph |$

660−112:12 glyph [

661−112:13 tight tvar A

662−112:14 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 )

663691113:3 INDENT

664−113:3 lit ~

665−114:3 NEWLINE

666−114:3 glyph [

667−114:4 tight tvar A

668−114:6 glyph (

669−114:7 tight name pole

670−114:12 tvar A

671−114:13 tight glyph )

672−114:14 tight glyph ]

673−116:1 DEDENT

674−116:1 NEWLINE

675−116:1 glyph +$

676−116:4 name quip

677−116:9 glyph |$

678−116:12 glyph [

679−116:13 tight tvar A

680−116:15 tvar B

681−116:16 tight glyph ]

682−116:18 glyph [

683−116:19 tight glyph (

684−116:20 tight name list

685−116:25 tvar A

686−116:26 tight glyph )

687−116:28 tvar B

688−116:29 tight glyph ]

689−118:1 NEWLINE

690−118:1 glyph +$

691−118:4 name tree

692−118:9 glyph |$

693−118:12 glyph [

694−118:13 tight tvar A

695−118:14 tight glyph ]

696−119:3 INDENT

697−119:3 lit ~

698−120:3 NEWLINE

699−120:3 glyph [

700−120:4 tight name n

701−120:5 tight glyph =

702−120:6 tight tvar A

703−120:8 name l

704−120:9 tight glyph =

705−120:10 tight glyph (

706−120:11 tight name tree

707−120:16 tvar A

708−120:17 tight glyph )

709−120:19 name r

710−120:20 tight glyph =

711−120:21 tight glyph (

712−120:22 tight name tree

713−120:27 tvar A

714−120:28 tight glyph )

715−120:29 tight glyph ]

716−122:1 DEDENT

717−122:1 NEWLINE

718−122:1 glyph +$

719−122:4 name each

720−122:9 glyph |$

721−122:12 glyph [

722−122:13 tight tvar A

723−122:15 tvar B

724−122:16 tight glyph ]

725−123: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

726745123:3 glyph [

727−123:4 tight lit %|

728−123:7 name p

729−123:8 tight glyph =

730−123:9 tight tvar B

731−123:10 tight glyph ]

732−124:3 NEWLINE

733−124:3 glyph [

734−124:4 tight lit %&

735−124:7 name p

736−124:8 tight glyph =

737−124:9 tight tvar A

738−124:10 tight glyph ]

739−126:1 DEDENT

740−126:1 NEWLINE

741−126:1 glyph +$

742−126:4 name bloq

743−126:9 aura @

744−128:1 NEWLINE

745−128:1 glyph ++

746−128:4 name some

747−128:9 glyph |=

748−128:12 name item

749−128:16 tight glyph =

750−128:17 tight tvar A

751−128:19 glyph `

752−128:20 tight name item

753−130:1 NEWLINE

754−130:1 glyph ++

755−130:4 name lure

756−130:9 glyph |=

757−130:12 name item

758−130:16 tight glyph =

759−130:17 tight tvar A

760−131:3 INDENT

761−131:3 glyph ^-

762−131:6 glyph (

763−131:7 tight name list

764−131:12 tvar A

765−131:13 tight glyph )

766−131:15 glyph [

767−131:16 tight name item

768−131:21 lit ~

769−131:22 tight glyph ]

770−133:1 DEDENT

771−133:1 NEWLINE

772−133:1 glyph ++

773−133:4 name snoc

774−133:9 glyph |=

775−133:12 name args

776−133:16 tight glyph =

777−133:17 tight glyph [

778−133:18 tight glyph (

779−133:19 tight name list

780−133:24 tvar A

781−133:25 tight glyph )

782−133:27 tvar A

783−133:28 tight glyph ]

784−134:3 INDENT

785−134:3 glyph ?-

786−134:6 name args

787−135:5 INDENT

788−135:5 glyph [

789−135:6 tight name xs

790−135:9 name item

791−135:13 tight glyph ]

792−135:15 glyph (

793−135:16 tight name weld

794−135:21 name xs

795−135:24 glyph [

796−135:25 tight name item

797−135:30 lit ~

798−135:31 tight glyph ]

799−135:32 tight glyph )

800−137:1 DEDENT

801−137:1 DEDENT

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

792+129:27 tvar A

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 @

802823137:1 NEWLINE

803824137:1 glyph ++

804−137:4 name flop

825+137:4 name some

805826137:9 glyph |=

806−137:12 name xs

807−137:14 tight glyph =

808−137:15 tight glyph (

809−137:16 tight name list

810−137:21 tvar A

811−137:22 tight glyph )

812−138:3 INDENT

813−138:3 glyph ++

814−138:6 name reverse-into

815−138:19 glyph |=

816−138:22 name args

817−138:26 tight glyph =

818−138:27 tight glyph [

819−138:28 tight glyph (

820−138:29 tight name list

821−138:34 tvar A

822−138:35 tight glyph )

823−138:37 glyph (

824−138:38 tight name list

825−138:43 tvar A

826−138:44 tight glyph )

827−138:45 tight glyph ]

828−139:5 INDENT

829−139:5 glyph ?-

830−139:8 name args

831−140:7 INDENT

832−140:7 glyph [

833−140:8 tight name rest

834−140:13 name acc

835−140:16 tight glyph ]

836−141:9 INDENT

837−141:9 glyph ?-

838−141:12 name rest

839−142:11 INDENT

840−142:11 lit ~

841−142:13 name acc

842−143:11 NEWLINE

843−143:11 glyph [

844−143:12 tight name item

845−143:17 name more

846−143:21 tight glyph ]

847−143:23 glyph (

848−143:24 tight name reverse-into

849−143:37 name more

850−143:42 glyph [

851−143:43 tight name item

852−143:48 name acc

853−143:51 tight glyph ]

854−143:52 tight glyph )

855−144:3 DEDENT

856−144:3 DEDENT

857−144:3 DEDENT

858−144:3 DEDENT

859−144:3 NEWLINE

860−144:3 glyph (

861−144:4 tight name reverse-into

862−144:17 name xs

863−144:20 lit ~

864−144:21 tight 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 ]

849+142:1 DEDENT

850+142:1 NEWLINE

851+142:1 glyph ++

852+142:4 name snoc

853+142:9 glyph |=

854+142:12 name args

855+142:16 tight glyph =

856+142:17 tight glyph [

857+142:18 tight glyph (

858+142:19 tight name list

859+142:24 tvar A

860+142:25 tight glyph )

861+142:27 tvar A

862+142:28 tight glyph ]

863+143:3 INDENT

864+143:3 glyph ?-

865+143:6 name args

866+144:5 INDENT

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

865880146:1 DEDENT

866881146:1 NEWLINE

867882146:1 glyph ++

868−146:4 name drop

883+146:4 name flop

869884146:9 glyph |=

870−146:12 name maybe

871−146:17 tight glyph =

872−146:18 tight glyph (

873−146:19 tight name unit

874−146:24 tvar A

875−146:25 tight 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 )

876891147:3 INDENT

877−147:3 glyph ^-

878−147:6 glyph (

879−147:7 tight name list

880−147:12 tvar A

881−147:13 tight glyph )

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 ]

882907148:5 INDENT

883908148:5 glyph ?-

884−148:8 name maybe

909+148:8 name args

885910149:7 INDENT

886−149:7 lit ~

887−149:9 lit ~

888−150:7 NEWLINE

889−150:7 glyph [

890−150:8 tight lit ~

891−150:10 name value

892−150:15 tight glyph ]

893−150:17 glyph [

894−150:18 tight name value

895−150:24 lit ~

896−150:25 tight glyph ]

897−152:1 DEDENT

898−152:1 DEDENT

899−152:1 DEDENT

900−152:1 NEWLINE

901−152:1 glyph ++

902−152:4 name bind

903−152:9 glyph |=

904−152:12 name args

905−152:16 tight glyph =

906−152:17 tight glyph [

907−152:18 tight glyph (

908−152:19 tight name unit

909−152:24 tvar A

910−152:25 tight glyph )

911−152:27 glyph $-(

912−152:30 tight tvar A

913−152:32 tvar B

914−152:33 tight glyph )

915−152:34 tight glyph ]

916−153:3 INDENT

917−153:3 glyph ?-

918−153:6 name args

919−154:5 INDENT

920−154:5 glyph [

921−154:6 tight name maybe

922−154:12 name f

923−154:13 tight glyph ]

924−154:15 glyph ^-

925−154:18 glyph (

926−154:19 tight name unit

927−154:24 tvar B

928−154:25 tight glyph )

929−155:7 INDENT

930−155:7 glyph ?-

931−155:10 name maybe

932−156:9 INDENT

933−156:9 lit ~

934−156:11 lit ~

935−157:9 NEWLINE

936−157:9 glyph [

937−157:10 tight lit ~

938−157:12 name value

939−157:17 tight glyph ]

940−157:19 glyph `

941−157:20 tight glyph (

942−157:21 tight name f

943−157:23 name value

944−157:28 tight glyph )

945−159:1 DEDENT

946−159:1 DEDENT

947−159:1 DEDENT

948−159:1 DEDENT

949−159:1 NEWLINE

950−159:1 glyph ++

951−159:4 name biff

952−159:9 glyph |=

953−159:12 name args

954−159:16 tight glyph =

955−159:17 tight glyph [

956−159:18 tight glyph (

957−159:19 tight name unit

958−159:24 tvar A

959−159:25 tight glyph )

960−159:27 glyph $-(

961−159:30 tight tvar A

962−159:32 glyph (

963−159:33 tight name unit

964−159:38 tvar B

965−159:39 tight glyph )

966−159:40 tight glyph )

967−159:41 tight glyph ]

968−160:3 INDENT

969−160:3 glyph ?-

970−160:6 name args

971−161:5 INDENT

972−161:5 glyph [

973−161:6 tight name maybe

974−161:12 name f

975−161:13 tight glyph ]

976−161:15 glyph ^-

977−161:18 glyph (

978−161:19 tight name unit

979−161:24 tvar B

980−161:25 tight glyph )

981−162:7 INDENT

982−162:7 glyph ?-

983−162:10 name maybe

984−163:9 INDENT

985−163:9 lit ~

986−163:11 lit ~

987−164:9 NEWLINE

988−164:9 glyph [

989−164:10 tight lit ~

990−164:12 name value

991−164:17 tight glyph ]

992−164:19 glyph (

993−164:20 tight name f

994−164:22 name value

995−164:27 tight glyph )

996−166:1 DEDENT

997−166:1 DEDENT

998−166:1 DEDENT

999−166:1 DEDENT

1000−166:1 NEWLINE

1001−166:1 glyph ++

1002−166:4 name both

1003−166:9 glyph |=

1004−166:12 name args

1005−166:16 tight glyph =

1006−166:17 tight glyph [

1007−166:18 tight glyph (

1008−166:19 tight name unit

1009−166:24 tvar A

1010−166:25 tight glyph )

1011−166:27 glyph (

1012−166:28 tight name unit

1013−166:33 tvar B

1014−166:34 tight glyph )

1015−166:35 tight glyph ]

1016−167:3 INDENT

1017−167:3 glyph ?-

1018−167:6 name args

1019−168:5 INDENT

1020−168:5 glyph [

1021−168:6 tight name first

1022−168:12 name second

1023−168:18 tight glyph ]

1024−168:20 glyph ^-

1025−168:23 glyph (

1026−168:24 tight name unit

1027−168:29 glyph [

1028−168:30 tight tvar A

1029−168:32 tvar B

1030−168:33 tight glyph ]

1031−168:34 tight glyph )

1032−169:7 INDENT

1033−169:7 glyph ?-

1034−169:10 name first

1035−170:9 INDENT

1036−170:9 lit ~

1037−170:11 lit ~

1038−171:9 NEWLINE

1039−171:9 glyph [

1040−171:10 tight lit ~

1041−171:12 name a

1042−171:13 tight glyph ]

1043−172:11 INDENT

1044−172:11 glyph ?-

1045−172:14 name second

1046−173:13 INDENT

1047−173:13 lit ~

1048−173:15 lit ~

1049−174:13 NEWLINE

1050−174:13 glyph [

1051−174:14 tight lit ~

1052−174:16 name b

1053−174:17 tight glyph ]

1054−174:19 glyph `

1055−174:20 tight glyph [

1056−174:21 tight name a

1057−174:23 name b

1058−174:24 tight glyph ]

1059−176:1 DEDENT

1060−176:1 DEDENT

1061−176:1 DEDENT

1062−176:1 DEDENT

1063−176:1 DEDENT

1064−176:1 DEDENT

1065−176:1 NEWLINE

1066−176:1 glyph ++

1067−176:4 name clap

1068−176:9 glyph |=

1069−176:12 name args

1070−176:16 tight glyph =

1071−176:17 tight glyph [

1072−176:18 tight glyph (

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

919+151:11 lit ~

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 ~

966+158:9 lit ~

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 ]

976+161:1 DEDENT

977+161:1 DEDENT

978+161:1 DEDENT

979+161:1 NEWLINE

980+161:1 glyph ++

981+161:4 name bond

982+161:9 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 )

989+162:3 INDENT

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 )

997+163:5 INDENT

998+163:5 glyph ?-

999+163:8 name maybe

1000+164:7 INDENT

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

1090+176:13 tight glyph ]

1091+176:15 glyph ^-

1092+176:18 glyph (

10731093176:19 tight name unit

1074−176:24 tvar A

1094+176:24 tvar B

10751095176:25 tight glyph )

1076−176:27 glyph (

1077−176:28 tight name unit

1078−176:33 tvar A

1079−176:34 tight glyph )

1080−176:36 glyph $-(

1081−176:39 tight glyph [

1082−176:40 tight tvar A

1083−176:42 tvar A

1084−176:43 tight glyph ]

1085−176:45 tvar A

1086−176:46 tight glyph )

1087−176:47 tight glyph ]

1088−177:3 INDENT

1089−177:3 glyph ?-

1090−177:6 name args

1091−178:5 INDENT

1092−178:5 glyph [

1093−178:6 tight name first

1094−178:12 name second

1095−178:19 name combine

1096−178:26 tight glyph ]

1097−178:28 glyph ^-

1098−178:31 glyph (

1099−178:32 tight name unit

1100−178:37 tvar A

1101−178:38 tight glyph )

1102−179:7 INDENT

1103−179:7 glyph ?-

1104−179:10 name first

1105−180:9 INDENT

1106−180:9 lit ~

1107−180:11 name second

1108−181:9 NEWLINE

1109−181:9 glyph [

1110−181:10 tight lit ~

1111−181:12 name a

1112−181:13 tight glyph ]

1113−182:11 INDENT

1114−182:11 glyph ?-

1115−182:14 name second

1116−183:13 INDENT

1117−183:13 lit ~

1118−183:15 name first

1119−184:13 NEWLINE

1120−184:13 glyph [

1121−184:14 tight lit ~

1122−184:16 name b

1123−184:17 tight glyph ]

1124−184:19 glyph `

1125−184:20 tight glyph (

1126−184:21 tight name combine

1127−184:29 name a

1128−184:31 name b

1129−184:32 tight glyph )

1130−186:1 DEDENT

1131−186:1 DEDENT

1132−186:1 DEDENT

1133−186:1 DEDENT

1134−186:1 DEDENT

1135−186:1 DEDENT

1136−186:1 NEWLINE

1137−186:1 glyph ++

1138−186:4 name clef

1139−186:9 glyph |=

1140−186:12 name args

1141−186:16 tight glyph =

1142−186:17 tight glyph [

1143−186:18 tight glyph (

1144−186:19 tight name unit

1145−186:24 tvar A

1146−186:25 tight glyph )

1147−186:27 glyph (

1148−186:28 tight name unit

1149−186:33 tvar B

1150−186:34 tight glyph )

1151−186:36 glyph $-(

1152−186:39 tight glyph [

1153−186:40 tight tvar A

1154−186:42 tvar B

1155−186:43 tight glyph ]

1156−186:45 glyph (

1157−186:46 tight name unit

1158−186:51 tvar C

1159−186:52 tight glyph )

1160−186:53 tight glyph )

1161−186:54 tight glyph ]

1162−187:3 INDENT

1163−187:3 glyph ?-

1164−187:6 name args

1165−188:5 INDENT

1166−188:5 glyph [

1167−188:6 tight name first

1168−188:12 name second

1169−188:19 name combine

1170−188:26 tight glyph ]

1171−188:28 glyph ^-

1172−188:31 glyph (

1173−188:32 tight name unit

1174−188:37 tvar C

1175−188:38 tight glyph )

1176−189:7 INDENT

1177−189:7 glyph ?-

1178−189:10 name first

1179−190:9 INDENT

1180−190:9 lit ~

1181−190:11 lit ~

1182−191:9 NEWLINE

1183−191:9 glyph [

1184−191:10 tight lit ~

1185−191:12 name a

1186−191:13 tight glyph ]

1187−192:11 INDENT

1188−192:11 glyph ?-

1189−192:14 name second

1190−193:13 INDENT

1191−193:13 lit ~

1192−193:15 lit ~

1193−194:13 NEWLINE

1194−194:13 glyph [

1195−194:14 tight lit ~

1196−194:16 name b

1197−194:17 tight glyph ]

1198−194:19 glyph (

1199−194:20 tight name combine

1200−194:28 name a

1201−194:30 name b

1202−194:31 tight glyph )

1203−196:1 DEDENT

1204−196:1 DEDENT

1205−196:1 DEDENT

1206−196:1 DEDENT

1207−196:1 DEDENT

1208−196:1 DEDENT

1209−196:1 NEWLINE

1210−196:1 glyph ++

1211−196:4 name skim

1212−196:9 glyph |=

1213−196:12 name args

1214−196:16 tight glyph =

1215−196:17 tight glyph [

1216−196:18 tight glyph (

1217−196:19 tight name list

1218−196:24 tvar A

1219−196:25 tight glyph )

1220−196:27 glyph $-(

1221−196:30 tight tvar A

1222−196:32 glyph ?

1223−196:33 tight glyph )

1224−196:34 tight glyph ]

1225−197:3 INDENT

1226−197:3 glyph ?-

1227−197:6 name args

1228−198:5 INDENT

1229−198:5 glyph [

1230−198:6 tight name xs

1231−198:9 name predicate

1232−198:18 tight glyph ]

1233−198:20 glyph ^-

1234−198:23 glyph (

1235−198:24 tight name list

1236−198:29 tvar A

1237−198:30 tight glyph )

1238−199:9 INDENT

1239−199:9 glyph ?-

1240−199:12 name xs

1241−200:11 INDENT

1242−200:11 lit ~

1243−200:13 lit ~

1244−201:11 NEWLINE

1245−201:11 glyph [

1246−201:12 tight name item

1247−201:17 name rest

1248−201:21 tight glyph ]

1249−202:13 INDENT

1250−202:13 glyph ?-

1251−202:16 glyph (

1252−202:17 tight name predicate

1253−202:27 name item

1254−202:31 tight glyph )

1255−203:15 INDENT

1256−203:15 lit %.y

1257−203:19 glyph [

1258−203:20 tight name item

1259−203:25 glyph (

1260−203:26 tight name skim

1261−203:31 name rest

1262−203:36 name predicate

1263−203:45 tight glyph )

1264−203:46 tight glyph ]

1265−204:15 NEWLINE

1266−204:15 lit %.n

1267−204:19 glyph (

1268−204:20 tight name skim

1269−204:25 name rest

1270−204:30 name predicate

1271−204:39 tight glyph )

1272−206:1 DEDENT

1273−206:1 DEDENT

1274−206:1 DEDENT

1275−206:1 DEDENT

1276−206:1 DEDENT

1277−206:1 DEDENT

1278−206:1 NEWLINE

1279−206:1 glyph ++

1280−206:4 name skip

1281−206:9 glyph |=

1282−206:12 name args

1283−206:16 tight glyph =

1284−206:17 tight glyph [

1285−206:18 tight glyph (

1286−206:19 tight name list

1287−206:24 tvar A

1288−206:25 tight glyph )

1289−206:27 glyph $-(

1290−206:30 tight tvar A

1291−206:32 glyph ?

1292−206:33 tight glyph )

1293−206:34 tight glyph ]

1294−207:3 INDENT

1295−207:3 glyph ?-

1296−207:6 name args

1297−208:5 INDENT

1298−208:5 glyph [

1299−208:6 tight name xs

1300−208:9 name predicate

1301−208:18 tight glyph ]

1302−208:20 glyph ^-

1303−208:23 glyph (

1304−208:24 tight name list

1305−208:29 tvar A

1306−208:30 tight glyph )

1307−209:9 INDENT

1308−209:9 glyph ?-

1309−209:12 name xs

1310−210:11 INDENT

1311−210:11 lit ~

1312−210:13 lit ~

1313−211:11 NEWLINE

1314−211:11 glyph [

1315−211:12 tight name item

1316−211:17 name rest

1317−211:21 tight glyph ]

1318−212:13 INDENT

1319−212:13 glyph ?-

1320−212:16 glyph (

1321−212:17 tight name predicate

1322−212:27 name item

1323−212:31 tight glyph )

1324−213:15 INDENT

1325−213:15 lit %.y

1326−213:19 glyph (

1327−213:20 tight name skip

1328−213:25 name rest

1329−213:30 name predicate

1330−213:39 tight glyph )

1331−214:15 NEWLINE

1332−214:15 lit %.n

1333−214:19 glyph [

1334−214:20 tight name item

1335−214:25 glyph (

1336−214:26 tight name skip

1337−214:31 name rest

1338−214:36 name predicate

1339−214:45 tight glyph )

1340−214:46 tight glyph ]

1341−216:1 DEDENT

1342−216:1 DEDENT

1343−216:1 DEDENT

1344−216:1 DEDENT

1345−216:1 DEDENT

1346−216:1 DEDENT

1347−216:1 NEWLINE

1348−216:1 glyph ++

1349−216:4 name levy

1350−216:9 glyph |=

1351−216:12 name args

1352−216:16 tight glyph =

1353−216:17 tight glyph [

1354−216:18 tight glyph (

1355−216:19 tight name list

1356−216:24 tvar A

1357−216:25 tight glyph )

1358−216:27 glyph $-(

1359−216:30 tight tvar A

1360−216:32 glyph ?

1361−216:33 tight glyph )

1362−216:34 tight glyph ]

1363−217:3 INDENT

1364−217:3 glyph ^-

1365−217:6 glyph ?

1366−218:5 INDENT

1367−218:5 glyph ?-

1368−218:8 name args

1369−219:7 INDENT

1370−219:7 glyph [

1371−219:8 tight name xs

1372−219:11 name predicate

1373−219:20 tight glyph ]

1374−220:9 INDENT

1375−220:9 glyph ?-

1376−220:12 name xs

1377−221:11 INDENT

1378−221:11 lit ~

1379−221:13 lit %.y

1380−222:11 NEWLINE

1381−222:11 glyph [

1382−222:12 tight name item

1383−222:17 name rest

1384−222:21 tight glyph ]

1385−223:13 INDENT

1386−223:13 glyph ?-

1387−223:16 glyph (

1388−223:17 tight name predicate

1389−223:27 name item

1390−223:31 tight glyph )

1391−224:15 INDENT

1392−224:15 lit %.y

1393−224:19 glyph (

1394−224:20 tight name levy

1395−224:25 name rest

1396−224:30 name predicate

1397−224:39 tight glyph )

1398−225:15 NEWLINE

1399−225:15 lit %.n

1400−225:19 lit %.n

1401−227:1 DEDENT

1402−227:1 DEDENT

1403−227:1 DEDENT

1404−227:1 DEDENT

1405−227:1 DEDENT

1406−227:1 DEDENT

1407−227:1 DEDENT

1408−227:1 NEWLINE

1409−227:1 glyph ++

1410−227:4 name lien

1411−227:9 glyph |=

1412−227:12 name args

1413−227:16 tight glyph =

1414−227:17 tight glyph [

1415−227:18 tight glyph (

1416−227:19 tight name list

1417−227:24 tvar A

1418−227:25 tight glyph )

1419−227:27 glyph $-(

1420−227:30 tight tvar A

1421−227:32 glyph ?

1422−227:33 tight glyph )

1423−227:34 tight glyph ]

1424−228:3 INDENT

1425−228:3 glyph ^-

1426−228:6 glyph ?

1427−229:5 INDENT

1428−229:5 glyph ?-

1429−229:8 name args

1430−230:7 INDENT

1431−230:7 glyph [

1432−230:8 tight name xs

1433−230:11 name predicate

1434−230:20 tight glyph ]

1435−231:9 INDENT

1436−231:9 glyph ?-

1437−231:12 name xs

1438−232:11 INDENT

1439−232:11 lit ~

1440−232:13 lit %.n

1441−233:11 NEWLINE

1442−233:11 glyph [

1443−233:12 tight name item

1444−233:17 name rest

1445−233:21 tight glyph ]

1446−234:13 INDENT

1447−234:13 glyph ?-

1448−234:16 glyph (

1449−234:17 tight name predicate

1450−234:27 name item

1451−234:31 tight glyph )

1452−235:15 INDENT

1453−235:15 lit %.y

1454−235:19 lit %.y

1455−236:15 NEWLINE

1456−236:15 lit %.n

1457−236:19 glyph (

1458−236:20 tight name lien

1459−236:25 name rest

1460−236:30 name predicate

1461−236:39 tight glyph )

1462−238:1 DEDENT

1463−238:1 DEDENT

1464−238:1 DEDENT

1465−238:1 DEDENT

1466−238:1 DEDENT

1467−238:1 DEDENT

1468−238:1 DEDENT

1469−238:1 NEWLINE

1470−238:1 glyph ++

1471−238:4 name roll

1472−238:9 glyph |=

1473−238:12 name args

1474−238:16 tight glyph =

1475−238:17 tight glyph [

1476−238:18 tight glyph (

1477−238:19 tight name list

1478−238:24 tvar A

1479−238:25 tight glyph )

1480−238:27 tvar B

1481−238:29 glyph $-(

1482−238:32 tight glyph [

1483−238:33 tight tvar A

1484−238:35 tvar B

1485−238:36 tight glyph ]

1486−238:38 tvar B

1487−238:39 tight glyph )

1488−238:40 tight glyph ]

1489−239:3 INDENT

1490−239:3 glyph ?-

1491−239:6 name args

1492−240:5 INDENT

1493−240:5 glyph [

1494−240:6 tight name xs

1495−240:9 name start

1496−240:15 name combine

1497−240:22 tight glyph ]

1498−241:7 INDENT

1499−241:7 glyph ?-

1500−241:10 name xs

1501−242:9 INDENT

1502−242:9 lit ~

1503−242:11 name start

1504−243:9 NEWLINE

1505−243:9 glyph [

1506−243:10 tight name item

1507−243:15 name rest

1508−243:19 tight glyph ]

1509−243:21 glyph (

1510−243:22 tight name roll

1511−243:27 name rest

1512−243:32 glyph (

1513−243:33 tight name combine

1514−243:41 name item

1515−243:46 name start

1516−243:51 tight glyph )

1517−243:53 name combine

1518−243:60 tight glyph )

1519−245:1 DEDENT

1520−245:1 DEDENT

1521−245:1 DEDENT

1522−245:1 DEDENT

1523−245:1 NEWLINE

1524−245:1 glyph ++

1525−245:4 name reel

1526−245:9 glyph |=

1527−245:12 name args

1528−245:16 tight glyph =

1529−245:17 tight glyph [

1530−245:18 tight glyph (

1531−245:19 tight name list

1532−245:24 tvar A

1533−245:25 tight glyph )

1534−245:27 tvar B

1535−245:29 glyph $-(

1536−245:32 tight glyph [

1537−245:33 tight tvar A

1538−245:35 tvar B

1539−245:36 tight glyph ]

1540−245:38 tvar B

1541−245:39 tight glyph )

1542−245:40 tight glyph ]

1543−246:3 INDENT

1544−246:3 glyph ?-

1545−246:6 name args

1546−247:5 INDENT

1547−247:5 glyph [

1548−247:6 tight name xs

1549−247:9 name start

1550−247:15 name combine

1551−247:22 tight glyph ]

1552−248:7 INDENT

1553−248:7 glyph ?-

1554−248:10 name xs

1555−249:9 INDENT

1556−249:9 lit ~

1557−249:11 name start

1558−250:9 NEWLINE

1559−250:9 glyph [

1560−250:10 tight name item

1561−250:15 name rest

1562−250:19 tight glyph ]

1563−250:21 glyph (

1564−250:22 tight name combine

1565−250:30 name item

1566−250:35 glyph (

1567−250:36 tight name reel

1568−250:41 name rest

1569−250:46 name start

1570−250:52 name combine

1571−250:59 tight glyph )

1572−250:60 tight glyph )

1573−252:1 DEDENT

1574−252:1 DEDENT

1575−252:1 DEDENT

1576−252:1 DEDENT

1577−252:1 NEWLINE

1578−252:1 glyph ++

1579−252:4 name flit

1580−252:9 glyph |=

1581−252:12 name predicate

1582−252:21 tight glyph =

1583−252:22 tight glyph $-(

1584−252:25 tight tvar A

1585−252:27 glyph ?

1586−252:28 tight glyph )

1587−253:3 INDENT

1588−253:3 glyph |=

1589−253:6 name value

1590−253:11 tight glyph =

1591−253:12 tight tvar A

1592−254:5 INDENT

1593−254:5 glyph ^-

1594−254:8 glyph (

1595−254:9 tight name unit

1596−254:14 tvar A

1597−254:15 tight glyph )

1598−255:7 INDENT

1599−255:7 glyph ?-

1600−255:10 glyph (

1601−255:11 tight name predicate

1602−255:21 name value

1603−255:26 tight glyph )

1604−256:9 INDENT

1605−256:9 lit %.y

1606−256:13 glyph `

1607−256:14 tight name value

1608−257:9 NEWLINE

1609−257:9 lit %.n

1610−257:13 lit ~

1611−259:1 DEDENT

1612−259:1 DEDENT

1613−259:1 DEDENT

1614−259:1 DEDENT

1615−259:1 NEWLINE

1616−259:1 glyph ++

1617−259:4 name murn

1618−259:9 glyph |=

1619−259:12 name args

1620−259:16 tight glyph =

1621−259:17 tight glyph [

1622−259:18 tight glyph (

1623−259:19 tight name list

1624−259:24 tvar A

1625−259:25 tight glyph )

1626−259:27 glyph $-(

1627−259:30 tight tvar A

1628−259:32 glyph (

1629−259:33 tight name unit

1630−259:38 tvar B

1631−259:39 tight glyph )

1632−259:40 tight glyph )

1633−259:41 tight glyph ]

1634−260:3 INDENT

1635−260:3 glyph ?-

1636−260:6 name args

1637−261:5 INDENT

1638−261:5 glyph [

1639−261:6 tight name xs

1640−261:9 name f

1641−261:10 tight glyph ]

1642−261:12 glyph ^-

1643−261:15 glyph (

1644−261:16 tight name list

1645−261:21 tvar B

1646−261:22 tight glyph )

1647−262:9 INDENT

1648−262:9 glyph ?-

1649−262:12 name xs

1650−263:11 INDENT

1651−263:11 lit ~

1652−263:13 lit ~

1653−264:11 NEWLINE

1654−264:11 glyph [

1655−264:12 tight name item

1656−264:17 name rest

1657−264:21 tight glyph ]

1658−265:13 INDENT

1659−265:13 glyph ?-

1660−265:16 glyph (

1661−265:17 tight name f

1662−265:19 name item

1663−265:23 tight glyph )

1664−266:15 INDENT

1665−266:15 lit ~

1666−266:17 glyph (

1667−266:18 tight name murn

1668−266:23 name rest

1669−266:28 name f

1670−266:29 tight glyph )

1671−267:15 NEWLINE

1672−267:15 glyph [

1673−267:16 tight lit ~

1674−267:18 name value

1675−267:23 tight glyph ]

1676−267:25 glyph [

1677−267:26 tight name value

1678−267:32 glyph (

1679−267:33 tight name murn

1680−267:38 name rest

1681−267:43 name f

1682−267:44 tight glyph )

1683−267:45 tight glyph ]

1684−269:1 DEDENT

1685−269:1 DEDENT

1686−269:1 DEDENT

1687−269:1 DEDENT

1688−269:1 DEDENT

1689−269:1 DEDENT

1690−269:1 NEWLINE

1691−269:1 glyph ++

1692−269:4 name join

1693−269:9 glyph |=

1694−269:12 name args

1695−269:16 tight glyph =

1696−269:17 tight glyph [

1697−269:18 tight tvar A

1698−269:20 glyph (

1699−269:21 tight name list

1700−269:26 tvar A

1701−269:27 tight glyph )

1702−269:28 tight glyph ]

1703−270:3 INDENT

1704−270:3 glyph ?-

1705−270:6 name args

1706−271:5 INDENT

1707−271:5 glyph [

1708−271:6 tight name separator

1709−271:16 name xs

1710−271:18 tight glyph ]

1711−271:20 glyph ^-

1712−271:23 glyph (

1713−271:24 tight name list

1714−271:29 tvar A

1715−271:30 tight glyph )

1716−272:9 INDENT

1717−272:9 glyph ?-

1718−272:12 name xs

1719−273:11 INDENT

1720−273:11 lit ~

1721−273:13 lit ~

1722−274:11 NEWLINE

1723−274:11 glyph [

1724−274:12 tight name item

1725−274:17 name rest

1726−274:21 tight glyph ]

1727−275:13 INDENT

1728−275:13 glyph ?-

1729−275:16 name rest

1730−276:15 INDENT

1731−276:15 lit ~

1732−276:17 glyph [

1733−276:18 tight name item

1734−276:23 lit ~

1735−276:24 tight glyph ]

1736−277:15 NEWLINE

1737−277:15 glyph [

1738−277:16 tight name next

1739−277:21 name more

1740−277:25 tight glyph ]

1741−277:27 glyph [

1742−277:28 tight name item

1743−277:33 glyph [

1744−277:34 tight name separator

1745−277:44 glyph (

1746−277:45 tight name join

1747−277:50 name separator

1748−277:60 name rest

1749−277:64 tight glyph )

1750−277:65 tight glyph ]

1751−277:66 tight glyph ]

1752−279:1 DEDENT

1753−279:1 DEDENT

1754−279:1 DEDENT

1755−279:1 DEDENT

1756−279:1 DEDENT

1757−279:1 DEDENT

1758−279:1 NEWLINE

1759−279:1 glyph ++

1760−279:4 name snip

1761−279:9 glyph |=

1762−279:12 name xs

1763−279:14 tight glyph =

1764−279:15 tight glyph (

1765−279:16 tight name list

1766−279:21 tvar A

1767−279:22 tight glyph )

1768−280:3 INDENT

1769−280:3 glyph ^-

1770−280:6 glyph (

1771−280:7 tight name list

1772−280:12 tvar A

1773−280:13 tight glyph )

1774−281:5 INDENT

1775−281:5 glyph ?-

1776−281:8 name xs

1777−282:7 INDENT

1778−282:7 lit ~

1779−282:9 lit ~

1780−283:7 NEWLINE

1781−283:7 glyph [

1782−283:8 tight name item

1783−283:13 name rest

1784−283:17 tight glyph ]

1785−284:9 INDENT

1786−284:9 glyph ?-

1787−284:12 name rest

1788−285:11 INDENT

1789−285:11 lit ~

1790−285:13 lit ~

1791−286:11 NEWLINE

1792−286:11 glyph [

1793−286:12 tight name next

1794−286:17 name more

1795−286:21 tight glyph ]

1796−286:23 glyph [

1797−286:24 tight name item

1798−286:29 glyph (

1799−286:30 tight name snip

1800−286:35 name rest

1801−286:39 tight glyph )

1802−286:40 tight glyph ]

1803−288:1 DEDENT

1804−288:1 DEDENT

1805−288:1 DEDENT

1806−288:1 DEDENT

1807−288:1 DEDENT

1808−288:1 NEWLINE

1809−288:1 glyph ++

1810−288:4 name rear

1811−288:9 glyph |=

1812−288:12 name xs

1813−288:14 tight glyph =

1814−288:15 tight glyph (

1815−288:16 tight name list

1816−288:21 tvar A

1817−288:22 tight glyph )

1818−289:3 INDENT

1819−289:3 glyph ?-

1820−289:6 name xs

1821−290:5 INDENT

1822−290:5 lit ~

1823−290:7 glyph !!

1824−291:5 NEWLINE

1825−291:5 glyph [

1826−291:6 tight name item

1827−291:11 name rest

1828−291:15 tight glyph ]

1829−292:7 INDENT

1830−292:7 glyph ?-

1831−292:10 name rest

1832−293:9 INDENT

1833−293:9 lit ~

1834−293:11 name item

1835−294:9 NEWLINE

1836−294:9 glyph [

1837−294:10 tight name next

1838−294:15 name more

1839−294:19 tight glyph ]

1840−294:21 glyph (

1841−294:22 tight name rear

1842−294:27 name rest

1843−294:31 tight glyph )

1844−296:1 DEDENT

1845−296:1 DEDENT

1846−296:1 DEDENT

1847−296:1 DEDENT

1848−296:1 NEWLINE

1849−296:1 glyph ++

1850−296:4 name cork

1851−296:9 glyph |=

1852−296:12 name gates

1853−296:17 tight glyph =

1854−296:18 tight glyph [

1855−296:19 tight glyph $-(

1856−296:22 tight tvar A

1857−296:24 tvar B

1858−296:25 tight glyph )

1859−296:27 glyph $-(

1860−296:30 tight tvar B

1861−296:32 tvar C

1862−296:33 tight glyph )

1863−296:34 tight glyph ]

1864−297:3 INDENT

1865−297:3 glyph ?-

1866−297:6 name gates

1867−298:5 INDENT

1868−298:5 glyph [

1869−298:6 tight name f

1870−298:8 name g

1871−298:9 tight glyph ]

1872−298:11 glyph |=

1873−298:14 name x

1874−298:15 tight glyph =

1875−298:16 tight tvar A

1876−298:18 glyph (

1877−298:19 tight name g

1878−298:21 glyph (

1879−298:22 tight name f

1880−298:24 name x

1881−298:25 tight glyph )

1882−298:26 tight glyph )

1883−300:1 DEDENT

1884−300:1 DEDENT

1885−300:1 NEWLINE

1886−300:1 glyph ++

1887−300:4 name corl

1888−300:9 glyph |=

1889−300:12 name gates

1890−300:17 tight glyph =

1891−300:18 tight glyph [

1892−300:19 tight glyph $-(

1893−300:22 tight tvar B

1894−300:24 tvar C

1895−300:25 tight glyph )

1896−300:27 glyph $-(

1897−300:30 tight tvar A

1898−300:32 tvar B

1899−300:33 tight glyph )

1900−300:34 tight glyph ]

1901−301:3 INDENT

1902−301:3 glyph ?-

1903−301:6 name gates

1904−302:5 INDENT

1905−302:5 glyph [

1906−302:6 tight name f

1907−302:8 name g

1908−302:9 tight glyph ]

1909−302:11 glyph |=

1910−302:14 name x

1911−302:15 tight glyph =

1912−302:16 tight tvar A

1913−302:18 glyph (

1914−302:19 tight name f

1915−302:21 glyph (

1916−302:22 tight name g

1917−302:24 name x

1918−302:25 tight glyph )

1919−302:26 tight glyph )

1920−304:1 DEDENT

1921−304:1 DEDENT

1922−304:1 NEWLINE

1923−304:1 glyph ++

1924−304:4 name cury

1925−304:9 glyph |=

1926−304:12 name args

1927−304:16 tight glyph =

1928−304:17 tight glyph [

1929−304:18 tight glyph $-(

1930−304:21 tight glyph [

1931−304:22 tight tvar A

1932−304:24 tvar B

1933−304:25 tight glyph ]

1934−304:27 tvar C

1935−304:28 tight glyph )

1936−304:30 tvar A

1937−304:31 tight glyph ]

1938−305:3 INDENT

1939−305:3 glyph ?-

1940−305:6 name args

1941−306:5 INDENT

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

1106+179:17 tight glyph ]

1107+179:19 glyph (

1108+179:20 tight name f

1109+179:22 name value

1110+179:27 tight glyph )

1111+181:1 DEDENT

1112+181:1 DEDENT

1113+181:1 DEDENT

1114+181:1 DEDENT

1115+181:1 NEWLINE

1116+181:1 glyph ++

1117+181:4 name both

1118+181:9 glyph |=

1119+181:12 name args

1120+181:16 tight glyph =

1121+181:17 tight glyph [

1122+181:18 tight glyph (

1123+181:19 tight name unit

1124+181:24 tvar A

1125+181:25 tight glyph )

1126+181:27 glyph (

1127+181:28 tight name unit

1128+181:33 tvar B

1129+181:34 tight glyph )

1130+181:35 tight glyph ]

1131+182:3 INDENT

1132+182:3 glyph ?-

1133+182:6 name args

1134+183:5 INDENT

1135+183:5 glyph [

1136+183:6 tight name first

1137+183:12 name second

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 )

1147+184:7 INDENT

1148+184:7 glyph ?-

1149+184:10 name first

1150+185:9 INDENT

1151+185:9 lit ~

1152+185:11 lit ~

1153+186:9 NEWLINE

1154+186:9 glyph [

1155+186:10 tight lit ~

1156+186:12 name a

1157+186:13 tight glyph ]

1158+187:11 INDENT

1159+187:11 glyph ?-

1160+187:14 name second

1161+188:13 INDENT

1162+188:13 lit ~

1163+188:15 lit ~

1164+189:13 NEWLINE

1165+189:13 glyph [

1166+189:14 tight lit ~

1167+189:16 name b

1168+189:17 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 ]

1174+191:1 DEDENT

1175+191:1 DEDENT

1176+191:1 DEDENT

1177+191:1 DEDENT

1178+191:1 DEDENT

1179+191:1 DEDENT

1180+191:1 NEWLINE

1181+191:1 glyph ++

1182+191:4 name clap

1183+191:9 glyph |=

1184+191:12 name args

1185+191:16 tight glyph =

1186+191:17 tight glyph [

1187+191:18 tight glyph (

1188+191:19 tight name unit

1189+191:24 tvar A

1190+191:25 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 ]

1203+192:3 INDENT

1204+192:3 glyph ?-

1205+192:6 name args

1206+193:5 INDENT

1207+193:5 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 )

1217+194:7 INDENT

1218+194:7 glyph ?-

1219+194:10 name first

1220+195:9 INDENT

1221+195:9 lit ~

1222+195:11 name second

1223+196:9 NEWLINE

1224+196:9 glyph [

1225+196:10 tight lit ~

1226+196:12 name a

1227+196:13 tight glyph ]

1228+197:11 INDENT

1229+197:11 glyph ?-

1230+197:14 name second

1231+198:13 INDENT

1232+198:13 lit ~

1233+198:15 name first

1234+199:13 NEWLINE

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 )

1245+201:1 DEDENT

1246+201:1 DEDENT

1247+201:1 DEDENT

1248+201:1 DEDENT

1249+201:1 DEDENT

1250+201:1 DEDENT

1251+201:1 NEWLINE

1252+201:1 glyph ++

1253+201:4 name clef

1254+201:9 glyph |=

1255+201:12 name args

1256+201:16 tight glyph =

1257+201:17 tight glyph [

1258+201:18 tight glyph (

1259+201:19 tight name unit

1260+201:24 tvar A

1261+201:25 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 ]

1277+202:3 INDENT

1278+202:3 glyph ?-

1279+202:6 name args

1280+203:5 INDENT

1281+203:5 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 )

1291+204:7 INDENT

1292+204:7 glyph ?-

1293+204:10 name first

1294+205:9 INDENT

1295+205:9 lit ~

1296+205:11 lit ~

1297+206:9 NEWLINE

1298+206:9 glyph [

1299+206:10 tight lit ~

1300+206:12 name a

1301+206:13 tight glyph ]

1302+207:11 INDENT

1303+207:11 glyph ?-

1304+207:14 name second

1305+208:13 INDENT

1306+208:13 lit ~

1307+208:15 lit ~

1308+209:13 NEWLINE

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 )

1318+211:1 DEDENT

1319+211:1 DEDENT

1320+211:1 DEDENT

1321+211:1 DEDENT

1322+211:1 DEDENT

1323+211:1 DEDENT

1324+211:1 NEWLINE

1325+211:1 glyph ++

1326+211:4 name skim

1327+211:9 glyph |=

1328+211:12 name args

1329+211:16 tight glyph =

1330+211:17 tight glyph [

1331+211:18 tight glyph (

1332+211:19 tight name list

1333+211:24 tvar A

1334+211:25 tight glyph )

1335+211:27 glyph $-(

1336+211:30 tight tvar A

1337+211:32 glyph ?

1338+211:33 tight glyph )

1339+211:34 tight glyph ]

1340+212:3 INDENT

1341+212:3 glyph ?-

1342+212:6 name args

1343+213:5 INDENT

1344+213:5 glyph [

1345+213:6 tight name xs

1346+213:9 name predicate

1347+213:18 tight glyph ]

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 )

1387+221:1 DEDENT

1388+221:1 DEDENT

1389+221:1 DEDENT

1390+221:1 DEDENT

1391+221:1 DEDENT

1392+221:1 DEDENT

1393+221:1 NEWLINE

1394+221:1 glyph ++

1395+221:4 name skip

1396+221:9 glyph |=

1397+221:12 name args

1398+221:16 tight glyph =

1399+221:17 tight glyph [

1400+221:18 tight glyph (

1401+221:19 tight name list

1402+221:24 tvar A

1403+221:25 tight glyph )

1404+221:27 glyph $-(

1405+221:30 tight tvar A

1406+221:32 glyph ?

1407+221:33 tight glyph )

1408+221:34 tight glyph ]

1409+222:3 INDENT

1410+222:3 glyph ?-

1411+222:6 name args

1412+223:5 INDENT

1413+223:5 glyph [

1414+223:6 tight name xs

1415+223:9 name predicate

1416+223:18 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 ]

1456+231:1 DEDENT

1457+231:1 DEDENT

1458+231:1 DEDENT

1459+231:1 DEDENT

1460+231:1 DEDENT

1461+231:1 DEDENT

1462+231:1 NEWLINE

1463+231:1 glyph ++

1464+231:4 name levy

1465+231:9 glyph |=

1466+231:12 name args

1467+231:16 tight glyph =

1468+231:17 tight glyph [

1469+231:18 tight glyph (

1470+231:19 tight name list

1471+231:24 tvar A

1472+231:25 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 ]

1478+232:3 INDENT

1479+232:3 glyph ^-

1480+232:6 glyph ?

1481+233:5 INDENT

1482+233:5 glyph ?-

1483+233:8 name args

1484+234:7 INDENT

1485+234:7 glyph [

1486+234:8 tight name xs

1487+234:11 name predicate

1488+234:20 tight glyph ]

1489+235:9 INDENT

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 )

1762+277:9 INDENT

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

19421940306:5 glyph [

1943−306:6 tight name f

1944−306:8 name a

1945−306:9 tight glyph ]

1946−306:11 glyph |=

1947−306:14 name b

1948−306:15 tight glyph =

1949−306:16 tight tvar B

1950−306:18 glyph (

1951−306:19 tight name f

1952−306:21 name a

1953−306:23 name b

1954−306:24 tight glyph )

1955−308:1 DEDENT

1956−308:1 DEDENT

1957−308:1 NEWLINE

1958−308:1 glyph ++

1959−308:4 name curr

1960−308:9 glyph |=

1961−308:12 name args

1962−308:16 tight glyph =

1963−308:17 tight glyph [

1964−308:18 tight glyph $-(

1965−308:21 tight glyph [

1966−308:22 tight tvar A

1967−308:24 tvar B

1968−308:25 tight glyph ]

1969−308:27 tvar C

1970−308:28 tight glyph )

1971−308:30 tvar B

1972−308:31 tight glyph ]

1973−309:3 INDENT

1974−309:3 glyph ?-

1975−309:6 name args

1976−310:5 INDENT

1977−310:5 glyph [

1978−310:6 tight name f

1979−310:8 name b

1980−310:9 tight glyph ]

1981−310:11 glyph |=

1982−310:14 name a

1983−310:15 tight glyph =

1984−310:16 tight tvar A

1985−310:18 glyph (

1986−310:19 tight name f

1987−310:21 name a

1988−310:23 name b

1989−310:24 tight glyph )

1990−312:1 DEDENT

1991−312:1 DEDENT

1992−312:1 NEWLINE

1993−312:1 glyph +$

1994−312:4 name cmd

1995−312:8 glyph |$

1996−312:11 glyph [

1997−312:12 tight tvar M

1998−312:13 tight glyph ]

1999−313:3 INDENT

2000−313:3 glyph [

2001−313:4 tight lit %poke

2002−313:10 name p

2003−313:11 tight glyph =

2004−313:12 tight name poke

2005−313:17 name reply

2006−313:22 tight glyph =

2007−313:23 tight glyph $-(

2008−313:26 tight glyph (

2009−313:27 tight name unit

2010−313:32 aura @t

2011−313:34 tight glyph )

2012−313:36 tvar M

2013−313:37 tight glyph )

2014−313:38 tight glyph ]

2015−314:3 NEWLINE

2016−314:3 glyph [

2017−314:4 tight lit %go

2018−314:8 name url

2019−314:11 tight glyph =

2020−314:12 tight aura @t

2021−314:14 tight glyph ]

2022−315:3 NEWLINE

2023−315:3 glyph [

2024−315:4 tight lit %wait

2025−315:10 name gap

2026−315:13 tight glyph =

2027−315:14 tight aura @dr

2028−315:18 name msg

2029−315:21 tight glyph =

2030−315:22 tight tvar M

2031−315:23 tight glyph ]

2032−316:3 NEWLINE

2033−316:3 glyph [

2034−316:4 tight lit %now

2035−316:9 name reply

2036−316:14 tight glyph =

2037−316:15 tight glyph $-(

2038−316:18 tight aura @da

2039−316:22 tvar M

2040−316:23 tight glyph )

2041−316:24 tight glyph ]

2042−317:3 NEWLINE

2043−317:3 glyph [

2044−317:4 tight lit %who

2045−317:9 name reply

2046−317:14 tight glyph =

2047−317:15 tight glyph $-(

2048−317:18 tight aura @p

2049−317:21 tvar M

2050−317:22 tight glyph )

2051−317:23 tight 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

20522036319:1 DEDENT

20532037319:1 NEWLINE

20542038319:1 glyph ++

2055−319:4 name gth

2056−319:8 glyph |=

2057−319:11 name args

2058−319:15 tight glyph =

2059−319:16 tight glyph [

2060−319:17 tight tvar A

2061−319:19 tvar A

2062−319:20 tight glyph ]

2063−319:22 glyph (

2064−319:23 tight wing gth-atom.internal

2065−319:41 name args

2066−319:45 tight glyph )

2067−319:46 NEWLINE

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+956−885

@@ -1,901 +1,972 @@

11(module

22 (jibb 1:1 internal /lib/jibb/internal)

33 (mold 2:1 poke (ref 2:9 poke.internal))

4− (value 6:1 same

5− (gate 6:9

6− (face 6:12 x (tvar 6:14 A))

7− (wing 6:16 x)))

8− (value 8:1 head

9− (gate 8:9

10− (face 8:12 p

11− (cell 8:14 (tvar 8:15 A) (tvar 8:17 B)))

12− (body 9:3

13− (branch 9:3

14− (wing 9:6 p)

15− (arm 10:5

16− (cell 10:5 (bind 10:6 a) (bind 10:8 b))

17− (wing 10:11 a))))))

18− (value 12:1 tail

19− (gate 12:9

20− (face 12:12 p

21− (cell 12:14 (tvar 12:15 A) (tvar 12:17 B)))

22− (body 13:3

23− (branch 13:3

24− (wing 13:6 p)

25− (arm 14:5

26− (cell 14:5 (bind 14:6 a) (bind 14:8 b))

27− (wing 14:11 b))))))

28− (value 16:1 not

29− (gate 16:8

30− (face 16:11 b (flag 16:13))

31− (body 17:3

32− (branch 17:3

33− (wing 17:6 b)

34− (arm 18:5 (lit 18:5 %.y) (lit 18:9 %.n))

35− (arm 19:5 (lit 19:5 %.n) (lit 19:9 %.y))))))

36− (mold 21:1 list

37− (generic 21:9 A

38− (union 22:3

39− (const 22:3 ~)

40− (cell 23:3

41− (face 23:4 i (tvar 23:6 A))

42− (face 23:8 t

43− (apply 23:10 list (tvar 23:16 A)))))))

44− (mold 25:1 unit

45− (generic 25:9 A

46− (union 26:3

47− (const 26:3 ~)

48− (cell 27:3

49− (const 27:4 ~)

50− (face 27:6 u (tvar 27:8 A))))))

51− (value 29:1 fall

52− (gate 29:9

53− (face 29:12 args

54− (cell 29:17

55− (apply 29:18 unit (tvar 29:24 A))

56− (tvar 29:27 A)))

57− (body 30:3

58− (branch 30:3

59− (wing 30:6 args)

60− (arm 31:5

61− (cell 31:5 (bind 31:6 maybe) (bind 31:12 fallback))

62− (body 32:7

63− (branch 32:7

64− (wing 32:10 maybe)

65− (arm 33:9 (lit 33:9 ~) (wing 33:11 fallback))

66− (arm 34:9

67− (cell 34:9 (lit 34:10 ~) (bind 34:12 value))

68− (wing 34:19 value)))))))))

69− (value 36:1 need

70− (gate 36:9

71− (face 36:12 maybe

72− (apply 36:18 unit (tvar 36:24 A)))

73− (body 37:3

74− (branch 37:3

75− (wing 37:6 maybe)

76− (arm 38:5 (lit 38:5 ~) (crash 38:7))

77− (arm 39:5

78− (cell 39:5 (lit 39:6 ~) (bind 39:8 value))

79− (wing 39:15 value))))))

80− (value 41:1 weld

81− (gate 41:9

82− (face 41:12 args

83− (cell 41:17

84− (apply 41:18 list (tvar 41:24 A))

85− (apply 41:27 list (tvar 41:33 A))))

86− (body 42:3

87− (branch 42:3

88− (wing 42:6 args)

89− (arm 43:5

90− (cell 43:5 (bind 43:6 xs) (bind 43:9 ys))

91− (body 44:7

92− (cast 44:7

93− (apply 44:10 list (tvar 44:16 A))

94− (body 45:9

95− (branch 45:9

96− (wing 45:12 xs)

97− (arm 46:11 (lit 46:11 ~) (wing 46:13 ys))

98− (arm 47:11

99− (cell 47:11 (bind 47:12 item) (bind 47:17 rest))

100− (tuple 47:23

101− (wing 47:24 item)

102− (group 47:29

103− (call 47:30 (wing 47:30 weld) (wing 47:35 rest) (wing 47:40 ys))))))))))))))

104− (value 49:1 turn

105− (gate 49:9

106− (face 49:12 args

107− (cell 49:17

108− (apply 49:18 list (tvar 49:24 A))

109− (fn 49:27 (tvar 49:30 A) (tvar 49:32 B))))

110− (body 50:3

111− (branch 50:3

112− (wing 50:6 args)

113− (arm 51:5

114− (cell 51:5 (bind 51:6 xs) (bind 51:9 f))

115− (body 52:7

116− (cast 52:7

117− (apply 52:10 list (tvar 52:16 B))

118− (body 53:9

119− (branch 53:9

120− (wing 53:12 xs)

121− (arm 54:11 (lit 54:11 ~) (lit 54:13 ~))

122− (arm 55:11

123− (cell 55:11 (bind 55:12 item) (bind 55:17 rest))

124− (tuple 55:23

125− (group 55:24

126− (call 55:25 (wing 55:25 f) (wing 55:27 item)))

127− (group 55:33

128− (call 55:34 (wing 55:34 turn) (wing 55:39 rest) (wing 55:44 f))))))))))))))

129− (mold 57:1 dime

130− (cell 57:9

131− (face 57:10 p (aura 57:12 @ta))

132− (face 57:16 q (aura 57:18 @))))

133− (mold 59:1 hair

134− (cell 59:9

135− (face 59:10 p (aura 59:12 @ud))

136− (face 59:16 q (aura 59:18 @ud))))

137− (mold 61:1 pint

138− (cell 61:9

139− (face 61:10 p

140− (cell 61:12

141− (face 61:13 p (aura 61:15 @))

142− (face 61:17 q (aura 61:19 @))))

143− (face 61:22 q

144− (cell 61:24

145− (face 61:25 p (aura 61:27 @))

146− (face 61:29 q (aura 61:31 @))))))

147− (mold 63:1 coin

148− (union 64:3

149− (cell 64:3

150− (const 64:4 %$)

151− (face 64:7 p (ref 64:9 dime)))

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

71+ (gate 37:9

72+ (face 37:12 maybe

73+ (apply 37:18 unit (tvar 37:24 A)))

74+ (body 38:3

75+ (branch 38:3

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

152150 (cell 65:3

153− (const 65:4 %blob)

154− (face 65:10 p (noun 65:12)))

151+ (const 65:4 %$)

152+ (face 65:7 p (ref 65:9 dime)))

155153 (cell 66:3

156− (const 66:4 %many)

157− (face 66:10 p

158− (apply 66:12 list (ref 66:18 coin))))))

159− (mold 68:1 pair

160− (generic 68:9 A B

161− (cell 68:18

162− (face 68:19 p (tvar 68:21 A))

163− (face 68:23 q (tvar 68:25 B)))))

164− (mold 70:1 trel

165− (generic 70:9 A B C

166− (cell 70:20

167− (face 70:21 p (tvar 70:23 A))

168− (face 70:25 q (tvar 70:27 B))

169− (face 70:29 r (tvar 70:31 C)))))

170− (mold 72:1 qual

171− (generic 72:9 A B C D

172− (cell 72:22

173− (face 72:23 p (tvar 72:25 A))

174− (face 72:27 q (tvar 72:29 B))

175− (face 72:31 r (tvar 72:33 C))

176− (face 72:35 s (tvar 72:37 D)))))

177− (mold 74:1 cord (aura 74:9 @t))

178− (mold 76:1 knot (aura 76:9 @ta))

179− (mold 78:1 tape

180− (apply 78:9 list (aura 78:15 @tD)))

181− (mold 80:1 path

182− (apply 80:9 list (ref 80:15 knot)))

183− (mold 82:1 tank

184− (union 83:3

185− (ref 83:3 cord)

186− (cell 84:3

187− (const 84:4 %leaf)

188− (face 84:10 p (ref 84:12 tape)))

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)

189187 (cell 85:3

190− (const 85:4 %palm)

191− (face 85:10 p

192− (apply 85:12 qual (ref 85:18 tape) (ref 85:23 tape) (ref 85:28 tape) (ref 85:33 tape)))

193− (face 85:39 q

194− (apply 85:41 list (ref 85:47 tank))))

188+ (const 85:4 %leaf)

189+ (face 85:10 p (ref 85:12 tape)))

195190 (cell 86:3

196− (const 86:4 %rose)

191+ (const 86:4 %palm)

197192 (face 86:10 p

198− (apply 86:12 trel (ref 86:18 tape) (ref 86:23 tape) (ref 86:28 tape)))

199− (face 86:34 q

200− (apply 86:36 list (ref 86:42 tank))))))

201− (mold 88:1 nail

202− (cell 88:9

203− (face 88:10 p (ref 88:12 hair))

204− (face 88:17 q (ref 88:19 tape))))

205− (mold 90:1 edge

206− (cell 90:9

207− (face 90:10 p (ref 90:12 hair))

208− (face 90:17 q

209− (apply 90:19 unit

210− (cell 90:25

211− (face 90:26 p (noun 90:28))

212− (face 90:30 q (ref 90:32 nail)))))))

213− (mold 92:1 rule

214− (fn 92:9 (ref 92:12 nail) (ref 92:17 edge)))

215− (mold 94:1 spot

216− (cell 94:9

217− (face 94:10 p (ref 94:12 path))

218− (face 94:17 q (ref 94:19 pint))))

219− (mold 96:1 toon

220− (union 97:3

221− (cell 97:3

222− (const 97:4 %0)

223− (face 97:7 p (noun 97:9)))

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

224222 (cell 98:3

225− (const 98:4 %1)

223+ (const 98:4 %0)

226224 (face 98:7 p (noun 98:9)))

227225 (cell 99:3

228− (const 99:4 %2)

229− (face 99:7 p

230− (apply 99:9 list (ref 99:15 tank))))))

231− (mold 101:1 like

232− (generic 101:9 A

233− (cell 101:16

234− (face 101:17 p (ref 101:19 hair))

235− (face 101:24 q

236− (apply 101:26 unit

237− (cell 101:32

238− (face 101:33 p (tvar 101:35 A))

239− (face 101:37 q (ref 101:39 nail))))))))

240− (value 103:1 wonk

241− (gate 103:9

242− (face 103:12 veq

243− (apply 103:16 like (tvar 103:22 A)))

244− (body 104:3

245− (branch 104:3

246− (wing 104:6 q.veq)

247− (arm 105:5 (lit 105:5 ~) (crash 105:7))

248− (arm 106:5

249− (cell 106:5 (lit 106:6 ~) (bind 106:8 product))

250− (wing 106:17 p.product))))))

251− (mold 108:1 lone

252− (generic 108:9 A

253− (cell 108:16

254− (face 108:17 p (tvar 108:19 A)))))

255− (mold 110:1 lest

256− (generic 110:9 A

257− (cell 110:16

258− (face 110:17 i (tvar 110:19 A))

259− (face 110:21 t

260− (apply 110:23 list (tvar 110:29 A))))))

261− (mold 112:1 pole

262− (generic 112:9 A

263− (union 113:3

264− (const 113:3 ~)

265− (cell 114:3

266− (tvar 114:4 A)

267− (apply 114:6 pole (tvar 114:12 A))))))

268− (mold 116:1 quip

269− (generic 116:9 A B

270− (cell 116:18

271− (apply 116:19 list (tvar 116:25 A))

272− (tvar 116:28 B))))

273− (mold 118:1 tree

274− (generic 118:9 A

275− (union 119:3

276− (const 119:3 ~)

277− (cell 120:3

278− (face 120:4 n (tvar 120:6 A))

279− (face 120:8 l

280− (apply 120:10 tree (tvar 120:16 A)))

281− (face 120:19 r

282− (apply 120:21 tree (tvar 120:27 A)))))))

283− (mold 122:1 each

284− (generic 122:9 A B

285− (union 123: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 ~)

286298 (cell 123:3

287− (const 123:4 %|)

288− (face 123:7 p (tvar 123:9 B)))

289− (cell 124:3

290− (const 124:4 %&)

291− (face 124:7 p (tvar 124:9 A))))))

292− (mold 126:1 bloq (aura 126:9 @))

293− (value 128:1 some

294− (gate 128:9

295− (face 128:12 item (tvar 128:17 A))

296− (unit 128:19 (wing 128:20 item))))

297− (value 130:1 lure

298− (gate 130:9

299− (face 130:12 item (tvar 130:17 A))

300− (body 131:3

301− (cast 131:3

302− (apply 131:6 list (tvar 131:12 A))

303− (tuple 131:15 (wing 131:16 item) (lit 131:21 ~))))))

304− (value 133:1 snoc

305− (gate 133:9

306− (face 133:12 args

307− (cell 133:17

308− (apply 133:18 list (tvar 133:24 A))

309− (tvar 133:27 A)))

310− (body 134:3

311− (branch 134:3

312− (wing 134:6 args)

313− (arm 135:5

314− (cell 135:5 (bind 135:6 xs) (bind 135:9 item))

315− (group 135:15

316− (call 135:16

317− (wing 135:16 weld)

318− (wing 135:21 xs)

319− (tuple 135:24 (wing 135:25 item) (lit 135:30 ~)))))))))

320− (value 137:1 flop

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

321327 (gate 137:9

322− (face 137:12 xs

323− (apply 137:15 list (tvar 137:21 A)))

324− (body 138:3

325− (value 138:3 reverse-into

326− (gate 138:19

327− (face 138:22 args

328− (cell 138:27

329− (apply 138:28 list (tvar 138:34 A))

330− (apply 138:37 list (tvar 138:43 A))))

331− (body 139:5

332− (branch 139:5

333− (wing 139:8 args)

334− (arm 140:7

335− (cell 140:7 (bind 140:8 rest) (bind 140:13 acc))

336− (body 141:9

337− (branch 141:9

338− (wing 141:12 rest)

339− (arm 142:11 (lit 142:11 ~) (wing 142:13 acc))

340− (arm 143:11

341− (cell 143:11 (bind 143:12 item) (bind 143:17 more))

342− (group 143:23

343− (call 143:24

344− (wing 143:24 reverse-into)

345− (wing 143:37 more)

346− (tuple 143:42 (wing 143:43 item) (wing 143:48 acc))))))))))))

347− (group 144:3

348− (call 144:4 (wing 144:4 reverse-into) (wing 144:17 xs) (lit 144:20 ~))))))

349− (value 146:1 drop

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

338+ (gate 142:9

339+ (face 142:12 args

340+ (cell 142:17

341+ (apply 142:18 list (tvar 142:24 A))

342+ (tvar 142:27 A)))

343+ (body 143:3

344+ (branch 143:3

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

350354 (gate 146:9

351− (face 146:12 maybe

352− (apply 146:18 unit (tvar 146:24 A)))

355+ (face 146:12 xs

356+ (apply 146:15 list (tvar 146:21 A)))

353357 (body 147:3

354− (cast 147:3

355− (apply 147:6 list (tvar 147:12 A))

356− (body 148:5

357− (branch 148:5

358− (wing 148:8 maybe)

359− (arm 149:7 (lit 149:7 ~) (lit 149:9 ~))

360− (arm 150:7

361− (cell 150:7 (lit 150:8 ~) (bind 150:10 value))

362− (tuple 150:17 (wing 150:18 value) (lit 150:24 ~)))))))))

363− (value 152:1 bind

364− (gate 152:9

365− (face 152:12 args

366− (cell 152:17

367− (apply 152:18 unit (tvar 152:24 A))

368− (fn 152:27 (tvar 152:30 A) (tvar 152:32 B))))

369− (body 153:3

370− (branch 153:3

371− (wing 153:6 args)

372− (arm 154:5

373− (cell 154:5 (bind 154:6 maybe) (bind 154:12 f))

374− (cast 154:15

375− (apply 154:18 unit (tvar 154:24 B))

376− (body 155:7

377− (branch 155:7

378− (wing 155:10 maybe)

379− (arm 156:9 (lit 156:9 ~) (lit 156:11 ~))

380− (arm 157:9

381− (cell 157:9 (lit 157:10 ~) (bind 157:12 value))

382− (unit 157:19

383− (group 157:20

384− (call 157:21 (wing 157:21 f) (wing 157:23 value)))))))))))))

385− (value 159:1 biff

386− (gate 159:9

387− (face 159:12 args

388− (cell 159:17

389− (apply 159:18 unit (tvar 159:24 A))

390− (fn 159:27

391− (tvar 159:30 A)

392− (apply 159:32 unit (tvar 159:38 B)))))

393− (body 160:3

394− (branch 160:3

395− (wing 160:6 args)

396− (arm 161:5

397− (cell 161:5 (bind 161:6 maybe) (bind 161:12 f))

398− (cast 161:15

399− (apply 161:18 unit (tvar 161:24 B))

400− (body 162:7

401− (branch 162:7

402− (wing 162:10 maybe)

403− (arm 163:9 (lit 163:9 ~) (lit 163:11 ~))

404− (arm 164:9

405− (cell 164:9 (lit 164:10 ~) (bind 164:12 value))

406− (group 164:19

407− (call 164:20 (wing 164:20 f) (wing 164:22 value))))))))))))

408− (value 166:1 both

409− (gate 166:9

410− (face 166:12 args

411− (cell 166:17

412− (apply 166:18 unit (tvar 166:24 A))

413− (apply 166:27 unit (tvar 166:33 B))))

414− (body 167:3

415− (branch 167:3

416− (wing 167:6 args)

417− (arm 168:5

418− (cell 168:5 (bind 168:6 first) (bind 168:12 second))

419− (cast 168:20

420− (apply 168:23 unit

421− (cell 168:29 (tvar 168:30 A) (tvar 168:32 B)))

422− (body 169:7

423− (branch 169:7

424− (wing 169:10 first)

425− (arm 170:9 (lit 170:9 ~) (lit 170:11 ~))

426− (arm 171:9

427− (cell 171:9 (lit 171:10 ~) (bind 171:12 a))

428− (body 172:11

429− (branch 172:11

430− (wing 172:14 second)

431− (arm 173:13 (lit 173:13 ~) (lit 173:15 ~))

432− (arm 174:13

433− (cell 174:13 (lit 174:14 ~) (bind 174:16 b))

434− (unit 174:19

435− (tuple 174:20 (wing 174:21 a) (wing 174:23 b)))))))))))))))

436− (value 176:1 clap

437− (gate 176:9

438− (face 176:12 args

439− (cell 176:17

440− (apply 176:18 unit (tvar 176:24 A))

441− (apply 176:27 unit (tvar 176:33 A))

442− (fn 176:36

443− (cell 176:39 (tvar 176:40 A) (tvar 176:42 A))

444− (tvar 176:45 A))))

445− (body 177:3

446− (branch 177:3

447− (wing 177:6 args)

448− (arm 178:5

449− (cell 178:5 (bind 178:6 first) (bind 178:12 second) (bind 178:19 combine))

450− (cast 178:28

451− (apply 178:31 unit (tvar 178:37 A))

452− (body 179:7

453− (branch 179:7

454− (wing 179:10 first)

455− (arm 180:9 (lit 180:9 ~) (wing 180:11 second))

456− (arm 181:9

457− (cell 181:9 (lit 181:10 ~) (bind 181:12 a))

458− (body 182:11

459− (branch 182:11

460− (wing 182:14 second)

461− (arm 183:13 (lit 183:13 ~) (wing 183:15 first))

462− (arm 184:13

463− (cell 184:13 (lit 184:14 ~) (bind 184:16 b))

464− (unit 184:19

465− (group 184:20

466− (call 184:21 (wing 184:21 combine) (wing 184:29 a) (wing 184:31 b))))))))))))))))

467− (value 186:1 clef

468− (gate 186:9

469− (face 186:12 args

470− (cell 186:17

471− (apply 186:18 unit (tvar 186:24 A))

472− (apply 186:27 unit (tvar 186:33 B))

473− (fn 186:36

474− (cell 186:39 (tvar 186:40 A) (tvar 186:42 B))

475− (apply 186:45 unit (tvar 186:51 C)))))

476− (body 187:3

477− (branch 187:3

478− (wing 187:6 args)

479− (arm 188:5

480− (cell 188:5 (bind 188:6 first) (bind 188:12 second) (bind 188:19 combine))

481− (cast 188:28

482− (apply 188:31 unit (tvar 188:37 C))

483− (body 189:7

484− (branch 189:7

485− (wing 189:10 first)

486− (arm 190:9 (lit 190:9 ~) (lit 190:11 ~))

487− (arm 191:9

488− (cell 191:9 (lit 191:10 ~) (bind 191:12 a))

489− (body 192:11

490− (branch 192:11

491− (wing 192:14 second)

492− (arm 193:13 (lit 193:13 ~) (lit 193:15 ~))

493− (arm 194:13

494− (cell 194:13 (lit 194:14 ~) (bind 194:16 b))

495− (group 194:19

496− (call 194:20 (wing 194:20 combine) (wing 194:28 a) (wing 194:30 b)))))))))))))))

497− (value 196:1 skim

498− (gate 196:9

499− (face 196:12 args

500− (cell 196:17

501− (apply 196:18 list (tvar 196:24 A))

502− (fn 196:27 (tvar 196:30 A) (flag 196:32))))

503− (body 197:3

504− (branch 197:3

505− (wing 197:6 args)

506− (arm 198:5

507− (cell 198:5 (bind 198:6 xs) (bind 198:9 predicate))

508− (cast 198:20

509− (apply 198:23 list (tvar 198:29 A))

510− (body 199:9

511− (branch 199:9

512− (wing 199:12 xs)

513− (arm 200:11 (lit 200:11 ~) (lit 200:13 ~))

514− (arm 201:11

515− (cell 201:11 (bind 201:12 item) (bind 201:17 rest))

516− (body 202:13

517− (branch 202:13

518− (group 202:16

519− (call 202:17 (wing 202:17 predicate) (wing 202:27 item)))

520− (arm 203:15

521− (lit 203:15 %.y)

522− (tuple 203:19

523− (wing 203:20 item)

524− (group 203:25

525− (call 203:26 (wing 203:26 skim) (wing 203:31 rest) (wing 203:36 predicate)))))

526− (arm 204:15

527− (lit 204:15 %.n)

528− (group 204:19

529− (call 204:20 (wing 204:20 skim) (wing 204:25 rest) (wing 204:30 predicate)))))))))))))))

530− (value 206:1 skip

531− (gate 206:9

532− (face 206:12 args

533− (cell 206:17

534− (apply 206:18 list (tvar 206:24 A))

535− (fn 206:27 (tvar 206:30 A) (flag 206:32))))

536− (body 207:3

537− (branch 207:3

538− (wing 207:6 args)

539− (arm 208:5

540− (cell 208:5 (bind 208:6 xs) (bind 208:9 predicate))

541− (cast 208:20

542− (apply 208:23 list (tvar 208:29 A))

543− (body 209:9

544− (branch 209:9

545− (wing 209:12 xs)

546− (arm 210:11 (lit 210:11 ~) (lit 210:13 ~))

547− (arm 211:11

548− (cell 211:11 (bind 211:12 item) (bind 211:17 rest))

549− (body 212:13

550− (branch 212:13

551− (group 212:16

552− (call 212:17 (wing 212:17 predicate) (wing 212:27 item)))

553− (arm 213:15

554− (lit 213:15 %.y)

555− (group 213:19

556− (call 213:20 (wing 213:20 skip) (wing 213:25 rest) (wing 213:30 predicate))))

557− (arm 214:15

558− (lit 214:15 %.n)

559− (tuple 214:19

560− (wing 214:20 item)

561− (group 214:25

562− (call 214:26 (wing 214:26 skip) (wing 214:31 rest) (wing 214:36 predicate))))))))))))))))

563− (value 216:1 levy

564− (gate 216:9

565− (face 216:12 args

566− (cell 216:17

567− (apply 216:18 list (tvar 216:24 A))

568− (fn 216:27 (tvar 216:30 A) (flag 216:32))))

569− (body 217:3

570− (cast 217:3

571− (flag 217:6)

572− (body 218:5

573− (branch 218:5

574− (wing 218:8 args)

575− (arm 219:7

576− (cell 219:7 (bind 219:8 xs) (bind 219:11 predicate))

577− (body 220:9

578− (branch 220:9

579− (wing 220:12 xs)

580− (arm 221:11 (lit 221:11 ~) (lit 221:13 %.y))

581− (arm 222:11

582− (cell 222:11 (bind 222:12 item) (bind 222:17 rest))

583− (body 223:13

584− (branch 223:13

585− (group 223:16

586− (call 223:17 (wing 223:17 predicate) (wing 223:27 item)))

587− (arm 224:15

588− (lit 224:15 %.y)

589− (group 224:19

590− (call 224:20 (wing 224:20 levy) (wing 224:25 rest) (wing 224:30 predicate))))

591− (arm 225:15 (lit 225:15 %.n) (lit 225:19 %.n))))))))))))))

592− (value 227:1 lien

593− (gate 227:9

594− (face 227:12 args

595− (cell 227:17

596− (apply 227:18 list (tvar 227:24 A))

597− (fn 227:27 (tvar 227:30 A) (flag 227:32))))

598− (body 228:3

599− (cast 228:3

600− (flag 228:6)

601− (body 229:5

602− (branch 229:5

603− (wing 229:8 args)

604− (arm 230:7

605− (cell 230:7 (bind 230:8 xs) (bind 230:11 predicate))

606− (body 231:9

607− (branch 231:9

608− (wing 231:12 xs)

609− (arm 232:11 (lit 232:11 ~) (lit 232:13 %.n))

610− (arm 233:11

611− (cell 233:11 (bind 233:12 item) (bind 233:17 rest))

612− (body 234:13

613− (branch 234:13

614− (group 234:16

615− (call 234:17 (wing 234:17 predicate) (wing 234:27 item)))

616− (arm 235:15 (lit 235:15 %.y) (lit 235:19 %.y))

617− (arm 236:15

618− (lit 236:15 %.n)

619− (group 236:19

620− (call 236:20 (wing 236:20 lien) (wing 236:25 rest) (wing 236:30 predicate))))))))))))))))

621− (value 238:1 roll

622− (gate 238:9

623− (face 238:12 args

624− (cell 238:17

625− (apply 238:18 list (tvar 238:24 A))

626− (tvar 238:27 B)

627− (fn 238:29

628− (cell 238:32 (tvar 238:33 A) (tvar 238:35 B))

629− (tvar 238:38 B))))

630− (body 239:3

631− (branch 239:3

632− (wing 239:6 args)

633− (arm 240:5

634− (cell 240:5 (bind 240:6 xs) (bind 240:9 start) (bind 240:15 combine))

635− (body 241:7

636− (branch 241:7

637− (wing 241:10 xs)

638− (arm 242:9 (lit 242:9 ~) (wing 242:11 start))

639− (arm 243:9

640− (cell 243:9 (bind 243:10 item) (bind 243:15 rest))

641− (group 243:21

642− (call 243:22

643− (wing 243:22 roll)

644− (wing 243:27 rest)

645− (group 243:32

646− (call 243:33 (wing 243:33 combine) (wing 243:41 item) (wing 243:46 start)))

647− (wing 243:53 combine)))))))))))

648− (value 245:1 reel

649− (gate 245:9

650− (face 245:12 args

651− (cell 245:17

652− (apply 245:18 list (tvar 245:24 A))

653− (tvar 245:27 B)

654− (fn 245:29

655− (cell 245:32 (tvar 245:33 A) (tvar 245:35 B))

656− (tvar 245:38 B))))

657− (body 246:3

658− (branch 246:3

659− (wing 246:6 args)

660− (arm 247:5

661− (cell 247:5 (bind 247:6 xs) (bind 247:9 start) (bind 247:15 combine))

662− (body 248:7

663− (branch 248:7

664− (wing 248:10 xs)

665− (arm 249:9 (lit 249:9 ~) (wing 249:11 start))

666− (arm 250:9

667− (cell 250:9 (bind 250:10 item) (bind 250:15 rest))

668− (group 250:21

669− (call 250:22

670− (wing 250:22 combine)

671− (wing 250:30 item)

672− (group 250:35

673− (call 250:36 (wing 250:36 reel) (wing 250:41 rest) (wing 250:46 start) (wing 250:52 combine)))))))))))))

674− (value 252:1 flit

675− (gate 252:9

676− (face 252:12 predicate

677− (fn 252:22 (tvar 252:25 A) (flag 252:27)))

678− (body 253:3

679− (gate 253:3

680− (face 253:6 value (tvar 253:12 A))

681− (body 254:5

682− (cast 254:5

683− (apply 254:8 unit (tvar 254:14 A))

684− (body 255:7

685− (branch 255:7

686− (group 255:10

687− (call 255:11 (wing 255:11 predicate) (wing 255:21 value)))

688− (arm 256:9

689− (lit 256:9 %.y)

690− (unit 256:13 (wing 256:14 value)))

691− (arm 257:9 (lit 257:9 %.n) (lit 257:13 ~))))))))))

692− (value 259:1 murn

693− (gate 259:9

694− (face 259:12 args

695− (cell 259:17

696− (apply 259:18 list (tvar 259:24 A))

697− (fn 259:27

698− (tvar 259:30 A)

699− (apply 259:32 unit (tvar 259:38 B)))))

700− (body 260:3

701− (branch 260:3

702− (wing 260:6 args)

703− (arm 261:5

704− (cell 261:5 (bind 261:6 xs) (bind 261:9 f))

705− (cast 261:12

706− (apply 261:15 list (tvar 261:21 B))

707− (body 262:9

708− (branch 262:9

709− (wing 262:12 xs)

710− (arm 263:11 (lit 263:11 ~) (lit 263:13 ~))

711− (arm 264:11

712− (cell 264:11 (bind 264:12 item) (bind 264:17 rest))

713− (body 265:13

714− (branch 265:13

715− (group 265:16

716− (call 265:17 (wing 265:17 f) (wing 265:19 item)))

717− (arm 266:15

718− (lit 266:15 ~)

719− (group 266:17

720− (call 266:18 (wing 266:18 murn) (wing 266:23 rest) (wing 266:28 f))))

721− (arm 267:15

722− (cell 267:15 (lit 267:16 ~) (bind 267:18 value))

723− (tuple 267:25

724− (wing 267:26 value)

725− (group 267:32

726− (call 267:33 (wing 267:33 murn) (wing 267:38 rest) (wing 267:43 f))))))))))))))))

727− (value 269:1 join

728− (gate 269:9

729− (face 269:12 args

730− (cell 269:17

731− (tvar 269:18 A)

732− (apply 269:20 list (tvar 269:26 A))))

733− (body 270:3

734− (branch 270:3

735− (wing 270:6 args)

736− (arm 271:5

737− (cell 271:5 (bind 271:6 separator) (bind 271:16 xs))

738− (cast 271:20

739− (apply 271:23 list (tvar 271:29 A))

740− (body 272:9

741− (branch 272:9

742− (wing 272:12 xs)

743− (arm 273:11 (lit 273:11 ~) (lit 273:13 ~))

744− (arm 274:11

745− (cell 274:11 (bind 274:12 item) (bind 274:17 rest))

746− (body 275:13

747− (branch 275:13

748− (wing 275:16 rest)

749− (arm 276:15

750− (lit 276:15 ~)

751− (tuple 276:17 (wing 276:18 item) (lit 276:23 ~)))

752− (arm 277:15

753− (cell 277:15 (bind 277:16 next) (bind 277:21 more))

754− (tuple 277:27

755− (wing 277:28 item)

756− (tuple 277:33

757− (wing 277:34 separator)

758− (group 277:44

759− (call 277:45 (wing 277:45 join) (wing 277:50 separator) (wing 277:60 rest)))))))))))))))))

760− (value 279:1 snip

761− (gate 279:9

762− (face 279:12 xs

763− (apply 279:15 list (tvar 279:21 A)))

764− (body 280:3

765− (cast 280:3

766− (apply 280:6 list (tvar 280:12 A))

767− (body 281:5

768− (branch 281:5

769− (wing 281:8 xs)

770− (arm 282:7 (lit 282:7 ~) (lit 282:9 ~))

771− (arm 283:7

772− (cell 283:7 (bind 283:8 item) (bind 283:13 rest))

773− (body 284:9

774− (branch 284:9

775− (wing 284:12 rest)

776− (arm 285:11 (lit 285:11 ~) (lit 285:13 ~))

777− (arm 286:11

778− (cell 286:11 (bind 286:12 next) (bind 286:17 more))

779− (tuple 286:23

780− (wing 286:24 item)

781− (group 286:29

782− (call 286:30 (wing 286:30 snip) (wing 286:35 rest))))))))))))))

783− (value 288:1 rear

784− (gate 288:9

785− (face 288:12 xs

786− (apply 288:15 list (tvar 288:21 A)))

787− (body 289:3

788− (branch 289:3

789− (wing 289:6 xs)

790− (arm 290:5 (lit 290:5 ~) (crash 290:7))

791− (arm 291:5

792− (cell 291:5 (bind 291:6 item) (bind 291:11 rest))

793− (body 292:7

794− (branch 292:7

795− (wing 292:10 rest)

796− (arm 293:9 (lit 293:9 ~) (wing 293:11 item))

797− (arm 294:9

798− (cell 294:9 (bind 294:10 next) (bind 294:15 more))

799− (group 294:21

800− (call 294:22 (wing 294:22 rear) (wing 294:27 rest)))))))))))

801− (value 296:1 cork

802− (gate 296:9

803− (face 296:12 gates

804− (cell 296:18

805− (fn 296:19 (tvar 296:22 A) (tvar 296:24 B))

806− (fn 296:27 (tvar 296:30 B) (tvar 296:32 C))))

807− (body 297:3

808− (branch 297:3

809− (wing 297:6 gates)

810− (arm 298:5

811− (cell 298:5 (bind 298:6 f) (bind 298:8 g))

812− (gate 298:11

813− (face 298:14 x (tvar 298:16 A))

814− (group 298:18

815− (call 298:19

816− (wing 298:19 g)

817− (group 298:21

818− (call 298:22 (wing 298:22 f) (wing 298:24 x)))))))))))

819− (value 300:1 corl

820− (gate 300:9

821− (face 300:12 gates

822− (cell 300:18

823− (fn 300:19 (tvar 300:22 B) (tvar 300:24 C))

824− (fn 300:27 (tvar 300:30 A) (tvar 300:32 B))))

825− (body 301:3

826− (branch 301:3

827− (wing 301:6 gates)

828− (arm 302:5

829− (cell 302:5 (bind 302:6 f) (bind 302:8 g))

830− (gate 302:11

831− (face 302:14 x (tvar 302:16 A))

832− (group 302:18

833− (call 302:19

834− (wing 302:19 f)

835− (group 302:21

836− (call 302:22 (wing 302:22 g) (wing 302:24 x)))))))))))

837− (value 304:1 cury

838− (gate 304:9

839− (face 304:12 args

840− (cell 304:17

841− (fn 304:18

842− (cell 304:21 (tvar 304:22 A) (tvar 304:24 B))

843− (tvar 304:27 C))

844− (tvar 304:30 A)))

845− (body 305:3

846− (branch 305:3

847− (wing 305:6 args)

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

397+ (gate 161:9

398+ (face 161:12 fallback

399+ (fn 161:21 (const 161:24 ~) (tvar 161:26 A)))

400+ (body 162:3

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

460+ (gate 181:9

461+ (face 181:12 args

462+ (cell 181:17

463+ (apply 181:18 unit (tvar 181:24 A))

464+ (apply 181:27 unit (tvar 181:33 B))))

465+ (body 182:3

466+ (branch 182:3

467+ (wing 182:6 args)

468+ (arm 183:5

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

488+ (gate 191:9

489+ (face 191:12 args

490+ (cell 191:17

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

496+ (body 192:3

497+ (branch 192:3

498+ (wing 192:6 args)

499+ (arm 193:5

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

519+ (gate 201:9

520+ (face 201:12 args

521+ (cell 201:17

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

527+ (body 202:3

528+ (branch 202:3

529+ (wing 202:6 args)

530+ (arm 203:5

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

549+ (gate 211:9

550+ (face 211:12 args

551+ (cell 211:17

552+ (apply 211:18 list (tvar 211:24 A))

553+ (fn 211:27 (tvar 211:30 A) (flag 211:32))))

554+ (body 212:3

555+ (branch 212:3

556+ (wing 212:6 args)

557+ (arm 213:5

558+ (cell 213:5 (bind 213:6 xs) (bind 213:9 predicate))

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

582+ (gate 221:9

583+ (face 221:12 args

584+ (cell 221:17

585+ (apply 221:18 list (tvar 221:24 A))

586+ (fn 221:27 (tvar 221:30 A) (flag 221:32))))

587+ (body 222:3

588+ (branch 222:3

589+ (wing 222:6 args)

590+ (arm 223:5

591+ (cell 223:5 (bind 223:6 xs) (bind 223:9 predicate))

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

615+ (gate 231:9

616+ (face 231:12 args

617+ (cell 231:17

618+ (apply 231:18 list (tvar 231:24 A))

619+ (fn 231:27 (tvar 231:30 A) (flag 231:32))))

620+ (body 232:3

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

848842 (arm 306:5

849− (cell 306:5 (bind 306:6 f) (bind 306:8 a))

850− (gate 306:11

851− (face 306:14 b (tvar 306:16 B))

852− (group 306:18

853− (call 306:19 (wing 306:19 f) (wing 306:21 a) (wing 306:23 b)))))))))

854− (value 308:1 curr

855− (gate 308:9

856− (face 308:12 args

857− (cell 308:17

858− (fn 308:18

859− (cell 308:21 (tvar 308:22 A) (tvar 308:24 B))

860− (tvar 308:27 C))

861− (tvar 308:30 B)))

862− (body 309:3

863− (branch 309:3

864− (wing 309:6 args)

865− (arm 310:5

866− (cell 310:5 (bind 310:6 f) (bind 310:8 b))

867− (gate 310:11

868− (face 310:14 a (tvar 310:16 A))

869− (group 310:18

870− (call 310:19 (wing 310:19 f) (wing 310:21 a) (wing 310:23 b)))))))))

871− (mold 312:1 cmd

872− (generic 312:8 M

873− (union 313:3

874− (cell 313:3

875− (const 313:4 %poke)

876− (face 313:10 p (ref 313:12 poke))

877− (face 313:17 reply

878− (fn 313:23

879− (apply 313:26 unit (aura 313:32 @t))

880− (tvar 313:36 M))))

881− (cell 314:3

882− (const 314:4 %go)

883− (face 314:8 url (aura 314:12 @t)))

884− (cell 315:3

885− (const 315:4 %wait)

886− (face 315:10 gap (aura 315:14 @dr))

887− (face 315:18 msg (tvar 315:22 M)))

888− (cell 316:3

889− (const 316:4 %now)

890− (face 316:9 reply

891− (fn 316:15 (aura 316:18 @da) (tvar 316:22 M))))

892− (cell 317:3

893− (const 317:4 %who)

894− (face 317:9 reply

895− (fn 317:15 (aura 317:18 @p) (tvar 317:21 M)))))))

896− (value 319:1 gth

897− (gate 319:8

898− (face 319:11 args

899− (cell 319:16 (tvar 319:17 A) (tvar 319:19 A)))

900− (group 319:22

901− (call 319:23 (wing 319:23 gth-atom.internal) (wing 319:41 args))))))

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

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

11partial inference; module not checked

22+$ poke: not checked

3++$ qath: not checked

34++ same: $-(A A)

45++ head: $-([A B] A)

56++ tail: $-([A B] B)

@@ -28,6 +29,7 @@ partial inference; module not checked

2829+$ spot: not checked

2930+$ toon: cases proven disjoint; mold not checked

3031+$ like: not checked

32+++ like: sample mold is not supported by partial inference

3133++ wonk: sample mold is not supported by partial inference

3234+$ lone: not checked

3335+$ lest: not checked

@@ -41,6 +43,7 @@ partial inference; module not checked

4143++ snoc: sample mold is not supported by partial inference

4244++ flop: sample mold is not supported by partial inference

4345++ drop: cast mold is not supported by partial inference

46+++ bond: $-($-(~ A) $-((unit A) A))

4447++ bind: unit construction needs the standard prelude in partial inference

4548++ biff: $-([(unit A) $-(A (unit B))] (unit B))

4649++ both: unit construction needs the standard prelude in partial inference

@@ -63,3 +66,7 @@ partial inference; module not checked

6366++ curr: $-([$-([A B] C) B] $-(A C))

6467+$ cmd: cases proven disjoint; mold not checked

6568++ 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-branch-context/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Branching and Molds — branch arms share the expected result type; unresolved tags need context; written record faces remain part of values.

2+tests: Closed cell result context flows into bounded loobean branches. The checker preserves previously inferred cases and faces, leaves wrong or inconsistent fields, unresolved tags, and open generic context unsupported.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-cell-branch-context/modules.txtnew file+1

@@ -0,0 +1 @@

1+# Use the actual source-backed prelude.

tests/golden/types-cell-branch-context/source.jibbnew file+37

@@ -0,0 +1,37 @@

1+++ choose |= flag=?

2+ ^- [@t (unit @t)] ?- flag

3+ %.y ["yes" ~]

4+ %.n ["no" ~]

5+++ bad |= flag=?

6+ ^- [@t (unit @t)] ?- flag

7+ %.y ["yes" ~]

8+ %.n [~zod ~]

9+++ pending |= flag=?

10+ ^- [@t (unit @t)] ?- flag

11+ %.y ["yes" ~]

12+ %.n [%waiting ~]

13+++ already |= flag=?

14+ ^- [@t @t] ?- flag

15+ %.y ["yes" "a"]

16+ %.n ["no" "b"]

17++$ rec [name=@t place=(unit @t)]

18+++ named |= flag=?

19+ ^- rec ?- flag

20+ %.y [name="yes" place=~]

21+ %.n [name="no" place=~]

22+++ wrong |= flag=?

23+ ^- rec ?- flag

24+ %.y [name="yes" place=~]

25+ %.n [other="no" place=~]

26+++ different |= flag=?

27+ ^- rec ?- flag

28+ %.y [name="yes" place=~]

29+ %.n ["no" ~]

30+++ open |= [flag=? value=A]

31+ ^- [A (unit A)] ?- flag

32+ %.y [value ~]

33+ %.n [value ~]

34+++ waiting |= flag=?

35+ ^- rec ?- flag

36+ %.y [name="yes" place=~]

37+ %.n [name=%waiting place=~]

tests/golden/types-cell-branch-context/tokens.txtnew file+308

@@ -0,0 +1,308 @@

1+1:1 glyph ++

2+1:4 name choose

3+1:11 glyph |=

4+1:14 name flag

5+1:18 tight glyph =

6+1:19 tight glyph ?

7+2:3 INDENT

8+2:3 glyph ^-

9+2:6 glyph [

10+2:7 tight aura @t

11+2:10 glyph (

12+2:11 tight name unit

13+2:16 aura @t

14+2:18 tight glyph )

15+2:19 tight glyph ]

16+2:21 glyph ?-

17+2:24 name flag

18+3:5 INDENT

19+3:5 lit %.y

20+3:9 glyph [

21+3:10 tight str "yes"

22+3:16 lit ~

23+3:17 tight glyph ]

24+4:5 NEWLINE

25+4:5 lit %.n

26+4:9 glyph [

27+4:10 tight str "no"

28+4:15 lit ~

29+4:16 tight glyph ]

30+5:1 DEDENT

31+5:1 DEDENT

32+5:1 NEWLINE

33+5:1 glyph ++

34+5:4 name bad

35+5:8 glyph |=

36+5:11 name flag

37+5:15 tight glyph =

38+5:16 tight glyph ?

39+6:3 INDENT

40+6:3 glyph ^-

41+6:6 glyph [

42+6:7 tight aura @t

43+6:10 glyph (

44+6:11 tight name unit

45+6:16 aura @t

46+6:18 tight glyph )

47+6:19 tight glyph ]

48+6:21 glyph ?-

49+6:24 name flag

50+7:5 INDENT

51+7:5 lit %.y

52+7:9 glyph [

53+7:10 tight str "yes"

54+7:16 lit ~

55+7:17 tight glyph ]

56+8:5 NEWLINE

57+8:5 lit %.n

58+8:9 glyph [

59+8:10 tight lit ~zod

60+8:15 lit ~

61+8:16 tight glyph ]

62+9:1 DEDENT

63+9:1 DEDENT

64+9:1 NEWLINE

65+9:1 glyph ++

66+9:4 name pending

67+9:12 glyph |=

68+9:15 name flag

69+9:19 tight glyph =

70+9:20 tight glyph ?

71+10:3 INDENT

72+10:3 glyph ^-

73+10:6 glyph [

74+10:7 tight aura @t

75+10:10 glyph (

76+10:11 tight name unit

77+10:16 aura @t

78+10:18 tight glyph )

79+10:19 tight glyph ]

80+10:21 glyph ?-

81+10:24 name flag

82+11:5 INDENT

83+11:5 lit %.y

84+11:9 glyph [

85+11:10 tight str "yes"

86+11:16 lit ~

87+11:17 tight glyph ]

88+12:5 NEWLINE

89+12:5 lit %.n

90+12:9 glyph [

91+12:10 tight lit %waiting

92+12:19 lit ~

93+12:20 tight glyph ]

94+13:1 DEDENT

95+13:1 DEDENT

96+13:1 NEWLINE

97+13:1 glyph ++

98+13:4 name already

99+13:12 glyph |=

100+13:15 name flag

101+13:19 tight glyph =

102+13:20 tight glyph ?

103+14:3 INDENT

104+14:3 glyph ^-

105+14:6 glyph [

106+14:7 tight aura @t

107+14:10 aura @t

108+14:12 tight glyph ]

109+14:14 glyph ?-

110+14:17 name flag

111+15:5 INDENT

112+15:5 lit %.y

113+15:9 glyph [

114+15:10 tight str "yes"

115+15:16 str "a"

116+15:19 tight glyph ]

117+16:5 NEWLINE

118+16:5 lit %.n

119+16:9 glyph [

120+16:10 tight str "no"

121+16:15 str "b"

122+16:18 tight glyph ]

123+17:1 DEDENT

124+17:1 DEDENT

125+17:1 NEWLINE

126+17:1 glyph +$

127+17:4 name rec

128+17:8 glyph [

129+17:9 tight name name

130+17:13 tight glyph =

131+17:14 tight aura @t

132+17:17 name place

133+17:22 tight glyph =

134+17:23 tight glyph (

135+17:24 tight name unit

136+17:29 aura @t

137+17:31 tight glyph )

138+17:32 tight glyph ]

139+18:1 NEWLINE

140+18:1 glyph ++

141+18:4 name named

142+18:10 glyph |=

143+18:13 name flag

144+18:17 tight glyph =

145+18:18 tight glyph ?

146+19:3 INDENT

147+19:3 glyph ^-

148+19:6 name rec

149+19:10 glyph ?-

150+19:13 name flag

151+20:5 INDENT

152+20:5 lit %.y

153+20:9 glyph [

154+20:10 tight name name

155+20:14 tight glyph =

156+20:15 tight str "yes"

157+20:21 name place

158+20:26 tight glyph =

159+20:27 tight lit ~

160+20:28 tight glyph ]

161+21:5 NEWLINE

162+21:5 lit %.n

163+21:9 glyph [

164+21:10 tight name name

165+21:14 tight glyph =

166+21:15 tight str "no"

167+21:20 name place

168+21:25 tight glyph =

169+21:26 tight lit ~

170+21:27 tight glyph ]

171+22:1 DEDENT

172+22:1 DEDENT

173+22:1 NEWLINE

174+22:1 glyph ++

175+22:4 name wrong

176+22:10 glyph |=

177+22:13 name flag

178+22:17 tight glyph =

179+22:18 tight glyph ?

180+23:3 INDENT

181+23:3 glyph ^-

182+23:6 name rec

183+23:10 glyph ?-

184+23:13 name flag

185+24:5 INDENT

186+24:5 lit %.y

187+24:9 glyph [

188+24:10 tight name name

189+24:14 tight glyph =

190+24:15 tight str "yes"

191+24:21 name place

192+24:26 tight glyph =

193+24:27 tight lit ~

194+24:28 tight glyph ]

195+25:5 NEWLINE

196+25:5 lit %.n

197+25:9 glyph [

198+25:10 tight name other

199+25:15 tight glyph =

200+25:16 tight str "no"

201+25:21 name place

202+25:26 tight glyph =

203+25:27 tight lit ~

204+25:28 tight glyph ]

205+26:1 DEDENT

206+26:1 DEDENT

207+26:1 NEWLINE

208+26:1 glyph ++

209+26:4 name different

210+26:14 glyph |=

211+26:17 name flag

212+26:21 tight glyph =

213+26:22 tight glyph ?

214+27:3 INDENT

215+27:3 glyph ^-

216+27:6 name rec

217+27:10 glyph ?-

218+27:13 name flag

219+28:5 INDENT

220+28:5 lit %.y

221+28:9 glyph [

222+28:10 tight name name

223+28:14 tight glyph =

224+28:15 tight str "yes"

225+28:21 name place

226+28:26 tight glyph =

227+28:27 tight lit ~

228+28:28 tight glyph ]

229+29:5 NEWLINE

230+29:5 lit %.n

231+29:9 glyph [

232+29:10 tight str "no"

233+29:15 lit ~

234+29:16 tight glyph ]

235+30:1 DEDENT

236+30:1 DEDENT

237+30:1 NEWLINE

238+30:1 glyph ++

239+30:4 name open

240+30:9 glyph |=

241+30:12 glyph [

242+30:13 tight name flag

243+30:17 tight glyph =

244+30:18 tight glyph ?

245+30:20 name value

246+30:25 tight glyph =

247+30:26 tight tvar A

248+30:27 tight glyph ]

249+31:3 INDENT

250+31:3 glyph ^-

251+31:6 glyph [

252+31:7 tight tvar A

253+31:9 glyph (

254+31:10 tight name unit

255+31:15 tvar A

256+31:16 tight glyph )

257+31:17 tight glyph ]

258+31:19 glyph ?-

259+31:22 name flag

260+32:5 INDENT

261+32:5 lit %.y

262+32:9 glyph [

263+32:10 tight name value

264+32:16 lit ~

265+32:17 tight glyph ]

266+33:5 NEWLINE

267+33:5 lit %.n

268+33:9 glyph [

269+33:10 tight name value

270+33:16 lit ~

271+33:17 tight glyph ]

272+34:1 DEDENT

273+34:1 DEDENT

274+34:1 NEWLINE

275+34:1 glyph ++

276+34:4 name waiting

277+34:12 glyph |=

278+34:15 name flag

279+34:19 tight glyph =

280+34:20 tight glyph ?

281+35:3 INDENT

282+35:3 glyph ^-

283+35:6 name rec

284+35:10 glyph ?-

285+35:13 name flag

286+36:5 INDENT

287+36:5 lit %.y

288+36:9 glyph [

289+36:10 tight name name

290+36:14 tight glyph =

291+36:15 tight str "yes"

292+36:21 name place

293+36:26 tight glyph =

294+36:27 tight lit ~

295+36:28 tight glyph ]

296+37:5 NEWLINE

297+37:5 lit %.n

298+37:9 glyph [

299+37:10 tight name name

300+37:14 tight glyph =

301+37:15 tight lit %waiting

302+37:24 name place

303+37:29 tight glyph =

304+37:30 tight lit ~

305+37:31 tight glyph ]

306+37:32 DEDENT

307+37:32 DEDENT

308+37:32 NEWLINE

tests/golden/types-cell-branch-context/tree.txtnew file+156

@@ -0,0 +1,156 @@

1+(module

2+ (value 1:1 choose

3+ (gate 1:11

4+ (face 1:14 flag (flag 1:19))

5+ (body 2:3

6+ (cast 2:3

7+ (cell 2:6

8+ (aura 2:7 @t)

9+ (apply 2:10 unit (aura 2:16 @t)))

10+ (branch 2:21

11+ (wing 2:24 flag)

12+ (arm 3:5

13+ (lit 3:5 %.y)

14+ (tuple 3:9 (str 3:10 "yes") (lit 3:16 ~)))

15+ (arm 4:5

16+ (lit 4:5 %.n)

17+ (tuple 4:9 (str 4:10 "no") (lit 4:15 ~))))))))

18+ (value 5:1 bad

19+ (gate 5:8

20+ (face 5:11 flag (flag 5:16))

21+ (body 6:3

22+ (cast 6:3

23+ (cell 6:6

24+ (aura 6:7 @t)

25+ (apply 6:10 unit (aura 6:16 @t)))

26+ (branch 6:21

27+ (wing 6:24 flag)

28+ (arm 7:5

29+ (lit 7:5 %.y)

30+ (tuple 7:9 (str 7:10 "yes") (lit 7:16 ~)))

31+ (arm 8:5

32+ (lit 8:5 %.n)

33+ (tuple 8:9 (lit 8:10 ~zod) (lit 8:15 ~))))))))

34+ (value 9:1 pending

35+ (gate 9:12

36+ (face 9:15 flag (flag 9:20))

37+ (body 10:3

38+ (cast 10:3

39+ (cell 10:6

40+ (aura 10:7 @t)

41+ (apply 10:10 unit (aura 10:16 @t)))

42+ (branch 10:21

43+ (wing 10:24 flag)

44+ (arm 11:5

45+ (lit 11:5 %.y)

46+ (tuple 11:9 (str 11:10 "yes") (lit 11:16 ~)))

47+ (arm 12:5

48+ (lit 12:5 %.n)

49+ (tuple 12:9 (lit 12:10 %waiting) (lit 12:19 ~))))))))

50+ (value 13:1 already

51+ (gate 13:12

52+ (face 13:15 flag (flag 13:20))

53+ (body 14:3

54+ (cast 14:3

55+ (cell 14:6 (aura 14:7 @t) (aura 14:10 @t))

56+ (branch 14:14

57+ (wing 14:17 flag)

58+ (arm 15:5

59+ (lit 15:5 %.y)

60+ (tuple 15:9 (str 15:10 "yes") (str 15:16 "a")))

61+ (arm 16:5

62+ (lit 16:5 %.n)

63+ (tuple 16:9 (str 16:10 "no") (str 16:15 "b"))))))))

64+ (mold 17:1 rec

65+ (cell 17:8

66+ (face 17:9 name (aura 17:14 @t))

67+ (face 17:17 place

68+ (apply 17:23 unit (aura 17:29 @t)))))

69+ (value 18:1 named

70+ (gate 18:10

71+ (face 18:13 flag (flag 18:18))

72+ (body 19:3

73+ (cast 19:3

74+ (ref 19:6 rec)

75+ (branch 19:10

76+ (wing 19:13 flag)

77+ (arm 20:5

78+ (lit 20:5 %.y)

79+ (tuple 20:9

80+ (face 20:10 name (str 20:15 "yes"))

81+ (face 20:21 place (lit 20:27 ~))))

82+ (arm 21:5

83+ (lit 21:5 %.n)

84+ (tuple 21:9

85+ (face 21:10 name (str 21:15 "no"))

86+ (face 21:20 place (lit 21:26 ~)))))))))

87+ (value 22:1 wrong

88+ (gate 22:10

89+ (face 22:13 flag (flag 22:18))

90+ (body 23:3

91+ (cast 23:3

92+ (ref 23:6 rec)

93+ (branch 23:10

94+ (wing 23:13 flag)

95+ (arm 24:5

96+ (lit 24:5 %.y)

97+ (tuple 24:9

98+ (face 24:10 name (str 24:15 "yes"))

99+ (face 24:21 place (lit 24:27 ~))))

100+ (arm 25:5

101+ (lit 25:5 %.n)

102+ (tuple 25:9

103+ (face 25:10 other (str 25:16 "no"))

104+ (face 25:21 place (lit 25:27 ~)))))))))

105+ (value 26:1 different

106+ (gate 26:14

107+ (face 26:17 flag (flag 26:22))

108+ (body 27:3

109+ (cast 27:3

110+ (ref 27:6 rec)

111+ (branch 27:10

112+ (wing 27:13 flag)

113+ (arm 28:5

114+ (lit 28:5 %.y)

115+ (tuple 28:9

116+ (face 28:10 name (str 28:15 "yes"))

117+ (face 28:21 place (lit 28:27 ~))))

118+ (arm 29:5

119+ (lit 29:5 %.n)

120+ (tuple 29:9 (str 29:10 "no") (lit 29:15 ~))))))))

121+ (value 30:1 open

122+ (gate 30:9

123+ (cell 30:12

124+ (face 30:13 flag (flag 30:18))

125+ (face 30:20 value (tvar 30:26 A)))

126+ (body 31:3

127+ (cast 31:3

128+ (cell 31:6

129+ (tvar 31:7 A)

130+ (apply 31:9 unit (tvar 31:15 A)))

131+ (branch 31:19

132+ (wing 31:22 flag)

133+ (arm 32:5

134+ (lit 32:5 %.y)

135+ (tuple 32:9 (wing 32:10 value) (lit 32:16 ~)))

136+ (arm 33:5

137+ (lit 33:5 %.n)

138+ (tuple 33:9 (wing 33:10 value) (lit 33:16 ~))))))))

139+ (value 34:1 waiting

140+ (gate 34:12

141+ (face 34:15 flag (flag 34:20))

142+ (body 35:3

143+ (cast 35:3

144+ (ref 35:6 rec)

145+ (branch 35:10

146+ (wing 35:13 flag)

147+ (arm 36:5

148+ (lit 36:5 %.y)

149+ (tuple 36:9

150+ (face 36:10 name (str 36:15 "yes"))

151+ (face 36:21 place (lit 36:27 ~))))

152+ (arm 37:5

153+ (lit 37:5 %.n)

154+ (tuple 37:9

155+ (face 37:10 name (lit 37:15 %waiting))

156+ (face 37:24 place (lit 37:30 ~))))))))))

tests/golden/types-cell-branch-context/types.txtnew file+11

@@ -0,0 +1,11 @@

1+partial inference; module not checked

2+++ choose: $-(? [@t (unit @t)])

3+++ bad: branch tag or union context is not supported by partial inference

4+++ pending: branch tag or union context is not supported by partial inference

5+++ already: $-(? [@t @t])

6++$ rec: not checked

7+++ named: $-(? [name=@t place=(unit @t)])

8+++ wrong: branch tag or union context is not supported by partial inference

9+++ different: branch tag or union context is not supported by partial inference

10+++ open: branch widening is not supported by partial inference

11+++ waiting: branch tag or union context is not supported by partial inference

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

@@ -0,0 +1,179 @@

1+1:1 glyph +$

2+1:4 name split

3+2:3 INDENT

4+2:3 glyph [

5+2:4 tight lit %one

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 glyph [

12+3:4 tight lit %one

13+3:9 name value

14+3:14 tight glyph =

15+3:15 tight aura @p

16+3:17 tight glyph ]

17+4:1 DEDENT

18+4:1 NEWLINE

19+4:1 glyph +$

20+4:4 name split-zero

21+5:3 INDENT

22+5:3 glyph [

23+5:4 tight lit ~

24+5:6 name value

25+5:11 tight glyph =

26+5:12 tight aura @t

27+5:14 tight glyph ]

28+6:3 NEWLINE

29+6:3 glyph [

30+6:4 tight lit %.y

31+6:8 name value

32+6:13 tight glyph =

33+6:14 tight aura @p

34+6:16 tight glyph ]

35+7:1 DEDENT

36+7:1 NEWLINE

37+7:1 glyph +$

38+7:4 name nullable

39+8:3 INDENT

40+8:3 lit ~

41+9:3 NEWLINE

42+9:3 glyph [

43+9:4 tight lit ~

44+9:6 name value

45+9:11 tight glyph =

46+9:12 tight aura @t

47+9:14 tight glyph ]

48+10:1 DEDENT

49+10:1 NEWLINE

50+10:1 glyph ++

51+10:4 name cord

52+10:9 glyph ^-

53+10:12 glyph $-(

54+10:15 tight aura @t

55+10:18 name split

56+10:23 tight glyph )

57+10:25 glyph |=

58+10:27 tight lit %one

59+11:1 NEWLINE

60+11:1 glyph ++

61+11:4 name ship

62+11:9 glyph ^-

63+11:12 glyph $-(

64+11:15 tight aura @p

65+11:18 name split

66+11:23 tight glyph )

67+11:25 glyph |=

68+11:27 tight lit %one

69+12:1 NEWLINE

70+12:1 glyph ++

71+12:4 name neither

72+12:12 glyph ^-

73+12:15 glyph $-(

74+12:18 tight aura @ud

75+12:22 name split

76+12:27 tight glyph )

77+12:29 glyph |=

78+12:31 tight lit %one

79+13:1 NEWLINE

80+13:1 glyph ++

81+13:4 name zero-cord

82+13:14 glyph ^-

83+13:17 glyph $-(

84+13:20 tight aura @t

85+13:23 name split-zero

86+13:33 tight glyph )

87+13:35 glyph |=

88+13:37 tight lit %$

89+14:1 NEWLINE

90+14:1 glyph ++

91+14:4 name zero-ship

92+14:14 glyph ^-

93+14:17 glyph $-(

94+14:20 tight aura @p

95+14:23 name split-zero

96+14:33 tight glyph )

97+14:35 glyph |=

98+14:37 tight lit %$

99+15:1 NEWLINE

100+15:1 glyph ++

101+15:4 name zero-neither

102+15:17 glyph ^-

103+15:20 glyph $-(

104+15:23 tight aura @ud

105+15:27 name split-zero

106+15:37 tight glyph )

107+15:39 glyph |=

108+15:41 tight lit %$

109+16:1 NEWLINE

110+16:1 glyph ++

111+16:4 name contextual

112+16:15 glyph ^-

113+16:18 glyph $-(

114+16:21 tight aura @t

115+16:24 name nullable

116+16:32 tight glyph )

117+16:34 glyph |=

118+16:36 tight lit %$

119+17:1 NEWLINE

120+17:1 glyph ++

121+17:4 name pending

122+18:3 INDENT

123+18:3 glyph ~&

124+18:6 lit %orphan

125+19:5 INDENT

126+19:5 glyph ^-

127+19:8 glyph $-(

128+19:11 tight aura @t

129+19:14 name split

130+19:19 tight glyph )

131+19:21 glyph |=

132+19:23 tight lit %one

133+20:1 DEDENT

134+20:1 DEDENT

135+20:1 NEWLINE

136+20:1 glyph +$

137+20:4 name exact

138+21:3 INDENT

139+21:3 glyph [

140+21:4 tight lit %same

141+21:10 lit %alpha

142+21:16 tight glyph ]

143+22:3 NEWLINE

144+22:3 glyph [

145+22:4 tight lit %same

146+22:10 lit %beta

147+22:15 tight glyph ]

148+23:1 DEDENT

149+23:1 NEWLINE

150+23:1 glyph ++

151+23:4 name first

152+23:10 glyph ^-

153+23:13 glyph $-(

154+23:16 tight lit %alpha

155+23:23 name exact

156+23:28 tight glyph )

157+23:30 glyph |=

158+23:32 tight lit %same

159+24:1 NEWLINE

160+24:1 glyph ++

161+24:4 name second

162+24:11 glyph ^-

163+24:14 glyph $-(

164+24:17 tight lit %beta

165+24:23 name exact

166+24:28 tight glyph )

167+24:30 glyph |=

168+24:32 tight lit %same

169+25:1 NEWLINE

170+25:1 glyph ++

171+25:4 name no-case

172+25:12 glyph ^-

173+25:15 glyph $-(

174+25:18 tight lit %other

175+25:25 name exact

176+25:30 tight glyph )

177+25:32 glyph |=

178+25:34 tight lit %same

179+25:39 NEWLINE

tests/golden/types-equal-head-disjoint/tree.txtnew file+75

@@ -0,0 +1,75 @@

1+(module

2+ (mold 1:1 split

3+ (union 2:3

4+ (cell 2:3

5+ (const 2:4 %one)

6+ (face 2:9 value (aura 2:15 @t)))

7+ (cell 3:3

8+ (const 3:4 %one)

9+ (face 3:9 value (aura 3:15 @p)))))

10+ (mold 4:1 split-zero

11+ (union 5:3

12+ (cell 5:3

13+ (const 5:4 ~)

14+ (face 5:6 value (aura 5:12 @t)))

15+ (cell 6:3

16+ (const 6:4 %.y)

17+ (face 6:8 value (aura 6:14 @p)))))

18+ (mold 7:1 nullable

19+ (union 8:3

20+ (const 8:3 ~)

21+ (cell 9:3

22+ (const 9:4 ~)

23+ (face 9:6 value (aura 9:12 @t)))))

24+ (value 10:1 cord

25+ (cast 10:9

26+ (fn 10:12 (aura 10:15 @t) (ref 10:18 split))

27+ (ctor 10:25 %one)))

28+ (value 11:1 ship

29+ (cast 11:9

30+ (fn 11:12 (aura 11:15 @p) (ref 11:18 split))

31+ (ctor 11:25 %one)))

32+ (value 12:1 neither

33+ (cast 12:12

34+ (fn 12:15 (aura 12:18 @ud) (ref 12:22 split))

35+ (ctor 12:29 %one)))

36+ (value 13:1 zero-cord

37+ (cast 13:14

38+ (fn 13:17 (aura 13:20 @t) (ref 13:23 split-zero))

39+ (ctor 13:35 %$)))

40+ (value 14:1 zero-ship

41+ (cast 14:14

42+ (fn 14:17 (aura 14:20 @p) (ref 14:23 split-zero))

43+ (ctor 14:35 %$)))

44+ (value 15:1 zero-neither

45+ (cast 15:17

46+ (fn 15:20 (aura 15:23 @ud) (ref 15:27 split-zero))

47+ (ctor 15:39 %$)))

48+ (value 16:1 contextual

49+ (cast 16:15

50+ (fn 16:18 (aura 16:21 @t) (ref 16:24 nullable))

51+ (ctor 16:34 %$)))

52+ (value 17:1 pending

53+ (body 18:3

54+ (trace 18:3

55+ (lit 18:6 %orphan)

56+ (body 19:5

57+ (cast 19:5

58+ (fn 19:8 (aura 19:11 @t) (ref 19:14 split))

59+ (ctor 19:21 %one))))))

60+ (mold 20:1 exact

61+ (union 21:3

62+ (cell 21:3 (const 21:4 %same) (const 21:10 %alpha))

63+ (cell 22:3 (const 22:4 %same) (const 22:10 %beta))))

64+ (value 23:1 first

65+ (cast 23:10

66+ (fn 23:13 (const 23:16 %alpha) (ref 23:23 exact))

67+ (ctor 23:30 %same)))

68+ (value 24:1 second

69+ (cast 24:11

70+ (fn 24:14 (const 24:17 %beta) (ref 24:23 exact))

71+ (ctor 24:30 %same)))

72+ (value 25:1 no-case

73+ (cast 25:12

74+ (fn 25:15 (const 25:18 %other) (ref 25:25 exact))

75+ (ctor 25:32 %same))))

tests/golden/types-equal-head-disjoint/types.txtnew file+34

@@ -0,0 +1,34 @@

1+partial inference; module not checked

2++$ split: overlapping cases; mold not checked

3+/tests/golden/types-equal-head-disjoint/source.jibb:2:3: first union case

4+ [%one value=@t]

5+ ^

6+/tests/golden/types-equal-head-disjoint/source.jibb:3:3: overlapping case

7+ [%one value=@p]

8+ ^

9++$ split-zero: overlapping cases; mold not checked

10+/tests/golden/types-equal-head-disjoint/source.jibb:5:3: first union case

11+ [~ value=@t]

12+ ^

13+/tests/golden/types-equal-head-disjoint/source.jibb:6:3: overlapping case

14+ [%.y value=@p]

15+ ^

16++$ nullable: cases proven disjoint; mold not checked

17+++ cord: cast mold is not supported by partial inference

18+++ ship: cast mold is not supported by partial inference

19+++ neither: cast mold is not supported by partial inference

20+++ zero-cord: cast mold is not supported by partial inference

21+++ zero-ship: cast mold is not supported by partial inference

22+++ zero-neither: cast mold is not supported by partial inference

23+++ contextual: $-(@t nullable)

24+++ pending: cast mold is not supported by partial inference

25++$ exact: cases proven disjoint; mold not checked

26+++ first: $-(%alpha exact)

27+++ second: $-(%beta exact)

28+++ no-case: cast mold and expression type do not unify

29+/tests/golden/types-equal-head-disjoint/source.jibb:25:15: cast mold

30+++ no-case ^- $-(%other exact) |=%same

31+ ^

32+/tests/golden/types-equal-head-disjoint/source.jibb:25:32: expression

33+++ no-case ^- $-(%other exact) |=%same

34+ ^

tests/golden/types-generic-result-context/about.txtnew file+1

@@ -0,0 +1 @@

1+Context can reach a directly known generic union result, including reordered and repeated aliases, distinct nominal arguments, independent uses, pending tags and a missing case. These are partial inference reports.

tests/golden/types-generic-result-context/source.jibbnew file+24

@@ -0,0 +1,24 @@

1++$ msg

2+ %idle

3+ %busy

4++$ other

5+ %idle

6+ %busy

7++$ choice |$ [A B]

8+ [%one value=A]

9+ [%two value=B]

10++$ swap |$ [A B] (choice B A)

11++$ repeated |$ [A] (choice A A)

12++$ phantom |$ [A B] (choice A @p)

13+++ wrap |= x=A ^- (choice A @p) [%one x]

14+++ wrap-repeat |= x=A ^- (repeated A) [%one x]

15+++ use-msg ^- (choice msg @p) (wrap %idle)

16+++ use-alias ^- (swap @p msg) (wrap %idle)

17+++ use-repeated ^- (repeated msg) (wrap-repeat %idle)

18+++ use-distinct ^- (choice other @p) (wrap %idle)

19+++ independent |= [m=msg n=other]

20+ [(^- (choice msg @p) (wrap m)) (^- (choice other @p) (wrap n))]

21+++ pending

22+ ~& %orphan

23+ ^- (choice msg @p) (wrap %idle)

24+++ wrong-case ^- (choice msg @p) (wrap %absent)

tests/golden/types-generic-result-context/tokens.txtnew file+233

@@ -0,0 +1,233 @@

1+1:1 glyph +$

2+1:4 name msg

3+2:3 INDENT

4+2:3 lit %idle

5+3:3 NEWLINE

6+3:3 lit %busy

7+4:1 DEDENT

8+4:1 NEWLINE

9+4:1 glyph +$

10+4:4 name other

11+5:3 INDENT

12+5:3 lit %idle

13+6:3 NEWLINE

14+6:3 lit %busy

15+7:1 DEDENT

16+7:1 NEWLINE

17+7:1 glyph +$

18+7:4 name choice

19+7:11 glyph |$

20+7:14 glyph [

21+7:15 tight tvar A

22+7:17 tvar B

23+7:18 tight glyph ]

24+8:3 INDENT

25+8:3 glyph [

26+8:4 tight lit %one

27+8:9 name value

28+8:14 tight glyph =

29+8:15 tight tvar A

30+8:16 tight glyph ]

31+9:3 NEWLINE

32+9:3 glyph [

33+9:4 tight lit %two

34+9:9 name value

35+9:14 tight glyph =

36+9:15 tight tvar B

37+9:16 tight glyph ]

38+10:1 DEDENT

39+10:1 NEWLINE

40+10:1 glyph +$

41+10:4 name swap

42+10:9 glyph |$

43+10:12 glyph [

44+10:13 tight tvar A

45+10:15 tvar B

46+10:16 tight glyph ]

47+10:18 glyph (

48+10:19 tight name choice

49+10:26 tvar B

50+10:28 tvar A

51+10:29 tight glyph )

52+11:1 NEWLINE

53+11:1 glyph +$

54+11:4 name repeated

55+11:13 glyph |$

56+11:16 glyph [

57+11:17 tight tvar A

58+11:18 tight glyph ]

59+11:20 glyph (

60+11:21 tight name choice

61+11:28 tvar A

62+11:30 tvar A

63+11:31 tight glyph )

64+12:1 NEWLINE

65+12:1 glyph +$

66+12:4 name phantom

67+12:12 glyph |$

68+12:15 glyph [

69+12:16 tight tvar A

70+12:18 tvar B

71+12:19 tight glyph ]

72+12:21 glyph (

73+12:22 tight name choice

74+12:29 tvar A

75+12:31 aura @p

76+12:33 tight glyph )

77+13:1 NEWLINE

78+13:1 glyph ++

79+13:4 name wrap

80+13:9 glyph |=

81+13:12 name x

82+13:13 tight glyph =

83+13:14 tight tvar A

84+13:16 glyph ^-

85+13:19 glyph (

86+13:20 tight name choice

87+13:27 tvar A

88+13:29 aura @p

89+13:31 tight glyph )

90+13:33 glyph [

91+13:34 tight lit %one

92+13:39 name x

93+13:40 tight glyph ]

94+14:1 NEWLINE

95+14:1 glyph ++

96+14:4 name wrap-repeat

97+14:16 glyph |=

98+14:19 name x

99+14:20 tight glyph =

100+14:21 tight tvar A

101+14:23 glyph ^-

102+14:26 glyph (

103+14:27 tight name repeated

104+14:36 tvar A

105+14:37 tight glyph )

106+14:39 glyph [

107+14:40 tight lit %one

108+14:45 name x

109+14:46 tight glyph ]

110+15:1 NEWLINE

111+15:1 glyph ++

112+15:4 name use-msg

113+15:12 glyph ^-

114+15:15 glyph (

115+15:16 tight name choice

116+15:23 name msg

117+15:27 aura @p

118+15:29 tight glyph )

119+15:31 glyph (

120+15:32 tight name wrap

121+15:37 lit %idle

122+15:42 tight glyph )

123+16:1 NEWLINE

124+16:1 glyph ++

125+16:4 name use-alias

126+16:14 glyph ^-

127+16:17 glyph (

128+16:18 tight name swap

129+16:23 aura @p

130+16:26 name msg

131+16:29 tight glyph )

132+16:31 glyph (

133+16:32 tight name wrap

134+16:37 lit %idle

135+16:42 tight glyph )

136+17:1 NEWLINE

137+17:1 glyph ++

138+17:4 name use-repeated

139+17:17 glyph ^-

140+17:20 glyph (

141+17:21 tight name repeated

142+17:30 name msg

143+17:33 tight glyph )

144+17:35 glyph (

145+17:36 tight name wrap-repeat

146+17:48 lit %idle

147+17:53 tight glyph )

148+18:1 NEWLINE

149+18:1 glyph ++

150+18:4 name use-distinct

151+18:17 glyph ^-

152+18:20 glyph (

153+18:21 tight name choice

154+18:28 name other

155+18:34 aura @p

156+18:36 tight glyph )

157+18:38 glyph (

158+18:39 tight name wrap

159+18:44 lit %idle

160+18:49 tight glyph )

161+19:1 NEWLINE

162+19:1 glyph ++

163+19:4 name independent

164+19:16 glyph |=

165+19:19 glyph [

166+19:20 tight name m

167+19:21 tight glyph =

168+19:22 tight name msg

169+19:26 name n

170+19:27 tight glyph =

171+19:28 tight name other

172+19:33 tight glyph ]

173+20:3 INDENT

174+20:3 glyph [

175+20:4 tight glyph (

176+20:5 tight glyph ^-

177+20:8 glyph (

178+20:9 tight name choice

179+20:16 name msg

180+20:20 aura @p

181+20:22 tight glyph )

182+20:24 glyph (

183+20:25 tight name wrap

184+20:30 name m

185+20:31 tight glyph )

186+20:32 tight glyph )

187+20:34 glyph (

188+20:35 tight glyph ^-

189+20:38 glyph (

190+20:39 tight name choice

191+20:46 name other

192+20:52 aura @p

193+20:54 tight glyph )

194+20:56 glyph (

195+20:57 tight name wrap

196+20:62 name n

197+20:63 tight glyph )

198+20:64 tight glyph )

199+20:65 tight glyph ]

200+21:1 DEDENT

201+21:1 NEWLINE

202+21:1 glyph ++

203+21:4 name pending

204+22:3 INDENT

205+22:3 glyph ~&

206+22:6 lit %orphan

207+23:5 INDENT

208+23:5 glyph ^-

209+23:8 glyph (

210+23:9 tight name choice

211+23:16 name msg

212+23:20 aura @p

213+23:22 tight glyph )

214+23:24 glyph (

215+23:25 tight name wrap

216+23:30 lit %idle

217+23:35 tight glyph )

218+24:1 DEDENT

219+24:1 DEDENT

220+24:1 NEWLINE

221+24:1 glyph ++

222+24:4 name wrong-case

223+24:15 glyph ^-

224+24:18 glyph (

225+24:19 tight name choice

226+24:26 name msg

227+24:30 aura @p

228+24:32 tight glyph )

229+24:34 glyph (

230+24:35 tight name wrap

231+24:40 lit %absent

232+24:47 tight glyph )

233+24:48 NEWLINE

tests/golden/types-generic-result-context/tree.txtnew file+86

@@ -0,0 +1,86 @@

1+(module

2+ (mold 1:1 msg

3+ (union 2:3 (const 2:3 %idle) (const 3:3 %busy)))

4+ (mold 4:1 other

5+ (union 5:3 (const 5:3 %idle) (const 6:3 %busy)))

6+ (mold 7:1 choice

7+ (generic 7:11 A B

8+ (union 8:3

9+ (cell 8:3

10+ (const 8:4 %one)

11+ (face 8:9 value (tvar 8:15 A)))

12+ (cell 9:3

13+ (const 9:4 %two)

14+ (face 9:9 value (tvar 9:15 B))))))

15+ (mold 10:1 swap

16+ (generic 10:9 A B

17+ (apply 10:18 choice (tvar 10:26 B) (tvar 10:28 A))))

18+ (mold 11:1 repeated

19+ (generic 11:13 A

20+ (apply 11:20 choice (tvar 11:28 A) (tvar 11:30 A))))

21+ (mold 12:1 phantom

22+ (generic 12:12 A B

23+ (apply 12:21 choice (tvar 12:29 A) (aura 12:31 @p))))

24+ (value 13:1 wrap

25+ (gate 13:9

26+ (face 13:12 x (tvar 13:14 A))

27+ (cast 13:16

28+ (apply 13:19 choice (tvar 13:27 A) (aura 13:29 @p))

29+ (tuple 13:33 (lit 13:34 %one) (wing 13:39 x)))))

30+ (value 14:1 wrap-repeat

31+ (gate 14:16

32+ (face 14:19 x (tvar 14:21 A))

33+ (cast 14:23

34+ (apply 14:26 repeated (tvar 14:36 A))

35+ (tuple 14:39 (lit 14:40 %one) (wing 14:45 x)))))

36+ (value 15:1 use-msg

37+ (cast 15:12

38+ (apply 15:15 choice (ref 15:23 msg) (aura 15:27 @p))

39+ (group 15:31

40+ (call 15:32 (wing 15:32 wrap) (lit 15:37 %idle)))))

41+ (value 16:1 use-alias

42+ (cast 16:14

43+ (apply 16:17 swap (aura 16:23 @p) (ref 16:26 msg))

44+ (group 16:31

45+ (call 16:32 (wing 16:32 wrap) (lit 16:37 %idle)))))

46+ (value 17:1 use-repeated

47+ (cast 17:17

48+ (apply 17:20 repeated (ref 17:30 msg))

49+ (group 17:35

50+ (call 17:36 (wing 17:36 wrap-repeat) (lit 17:48 %idle)))))

51+ (value 18:1 use-distinct

52+ (cast 18:17

53+ (apply 18:20 choice (ref 18:28 other) (aura 18:34 @p))

54+ (group 18:38

55+ (call 18:39 (wing 18:39 wrap) (lit 18:44 %idle)))))

56+ (value 19:1 independent

57+ (gate 19:16

58+ (cell 19:19

59+ (face 19:20 m (ref 19:22 msg))

60+ (face 19:26 n (ref 19:28 other)))

61+ (body 20:3

62+ (tuple 20:3

63+ (group 20:4

64+ (cast 20:5

65+ (apply 20:8 choice (ref 20:16 msg) (aura 20:20 @p))

66+ (group 20:24

67+ (call 20:25 (wing 20:25 wrap) (wing 20:30 m)))))

68+ (group 20:34

69+ (cast 20:35

70+ (apply 20:38 choice (ref 20:46 other) (aura 20:52 @p))

71+ (group 20:56

72+ (call 20:57 (wing 20:57 wrap) (wing 20:62 n)))))))))

73+ (value 21:1 pending

74+ (body 22:3

75+ (trace 22:3

76+ (lit 22:6 %orphan)

77+ (body 23:5

78+ (cast 23:5

79+ (apply 23:8 choice (ref 23:16 msg) (aura 23:20 @p))

80+ (group 23:24

81+ (call 23:25 (wing 23:25 wrap) (lit 23:30 %idle))))))))

82+ (value 24:1 wrong-case

83+ (cast 24:15

84+ (apply 24:18 choice (ref 24:26 msg) (aura 24:30 @p))

85+ (group 24:34

86+ (call 24:35 (wing 24:35 wrap) (lit 24:40 %absent))))))

tests/golden/types-generic-result-context/types.txtnew file+22

@@ -0,0 +1,22 @@

1+partial inference; module not checked

2++$ msg: cases proven disjoint; mold not checked

3++$ other: cases proven disjoint; mold not checked

4++$ choice: cases proven disjoint; mold not checked

5++$ swap: not checked

6++$ repeated: not checked

7++$ phantom: not checked

8+++ wrap: $-(A (choice A @p))

9+++ wrap-repeat: $-(A (choice A A))

10+++ use-msg: (choice msg @p)

11+++ use-alias: (choice msg @p)

12+++ use-repeated: (choice msg msg)

13+++ use-distinct: (choice other @p)

14+++ independent: $-([m=msg n=other] [(choice msg @p) (choice other @p)])

15+++ pending: tag needs context in partial inference

16+++ wrong-case: msg has no case `%absent`

17+/tests/golden/types-generic-result-context/source.jibb:24:35: expected union

18+++ wrong-case ^- (choice msg @p) (wrap %absent)

19+ ^

20+/tests/golden/types-generic-result-context/source.jibb:24:40: tag

21+++ wrong-case ^- (choice msg @p) (wrap %absent)

22+ ^

tests/golden/types-list-patterns/about.txt+1−1

@@ -1,4 +1,4 @@

11source: Grammar, Patterns: "Every case needs an arm or a catch-all"; "A name in a pattern always binds anew". Modules: no name may shadow an in-scope name.

2−tests: Both orders of an exhaustive list branch bind the head and tail with their respective types; unsupported subjects or patterns, conflicting binders, and unrelated unresolved tags fail closed.

2+tests: Both orders of an exhaustive list branch bind the head and tail with their respective types; unsupported subjects or patterns, conflicting binders, and unrelated unresolved tags fail closed; a nonempty arm of `(list !!)` is unreachable.

33expect: parses

44expect-types: a partial inference report

tests/golden/types-list-patterns/types.txt+1−1

@@ -12,6 +12,6 @@ partial inference; module not checked

1212++ unresolved: list branch results need unsupported inference

1313++ duplicate-arm: branch is not supported by partial inference

1414++ unrelated: tag needs context in partial inference

15−++ empty-elements: sample mold is not supported by partial inference

15+++ empty-elements: list nonempty pattern is unreachable

1616+$ maybe: cases proven disjoint; mold not checked

1717++ unit-shape: unit branch pattern is not supported by partial inference

tests/golden/types-literal-constructor-nouns/about.txtnew file+2

@@ -0,0 +1,2 @@

1+source: equality of literal molds is based on their runtime nouns.

2+tests: The `%$` constructor matches null-, loobean-zero- and term-zero-headed cells. Overlapping same-noun cases are rejected. Wrong payload, absent tags and unrelated pending constraints remain checked. This is a partial inference report.

tests/golden/types-literal-constructor-nouns/source.jibbnew file+25

@@ -0,0 +1,25 @@

1++$ null-head [~ value=@t]

2++$ flag-head [%.y value=@t]

3++$ dollar-head [%$ value=@t]

4++$ pair-null

5+ ~

6+ [~ value=@t]

7++$ overlap-null

8+ [~ value=@t]

9+ [%$ value=@t]

10++$ overlap-flag

11+ [%.y value=@t]

12+ [%$ value=@t]

13++$ overlap-three

14+ [~ value=@t]

15+ [%.y value=@t]

16+ [%$ value=@t]

17+++ null-ctor ^- $-(@t null-head) |=%$

18+++ flag-ctor ^- $-(@t flag-head) |=%$

19+++ dollar-ctor ^- $-(@t dollar-head) |=%$

20+++ unit-like-ctor ^- $-(@t pair-null) |=%$

21+++ wrong-payload ^- $-(@p null-head) |=%$

22+++ missing-tag ^- $-(@t null-head) |=%missing

23+++ pending

24+ ~& %unrelated

25+ ^- $-(@t null-head) |=%$

tests/golden/types-literal-constructor-nouns/tokens.txtnew file+177

@@ -0,0 +1,177 @@

1+1:1 glyph +$

2+1:4 name null-head

3+1:14 glyph [

4+1:15 tight lit ~

5+1:17 name value

6+1:22 tight glyph =

7+1:23 tight aura @t

8+1:25 tight glyph ]

9+2:1 NEWLINE

10+2:1 glyph +$

11+2:4 name flag-head

12+2:14 glyph [

13+2:15 tight lit %.y

14+2:19 name value

15+2:24 tight glyph =

16+2:25 tight aura @t

17+2:27 tight glyph ]

18+3:1 NEWLINE

19+3:1 glyph +$

20+3:4 name dollar-head

21+3:16 glyph [

22+3:17 tight lit %$

23+3:20 name value

24+3:25 tight glyph =

25+3:26 tight aura @t

26+3:28 tight glyph ]

27+4:1 NEWLINE

28+4:1 glyph +$

29+4:4 name pair-null

30+5:3 INDENT

31+5:3 lit ~

32+6:3 NEWLINE

33+6:3 glyph [

34+6:4 tight lit ~

35+6:6 name value

36+6:11 tight glyph =

37+6:12 tight aura @t

38+6:14 tight glyph ]

39+7:1 DEDENT

40+7:1 NEWLINE

41+7:1 glyph +$

42+7:4 name overlap-null

43+8:3 INDENT

44+8:3 glyph [

45+8:4 tight lit ~

46+8:6 name value

47+8:11 tight glyph =

48+8:12 tight aura @t

49+8:14 tight glyph ]

50+9:3 NEWLINE

51+9:3 glyph [

52+9:4 tight lit %$

53+9:7 name value

54+9:12 tight glyph =

55+9:13 tight aura @t

56+9:15 tight glyph ]

57+10:1 DEDENT

58+10:1 NEWLINE

59+10:1 glyph +$

60+10:4 name overlap-flag

61+11:3 INDENT

62+11:3 glyph [

63+11:4 tight lit %.y

64+11:8 name value

65+11:13 tight glyph =

66+11:14 tight aura @t

67+11:16 tight glyph ]

68+12:3 NEWLINE

69+12:3 glyph [

70+12:4 tight lit %$

71+12:7 name value

72+12:12 tight glyph =

73+12:13 tight aura @t

74+12:15 tight glyph ]

75+13:1 DEDENT

76+13:1 NEWLINE

77+13:1 glyph +$

78+13:4 name overlap-three

79+14:3 INDENT

80+14:3 glyph [

81+14:4 tight lit ~

82+14:6 name value

83+14:11 tight glyph =

84+14:12 tight aura @t

85+14:14 tight glyph ]

86+15:3 NEWLINE

87+15:3 glyph [

88+15:4 tight lit %.y

89+15:8 name value

90+15:13 tight glyph =

91+15:14 tight aura @t

92+15:16 tight glyph ]

93+16:3 NEWLINE

94+16:3 glyph [

95+16:4 tight lit %$

96+16:7 name value

97+16:12 tight glyph =

98+16:13 tight aura @t

99+16:15 tight glyph ]

100+17:1 DEDENT

101+17:1 NEWLINE

102+17:1 glyph ++

103+17:4 name null-ctor

104+17:14 glyph ^-

105+17:17 glyph $-(

106+17:20 tight aura @t

107+17:23 name null-head

108+17:32 tight glyph )

109+17:34 glyph |=

110+17:36 tight lit %$

111+18:1 NEWLINE

112+18:1 glyph ++

113+18:4 name flag-ctor

114+18:14 glyph ^-

115+18:17 glyph $-(

116+18:20 tight aura @t

117+18:23 name flag-head

118+18:32 tight glyph )

119+18:34 glyph |=

120+18:36 tight lit %$

121+19:1 NEWLINE

122+19:1 glyph ++

123+19:4 name dollar-ctor

124+19:16 glyph ^-

125+19:19 glyph $-(

126+19:22 tight aura @t

127+19:25 name dollar-head

128+19:36 tight glyph )

129+19:38 glyph |=

130+19:40 tight lit %$

131+20:1 NEWLINE

132+20:1 glyph ++

133+20:4 name unit-like-ctor

134+20:19 glyph ^-

135+20:22 glyph $-(

136+20:25 tight aura @t

137+20:28 name pair-null

138+20:37 tight glyph )

139+20:39 glyph |=

140+20:41 tight lit %$

141+21:1 NEWLINE

142+21:1 glyph ++

143+21:4 name wrong-payload

144+21:18 glyph ^-

145+21:21 glyph $-(

146+21:24 tight aura @p

147+21:27 name null-head

148+21:36 tight glyph )

149+21:38 glyph |=

150+21:40 tight lit %$

151+22:1 NEWLINE

152+22:1 glyph ++

153+22:4 name missing-tag

154+22:16 glyph ^-

155+22:19 glyph $-(

156+22:22 tight aura @t

157+22:25 name null-head

158+22:34 tight glyph )

159+22:36 glyph |=

160+22:38 tight lit %missing

161+23:1 NEWLINE

162+23:1 glyph ++

163+23:4 name pending

164+24:3 INDENT

165+24:3 glyph ~&

166+24:6 lit %unrelated

167+25:5 INDENT

168+25:5 glyph ^-

169+25:8 glyph $-(

170+25:11 tight aura @t

171+25:14 name null-head

172+25:23 tight glyph )

173+25:25 glyph |=

174+25:27 tight lit %$

175+25:29 DEDENT

176+25:29 DEDENT

177+25:29 NEWLINE

tests/golden/types-literal-constructor-nouns/tree.txtnew file+78

@@ -0,0 +1,78 @@

1+(module

2+ (mold 1:1 null-head

3+ (cell 1:14

4+ (const 1:15 ~)

5+ (face 1:17 value (aura 1:23 @t))))

6+ (mold 2:1 flag-head

7+ (cell 2:14

8+ (const 2:15 %.y)

9+ (face 2:19 value (aura 2:25 @t))))

10+ (mold 3:1 dollar-head

11+ (cell 3:16

12+ (const 3:17 %$)

13+ (face 3:20 value (aura 3:26 @t))))

14+ (mold 4:1 pair-null

15+ (union 5:3

16+ (const 5:3 ~)

17+ (cell 6:3

18+ (const 6:4 ~)

19+ (face 6:6 value (aura 6:12 @t)))))

20+ (mold 7:1 overlap-null

21+ (union 8:3

22+ (cell 8:3

23+ (const 8:4 ~)

24+ (face 8:6 value (aura 8:12 @t)))

25+ (cell 9:3

26+ (const 9:4 %$)

27+ (face 9:7 value (aura 9:13 @t)))))

28+ (mold 10:1 overlap-flag

29+ (union 11:3

30+ (cell 11:3

31+ (const 11:4 %.y)

32+ (face 11:8 value (aura 11:14 @t)))

33+ (cell 12:3

34+ (const 12:4 %$)

35+ (face 12:7 value (aura 12:13 @t)))))

36+ (mold 13:1 overlap-three

37+ (union 14:3

38+ (cell 14:3

39+ (const 14:4 ~)

40+ (face 14:6 value (aura 14:12 @t)))

41+ (cell 15:3

42+ (const 15:4 %.y)

43+ (face 15:8 value (aura 15:14 @t)))

44+ (cell 16:3

45+ (const 16:4 %$)

46+ (face 16:7 value (aura 16:13 @t)))))

47+ (value 17:1 null-ctor

48+ (cast 17:14

49+ (fn 17:17 (aura 17:20 @t) (ref 17:23 null-head))

50+ (ctor 17:34 %$)))

51+ (value 18:1 flag-ctor

52+ (cast 18:14

53+ (fn 18:17 (aura 18:20 @t) (ref 18:23 flag-head))

54+ (ctor 18:34 %$)))

55+ (value 19:1 dollar-ctor

56+ (cast 19:16

57+ (fn 19:19 (aura 19:22 @t) (ref 19:25 dollar-head))

58+ (ctor 19:38 %$)))

59+ (value 20:1 unit-like-ctor

60+ (cast 20:19

61+ (fn 20:22 (aura 20:25 @t) (ref 20:28 pair-null))

62+ (ctor 20:39 %$)))

63+ (value 21:1 wrong-payload

64+ (cast 21:18

65+ (fn 21:21 (aura 21:24 @p) (ref 21:27 null-head))

66+ (ctor 21:38 %$)))

67+ (value 22:1 missing-tag

68+ (cast 22:16

69+ (fn 22:19 (aura 22:22 @t) (ref 22:25 null-head))

70+ (ctor 22:36 %missing)))

71+ (value 23:1 pending

72+ (body 24:3

73+ (trace 24:3

74+ (lit 24:6 %unrelated)

75+ (body 25:5

76+ (cast 25:5

77+ (fn 25:8 (aura 25:11 @t) (ref 25:14 null-head))

78+ (ctor 25:25 %$)))))))

tests/golden/types-literal-constructor-nouns/types.txtnew file+45

@@ -0,0 +1,45 @@

1+partial inference; module not checked

2++$ null-head: not checked

3++$ flag-head: not checked

4++$ dollar-head: not checked

5++$ pair-null: cases proven disjoint; mold not checked

6++$ overlap-null: overlapping cases; mold not checked

7+/tests/golden/types-literal-constructor-nouns/source.jibb:8:3: first union case

8+ [~ value=@t]

9+ ^

10+/tests/golden/types-literal-constructor-nouns/source.jibb:9:3: overlapping case

11+ [%$ value=@t]

12+ ^

13++$ overlap-flag: overlapping cases; mold not checked

14+/tests/golden/types-literal-constructor-nouns/source.jibb:11:3: first union case

15+ [%.y value=@t]

16+ ^

17+/tests/golden/types-literal-constructor-nouns/source.jibb:12:3: overlapping case

18+ [%$ value=@t]

19+ ^

20++$ overlap-three: overlapping cases; mold not checked

21+/tests/golden/types-literal-constructor-nouns/source.jibb:14:3: first union case

22+ [~ value=@t]

23+ ^

24+/tests/golden/types-literal-constructor-nouns/source.jibb:15:3: overlapping case

25+ [%.y value=@t]

26+ ^

27+++ null-ctor: $-(@t [~ value=@t])

28+++ flag-ctor: $-(@t [%.y value=@t])

29+++ dollar-ctor: $-(@t [%$ value=@t])

30+++ unit-like-ctor: $-(@t pair-null)

31+++ wrong-payload: cast mold and expression type do not unify

32+/tests/golden/types-literal-constructor-nouns/source.jibb:21:21: cast mold has type $-(@p [~ value=@t])

33+++ wrong-payload ^- $-(@p null-head) |=%$

34+ ^

35+/tests/golden/types-literal-constructor-nouns/source.jibb:21:38: expression

36+++ wrong-payload ^- $-(@p null-head) |=%$

37+ ^

38+++ missing-tag: cast mold and expression type do not unify

39+/tests/golden/types-literal-constructor-nouns/source.jibb:22:19: cast mold has type $-(@t [~ value=@t])

40+++ missing-tag ^- $-(@t null-head) |=%missing

41+ ^

42+/tests/golden/types-literal-constructor-nouns/source.jibb:22:36: expression

43+++ missing-tag ^- $-(@t null-head) |=%missing

44+ ^

45+++ pending: tag needs context in partial inference

tests/golden/types-loobean-singleton-source/about.txtnew file+2

@@ -0,0 +1,2 @@

1+source: literal equality uses runtime nouns while typed aura constraints remain directional.

2+tests: Loobean singleton molds and equal-noun terms, wrong singleton, ordinary loobean widening to ? and @, invalid widening to typed auras, and constructor matching a loobean-headed case. This is a partial inference report.

tests/golden/types-loobean-singleton-source/source.jibbnew file+22

@@ -0,0 +1,22 @@

1++$ yes %.y

2++$ no %.n

3++$ flag-headed [%.y value=@t]

4+++ yes-flag ^- yes %.y

5+++ yes-term ^- yes %$

6+++ wrong-flag ^- yes %.n

7+++ normal-flag ^- ? %.y

8+++ normal-any ^- @ %.y

9+++ wrong-tas ^- @tas %.y

10+++ wrong-ta ^- @ta %.y

11+++ wrong-ud ^- @ud %.y

12+++ named-value ^- yes %.y

13+++ named-as-flag ^- ? named-value

14+++ named-as-any ^- @ named-value

15+++ named-as-tas ^- @tas named-value

16+++ named-as-ta ^- @ta named-value

17+++ named-as-ud ^- @ud named-value

18+++ loobean-constructor ^- $-(@t flag-headed) |=%$

19+++ literal-f ^- @f %.y

20+++ flag-f |= b=? ^- @f b

21+++ named-f ^- @f named-value

22+++ explicit-tag ^- @tas (^- %$ %.y)

tests/golden/types-loobean-singleton-source/tokens.txtnew file+143

@@ -0,0 +1,143 @@

1+1:1 glyph +$

2+1:4 name yes

3+1:8 lit %.y

4+2:1 NEWLINE

5+2:1 glyph +$

6+2:4 name no

7+2:7 lit %.n

8+3:1 NEWLINE

9+3:1 glyph +$

10+3:4 name flag-headed

11+3:16 glyph [

12+3:17 tight lit %.y

13+3:21 name value

14+3:26 tight glyph =

15+3:27 tight aura @t

16+3:29 tight glyph ]

17+4:1 NEWLINE

18+4:1 glyph ++

19+4:4 name yes-flag

20+4:13 glyph ^-

21+4:16 name yes

22+4:20 lit %.y

23+5:1 NEWLINE

24+5:1 glyph ++

25+5:4 name yes-term

26+5:13 glyph ^-

27+5:16 name yes

28+5:20 lit %$

29+6:1 NEWLINE

30+6:1 glyph ++

31+6:4 name wrong-flag

32+6:15 glyph ^-

33+6:18 name yes

34+6:22 lit %.n

35+7:1 NEWLINE

36+7:1 glyph ++

37+7:4 name normal-flag

38+7:16 glyph ^-

39+7:19 glyph ?

40+7:21 lit %.y

41+8:1 NEWLINE

42+8:1 glyph ++

43+8:4 name normal-any

44+8:15 glyph ^-

45+8:18 aura @

46+8:20 lit %.y

47+9:1 NEWLINE

48+9:1 glyph ++

49+9:4 name wrong-tas

50+9:14 glyph ^-

51+9:17 aura @tas

52+9:22 lit %.y

53+10:1 NEWLINE

54+10:1 glyph ++

55+10:4 name wrong-ta

56+10:13 glyph ^-

57+10:16 aura @ta

58+10:20 lit %.y

59+11:1 NEWLINE

60+11:1 glyph ++

61+11:4 name wrong-ud

62+11:13 glyph ^-

63+11:16 aura @ud

64+11:20 lit %.y

65+12:1 NEWLINE

66+12:1 glyph ++

67+12:4 name named-value

68+12:16 glyph ^-

69+12:19 name yes

70+12:23 lit %.y

71+13:1 NEWLINE

72+13:1 glyph ++

73+13:4 name named-as-flag

74+13:18 glyph ^-

75+13:21 glyph ?

76+13:23 name named-value

77+14:1 NEWLINE

78+14:1 glyph ++

79+14:4 name named-as-any

80+14:17 glyph ^-

81+14:20 aura @

82+14:22 name named-value

83+15:1 NEWLINE

84+15:1 glyph ++

85+15:4 name named-as-tas

86+15:17 glyph ^-

87+15:20 aura @tas

88+15:25 name named-value

89+16:1 NEWLINE

90+16:1 glyph ++

91+16:4 name named-as-ta

92+16:16 glyph ^-

93+16:19 aura @ta

94+16:23 name named-value

95+17:1 NEWLINE

96+17:1 glyph ++

97+17:4 name named-as-ud

98+17:16 glyph ^-

99+17:19 aura @ud

100+17:23 name named-value

101+18:1 NEWLINE

102+18:1 glyph ++

103+18:4 name loobean-constructor

104+18:24 glyph ^-

105+18:27 glyph $-(

106+18:30 tight aura @t

107+18:33 name flag-headed

108+18:44 tight glyph )

109+18:46 glyph |=

110+18:48 tight lit %$

111+19:1 NEWLINE

112+19:1 glyph ++

113+19:4 name literal-f

114+19:14 glyph ^-

115+19:17 aura @f

116+19:20 lit %.y

117+20:1 NEWLINE

118+20:1 glyph ++

119+20:4 name flag-f

120+20:11 glyph |=

121+20:14 name b

122+20:15 tight glyph =

123+20:16 tight glyph ?

124+20:18 glyph ^-

125+20:21 aura @f

126+20:24 name b

127+21:1 NEWLINE

128+21:1 glyph ++

129+21:4 name named-f

130+21:12 glyph ^-

131+21:15 aura @f

132+21:18 name named-value

133+22:1 NEWLINE

134+22:1 glyph ++

135+22:4 name explicit-tag

136+22:17 glyph ^-

137+22:20 aura @tas

138+22:25 glyph (

139+22:26 tight glyph ^-

140+22:29 lit %$

141+22:32 lit %.y

142+22:35 tight glyph )

143+22:36 NEWLINE

tests/golden/types-loobean-singleton-source/tree.txtnew file+52

@@ -0,0 +1,52 @@

1+(module

2+ (mold 1:1 yes (const 1:8 %.y))

3+ (mold 2:1 no (const 2:7 %.n))

4+ (mold 3:1 flag-headed

5+ (cell 3:16

6+ (const 3:17 %.y)

7+ (face 3:21 value (aura 3:27 @t))))

8+ (value 4:1 yes-flag

9+ (cast 4:13 (ref 4:16 yes) (lit 4:20 %.y)))

10+ (value 5:1 yes-term

11+ (cast 5:13 (ref 5:16 yes) (lit 5:20 %$)))

12+ (value 6:1 wrong-flag

13+ (cast 6:15 (ref 6:18 yes) (lit 6:22 %.n)))

14+ (value 7:1 normal-flag

15+ (cast 7:16 (flag 7:19) (lit 7:21 %.y)))

16+ (value 8:1 normal-any

17+ (cast 8:15 (aura 8:18 @) (lit 8:20 %.y)))

18+ (value 9:1 wrong-tas

19+ (cast 9:14 (aura 9:17 @tas) (lit 9:22 %.y)))

20+ (value 10:1 wrong-ta

21+ (cast 10:13 (aura 10:16 @ta) (lit 10:20 %.y)))

22+ (value 11:1 wrong-ud

23+ (cast 11:13 (aura 11:16 @ud) (lit 11:20 %.y)))

24+ (value 12:1 named-value

25+ (cast 12:16 (ref 12:19 yes) (lit 12:23 %.y)))

26+ (value 13:1 named-as-flag

27+ (cast 13:18 (flag 13:21) (wing 13:23 named-value)))

28+ (value 14:1 named-as-any

29+ (cast 14:17 (aura 14:20 @) (wing 14:22 named-value)))

30+ (value 15:1 named-as-tas

31+ (cast 15:17 (aura 15:20 @tas) (wing 15:25 named-value)))

32+ (value 16:1 named-as-ta

33+ (cast 16:16 (aura 16:19 @ta) (wing 16:23 named-value)))

34+ (value 17:1 named-as-ud

35+ (cast 17:16 (aura 17:19 @ud) (wing 17:23 named-value)))

36+ (value 18:1 loobean-constructor

37+ (cast 18:24

38+ (fn 18:27 (aura 18:30 @t) (ref 18:33 flag-headed))

39+ (ctor 18:46 %$)))

40+ (value 19:1 literal-f

41+ (cast 19:14 (aura 19:17 @f) (lit 19:20 %.y)))

42+ (value 20:1 flag-f

43+ (gate 20:11

44+ (face 20:14 b (flag 20:16))

45+ (cast 20:18 (aura 20:21 @f) (wing 20:24 b))))

46+ (value 21:1 named-f

47+ (cast 21:12 (aura 21:15 @f) (wing 21:18 named-value)))

48+ (value 22:1 explicit-tag

49+ (cast 22:17

50+ (aura 22:20 @tas)

51+ (group 22:25

52+ (cast 22:26 (const 22:29 %$) (lit 22:32 %.y))))))

tests/golden/types-loobean-singleton-source/types.txtnew file+65

@@ -0,0 +1,65 @@

1+partial inference; module not checked

2++$ yes: not checked

3++$ no: not checked

4++$ flag-headed: not checked

5+++ yes-flag: %.y

6+++ yes-term: %.y

7+++ wrong-flag: cast mold and expression type do not unify

8+/tests/golden/types-loobean-singleton-source/source.jibb:6:18: cast mold has type %.y

9+++ wrong-flag ^- yes %.n

10+ ^

11+/tests/golden/types-loobean-singleton-source/source.jibb:6:22: expression has type %.n

12+++ wrong-flag ^- yes %.n

13+ ^

14+++ normal-flag: ?

15+++ normal-any: @

16+++ wrong-tas: cast mold and expression type do not unify

17+/tests/golden/types-loobean-singleton-source/source.jibb:9:17: cast mold has type @tas

18+++ wrong-tas ^- @tas %.y

19+ ^

20+/tests/golden/types-loobean-singleton-source/source.jibb:9:22: expression has type ?

21+++ wrong-tas ^- @tas %.y

22+ ^

23+++ wrong-ta: cast mold and expression type do not unify

24+/tests/golden/types-loobean-singleton-source/source.jibb:10:16: cast mold has type @ta

25+++ wrong-ta ^- @ta %.y

26+ ^

27+/tests/golden/types-loobean-singleton-source/source.jibb:10:20: expression has type ?

28+++ wrong-ta ^- @ta %.y

29+ ^

30+++ wrong-ud: cast mold and expression type do not unify

31+/tests/golden/types-loobean-singleton-source/source.jibb:11:16: cast mold has type @ud

32+++ wrong-ud ^- @ud %.y

33+ ^

34+/tests/golden/types-loobean-singleton-source/source.jibb:11:20: expression has type ?

35+++ wrong-ud ^- @ud %.y

36+ ^

37+++ named-value: %.y

38+++ named-as-flag: ?

39+++ named-as-any: @

40+++ named-as-tas: cast mold and expression type do not unify

41+/tests/golden/types-loobean-singleton-source/source.jibb:15:20: cast mold has type @tas

42+++ named-as-tas ^- @tas named-value

43+ ^

44+/tests/golden/types-loobean-singleton-source/source.jibb:15:25: expression has type %.y

45+++ named-as-tas ^- @tas named-value

46+ ^

47+++ named-as-ta: cast mold and expression type do not unify

48+/tests/golden/types-loobean-singleton-source/source.jibb:16:19: cast mold has type @ta

49+++ named-as-ta ^- @ta named-value

50+ ^

51+/tests/golden/types-loobean-singleton-source/source.jibb:16:23: expression has type %.y

52+++ named-as-ta ^- @ta named-value

53+ ^

54+++ named-as-ud: cast mold and expression type do not unify

55+/tests/golden/types-loobean-singleton-source/source.jibb:17:19: cast mold has type @ud

56+++ named-as-ud ^- @ud named-value

57+ ^

58+/tests/golden/types-loobean-singleton-source/source.jibb:17:23: expression has type %.y

59+++ named-as-ud ^- @ud named-value

60+ ^

61+++ loobean-constructor: $-(@t [%.y value=@t])

62+++ literal-f: cast constraint is not supported by partial inference

63+++ flag-f: cast constraint is not supported by partial inference

64+++ named-f: cast constraint is not supported by partial inference

65+++ explicit-tag: @tas

tests/golden/types-loobean-union-context/about.txtnew file+2

@@ -0,0 +1,2 @@

1+source: literal singleton cases compare by runtime noun.

2+tests: Null, term-zero and loobean singleton contexts across direct unions; unequal values, overlapping singleton cases, unknown targets and pending constraints.

tests/golden/types-loobean-union-context/source.jibbnew file+28

@@ -0,0 +1,28 @@

1++$ maybe

2+ ~

3+ [~ value=@t]

4++$ term-zero

5+ %$

6+ [%some value=@t]

7++$ flag-zero

8+ %.y

9+ [%some value=@t]

10++$ repeated

11+ ~

12+ %.y

13++$ number-one

14+ %.n

15+ [%some value=@t]

16+++ as-null ^- maybe %.y

17+++ bad-null ^- maybe %.n

18+++ null-as-term ^- term-zero ~

19+++ flag-as-term ^- term-zero %.y

20+++ term-as-flag ^- flag-zero %$

21+++ null-as-flag ^- flag-zero ~

22+++ yes-as-flag ^- flag-zero %.y

23+++ no-as-one ^- number-one %.n

24+++ no-as-zero ^- flag-zero %.n

25+++ pending

26+ ~& %unrelated

27+ ^- maybe %.y

28+++ unknown |= x=A ^- A %.y

tests/golden/types-loobean-union-context/tokens.txtnew file+136

@@ -0,0 +1,136 @@

1+1:1 glyph +$

2+1:4 name maybe

3+2:3 INDENT

4+2:3 lit ~

5+3:3 NEWLINE

6+3:3 glyph [

7+3:4 tight lit ~

8+3:6 name value

9+3:11 tight glyph =

10+3:12 tight aura @t

11+3:14 tight glyph ]

12+4:1 DEDENT

13+4:1 NEWLINE

14+4:1 glyph +$

15+4:4 name term-zero

16+5:3 INDENT

17+5:3 lit %$

18+6:3 NEWLINE

19+6:3 glyph [

20+6:4 tight lit %some

21+6:10 name value

22+6:15 tight glyph =

23+6:16 tight aura @t

24+6:18 tight glyph ]

25+7:1 DEDENT

26+7:1 NEWLINE

27+7:1 glyph +$

28+7:4 name flag-zero

29+8:3 INDENT

30+8:3 lit %.y

31+9:3 NEWLINE

32+9:3 glyph [

33+9:4 tight lit %some

34+9:10 name value

35+9:15 tight glyph =

36+9:16 tight aura @t

37+9:18 tight glyph ]

38+10:1 DEDENT

39+10:1 NEWLINE

40+10:1 glyph +$

41+10:4 name repeated

42+11:3 INDENT

43+11:3 lit ~

44+12:3 NEWLINE

45+12:3 lit %.y

46+13:1 DEDENT

47+13:1 NEWLINE

48+13:1 glyph +$

49+13:4 name number-one

50+14:3 INDENT

51+14:3 lit %.n

52+15:3 NEWLINE

53+15:3 glyph [

54+15:4 tight lit %some

55+15:10 name value

56+15:15 tight glyph =

57+15:16 tight aura @t

58+15:18 tight glyph ]

59+16:1 DEDENT

60+16:1 NEWLINE

61+16:1 glyph ++

62+16:4 name as-null

63+16:12 glyph ^-

64+16:15 name maybe

65+16:21 lit %.y

66+17:1 NEWLINE

67+17:1 glyph ++

68+17:4 name bad-null

69+17:13 glyph ^-

70+17:16 name maybe

71+17:22 lit %.n

72+18:1 NEWLINE

73+18:1 glyph ++

74+18:4 name null-as-term

75+18:17 glyph ^-

76+18:20 name term-zero

77+18:30 lit ~

78+19:1 NEWLINE

79+19:1 glyph ++

80+19:4 name flag-as-term

81+19:17 glyph ^-

82+19:20 name term-zero

83+19:30 lit %.y

84+20:1 NEWLINE

85+20:1 glyph ++

86+20:4 name term-as-flag

87+20:17 glyph ^-

88+20:20 name flag-zero

89+20:30 lit %$

90+21:1 NEWLINE

91+21:1 glyph ++

92+21:4 name null-as-flag

93+21:17 glyph ^-

94+21:20 name flag-zero

95+21:30 lit ~

96+22:1 NEWLINE

97+22:1 glyph ++

98+22:4 name yes-as-flag

99+22:16 glyph ^-

100+22:19 name flag-zero

101+22:29 lit %.y

102+23:1 NEWLINE

103+23:1 glyph ++

104+23:4 name no-as-one

105+23:14 glyph ^-

106+23:17 name number-one

107+23:28 lit %.n

108+24:1 NEWLINE

109+24:1 glyph ++

110+24:4 name no-as-zero

111+24:15 glyph ^-

112+24:18 name flag-zero

113+24:28 lit %.n

114+25:1 NEWLINE

115+25:1 glyph ++

116+25:4 name pending

117+26:3 INDENT

118+26:3 glyph ~&

119+26:6 lit %unrelated

120+27:5 INDENT

121+27:5 glyph ^-

122+27:8 name maybe

123+27:14 lit %.y

124+28:1 DEDENT

125+28:1 DEDENT

126+28:1 NEWLINE

127+28:1 glyph ++

128+28:4 name unknown

129+28:12 glyph |=

130+28:15 name x

131+28:16 tight glyph =

132+28:17 tight tvar A

133+28:19 glyph ^-

134+28:22 tvar A

135+28:24 lit %.y

136+28:27 NEWLINE

tests/golden/types-loobean-union-context/tree.txtnew file+55

@@ -0,0 +1,55 @@

1+(module

2+ (mold 1:1 maybe

3+ (union 2:3

4+ (const 2:3 ~)

5+ (cell 3:3

6+ (const 3:4 ~)

7+ (face 3:6 value (aura 3:12 @t)))))

8+ (mold 4:1 term-zero

9+ (union 5:3

10+ (const 5:3 %$)

11+ (cell 6:3

12+ (const 6:4 %some)

13+ (face 6:10 value (aura 6:16 @t)))))

14+ (mold 7:1 flag-zero

15+ (union 8:3

16+ (const 8:3 %.y)

17+ (cell 9:3

18+ (const 9:4 %some)

19+ (face 9:10 value (aura 9:16 @t)))))

20+ (mold 10:1 repeated

21+ (union 11:3 (const 11:3 ~) (const 12:3 %.y)))

22+ (mold 13:1 number-one

23+ (union 14:3

24+ (const 14:3 %.n)

25+ (cell 15:3

26+ (const 15:4 %some)

27+ (face 15:10 value (aura 15:16 @t)))))

28+ (value 16:1 as-null

29+ (cast 16:12 (ref 16:15 maybe) (lit 16:21 %.y)))

30+ (value 17:1 bad-null

31+ (cast 17:13 (ref 17:16 maybe) (lit 17:22 %.n)))

32+ (value 18:1 null-as-term

33+ (cast 18:17 (ref 18:20 term-zero) (lit 18:30 ~)))

34+ (value 19:1 flag-as-term

35+ (cast 19:17 (ref 19:20 term-zero) (lit 19:30 %.y)))

36+ (value 20:1 term-as-flag

37+ (cast 20:17 (ref 20:20 flag-zero) (lit 20:30 %$)))

38+ (value 21:1 null-as-flag

39+ (cast 21:17 (ref 21:20 flag-zero) (lit 21:30 ~)))

40+ (value 22:1 yes-as-flag

41+ (cast 22:16 (ref 22:19 flag-zero) (lit 22:29 %.y)))

42+ (value 23:1 no-as-one

43+ (cast 23:14 (ref 23:17 number-one) (lit 23:28 %.n)))

44+ (value 24:1 no-as-zero

45+ (cast 24:15 (ref 24:18 flag-zero) (lit 24:28 %.n)))

46+ (value 25:1 pending

47+ (body 26:3

48+ (trace 26:3

49+ (lit 26:6 %unrelated)

50+ (body 27:5

51+ (cast 27:5 (ref 27:8 maybe) (lit 27:14 %.y))))))

52+ (value 28:1 unknown

53+ (gate 28:12

54+ (face 28:15 x (tvar 28:17 A))

55+ (cast 28:19 (tvar 28:22 A) (lit 28:24 %.y)))))

tests/golden/types-loobean-union-context/types.txtnew file+35

@@ -0,0 +1,35 @@

1+partial inference; module not checked

2++$ maybe: cases proven disjoint; mold not checked

3++$ term-zero: cases proven disjoint; mold not checked

4++$ flag-zero: cases proven disjoint; mold not checked

5++$ repeated: overlapping cases; mold not checked

6+/tests/golden/types-loobean-union-context/source.jibb:11:3: first union case

7+ ~

8+ ^

9+/tests/golden/types-loobean-union-context/source.jibb:12:3: overlapping case

10+ %.y

11+ ^

12++$ number-one: cases proven disjoint; mold not checked

13+++ as-null: maybe

14+++ bad-null: cast mold and expression type do not unify

15+/tests/golden/types-loobean-union-context/source.jibb:17:16: cast mold

16+++ bad-null ^- maybe %.n

17+ ^

18+/tests/golden/types-loobean-union-context/source.jibb:17:22: expression has type ?

19+++ bad-null ^- maybe %.n

20+ ^

21+++ null-as-term: term-zero

22+++ flag-as-term: term-zero

23+++ term-as-flag: flag-zero

24+++ null-as-flag: flag-zero

25+++ yes-as-flag: flag-zero

26+++ no-as-one: number-one

27+++ no-as-zero: cast mold and expression type do not unify

28+/tests/golden/types-loobean-union-context/source.jibb:24:18: cast mold

29+++ no-as-zero ^- flag-zero %.n

30+ ^

31+/tests/golden/types-loobean-union-context/source.jibb:24:28: expression has type ?

32+++ no-as-zero ^- flag-zero %.n

33+ ^

34+++ pending: tag needs context in partial inference

35+++ unknown: explicit capital constraints are not supported by partial inference

tests/golden/types-nested-noun-context/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Tag resolution: "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 `~`.

2+tests: Null, loobean-zero and term-zero input/head combinations with nested generic payloads; missing, mismatched, ambiguous and unknown contexts remain conservative.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-nested-noun-context/source.jibbnew file+35

@@ -0,0 +1,35 @@

1++$ msg

2+ %ready

3+ %idle

4++$ inner |$ [A]

5+ [%one item=A]

6+ [%two item=A]

7++$ null-out |$ [A]

8+ [~ item=(inner A)]

9+ [%other value=@ud]

10++$ flag-out |$ [A]

11+ [%.y item=(inner A)]

12+ [%other value=@ud]

13++$ term-out |$ [A]

14+ [%$ item=(inner A)]

15+ [%other value=@ud]

16++$ competitors |$ [A]

17+ [~ item=(inner A)]

18+ [%.y value=@p]

19+++ inner |= x=A ^- (inner A) [%one x]

20+++ null-null ^- (null-out msg) [~ (inner %ready)]

21+++ flag-null ^- (null-out msg) [%.y (inner %ready)]

22+++ term-null ^- (null-out msg) [%$ (inner %ready)]

23+++ null-flag ^- (flag-out msg) [~ (inner %ready)]

24+++ flag-flag ^- (flag-out msg) [%.y (inner %ready)]

25+++ term-flag ^- (flag-out msg) [%$ (inner %ready)]

26+++ null-term ^- (term-out msg) [~ (inner %ready)]

27+++ flag-term ^- (term-out msg) [%.y (inner %ready)]

28+++ term-term ^- (term-out msg) [%$ (inner %ready)]

29+++ wrong-inner ^- (null-out msg) [%$ (inner %missing)]

30+++ wrong-payload ^- (flag-out @t) [~ (inner ~zod)]

31+++ pending

32+ ~& %orphan

33+ ^- (term-out msg) [%.y (inner %ready)]

34+++ unknown-target |= x=A ^- A [~ (inner %ready)]

35+++ ambiguous ^- (competitors msg) [~ (inner %ready)]

tests/golden/types-nested-noun-context/tokens.txtnew file+363

@@ -0,0 +1,363 @@

1+1:1 glyph +$

2+1:4 name msg

3+2:3 INDENT

4+2:3 lit %ready

5+3:3 NEWLINE

6+3:3 lit %idle

7+4:1 DEDENT

8+4:1 NEWLINE

9+4:1 glyph +$

10+4:4 name inner

11+4:10 glyph |$

12+4:13 glyph [

13+4:14 tight tvar A

14+4:15 tight glyph ]

15+5:3 INDENT

16+5:3 glyph [

17+5:4 tight lit %one

18+5:9 name item

19+5:13 tight glyph =

20+5:14 tight tvar A

21+5:15 tight glyph ]

22+6:3 NEWLINE

23+6:3 glyph [

24+6:4 tight lit %two

25+6:9 name item

26+6:13 tight glyph =

27+6:14 tight tvar A

28+6:15 tight glyph ]

29+7:1 DEDENT

30+7:1 NEWLINE

31+7:1 glyph +$

32+7:4 name null-out

33+7:13 glyph |$

34+7:16 glyph [

35+7:17 tight tvar A

36+7:18 tight glyph ]

37+8:3 INDENT

38+8:3 glyph [

39+8:4 tight lit ~

40+8:6 name item

41+8:10 tight glyph =

42+8:11 tight glyph (

43+8:12 tight name inner

44+8:18 tvar A

45+8:19 tight glyph )

46+8:20 tight glyph ]

47+9:3 NEWLINE

48+9:3 glyph [

49+9:4 tight lit %other

50+9:11 name value

51+9:16 tight glyph =

52+9:17 tight aura @ud

53+9:20 tight glyph ]

54+10:1 DEDENT

55+10:1 NEWLINE

56+10:1 glyph +$

57+10:4 name flag-out

58+10:13 glyph |$

59+10:16 glyph [

60+10:17 tight tvar A

61+10:18 tight glyph ]

62+11:3 INDENT

63+11:3 glyph [

64+11:4 tight lit %.y

65+11:8 name item

66+11:12 tight glyph =

67+11:13 tight glyph (

68+11:14 tight name inner

69+11:20 tvar A

70+11:21 tight glyph )

71+11:22 tight glyph ]

72+12:3 NEWLINE

73+12:3 glyph [

74+12:4 tight lit %other

75+12:11 name value

76+12:16 tight glyph =

77+12:17 tight aura @ud

78+12:20 tight glyph ]

79+13:1 DEDENT

80+13:1 NEWLINE

81+13:1 glyph +$

82+13:4 name term-out

83+13:13 glyph |$

84+13:16 glyph [

85+13:17 tight tvar A

86+13:18 tight glyph ]

87+14:3 INDENT

88+14:3 glyph [

89+14:4 tight lit %$

90+14:7 name item

91+14:11 tight glyph =

92+14:12 tight glyph (

93+14:13 tight name inner

94+14:19 tvar A

95+14:20 tight glyph )

96+14:21 tight glyph ]

97+15:3 NEWLINE

98+15:3 glyph [

99+15:4 tight lit %other

100+15:11 name value

101+15:16 tight glyph =

102+15:17 tight aura @ud

103+15:20 tight glyph ]

104+16:1 DEDENT

105+16:1 NEWLINE

106+16:1 glyph +$

107+16:4 name competitors

108+16:16 glyph |$

109+16:19 glyph [

110+16:20 tight tvar A

111+16:21 tight glyph ]

112+17:3 INDENT

113+17:3 glyph [

114+17:4 tight lit ~

115+17:6 name item

116+17:10 tight glyph =

117+17:11 tight glyph (

118+17:12 tight name inner

119+17:18 tvar A

120+17:19 tight glyph )

121+17:20 tight glyph ]

122+18:3 NEWLINE

123+18:3 glyph [

124+18:4 tight lit %.y

125+18:8 name value

126+18:13 tight glyph =

127+18:14 tight aura @p

128+18:16 tight glyph ]

129+19:1 DEDENT

130+19:1 NEWLINE

131+19:1 glyph ++

132+19:4 name inner

133+19:10 glyph |=

134+19:13 name x

135+19:14 tight glyph =

136+19:15 tight tvar A

137+19:17 glyph ^-

138+19:20 glyph (

139+19:21 tight name inner

140+19:27 tvar A

141+19:28 tight glyph )

142+19:30 glyph [

143+19:31 tight lit %one

144+19:36 name x

145+19:37 tight glyph ]

146+20:1 NEWLINE

147+20:1 glyph ++

148+20:4 name null-null

149+20:14 glyph ^-

150+20:17 glyph (

151+20:18 tight name null-out

152+20:27 name msg

153+20:30 tight glyph )

154+20:32 glyph [

155+20:33 tight lit ~

156+20:35 glyph (

157+20:36 tight name inner

158+20:42 lit %ready

159+20:48 tight glyph )

160+20:49 tight glyph ]

161+21:1 NEWLINE

162+21:1 glyph ++

163+21:4 name flag-null

164+21:14 glyph ^-

165+21:17 glyph (

166+21:18 tight name null-out

167+21:27 name msg

168+21:30 tight glyph )

169+21:32 glyph [

170+21:33 tight lit %.y

171+21:37 glyph (

172+21:38 tight name inner

173+21:44 lit %ready

174+21:50 tight glyph )

175+21:51 tight glyph ]

176+22:1 NEWLINE

177+22:1 glyph ++

178+22:4 name term-null

179+22:14 glyph ^-

180+22:17 glyph (

181+22:18 tight name null-out

182+22:27 name msg

183+22:30 tight glyph )

184+22:32 glyph [

185+22:33 tight lit %$

186+22:36 glyph (

187+22:37 tight name inner

188+22:43 lit %ready

189+22:49 tight glyph )

190+22:50 tight glyph ]

191+23:1 NEWLINE

192+23:1 glyph ++

193+23:4 name null-flag

194+23:14 glyph ^-

195+23:17 glyph (

196+23:18 tight name flag-out

197+23:27 name msg

198+23:30 tight glyph )

199+23:32 glyph [

200+23:33 tight lit ~

201+23:35 glyph (

202+23:36 tight name inner

203+23:42 lit %ready

204+23:48 tight glyph )

205+23:49 tight glyph ]

206+24:1 NEWLINE

207+24:1 glyph ++

208+24:4 name flag-flag

209+24:14 glyph ^-

210+24:17 glyph (

211+24:18 tight name flag-out

212+24:27 name msg

213+24:30 tight glyph )

214+24:32 glyph [

215+24:33 tight lit %.y

216+24:37 glyph (

217+24:38 tight name inner

218+24:44 lit %ready

219+24:50 tight glyph )

220+24:51 tight glyph ]

221+25:1 NEWLINE

222+25:1 glyph ++

223+25:4 name term-flag

224+25:14 glyph ^-

225+25:17 glyph (

226+25:18 tight name flag-out

227+25:27 name msg

228+25:30 tight glyph )

229+25:32 glyph [

230+25:33 tight lit %$

231+25:36 glyph (

232+25:37 tight name inner

233+25:43 lit %ready

234+25:49 tight glyph )

235+25:50 tight glyph ]

236+26:1 NEWLINE

237+26:1 glyph ++

238+26:4 name null-term

239+26:14 glyph ^-

240+26:17 glyph (

241+26:18 tight name term-out

242+26:27 name msg

243+26:30 tight glyph )

244+26:32 glyph [

245+26:33 tight lit ~

246+26:35 glyph (

247+26:36 tight name inner

248+26:42 lit %ready

249+26:48 tight glyph )

250+26:49 tight glyph ]

251+27:1 NEWLINE

252+27:1 glyph ++

253+27:4 name flag-term

254+27:14 glyph ^-

255+27:17 glyph (

256+27:18 tight name term-out

257+27:27 name msg

258+27:30 tight glyph )

259+27:32 glyph [

260+27:33 tight lit %.y

261+27:37 glyph (

262+27:38 tight name inner

263+27:44 lit %ready

264+27:50 tight glyph )

265+27:51 tight glyph ]

266+28:1 NEWLINE

267+28:1 glyph ++

268+28:4 name term-term

269+28:14 glyph ^-

270+28:17 glyph (

271+28:18 tight name term-out

272+28:27 name msg

273+28:30 tight glyph )

274+28:32 glyph [

275+28:33 tight lit %$

276+28:36 glyph (

277+28:37 tight name inner

278+28:43 lit %ready

279+28:49 tight glyph )

280+28:50 tight glyph ]

281+29:1 NEWLINE

282+29:1 glyph ++

283+29:4 name wrong-inner

284+29:16 glyph ^-

285+29:19 glyph (

286+29:20 tight name null-out

287+29:29 name msg

288+29:32 tight glyph )

289+29:34 glyph [

290+29:35 tight lit %$

291+29:38 glyph (

292+29:39 tight name inner

293+29:45 lit %missing

294+29:53 tight glyph )

295+29:54 tight glyph ]

296+30:1 NEWLINE

297+30:1 glyph ++

298+30:4 name wrong-payload

299+30:18 glyph ^-

300+30:21 glyph (

301+30:22 tight name flag-out

302+30:31 aura @t

303+30:33 tight glyph )

304+30:35 glyph [

305+30:36 tight lit ~

306+30:38 glyph (

307+30:39 tight name inner

308+30:45 lit ~zod

309+30:49 tight glyph )

310+30:50 tight glyph ]

311+31:1 NEWLINE

312+31:1 glyph ++

313+31:4 name pending

314+32:3 INDENT

315+32:3 glyph ~&

316+32:6 lit %orphan

317+33:5 INDENT

318+33:5 glyph ^-

319+33:8 glyph (

320+33:9 tight name term-out

321+33:18 name msg

322+33:21 tight glyph )

323+33:23 glyph [

324+33:24 tight lit %.y

325+33:28 glyph (

326+33:29 tight name inner

327+33:35 lit %ready

328+33:41 tight glyph )

329+33:42 tight glyph ]

330+34:1 DEDENT

331+34:1 DEDENT

332+34:1 NEWLINE

333+34:1 glyph ++

334+34:4 name unknown-target

335+34:19 glyph |=

336+34:22 name x

337+34:23 tight glyph =

338+34:24 tight tvar A

339+34:26 glyph ^-

340+34:29 tvar A

341+34:31 glyph [

342+34:32 tight lit ~

343+34:34 glyph (

344+34:35 tight name inner

345+34:41 lit %ready

346+34:47 tight glyph )

347+34:48 tight glyph ]

348+35:1 NEWLINE

349+35:1 glyph ++

350+35:4 name ambiguous

351+35:14 glyph ^-

352+35:17 glyph (

353+35:18 tight name competitors

354+35:30 name msg

355+35:33 tight glyph )

356+35:35 glyph [

357+35:36 tight lit ~

358+35:38 glyph (

359+35:39 tight name inner

360+35:45 lit %ready

361+35:51 tight glyph )

362+35:52 tight glyph ]

363+35:53 NEWLINE

tests/golden/types-nested-noun-context/tree.txtnew file+162

@@ -0,0 +1,162 @@

1+(module

2+ (mold 1:1 msg

3+ (union 2:3 (const 2:3 %ready) (const 3:3 %idle)))

4+ (mold 4:1 inner

5+ (generic 4:10 A

6+ (union 5:3

7+ (cell 5:3

8+ (const 5:4 %one)

9+ (face 5:9 item (tvar 5:14 A)))

10+ (cell 6:3

11+ (const 6:4 %two)

12+ (face 6:9 item (tvar 6:14 A))))))

13+ (mold 7:1 null-out

14+ (generic 7:13 A

15+ (union 8:3

16+ (cell 8:3

17+ (const 8:4 ~)

18+ (face 8:6 item

19+ (apply 8:11 inner (tvar 8:18 A))))

20+ (cell 9:3

21+ (const 9:4 %other)

22+ (face 9:11 value (aura 9:17 @ud))))))

23+ (mold 10:1 flag-out

24+ (generic 10:13 A

25+ (union 11:3

26+ (cell 11:3

27+ (const 11:4 %.y)

28+ (face 11:8 item

29+ (apply 11:13 inner (tvar 11:20 A))))

30+ (cell 12:3

31+ (const 12:4 %other)

32+ (face 12:11 value (aura 12:17 @ud))))))

33+ (mold 13:1 term-out

34+ (generic 13:13 A

35+ (union 14:3

36+ (cell 14:3

37+ (const 14:4 %$)

38+ (face 14:7 item

39+ (apply 14:12 inner (tvar 14:19 A))))

40+ (cell 15:3

41+ (const 15:4 %other)

42+ (face 15:11 value (aura 15:17 @ud))))))

43+ (mold 16:1 competitors

44+ (generic 16:16 A

45+ (union 17:3

46+ (cell 17:3

47+ (const 17:4 ~)

48+ (face 17:6 item

49+ (apply 17:11 inner (tvar 17:18 A))))

50+ (cell 18:3

51+ (const 18:4 %.y)

52+ (face 18:8 value (aura 18:14 @p))))))

53+ (value 19:1 inner

54+ (gate 19:10

55+ (face 19:13 x (tvar 19:15 A))

56+ (cast 19:17

57+ (apply 19:20 inner (tvar 19:27 A))

58+ (tuple 19:30 (lit 19:31 %one) (wing 19:36 x)))))

59+ (value 20:1 null-null

60+ (cast 20:14

61+ (apply 20:17 null-out (ref 20:27 msg))

62+ (tuple 20:32

63+ (lit 20:33 ~)

64+ (group 20:35

65+ (call 20:36 (wing 20:36 inner) (lit 20:42 %ready))))))

66+ (value 21:1 flag-null

67+ (cast 21:14

68+ (apply 21:17 null-out (ref 21:27 msg))

69+ (tuple 21:32

70+ (lit 21:33 %.y)

71+ (group 21:37

72+ (call 21:38 (wing 21:38 inner) (lit 21:44 %ready))))))

73+ (value 22:1 term-null

74+ (cast 22:14

75+ (apply 22:17 null-out (ref 22:27 msg))

76+ (tuple 22:32

77+ (lit 22:33 %$)

78+ (group 22:36

79+ (call 22:37 (wing 22:37 inner) (lit 22:43 %ready))))))

80+ (value 23:1 null-flag

81+ (cast 23:14

82+ (apply 23:17 flag-out (ref 23:27 msg))

83+ (tuple 23:32

84+ (lit 23:33 ~)

85+ (group 23:35

86+ (call 23:36 (wing 23:36 inner) (lit 23:42 %ready))))))

87+ (value 24:1 flag-flag

88+ (cast 24:14

89+ (apply 24:17 flag-out (ref 24:27 msg))

90+ (tuple 24:32

91+ (lit 24:33 %.y)

92+ (group 24:37

93+ (call 24:38 (wing 24:38 inner) (lit 24:44 %ready))))))

94+ (value 25:1 term-flag

95+ (cast 25:14

96+ (apply 25:17 flag-out (ref 25:27 msg))

97+ (tuple 25:32

98+ (lit 25:33 %$)

99+ (group 25:36

100+ (call 25:37 (wing 25:37 inner) (lit 25:43 %ready))))))

101+ (value 26:1 null-term

102+ (cast 26:14

103+ (apply 26:17 term-out (ref 26:27 msg))

104+ (tuple 26:32

105+ (lit 26:33 ~)

106+ (group 26:35

107+ (call 26:36 (wing 26:36 inner) (lit 26:42 %ready))))))

108+ (value 27:1 flag-term

109+ (cast 27:14

110+ (apply 27:17 term-out (ref 27:27 msg))

111+ (tuple 27:32

112+ (lit 27:33 %.y)

113+ (group 27:37

114+ (call 27:38 (wing 27:38 inner) (lit 27:44 %ready))))))

115+ (value 28:1 term-term

116+ (cast 28:14

117+ (apply 28:17 term-out (ref 28:27 msg))

118+ (tuple 28:32

119+ (lit 28:33 %$)

120+ (group 28:36

121+ (call 28:37 (wing 28:37 inner) (lit 28:43 %ready))))))

122+ (value 29:1 wrong-inner

123+ (cast 29:16

124+ (apply 29:19 null-out (ref 29:29 msg))

125+ (tuple 29:34

126+ (lit 29:35 %$)

127+ (group 29:38

128+ (call 29:39 (wing 29:39 inner) (lit 29:45 %missing))))))

129+ (value 30:1 wrong-payload

130+ (cast 30:18

131+ (apply 30:21 flag-out (aura 30:31 @t))

132+ (tuple 30:35

133+ (lit 30:36 ~)

134+ (group 30:38

135+ (call 30:39 (wing 30:39 inner) (lit 30:45 ~zod))))))

136+ (value 31:1 pending

137+ (body 32:3

138+ (trace 32:3

139+ (lit 32:6 %orphan)

140+ (body 33:5

141+ (cast 33:5

142+ (apply 33:8 term-out (ref 33:18 msg))

143+ (tuple 33:23

144+ (lit 33:24 %.y)

145+ (group 33:28

146+ (call 33:29 (wing 33:29 inner) (lit 33:35 %ready)))))))))

147+ (value 34:1 unknown-target

148+ (gate 34:19

149+ (face 34:22 x (tvar 34:24 A))

150+ (cast 34:26

151+ (tvar 34:29 A)

152+ (tuple 34:31

153+ (lit 34:32 ~)

154+ (group 34:34

155+ (call 34:35 (wing 34:35 inner) (lit 34:41 %ready)))))))

156+ (value 35:1 ambiguous

157+ (cast 35:14

158+ (apply 35:17 competitors (ref 35:30 msg))

159+ (tuple 35:35

160+ (lit 35:36 ~)

161+ (group 35:38

162+ (call 35:39 (wing 35:39 inner) (lit 35:45 %ready)))))))

tests/golden/types-nested-noun-context/types.txtnew file+34

@@ -0,0 +1,34 @@

1+partial inference; module not checked

2++$ msg: cases proven disjoint; mold not checked

3++$ inner: cases proven disjoint; mold not checked

4++$ null-out: cases proven disjoint; mold not checked

5++$ flag-out: cases proven disjoint; mold not checked

6++$ term-out: cases proven disjoint; mold not checked

7++$ competitors: case disjointness unresolved; mold not checked

8+++ inner: $-(A (inner A))

9+++ null-null: (null-out msg)

10+++ flag-null: (null-out msg)

11+++ term-null: (null-out msg)

12+++ null-flag: (flag-out msg)

13+++ flag-flag: (flag-out msg)

14+++ term-flag: (flag-out msg)

15+++ null-term: (term-out msg)

16+++ flag-term: (term-out msg)

17+++ term-term: (term-out msg)

18+++ wrong-inner: msg has no case `%missing`

19+/tests/golden/types-nested-noun-context/source.jibb:29:39: expected union

20+++ wrong-inner ^- (null-out msg) [%$ (inner %missing)]

21+ ^

22+/tests/golden/types-nested-noun-context/source.jibb:29:45: tag

23+++ wrong-inner ^- (null-out msg) [%$ (inner %missing)]

24+ ^

25+++ wrong-payload: call's sample and argument types do not unify

26+/tests/golden/types-nested-noun-context/source.jibb:30:39: called gate

27+++ wrong-payload ^- (flag-out @t) [~ (inner ~zod)]

28+ ^

29+/tests/golden/types-nested-noun-context/source.jibb:30:45: argument has type @p

30+++ wrong-payload ^- (flag-out @t) [~ (inner ~zod)]

31+ ^

32+++ pending: tag needs context in partial inference

33+++ unknown-target: explicit capital constraints are not supported by partial inference

34+++ ambiguous: cast mold is not supported by partial inference

tests/golden/types-nested-shallow-preserve/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Literals by context: "Number and cell literals resolve like tags: each waits for its context"; Literals: `gap+%s2` is `[%gap %s2]`.

2+tests: Previously supported nested pair and direct-cell contexts stay inferred through lists and calls; calls, groups, casts and constructors preserve errors and pending constraints. Unknown targets fail closed.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-nested-shallow-preserve/modules.txtnew file+1

@@ -0,0 +1 @@

1+# Use the source-backed prelude.

tests/golden/types-nested-shallow-preserve/source.jibbnew file+30

@@ -0,0 +1,30 @@

1++$ length

2+ [%fill n=@ud]

3+ %shrink

4++$ attr

5+ [%width length]

6+ [%gap @tas]

7+++ number-id |= x=@ud x

8+++ plain ^- attr width+[%fill 1]

9+++ direct ^- attr [%width [%fill 1]]

10+++ list ^- (list attr) ~[width+[%fill 1]]

11+++ accept |= value=attr value

12+++ call (accept width+[%fill 1])

13+++ simple-call ^- attr width+[%fill (number-id 1)]

14+++ grouped-call ^- attr width+[%fill ((number-id 1))]

15+++ cast-call ^- attr width+[%fill (^- @ud (number-id 1))]

16+++ nested-call ^- attr width+[%fill (number-id (number-id 1))]

17+++ bad-tag ^- attr width+[%missing 1]

18+++ bad-number ^- attr width+[%fill "bad"]

19+++ pending

20+ ~& %unrelated

21+ ^- attr width+[%fill (number-id 1)]

22+++ singleton ^- attr width+%shrink

23++$ event

24+ [%got value=@t]

25+ %idle

26++$ envelope

27+ [%handler callback=$-(@t event)]

28+ [%empty value=@ud]

29+++ constructor ^- envelope [%handler |=%got]

30+++ unknown-target |= x=A ^- A width+[%fill (number-id 1)]

tests/golden/types-nested-shallow-preserve/tokens.txtnew file+271

@@ -0,0 +1,271 @@

1+1:1 glyph +$

2+1:4 name length

3+2:3 INDENT

4+2:3 glyph [

5+2:4 tight lit %fill

6+2:10 name n

7+2:11 tight glyph =

8+2:12 tight aura @ud

9+2:15 tight glyph ]

10+3:3 NEWLINE

11+3:3 lit %shrink

12+4:1 DEDENT

13+4:1 NEWLINE

14+4:1 glyph +$

15+4:4 name attr

16+5:3 INDENT

17+5:3 glyph [

18+5:4 tight lit %width

19+5:11 name length

20+5:17 tight glyph ]

21+6:3 NEWLINE

22+6:3 glyph [

23+6:4 tight lit %gap

24+6:9 aura @tas

25+6:13 tight glyph ]

26+7:1 DEDENT

27+7:1 NEWLINE

28+7:1 glyph ++

29+7:4 name number-id

30+7:14 glyph |=

31+7:17 name x

32+7:18 tight glyph =

33+7:19 tight aura @ud

34+7:23 name x

35+8:1 NEWLINE

36+8:1 glyph ++

37+8:4 name plain

38+8:10 glyph ^-

39+8:13 name attr

40+8:18 name width

41+8:23 tight glyph +

42+8:24 tight glyph [

43+8:25 tight lit %fill

44+8:31 lit 1

45+8:32 tight glyph ]

46+9:1 NEWLINE

47+9:1 glyph ++

48+9:4 name direct

49+9:11 glyph ^-

50+9:14 name attr

51+9:19 glyph [

52+9:20 tight lit %width

53+9:27 glyph [

54+9:28 tight lit %fill

55+9:34 lit 1

56+9:35 tight glyph ]

57+9:36 tight glyph ]

58+10:1 NEWLINE

59+10:1 glyph ++

60+10:4 name list

61+10:9 glyph ^-

62+10:12 glyph (

63+10:13 tight name list

64+10:18 name attr

65+10:22 tight glyph )

66+10:24 glyph ~[

67+10:26 tight name width

68+10:31 tight glyph +

69+10:32 tight glyph [

70+10:33 tight lit %fill

71+10:39 lit 1

72+10:40 tight glyph ]

73+10:41 tight glyph ]

74+11:1 NEWLINE

75+11:1 glyph ++

76+11:4 name accept

77+11:11 glyph |=

78+11:14 name value

79+11:19 tight glyph =

80+11:20 tight name attr

81+11:25 name value

82+12:1 NEWLINE

83+12:1 glyph ++

84+12:4 name call

85+12:9 glyph (

86+12:10 tight name accept

87+12:17 name width

88+12:22 tight glyph +

89+12:23 tight glyph [

90+12:24 tight lit %fill

91+12:30 lit 1

92+12:31 tight glyph ]

93+12:32 tight glyph )

94+13:1 NEWLINE

95+13:1 glyph ++

96+13:4 name simple-call

97+13:16 glyph ^-

98+13:19 name attr

99+13:24 name width

100+13:29 tight glyph +

101+13:30 tight glyph [

102+13:31 tight lit %fill

103+13:37 glyph (

104+13:38 tight name number-id

105+13:48 lit 1

106+13:49 tight glyph )

107+13:50 tight glyph ]

108+14:1 NEWLINE

109+14:1 glyph ++

110+14:4 name grouped-call

111+14:17 glyph ^-

112+14:20 name attr

113+14:25 name width

114+14:30 tight glyph +

115+14:31 tight glyph [

116+14:32 tight lit %fill

117+14:38 glyph (

118+14:39 tight glyph (

119+14:40 tight name number-id

120+14:50 lit 1

121+14:51 tight glyph )

122+14:52 tight glyph )

123+14:53 tight glyph ]

124+15:1 NEWLINE

125+15:1 glyph ++

126+15:4 name cast-call

127+15:14 glyph ^-

128+15:17 name attr

129+15:22 name width

130+15:27 tight glyph +

131+15:28 tight glyph [

132+15:29 tight lit %fill

133+15:35 glyph (

134+15:36 tight glyph ^-

135+15:39 aura @ud

136+15:43 glyph (

137+15:44 tight name number-id

138+15:54 lit 1

139+15:55 tight glyph )

140+15:56 tight glyph )

141+15:57 tight glyph ]

142+16:1 NEWLINE

143+16:1 glyph ++

144+16:4 name nested-call

145+16:16 glyph ^-

146+16:19 name attr

147+16:24 name width

148+16:29 tight glyph +

149+16:30 tight glyph [

150+16:31 tight lit %fill

151+16:37 glyph (

152+16:38 tight name number-id

153+16:48 glyph (

154+16:49 tight name number-id

155+16:59 lit 1

156+16:60 tight glyph )

157+16:61 tight glyph )

158+16:62 tight glyph ]

159+17:1 NEWLINE

160+17:1 glyph ++

161+17:4 name bad-tag

162+17:12 glyph ^-

163+17:15 name attr

164+17:20 name width

165+17:25 tight glyph +

166+17:26 tight glyph [

167+17:27 tight lit %missing

168+17:36 lit 1

169+17:37 tight glyph ]

170+18:1 NEWLINE

171+18:1 glyph ++

172+18:4 name bad-number

173+18:15 glyph ^-

174+18:18 name attr

175+18:23 name width

176+18:28 tight glyph +

177+18:29 tight glyph [

178+18:30 tight lit %fill

179+18:36 str "bad"

180+18:41 tight glyph ]

181+19:1 NEWLINE

182+19:1 glyph ++

183+19:4 name pending

184+20:3 INDENT

185+20:3 glyph ~&

186+20:6 lit %unrelated

187+21:5 INDENT

188+21:5 glyph ^-

189+21:8 name attr

190+21:13 name width

191+21:18 tight glyph +

192+21:19 tight glyph [

193+21:20 tight lit %fill

194+21:26 glyph (

195+21:27 tight name number-id

196+21:37 lit 1

197+21:38 tight glyph )

198+21:39 tight glyph ]

199+22:1 DEDENT

200+22:1 DEDENT

201+22:1 NEWLINE

202+22:1 glyph ++

203+22:4 name singleton

204+22:14 glyph ^-

205+22:17 name attr

206+22:22 name width

207+22:27 tight glyph +

208+22:28 tight lit %shrink

209+23:1 NEWLINE

210+23:1 glyph +$

211+23:4 name event

212+24:3 INDENT

213+24:3 glyph [

214+24:4 tight lit %got

215+24:9 name value

216+24:14 tight glyph =

217+24:15 tight aura @t

218+24:17 tight glyph ]

219+25:3 NEWLINE

220+25:3 lit %idle

221+26:1 DEDENT

222+26:1 NEWLINE

223+26:1 glyph +$

224+26:4 name envelope

225+27:3 INDENT

226+27:3 glyph [

227+27:4 tight lit %handler

228+27:13 name callback

229+27:21 tight glyph =

230+27:22 tight glyph $-(

231+27:25 tight aura @t

232+27:28 name event

233+27:33 tight glyph )

234+27:34 tight glyph ]

235+28:3 NEWLINE

236+28:3 glyph [

237+28:4 tight lit %empty

238+28:11 name value

239+28:16 tight glyph =

240+28:17 tight aura @ud

241+28:20 tight glyph ]

242+29:1 DEDENT

243+29:1 NEWLINE

244+29:1 glyph ++

245+29:4 name constructor

246+29:16 glyph ^-

247+29:19 name envelope

248+29:28 glyph [

249+29:29 tight lit %handler

250+29:38 glyph |=

251+29:40 tight lit %got

252+29:44 tight glyph ]

253+30:1 NEWLINE

254+30:1 glyph ++

255+30:4 name unknown-target

256+30:19 glyph |=

257+30:22 name x

258+30:23 tight glyph =

259+30:24 tight tvar A

260+30:26 glyph ^-

261+30:29 tvar A

262+30:31 name width

263+30:36 tight glyph +

264+30:37 tight glyph [

265+30:38 tight lit %fill

266+30:44 glyph (

267+30:45 tight name number-id

268+30:55 lit 1

269+30:56 tight glyph )

270+30:57 tight glyph ]

271+30:58 NEWLINE

tests/golden/types-nested-shallow-preserve/tree.txtnew file+136

@@ -0,0 +1,136 @@

1+(module

2+ (mold 1:1 length

3+ (union 2:3

4+ (cell 2:3

5+ (const 2:4 %fill)

6+ (face 2:10 n (aura 2:12 @ud)))

7+ (const 3:3 %shrink)))

8+ (mold 4:1 attr

9+ (union 5:3

10+ (cell 5:3 (const 5:4 %width) (ref 5:11 length))

11+ (cell 6:3 (const 6:4 %gap) (aura 6:9 @tas))))

12+ (value 7:1 number-id

13+ (gate 7:14

14+ (face 7:17 x (aura 7:19 @ud))

15+ (wing 7:23 x)))

16+ (value 8:1 plain

17+ (cast 8:10

18+ (ref 8:13 attr)

19+ (pair 8:18 width

20+ (tuple 8:24 (lit 8:25 %fill) (lit 8:31 1)))))

21+ (value 9:1 direct

22+ (cast 9:11

23+ (ref 9:14 attr)

24+ (tuple 9:19

25+ (lit 9:20 %width)

26+ (tuple 9:27 (lit 9:28 %fill) (lit 9:34 1)))))

27+ (value 10:1 list

28+ (cast 10:9

29+ (apply 10:12 list (ref 10:18 attr))

30+ (list 10:24

31+ (pair 10:26 width

32+ (tuple 10:32 (lit 10:33 %fill) (lit 10:39 1))))))

33+ (value 11:1 accept

34+ (gate 11:11

35+ (face 11:14 value (ref 11:20 attr))

36+ (wing 11:25 value)))

37+ (value 12:1 call

38+ (group 12:9

39+ (call 12:10

40+ (wing 12:10 accept)

41+ (pair 12:17 width

42+ (tuple 12:23 (lit 12:24 %fill) (lit 12:30 1))))))

43+ (value 13:1 simple-call

44+ (cast 13:16

45+ (ref 13:19 attr)

46+ (pair 13:24 width

47+ (tuple 13:30

48+ (lit 13:31 %fill)

49+ (group 13:37

50+ (call 13:38 (wing 13:38 number-id) (lit 13:48 1)))))))

51+ (value 14:1 grouped-call

52+ (cast 14:17

53+ (ref 14:20 attr)

54+ (pair 14:25 width

55+ (tuple 14:31

56+ (lit 14:32 %fill)

57+ (group 14:38

58+ (group 14:39

59+ (call 14:40 (wing 14:40 number-id) (lit 14:50 1))))))))

60+ (value 15:1 cast-call

61+ (cast 15:14

62+ (ref 15:17 attr)

63+ (pair 15:22 width

64+ (tuple 15:28

65+ (lit 15:29 %fill)

66+ (group 15:35

67+ (cast 15:36

68+ (aura 15:39 @ud)

69+ (group 15:43

70+ (call 15:44 (wing 15:44 number-id) (lit 15:54 1)))))))))

71+ (value 16:1 nested-call

72+ (cast 16:16

73+ (ref 16:19 attr)

74+ (pair 16:24 width

75+ (tuple 16:30

76+ (lit 16:31 %fill)

77+ (group 16:37

78+ (call 16:38

79+ (wing 16:38 number-id)

80+ (group 16:48

81+ (call 16:49 (wing 16:49 number-id) (lit 16:59 1)))))))))

82+ (value 17:1 bad-tag

83+ (cast 17:12

84+ (ref 17:15 attr)

85+ (pair 17:20 width

86+ (tuple 17:26 (lit 17:27 %missing) (lit 17:36 1)))))

87+ (value 18:1 bad-number

88+ (cast 18:15

89+ (ref 18:18 attr)

90+ (pair 18:23 width

91+ (tuple 18:29 (lit 18:30 %fill) (str 18:36 "bad")))))

92+ (value 19:1 pending

93+ (body 20:3

94+ (trace 20:3

95+ (lit 20:6 %unrelated)

96+ (body 21:5

97+ (cast 21:5

98+ (ref 21:8 attr)

99+ (pair 21:13 width

100+ (tuple 21:19

101+ (lit 21:20 %fill)

102+ (group 21:26

103+ (call 21:27 (wing 21:27 number-id) (lit 21:37 1))))))))))

104+ (value 22:1 singleton

105+ (cast 22:14

106+ (ref 22:17 attr)

107+ (pair 22:22 width (lit 22:28 %shrink))))

108+ (mold 23:1 event

109+ (union 24:3

110+ (cell 24:3

111+ (const 24:4 %got)

112+ (face 24:9 value (aura 24:15 @t)))

113+ (const 25:3 %idle)))

114+ (mold 26:1 envelope

115+ (union 27:3

116+ (cell 27:3

117+ (const 27:4 %handler)

118+ (face 27:13 callback

119+ (fn 27:22 (aura 27:25 @t) (ref 27:28 event))))

120+ (cell 28:3

121+ (const 28:4 %empty)

122+ (face 28:11 value (aura 28:17 @ud)))))

123+ (value 29:1 constructor

124+ (cast 29:16

125+ (ref 29:19 envelope)

126+ (tuple 29:28 (lit 29:29 %handler) (ctor 29:38 %got))))

127+ (value 30:1 unknown-target

128+ (gate 30:19

129+ (face 30:22 x (tvar 30:24 A))

130+ (cast 30:26

131+ (tvar 30:29 A)

132+ (pair 30:31 width

133+ (tuple 30:37

134+ (lit 30:38 %fill)

135+ (group 30:44

136+ (call 30:45 (wing 30:45 number-id) (lit 30:55 1)))))))))

tests/golden/types-nested-shallow-preserve/types.txtnew file+33

@@ -0,0 +1,33 @@

1+partial inference; module not checked

2++$ length: cases proven disjoint; mold not checked

3++$ attr: cases proven disjoint; mold not checked

4+++ number-id: $-(@ud @ud)

5+++ plain: attr

6+++ direct: attr

7+++ list: (list attr)

8+++ accept: $-(attr attr)

9+++ call: attr

10+++ simple-call: attr

11+++ grouped-call: attr

12+++ cast-call: attr

13+++ nested-call: attr

14+++ bad-tag: cast mold and expression type do not unify

15+/tests/golden/types-nested-shallow-preserve/source.jibb:17:15: cast mold

16+++ bad-tag ^- attr width+[%missing 1]

17+ ^

18+/tests/golden/types-nested-shallow-preserve/source.jibb:17:20: expression

19+++ bad-tag ^- attr width+[%missing 1]

20+ ^

21+++ bad-number: cast mold and expression type do not unify

22+/tests/golden/types-nested-shallow-preserve/source.jibb:18:18: cast mold

23+++ bad-number ^- attr width+[%fill "bad"]

24+ ^

25+/tests/golden/types-nested-shallow-preserve/source.jibb:18:23: expression

26+++ bad-number ^- attr width+[%fill "bad"]

27+ ^

28+++ pending: tag needs context in partial inference

29+++ singleton: attr

30++$ event: cases proven disjoint; mold not checked

31++$ envelope: cases proven disjoint; mold not checked

32+++ constructor: envelope

33+++ unknown-target: explicit capital constraints are not supported by partial inference

tests/golden/types-nested-union-context/about.txtnew file+4

@@ -0,0 +1,4 @@

1+source: Grammar, Literals by context: "Number and cell literals resolve like tags: each waits for its context"; Molds: "Tags take their union from context".

2+tests: Nested named-union expressions, invalid and unknown contexts, shared and independent generic variables, unresolved tags and nulls. Unproven case coverage remains unsupported. This is a partial inference report.

3+expect: parses

4+expect-types: a partial inference report

tests/golden/types-nested-union-context/source.jibbnew file+59

@@ -0,0 +1,59 @@

1++$ msg

2+ %go

3+ %stay

4++$ alt

5+ %go

6+ %stay

7++$ payload |$ [A]

8+ [%value item=A]

9+ %empty

10++$ box |$ [A]

11+ [%wrap item=(payload A)]

12+ %none

13++$ reverse |$ [A B]

14+ [%left item=A]

15+ [%right item=B]

16+++ lift |= x=A ^- (payload A) [%value x]

17+++ direct ^- (payload msg) (lift %go)

18+++ nested ^- (box msg) [%wrap (lift %go)]

19+++ nested-alias |= p=(payload msg) ^- (box msg) [%wrap p]

20+++ nested-typed ^- (box msg) [%wrap (lift (^- msg %go))]

21+++ nested-cord ^- (box @t) [%wrap (lift "hi")]

22+++ nested-ship ^- (box @p) [%wrap (lift ~zod)]

23+++ independent |= [t=@t p=@p]

24+ [(^- (box @t) [%wrap (lift t)]) (^- (box @p) [%wrap (lift p)])]

25+++ wrong-payload ^- (box @t) [%wrap (lift ~zod)]

26+++ wrong-tag ^- (box msg) [%wrap (lift %absent)]

27+++ wrong-origin |= x=alt ^- (box msg) [%wrap (lift x)]

28+++ generic |= x=A ^- (box A) [%wrap (lift x)]

29+++ repeated |= x=A ^- [a=(box A) b=(box A)] [a=[%wrap (lift x)] b=[%wrap (lift x)]]

30+++ unrelated-pending

31+ ~& %orphan

32+ ^- (box msg) [%wrap (lift %go)]

33+++ pending-null

34+ ~& ~

35+ ^- (box msg) [%wrap (lift %go)]

36+++ discarded-constructor

37+ ~& |=%orphan

38+ ^- (box msg) [%wrap (lift %go)]

39+++ unknown-output [%wrap (lift %go)]

40+++ unknown-target |= x=A ^- A [%wrap (lift %go)]

41+++ outer-callback |= [p=(payload A) fn=$-((payload A) B)] (fn p)

42+++ ctor-context ^- (box @t) (outer-callback (lift "hi") |=%wrap)

43+++ other-case ^- (box @t) %none

44++$ full-payload |$ [A]

45+ [%value item=A]

46+ [%skip code=@ud]

47++$ full-box |$ [A]

48+ [%wrap item=(full-payload A)]

49+ [%other code=@ud]

50+++ make-full |= x=A ^- (full-payload A) [%value x]

51+++ full-valid ^- (full-box msg) [%wrap (make-full %go)]

52+++ full-cord ^- (full-box @t) [%wrap (make-full "hi")]

53+++ full-ship ^- (full-box @p) [%wrap (make-full ~zod)]

54+++ full-generic |= x=A ^- (full-box A) [%wrap (make-full x)]

55+++ full-wrong ^- (full-box @t) [%wrap (make-full ~zod)]

56+++ full-missing ^- (full-box msg) [%wrap (make-full %missing)]

57+++ full-pending

58+ ~& %orphan

59+ ^- (full-box msg) [%wrap (make-full %go)]

tests/golden/types-nested-union-context/tokens.txtnew file+660