docs

vic · vic · commit 20b1cd626177 · 2026-05-12T18:24:13.000-06:00
diff --git a/README.md b/README.md
@@ -14,7 +14,7 @@
 Bend draws from Haskell profunctor optics, Scala's `Either`, the `adapt` primitive from [denful/nfx](https://github.com/denful/nfx) and parser-combinators.
 
 The core idea is [Parse, Don't Validate](https://lexi-lambda.github.io/blog/2019/11/05/parse-don-t-validate/): a validator for non-empty lists that returns `true` is discarding the proof it just computed; instead if the function returns `left empty` or `right { head; tail; }`, the data structure *is* the proof.
-Every lens either refines its input (`right`) or returns the original unchanged (`left`).
+Every lens either refines data as proof on `right` or returns invalid data on `left`.
 
 
 Bend’s combinator names deliberately match parser-combinator vocabulary:
diff --git a/docs/src/content/docs/index.mdx b/docs/src/content/docs/index.mdx
@@ -32,7 +32,7 @@ import { Card, CardGrid, Aside, LinkButton } from '@astrojs/starlight/components
 Bend draws from Haskell profunctor optics, Scala's `Either`, the `adapt` primitive from [denful/nfx](https://github.com/denful/nfx) and parser-combinators.
 
 The core idea is [Parse, Don't Validate](https://lexi-lambda.github.io/blog/2019/11/05/parse-don-t-validate/): a validator for non-empty lists that returns `true` is discarding the proof it just computed; instead if the function returns `left empty` or `right { head; tail; }`, the data structure *is* the proof.
-Every lens either refines its input (`right`) or returns the original unchanged (`left`).
+Every lens either refines data as proof on `right` or returns invalid data on `left`.
 
 Bend’s combinator names deliberately match parser-combinator vocabulary:
 This is not cosmetic. The names signal that [Bend is a parser combinator library](/explanation/validation-is-parsing), one that operates on Nix data structures instead of character streams, and that happens to also support bidirectional writes.
