Composition root wiring the frontend, runtime, host and package layers: - Project loader: deterministic project-root discovery, explicit front-matter imports only (`@dependency` or relative `.mq.md`), recursive module loading with cycle diagnostics, resolved import edges and cross-module call checks. Loading never executes anything. - run/call: sandbox mode enforcement (strict refuses when unavailable), explicit capability grants, fuel/stack/output/timeout overrides, typed `--arg name=value` constants, program stdout separated from diagnostics, and machine-readable JSON output that embeds program output without mixing. - check: static diagnostics only, human-readable locations with source lines and stable machine codes in JSON. - inspect: canonical AST, heading units, signatures (explicit/inferred), executable IR, static reference edges (including cross-file links analysed without execution) and platform capability report. - fmt: conservative, AST-preserving normalisation of line endings and trailing newlines; --check mode. - plugin inspect: manifest/ABI/artifact validation and hash verification, never loading plugin code. - init: minimal project (manifest, entry document, .gitignore). - lock/sync --locked: deterministic path-dependency lockfile, stale lock or changed dependency content is an error (no silent upgrades). - examples: hello, factorial, math formula, Python foreign call, static references and a two-module project with an explicit import.
20 lines
218 B
Markdown
20 lines
218 B
Markdown
# 数学
|
|
|
|
## 阶乘
|
|
|
|
定义:
|
|
|
|
$$
|
|
n! = \begin{cases}1,& n\le1\\n(n-1)!,& n>1\end{cases}
|
|
$$
|
|
|
|
1. `n <= 1`,递归终点。
|
|
|
|
*1*
|
|
|
|
2. `n > 1`,计算更小的问题。
|
|
|
|
**结果 = n * 阶乘(n=n-1)**
|
|
|
|
*结果*
|