mirror of
https://github.com/NixOS/nix.git
synced 2025-11-08 11:36:03 +01:00
Progress on #13405, which asks for an explicit characterisation of the equivalence relation like the one given here. Also progress on #11895, because we're using the term "build trace entry" instead of "realisation". Mention #9259, a future work item. Co-authored-by: Robert Hensing <roberth@users.noreply.github.com>
590 B
590 B
Appendix: Math notation
A few times in this manual, formal "proof trees" are used for natural deduction-style definition of various relations.
The following grammar and assignment of metavariables to syntactic categories is used in these sections.
\begin{align} s, t &\in \text{store-path} \\ o &\in \text{output-name} \\ i, p &\in \text{deriving-path} \\ d &\in \text{derivation} \end{align}
\begin{align} \text{deriving-path} \quad p &::= s \mid (p, o) \end{align}