Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
Authoring .ftr.md Rules
The shortest reliable path for writing theorem families and monotonicity descriptors that remain readable, diagnosable, and replayable.
Use YAML frontmatter for compiled data and Markdown body text for exposition. Match, Result, Conditions, Applicability, and Rewrite contain Wolfram InputForm block scalars. LaTeX in the body is explanatory and is not compiled.
---SchemaVersion:1Kind:TransformFamilyName:ExampleTags:[Inequality,MeasureSpace]Conditions:|{}Variants:-Name:UpperMatch:Abs
[f_,x_,mu_]Result:Abs
[f,x,mu]≤
[f,1,mu]---
 | MeasureIntegral |
 | MeasureIntegral |
| LpNorm |
Write ordinary Wolfram multiplication and slots such as x_. Binder positions come from the primitive specification; repeated named slots are unified. See and .
Declare rule parameters in Parameters and mathematical hypotheses in Conditions. Use propositions such as , , , and ; do not construct function-space objects.
Use GeneratedParameters for theorem constants. The runtime represents them with . Result-only binders are inferred when they are lexically scoped.
A Heuristic is a family-scoped, equality-valued Preparation step with a total structural Applicability predicate. Representation normalization stays in the compiler/runtime canonicalizer; mathematical bridges remain ordinary theorem variants.
Run lint_ftr.wls while editing. returns exact source locations; and validate the two strict schemas.
wolframscript-file.\lint_ftr.wls.\Registry\Sources\Example.ftr.mdwolframscript-file.\compile_rules.wlswolframscript-file.\build_rules.wlswolframscript-file.\run_tests.wls
Keep names stable; use only declared symbols; prefer native inert Wolfram heads; add a package primitive only for a real missing semantic boundary; state hypotheses explicitly; keep Meta nonsemantic; add positive, negative, compilation, and replay tests.
""