@systemfsoftware/effect-schema-law 0.6.0 → 0.7.0

package/CHANGELOG.md

@@ -0,0 +1,15 @@
+# @systemfsoftware/effect-schema-law
+
+## 0.7.0
+
+### Minor Changes
+
+- cut over to effect v4 (4.0.0-rc.108): public surface derives from effect types; peers flip effect ^3→^4
+
+### Patch Changes
+
+- Array types are spelled one way. `Array<T>` and `ReadonlyArray<T>` in emitted
+  declarations become `T[]` and `readonly T[]`, which the type checker cannot tell
+  apart: no exported type changes, only how it is written.
+
+- New version is published through npm trusted publishing, so it carries a provenance attestation you can verify.

package/LICENSE

@@ -1,21 +1,203 @@
-MIT License
-
-Copyright (c) 2026 Ryan Lee
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
+Copyright (c) 2026 Ryan Lee (systemfsoftware)
+
+Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Ryan Lee (systemfsoftware)
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/dist/effect-schema-law.d.ts

@@ -1,10 +1,117 @@
+import * as AST from 'effect/SchemaAST';
+import { FastCheck } from 'effect/testing';
 import { Schema } from 'effect';
 
-export declare const boundedUnion: <Base extends readonly [Schema.Schema.Any, ...ReadonlyArray<Schema.Schema.Any>], Recur extends readonly [Schema.Schema.Any, ...ReadonlyArray<Schema.Schema.Any>]>(identifier: string, options: {
+/** Verdict for one schema's obligation set, carrying the detail R7 requires in a failure. */
+export declare interface AdequacyReport {
+    readonly adequate: boolean;
+    readonly undischarged: readonly Obligation[];
+    readonly message: string;
+}
+
+/**
+ * Which obligations no declared generator discharges. A bare "adequacy failed" leaves
+ * the author nothing to act on, so the message names each node's tag, every path
+ * reaching it, and the witness that proves the weakening is permissive.
+ */
+export declare const adequacyReport: (schema: Schema.ConstraintDecoder<unknown>, generators: RefusalGenerators) => AdequacyReport;
+
+/**
+ * One weakening of an Effect schema, produced by `armsOf`. Each arm identifies
+ * the AST node it removes; the rebuilt tree is the surrounding schema with
+ * that node replaced by its child or, for a dropped refinement, by the same
+ * node without that check.
+ *
+ * Two schemas reaching the same `node` share its identity and therefore its
+ * obligation key — the deduplication is the entire point of the shape.
+ */
+export declare interface Arm {
+    readonly kind: 'drop-refinement' | 'drop-to-arm' | 'drop-from-arm';
+    readonly path: string;
+    /** The node this arm removes — the obligation key. Two arms removing it are one obligation. */
+    readonly node: AST.AST;
+    readonly weakened: AST.AST;
+}
+
+/**
+ * Walk an Effect schema's AST and return every weakenable arm, recursively
+ * through `Objects`, `Union`, `Arrays`, `Declaration`, and `Suspend`, plus
+ * the v4 per-node `Checks` (refinements) and encoding `Link` chains
+ * (transformations). The walk terminates on `Suspend` cycles at `depthCap`
+ * levels; every other AST tag is a leaf whose children cannot hold a
+ * refinement, and `Union` over structurally identical members is fine because
+ * the walk keys arms by node identity, not shape.
+ *
+ * The arm's `node` is the AST node its weakening removes; reference identity
+ * is the obligation key (R3). `weakened` is the enclosing tree with `node`
+ * replaced by its child, ready to be passed to `Schema.make`.
+ */
+export declare const armsOf: (schema: Schema.ConstraintDecoder<unknown>) => readonly Arm[];
+
+/** An arm no source could draw for: the search could not look, which is not the same as finding nothing. */
+export declare interface BlindArm {
+    readonly path: string;
+    readonly kind: string;
+    readonly message: string;
+}
+
+export declare const boundedUnion: <Base extends readonly [Schema.ConstraintCodec<unknown, unknown>, ...readonly Schema.ConstraintCodec<unknown, unknown>[]], Recur extends readonly [Schema.ConstraintCodec<unknown, unknown>, ...readonly Schema.ConstraintCodec<unknown, unknown>[]]>(identifier: string, options: {
     readonly base: Base;
     readonly recur: Recur;
     readonly maxDepth?: number;
-}) => Schema.Schema<Schema.Schema.Type<Base[number] | Recur[number]>, Schema.Schema.Encoded<Base[number] | Recur[number]>, Schema.Schema.Context<Base[number] | Recur[number]>>;
+}) => Schema.Codec<Base[number]['Type'] | Recur[number]['Type'], Base[number]['Encoded'] | Recur[number]['Encoded']>;
+
+/**
+ * For each obligation, return the names of the generators whose draws
+ * the weakened schema accepts AND the original rejects. Generators
+ * whose draws the original also accepts do not discharge — they are
+ * the language the original already covers. Generators whose draws
+ * the weakened schema rejects do not discharge either.
+ *
+ * The original schema is part of the signature because discharge is
+ * defined relative to it.
+ */
+export declare const dischargedBy: (schema: Schema.ConstraintDecoder<unknown>, obligations: ReadonlyMap<AST.AST, Obligation>, generators: Readonly<Record<string, NamedArbitrary>>) => ReadonlyMap<AST.AST, readonly string[]>;
+
+/** True when `value` is a witness for some obligation: accepted by that weakening, rejected by the schema. */
+export declare const discriminates: (schema: Schema.ConstraintDecoder<unknown>, obligations: ReadonlyMap<AST.AST, Obligation>, value: unknown) => boolean;
+
+declare type NamedArbitrary = FastCheck.Arbitrary<unknown>;
+
+/**
+ * One node-keyed refutation obligation: a witness exists that the
+ * weakened schema accepts and the original rejects. Obligations are
+ * keyed by the AST node the arm removes (R3); several paths reaching
+ * one node are one obligation carrying several paths.
+ */
+export declare interface Obligation {
+    readonly node: AST.AST;
+    readonly tag: string;
+    readonly paths: readonly string[];
+    readonly weakened: AST.AST;
+    readonly witness: unknown;
+}
+
+/** Every arm of a schema, split into the ones a witness proved and the ones nothing could see. */
+export declare interface ObligationScan {
+    readonly obligations: ReadonlyMap<AST.AST, Obligation>;
+    readonly blind: readonly BlindArm[];
+}
+
+export declare const obligationsOf: (schema: Schema.ConstraintDecoder<unknown>) => ReadonlyMap<AST.AST, Obligation>;
+
+/** Named refusal generators: each draws rejection-class inputs the schema must reject. */
+export declare type RefusalGenerators = Record<string, FastCheck.Arbitrary<unknown>>;
+
+/**
+ * Property-test one schema's rejection contract. Registers per generator a refusal
+ * property (the schema rejects every draw) and a discrimination property (each draw is
+ * explained by some weakening), plus one adequacy property for the schema.
+ *
+ * Names follow the house convention: `∀b_<generator>_⊥`, `∀g_<generator>_discriminates`,
+ * `∀s_<schema>_adequate` — disjoint from `ruleOfSchemas`' `∀x_<name>_=x` pair.
+ */
+export declare const refutes: (schema: Schema.ConstraintDecoder<unknown>, generators: RefusalGenerators) => void;
 
 /**
  * Property-test the round-trip and encode-stability laws of any Effect Schema.
@@ -15,6 +122,23 @@ export declare const boundedUnion: <Base extends readonly [Schema.Schema.Any, ..
  *
  * Use inside a `describe` block to scope the generated tests.
  */
-export declare const ruleOfSchemas: <A, I>(name: string, schema: Schema.Schema<A, I, never>) => void;
+export declare const ruleOfSchemas: <A, I>(name: string, schema: Schema.Codec<A, I>) => void;
+
+/**
+ * Walk `armsOf` and classify every arm. An arm is an obligation iff a witness
+ * exists — an input the weakened schema accepts and the original rejects —
+ * drawn from a fallback chain (encoded arbitrary, type arbitrary, generic
+ * pool). An arm whose every source failed to construct is `blind`: "no
+ * obligation" and "could not look" are different answers, and collapsing
+ * them is the silent miss this scan exists to prevent.
+ */
+export declare const scanObligations: (schema: Schema.ConstraintDecoder<unknown>) => ObligationScan;
+
+/**
+ * The sampling budget is a property of the contract, not a knob. The
+ * plan pins the expectation against a literal table; the kernel draws
+ * up to this many candidates per source before exhausting the chain.
+ */
+export declare const WITNESS_BUDGET = 256;
 
 export { }

package/dist/index.d.ts

@@ -1,12 +1,95 @@
 import { Schema } from "effect";
-//#region src/bounded-union.kernel.d.ts
-declare const boundedUnion: <Base extends readonly [Schema.Schema.Any, ...ReadonlyArray<Schema.Schema.Any>], Recur extends readonly [Schema.Schema.Any, ...ReadonlyArray<Schema.Schema.Any>]>(identifier: string, options: {
+import { FastCheck } from "effect/testing";
+import * as AST from "effect/SchemaAST";
+//#region src/BoundedUnion.d.ts
+declare const boundedUnion: <Base extends readonly [Schema.ConstraintCodec<unknown, unknown>, ...readonly Schema.ConstraintCodec<unknown, unknown>[]], Recur extends readonly [Schema.ConstraintCodec<unknown, unknown>, ...readonly Schema.ConstraintCodec<unknown, unknown>[]]>(identifier: string, options: {
   readonly base: Base;
   readonly recur: Recur;
   readonly maxDepth?: number;
-}) => Schema.Schema<Schema.Schema.Type<Base[number] | Recur[number]>, Schema.Schema.Encoded<Base[number] | Recur[number]>, Schema.Schema.Context<Base[number] | Recur[number]>>;
+}) => Schema.Codec<Base[number]['Type'] | Recur[number]['Type'], Base[number]['Encoded'] | Recur[number]['Encoded']>;
 //#endregion
-//#region src/rule-of-schemas.kernel.d.ts
+//#region src/Refutation.d.ts
+/**
+ * One node-keyed refutation obligation: a witness exists that the
+ * weakened schema accepts and the original rejects. Obligations are
+ * keyed by the AST node the arm removes (R3); several paths reaching
+ * one node are one obligation carrying several paths.
+ */
+interface Obligation {
+  readonly node: AST.AST;
+  readonly tag: string;
+  readonly paths: readonly string[];
+  readonly weakened: AST.AST;
+  readonly witness: unknown;
+}
+/** An arm no source could draw for: the search could not look, which is not the same as finding nothing. */
+interface BlindArm {
+  readonly path: string;
+  readonly kind: string;
+  readonly message: string;
+}
+/** Every arm of a schema, split into the ones a witness proved and the ones nothing could see. */
+interface ObligationScan {
+  readonly obligations: ReadonlyMap<AST.AST, Obligation>;
+  readonly blind: readonly BlindArm[];
+}
+/**
+ * The sampling budget is a property of the contract, not a knob. The
+ * plan pins the expectation against a literal table; the kernel draws
+ * up to this many candidates per source before exhausting the chain.
+ */
+declare const WITNESS_BUDGET = 256;
+type NamedArbitrary = FastCheck.Arbitrary<unknown>;
+/**
+ * Walk `armsOf` and classify every arm. An arm is an obligation iff a witness
+ * exists — an input the weakened schema accepts and the original rejects —
+ * drawn from a fallback chain (encoded arbitrary, type arbitrary, generic
+ * pool). An arm whose every source failed to construct is `blind`: "no
+ * obligation" and "could not look" are different answers, and collapsing
+ * them is the silent miss this scan exists to prevent.
+ */
+declare const scanObligations: (schema: Schema.ConstraintDecoder<unknown>) => ObligationScan;
+declare const obligationsOf: (schema: Schema.ConstraintDecoder<unknown>) => ReadonlyMap<AST.AST, Obligation>;
+/**
+ * For each obligation, return the names of the generators whose draws
+ * the weakened schema accepts AND the original rejects. Generators
+ * whose draws the original also accepts do not discharge — they are
+ * the language the original already covers. Generators whose draws
+ * the weakened schema rejects do not discharge either.
+ *
+ * The original schema is part of the signature because discharge is
+ * defined relative to it.
+ */
+declare const dischargedBy: (schema: Schema.ConstraintDecoder<unknown>, obligations: ReadonlyMap<AST.AST, Obligation>, generators: Readonly<Record<string, NamedArbitrary>>) => ReadonlyMap<AST.AST, readonly string[]>;
+//#endregion
+//#region src/Refutes.d.ts
+/** Named refusal generators: each draws rejection-class inputs the schema must reject. */
+type RefusalGenerators = Record<string, FastCheck.Arbitrary<unknown>>;
+/** Verdict for one schema's obligation set, carrying the detail R7 requires in a failure. */
+interface AdequacyReport {
+  readonly adequate: boolean;
+  readonly undischarged: readonly Obligation[];
+  readonly message: string;
+}
+/** True when `value` is a witness for some obligation: accepted by that weakening, rejected by the schema. */
+declare const discriminates: (schema: Schema.ConstraintDecoder<unknown>, obligations: ReadonlyMap<AST.AST, Obligation>, value: unknown) => boolean;
+/**
+ * Which obligations no declared generator discharges. A bare "adequacy failed" leaves
+ * the author nothing to act on, so the message names each node's tag, every path
+ * reaching it, and the witness that proves the weakening is permissive.
+ */
+declare const adequacyReport: (schema: Schema.ConstraintDecoder<unknown>, generators: RefusalGenerators) => AdequacyReport;
+/**
+ * Property-test one schema's rejection contract. Registers per generator a refusal
+ * property (the schema rejects every draw) and a discrimination property (each draw is
+ * explained by some weakening), plus one adequacy property for the schema.
+ *
+ * Names follow the house convention: `∀b_<generator>_⊥`, `∀g_<generator>_discriminates`,
+ * `∀s_<schema>_adequate` — disjoint from `ruleOfSchemas`' `∀x_<name>_=x` pair.
+ */
+declare const refutes: (schema: Schema.ConstraintDecoder<unknown>, generators: RefusalGenerators) => void;
+//#endregion
+//#region src/RuleOfSchemas.d.ts
 /**
  * Property-test the round-trip and encode-stability laws of any Effect Schema.
  *
@@ -16,6 +99,38 @@ declare const boundedUnion: <Base extends readonly [Schema.Schema.Any, ...Readon
  *
  * Use inside a `describe` block to scope the generated tests.
  */
-declare const ruleOfSchemas: <A, I>(name: string, schema: Schema.Schema<A, I, never>) => void;
+declare const ruleOfSchemas: <A, I>(name: string, schema: Schema.Codec<A, I>) => void;
+//#endregion
+//#region src/Weaken.d.ts
+/**
+ * One weakening of an Effect schema, produced by `armsOf`. Each arm identifies
+ * the AST node it removes; the rebuilt tree is the surrounding schema with
+ * that node replaced by its child or, for a dropped refinement, by the same
+ * node without that check.
+ *
+ * Two schemas reaching the same `node` share its identity and therefore its
+ * obligation key — the deduplication is the entire point of the shape.
+ */
+interface Arm {
+  readonly kind: 'drop-refinement' | 'drop-to-arm' | 'drop-from-arm';
+  readonly path: string;
+  /** The node this arm removes — the obligation key. Two arms removing it are one obligation. */
+  readonly node: AST.AST;
+  readonly weakened: AST.AST;
+}
+/**
+ * Walk an Effect schema's AST and return every weakenable arm, recursively
+ * through `Objects`, `Union`, `Arrays`, `Declaration`, and `Suspend`, plus
+ * the v4 per-node `Checks` (refinements) and encoding `Link` chains
+ * (transformations). The walk terminates on `Suspend` cycles at `depthCap`
+ * levels; every other AST tag is a leaf whose children cannot hold a
+ * refinement, and `Union` over structurally identical members is fine because
+ * the walk keys arms by node identity, not shape.
+ *
+ * The arm's `node` is the AST node its weakening removes; reference identity
+ * is the obligation key (R3). `weakened` is the enclosing tree with `node`
+ * replaced by its child, ready to be passed to `Schema.make`.
+ */
+declare const armsOf: (schema: Schema.ConstraintDecoder<unknown>) => readonly Arm[];
 //#endregion
-export { boundedUnion, ruleOfSchemas };
+export { type AdequacyReport, type Arm, type BlindArm, type Obligation, type ObligationScan, type RefusalGenerators, WITNESS_BUDGET, adequacyReport, armsOf, boundedUnion, dischargedBy, discriminates, obligationsOf, refutes, ruleOfSchemas, scanObligations };

package/dist/index.mjs

@@ -1,20 +1,350 @@
-import { Arbitrary, Either, Schema } from "effect";
+import { Exit, Option, Result, Schema } from "effect";
+import { FastCheck } from "effect/testing";
+import * as AST from "effect/SchemaAST";
 import { it } from "@effect/vitest";
-//#region src/bounded-union.kernel.ts
+import { expect } from "vitest";
+//#region src/BoundedUnion.ts
 const boundedUnion = (identifier, options) => {
 	const { base, maxDepth = 2, recur } = options;
-	const baseArbitraries = base.map((member) => Arbitrary.make(member));
-	const recurArbitraries = recur.map((member) => Arbitrary.make(member));
-	return Schema.Union(...base, ...recur).annotations({
+	let deriving = false;
+	const hook = () => (fc, _context) => {
+		const baseArbitraries = fc.oneof(...base.map((member) => Schema.toArbitrary(member)(fc)));
+		if (deriving) return baseArbitraries;
+		deriving = true;
+		try {
+			const recurArbitraries = recur.map((member) => Schema.toArbitrary(member)(fc));
+			return {
+				arbitrary: fc.oneof({
+					depthIdentifier: identifier,
+					maxDepth
+				}, baseArbitraries, ...recurArbitraries),
+				terminal: baseArbitraries
+			};
+		} finally {
+			deriving = false;
+		}
+	};
+	return Schema.Union([...base, ...recur]).annotate({
 		identifier,
-		arbitrary: () => (fc) => fc.oneof({
-			depthIdentifier: identifier,
-			maxDepth
-		}, fc.oneof(...baseArbitraries), ...recurArbitraries)
+		toArbitrary: hook
 	});
 };
 //#endregion
-//#region src/rule-of-schemas.kernel.ts
+//#region src/Weaken.ts
+const DEFAULT_SUSPEND_DEPTH_CAP = 16;
+/**
+* Walk an Effect schema's AST and return every weakenable arm, recursively
+* through `Objects`, `Union`, `Arrays`, `Declaration`, and `Suspend`, plus
+* the v4 per-node `Checks` (refinements) and encoding `Link` chains
+* (transformations). The walk terminates on `Suspend` cycles at `depthCap`
+* levels; every other AST tag is a leaf whose children cannot hold a
+* refinement, and `Union` over structurally identical members is fine because
+* the walk keys arms by node identity, not shape.
+*
+* The arm's `node` is the AST node its weakening removes; reference identity
+* is the obligation key (R3). `weakened` is the enclosing tree with `node`
+* replaced by its child, ready to be passed to `Schema.make`.
+*/
+const armsOf = (schema) => {
+	const out = [];
+	const visited = /* @__PURE__ */ new Set();
+	walk(schema.ast, "root", out, 0, DEFAULT_SUSPEND_DEPTH_CAP, (replacement) => replacement, visited);
+	return out;
+};
+const replaceAt = (items, index, item) => items.map((existing, i) => i === index ? item : existing);
+/**
+* Clone an AST node, patching selected own properties. This mirrors the v4
+* `SchemaAST` internals (which rebuild checked nodes the same way on
+* `Schema.check`) without depending on non-public exports.
+*/
+const cloneWith = (node, patch) => {
+	const target = Object.assign({}, node);
+	Object.setPrototypeOf(target, Reflect.getPrototypeOf(node));
+	Object.assign(target, patch);
+	return target;
+};
+/** The AST with one refinement check removed — dropping a refinement in v4. */
+const dropCheck = (node, check) => {
+	const checks = node.checks;
+	if (checks === void 0) return node;
+	const rest = checks.filter((existing) => existing !== check);
+	return cloneWith(node, { checks: rest.length === 0 ? void 0 : rest });
+};
+/** The AST with its encoding chain removed — the decoded (type-side) view. */
+const withoutEncoding = (node) => node.encoding === void 0 ? node : cloneWith(node, { encoding: void 0 });
+/** The AST with the encoding link at `index` retargeted at `to`. */
+const replaceLinkAt = (node, index, to) => {
+	const encoding = node.encoding;
+	if (encoding === void 0) return node;
+	const link = encoding[index];
+	if (link === void 0 || link.to === to) return node;
+	const next = [
+		...encoding.slice(0, index),
+		new AST.Link(to, link.transformation),
+		...encoding.slice(index + 1)
+	];
+	return cloneWith(node, { encoding: next });
+};
+const walk = (node, path, out, suspendDepth, depthCap, rebuild, visited) => {
+	const isNewNode = !visited.has(node);
+	if (isNewNode) visited.add(node);
+	if (node.checks) node.checks.forEach((check, index) => {
+		out.push({
+			kind: "drop-refinement",
+			path: `${path}/refinement/${index}`,
+			node,
+			weakened: rebuild(dropCheck(node, check))
+		});
+	});
+	if (node.encoding !== void 0) node.encoding.forEach((link, index) => {
+		out.push({
+			kind: "drop-to-arm",
+			path: `${path}/to/${index}`,
+			node,
+			weakened: rebuild(link.to)
+		});
+		out.push({
+			kind: "drop-from-arm",
+			path: `${path}/from/${index}`,
+			node,
+			weakened: rebuild(withoutEncoding(node))
+		});
+		walk(link.to, `${path}/to/${index}`, out, suspendDepth, depthCap, (replacement) => rebuild(replaceLinkAt(node, index, replacement)), visited);
+	});
+	if (!isNewNode) return;
+	if (AST.isObjects(node)) {
+		node.propertySignatures.forEach((property, i) => {
+			walk(property.type, `${path}/property/${String(property.name)}`, out, suspendDepth, depthCap, (replacement) => rebuild(new AST.Objects(replaceAt(node.propertySignatures, i, new AST.PropertySignature(property.name, replacement)), node.indexSignatures, node.annotations, node.checks, node.encoding, node.context, node.encodingChecks)), visited);
+		});
+		return;
+	}
+	if (AST.isUnion(node)) {
+		node.types.forEach((member, i) => {
+			walk(member, `${path}/union/${i}`, out, suspendDepth, depthCap, (replacement) => rebuild(new AST.Union(replaceAt(node.types, i, replacement), node.mode, node.annotations, node.checks, node.encoding, node.context, node.encodingChecks)), visited);
+		});
+		return;
+	}
+	if (AST.isArrays(node)) {
+		node.elements.forEach((element, i) => {
+			walk(element, `${path}/element/${i}`, out, suspendDepth, depthCap, (replacement) => rebuild(new AST.Arrays(node.isMutable, replaceAt(node.elements, i, replacement), node.rest, node.annotations, node.checks, node.encoding, node.context, node.encodingChecks)), visited);
+		});
+		node.rest.forEach((rest, i) => {
+			walk(rest, `${path}/rest/${i}`, out, suspendDepth, depthCap, (replacement) => rebuild(new AST.Arrays(node.isMutable, node.elements, replaceAt(node.rest, i, replacement), node.annotations, node.checks, node.encoding, node.context, node.encodingChecks)), visited);
+		});
+		return;
+	}
+	if (AST.isDeclaration(node)) {
+		node.typeParameters.forEach((parameter, i) => {
+			walk(parameter, `${path}/typeParameter/${i}`, out, suspendDepth, depthCap, (replacement) => rebuild(new AST.Declaration(replaceAt(node.typeParameters, i, replacement), node.run, node.annotations, node.checks, node.encoding, node.context, node.encodingChecks)), visited);
+		});
+		return;
+	}
+	if (AST.isSuspend(node)) {
+		if (suspendDepth >= depthCap) return;
+		walk(node.thunk(), `${path}/suspend`, out, suspendDepth + 1, depthCap, (replacement) => rebuild(new AST.Suspend(() => replacement, node.annotations, node.checks, node.encoding, node.context)), visited);
+	}
+};
+//#endregion
+//#region src/Refutation.ts
+/**
+* The sampling budget is a property of the contract, not a knob. The
+* plan pins the expectation against a literal table; the kernel draws
+* up to this many candidates per source before exhausting the chain.
+*/
+const WITNESS_BUDGET = 256;
+const REJECTION_GENERIC_POOL = [
+	"",
+	" ",
+	"g",
+	"0",
+	"1",
+	-1,
+	0,
+	1,
+	true,
+	false,
+	null,
+	void 0,
+	{},
+	[],
+	{ _: "unknown" },
+	["unknown"],
+	NaN,
+	Number.POSITIVE_INFINITY,
+	"not-a-date"
+];
+/** Decode-side, not validate-side: refusal generators draw wire-form inputs, so this is a question about the Encoded side. */
+const accepts = (schema, value) => Exit.isSuccess(Schema.decodeUnknownExit(schema)(value));
+const buildArbitrary = (schema) => {
+	try {
+		return Schema.toArbitrary(schema)(FastCheck);
+	} catch {
+		return;
+	}
+};
+const sample = (arbitrary, budget) => {
+	try {
+		return FastCheck.sample(arbitrary, {
+			numRuns: budget,
+			seed: 1
+		});
+	} catch {
+		return;
+	}
+};
+const findWitness = (schema, arm) => {
+	const weakened = Schema.make(arm.weakened);
+	const isWitness = (value) => accepts(weakened, value) && !accepts(schema, value);
+	let schemaDerivedDraws = 0;
+	for (const source of [Schema.toEncoded(weakened), weakened]) {
+		const arbitrary = buildArbitrary(source);
+		if (arbitrary === void 0) continue;
+		const draws = sample(arbitrary, 256);
+		if (draws === void 0) continue;
+		schemaDerivedDraws += draws.length;
+		for (const value of draws) if (isWitness(value)) return Result.succeed(Option.some(value));
+	}
+	for (const value of REJECTION_GENERIC_POOL) if (isWitness(value)) return Result.succeed(Option.some(value));
+	if (schemaDerivedDraws === 0) return Result.fail({
+		path: arm.path,
+		kind: arm.kind,
+		message: `refutation.kernel: witness search failed for arm "${arm.path}" (${arm.kind}); neither the encoded nor the type arbitrary of the weakened schema yielded a draw, so "no obligation" cannot be distinguished from "could not look".`
+	});
+	return Result.succeed(Option.none());
+};
+/**
+* Walk `armsOf` and classify every arm. An arm is an obligation iff a witness
+* exists — an input the weakened schema accepts and the original rejects —
+* drawn from a fallback chain (encoded arbitrary, type arbitrary, generic
+* pool). An arm whose every source failed to construct is `blind`: "no
+* obligation" and "could not look" are different answers, and collapsing
+* them is the silent miss this scan exists to prevent.
+*/
+const scanObligations = (schema) => {
+	const collected = /* @__PURE__ */ new Map();
+	const blind = [];
+	for (const arm of armsOf(schema)) {
+		const found = findWitness(schema, arm);
+		if (Result.isFailure(found)) {
+			blind.push(found.failure);
+			continue;
+		}
+		if (Option.isNone(found.success)) continue;
+		const existing = collected.get(arm.node);
+		if (existing === void 0) collected.set(arm.node, {
+			paths: [arm.path],
+			witness: found.success.value,
+			weakened: arm.weakened
+		});
+		else existing.paths.push(arm.path);
+	}
+	const obligations = /* @__PURE__ */ new Map();
+	for (const [node, entry] of collected) obligations.set(node, {
+		node,
+		tag: node._tag,
+		paths: entry.paths,
+		weakened: entry.weakened,
+		witness: entry.witness
+	});
+	return {
+		obligations,
+		blind
+	};
+};
+const obligationsOf = (schema) => scanObligations(schema).obligations;
+const discharges = (schema, arbitrary, obligation) => {
+	const weakened = Schema.make(obligation.weakened);
+	const draws = sample(arbitrary, 256);
+	if (draws === void 0) return false;
+	for (const value of draws) if (accepts(weakened, value) && !accepts(schema, value)) return true;
+	return false;
+};
+/**
+* For each obligation, return the names of the generators whose draws
+* the weakened schema accepts AND the original rejects. Generators
+* whose draws the original also accepts do not discharge — they are
+* the language the original already covers. Generators whose draws
+* the weakened schema rejects do not discharge either.
+*
+* The original schema is part of the signature because discharge is
+* defined relative to it.
+*/
+const dischargedBy = (schema, obligations, generators) => {
+	const out = /* @__PURE__ */ new Map();
+	for (const [node, obligation] of obligations) {
+		const discharging = [];
+		for (const [name, arbitrary] of Object.entries(generators)) if (discharges(schema, arbitrary, obligation)) discharging.push(name);
+		out.set(node, discharging);
+	}
+	return out;
+};
+//#endregion
+//#region src/Refutes.ts
+const renderWitness = (witness) => {
+	try {
+		return JSON.stringify(witness) ?? String(witness);
+	} catch {
+		return String(witness);
+	}
+};
+/** True when `value` is a witness for some obligation: accepted by that weakening, rejected by the schema. */
+const discriminates = (schema, obligations, value) => {
+	if (Exit.isSuccess(Schema.decodeUnknownExit(schema)(value))) return false;
+	for (const obligation of obligations.values()) {
+		const weakened = Schema.make(obligation.weakened);
+		if (Exit.isSuccess(Schema.decodeUnknownExit(weakened)(value))) return true;
+	}
+	return false;
+};
+/**
+* Which obligations no declared generator discharges. A bare "adequacy failed" leaves
+* the author nothing to act on, so the message names each node's tag, every path
+* reaching it, and the witness that proves the weakening is permissive.
+*/
+const adequacyReport = (schema, generators) => {
+	const scan = scanObligations(schema);
+	const credits = dischargedBy(schema, scan.obligations, generators);
+	const undischarged = [...scan.obligations.values()].filter((obligation) => (credits.get(obligation.node) ?? []).length === 0);
+	if (scan.blind.length > 0) return {
+		adequate: false,
+		undischarged,
+		message: `${scan.blind.length} arm(s) could not be searched for a witness:\n` + scan.blind.map((b) => `  ${b.message}`).join("\n")
+	};
+	if (undischarged.length === 0) return {
+		adequate: true,
+		undischarged,
+		message: ""
+	};
+	const detail = undischarged.map((o) => `  ${o.tag} reached by [${o.paths.join(" | ")}] — witness ${renderWitness(o.witness)}`).join("\n");
+	return {
+		adequate: false,
+		undischarged,
+		message: `${undischarged.length} obligation(s) discharged by no declared generator:\n${detail}`
+	};
+};
+/**
+* Property-test one schema's rejection contract. Registers per generator a refusal
+* property (the schema rejects every draw) and a discrimination property (each draw is
+* explained by some weakening), plus one adequacy property for the schema.
+*
+* Names follow the house convention: `∀b_<generator>_⊥`, `∀g_<generator>_discriminates`,
+* `∀s_<schema>_adequate` — disjoint from `ruleOfSchemas`' `∀x_<name>_=x` pair.
+*/
+const refutes = (schema, generators) => {
+	const obligations = obligationsOf(schema);
+	const name = AST.resolveIdentifier(schema.ast) ?? String(schema.ast);
+	const decode = Schema.decodeUnknownExit(schema);
+	for (const [generator, arbitrary] of Object.entries(generators)) {
+		it.prop(`∀b_${generator}_⊥`, [arbitrary], ([value]) => Exit.isFailure(decode(value)));
+		it.prop(`∀g_${generator}_discriminates`, [arbitrary], ([value]) => discriminates(schema, obligations, value));
+	}
+	it("∀s_" + name + "_adequate", () => {
+		const report = adequacyReport(schema, generators);
+		expect(report.message).toBe("");
+	});
+};
+//#endregion
+//#region src/RuleOfSchemas.ts
 /**
 * Property-test the round-trip and encode-stability laws of any Effect Schema.
 *
@@ -25,22 +355,23 @@ const boundedUnion = (identifier, options) => {
 * Use inside a `describe` block to scope the generated tests.
 */
 const ruleOfSchemas = (name, schema) => {
-	const decodeEither = Schema.decodeEither(schema);
+	const decodeExit = Schema.decodeExit(schema);
 	const encodeSync = Schema.encodeSync(schema);
-	const typeEq = Schema.equivalence(schema);
-	const encodedEq = Schema.equivalence(Schema.encodedSchema(schema));
-	it.prop(`∀x_${name}Enc_=x`, [schema], ([value]) => {
+	const typeEq = Schema.toEquivalence(schema);
+	const encodedEq = Schema.toEquivalence(Schema.toEncoded(schema));
+	const arbitrary = Schema.toArbitrary(schema)(FastCheck);
+	it.prop(`∀x_${name}Enc_=x`, [arbitrary], ([value]) => {
 		const encoded = encodeSync(value);
-		const result = decodeEither(encoded);
-		if (Either.isLeft(result)) return false;
-		const reencoded = encodeSync(result.right);
+		const result = decodeExit(encoded);
+		if (Exit.isFailure(result)) return false;
+		const reencoded = encodeSync(result.value);
 		return encodedEq(reencoded, encoded);
 	});
-	it.prop(`∀x_${name}_=x`, [schema], ([value]) => {
+	it.prop(`∀x_${name}_=x`, [arbitrary], ([value]) => {
 		const encoded = encodeSync(value);
-		const result = decodeEither(encoded);
-		return Either.isRight(result) && typeEq(result.right, value);
+		const result = decodeExit(encoded);
+		return Exit.isSuccess(result) && typeEq(result.value, value);
 	});
 };
 //#endregion
-export { boundedUnion, ruleOfSchemas };
+export { WITNESS_BUDGET, adequacyReport, armsOf, boundedUnion, dischargedBy, discriminates, obligationsOf, refutes, ruleOfSchemas, scanObligations };

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@systemfsoftware/effect-schema-law",
-  "license": "MIT",
-  "version": "0.6.0",
+  "license": "Apache-2.0",
+  "version": "0.7.0",
   "author": "Ryan Lee <drdgvhbh@gmail.com>",
   "repository": {
     "type": "git",
@@ -36,24 +36,24 @@
     "dist"
   ],
   "devDependencies": {
-    "@effect/vitest": "0.30.0",
+    "@effect/vitest": "4.0.0-rc.108",
     "@microsoft/api-extractor": "^7.58.7",
+    "@systemfsoftware/arethetypeswrong-cli": "^1.1.1",
     "@types/node": "^24",
-    "effect": "^3.22.0",
-    "fast-check": "^3",
+    "effect": "4.0.0-rc.108",
+    "fast-check": "^4",
+    "oxlint": "^1.77.0",
     "rimraf": "^6.1.3",
-    "tsdown": "^0.22.9",
-    "vite-tsconfig-paths": "^6.1.1",
-    "vitest": "^4",
-    "@systemfsoftware/arethetypeswrong-cli": "^1.1.0",
+    "tsdown": "^0.22.14",
+    "vitest": "^4.1.10",
     "@systemfsoftware/oxlint-config": "^0.1.0",
-    "@systemfsoftware/effect-gherkin-spec": "^0.5.0",
-    "@systemfsoftware/vitest-config": "^0.1.0",
-    "@systemfsoftware/tsconfig": "^1.2.6"
+    "@systemfsoftware/tsconfig": "^1.3.2",
+    "@systemfsoftware/effect-gherkin-spec": "^1.0.0",
+    "@systemfsoftware/vitest-config": "^0.1.0"
   },
   "peerDependencies": {
-    "@effect/vitest": "0.30.0",
-    "effect": "^3.22.0",
+    "@effect/vitest": "4.0.0-rc.108",
+    "effect": "4.0.0-rc.108",
     "vitest": "*"
   },
   "publishConfig": {
@@ -67,7 +67,7 @@
     "test:run": "vitest run",
     "api:check": "api-extractor run",
     "api:update": "api-extractor run --local",
-    "lint": "oxlint . ${AGENT:+--format=unix --quiet}",
+    "lint": "f=${OXLINT_FORMAT:-${AGENT:+agent}}; oxlint . --format=${f:-default}",
     "attw": "attw --pack ."
   }
 }