`Structured`

definition

show as: view math explainer →

module: IndisputableMonolith.CPM.LNALBridge
domain: CPM
line: 10 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.CPM.LNALBridge on GitHub at line 10.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

used by

formal source

   7open IndisputableMonolith.LNAL
   8
   9/-- A minimal structured-set surrogate: programs that pass static checks. -/
  10def Structured (src : String) : Bool :=
  11  let rep := staticChecks (match parseProgram src with
  12    | .ok code   => code
  13    | .error _   => #[])
  14  rep.ok
  15
  16/-- A toy defect functional (zero when checks pass). -/
  17def Defect (src : String) : Nat := if Structured src then 0 else 1
  18
  19end CPM
  20end IndisputableMonolith

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.