RecurrenceLaws.invalid_zero: law of bend-kit-scheduler@0.4.1.0
Import: import bend-kit-scheduler@0.4.1.0/recurrence_laws.bend as RecurrenceLaws
Lines 4-8 of bend-kit-scheduler@0.4.1.0/recurrence_laws.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-scheduler@0.4.1.0/recurrence_laws.bend&start_line=4&end_line=8

import Base
import bend-kit-scheduler@0.4.1.0/recurrence.bend as R

law invalid_zero:
  for previous: Nat
  for completion: Nat
  for cadence: R.Cadence
  {R.plan(previous, completion, 0n, cadence) == None{} : Maybe<&2, R.Plan>}

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=Cadence
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=Plan
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=plan