fpf.tools
Library / Mathematical Thinking DPF
Jump to passage
In this reading
Source · lines 904–914

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 11:52:20 UTC · snapshot created 2026-10-03 11:53:41 UTC · last check 2026-10-03 14:30:10 UTC

MATH.1:7 - Conformance Checklist

  • Can the reader identify each generator’s source and target?
  • Does each constructed path satisfy the adjacent-endpoint condition, including any action-changing refinement such as permission?
  • Are empty paths attached to their objects and composition defined in one stated order?
  • Are the claimed identity and associativity laws supported by the construction used?
  • Does the returned path retain the detail required by its next use? If only a cost, length or class is returned, is that sufficient for the receiving question?
  • When a connection fails, is the missing or incompatible endpoint recoverable without inventing an available generator?

These questions assess the construction in use. They do not require a separate record for each path.