RecurrenceLaws.fixed_delay: law of bend-kit-scheduler@0.4.1.0
Import: import bend-kit-scheduler@0.4.1.0/recurrence_laws.bend as RecurrenceLaws
Lines 10-15 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=10&end_line=15

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

law fixed_delay:
  for previous: Nat
  for completion: Nat
  for p: Nat
  {R.plan(previous, completion, 1n+p, R.FixedDelay{}) ==
    Some{R.Planned{Nil{}, Nat.add(completion, 1n+p)}} : Maybe<&2, R.Plan>}

Uses (7):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  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=Base/base.bend&name=Nat.add
  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