Docs / Phonology / Prosody / Structure / Tree
Tree-shaped structures are trees
import Linglib.Phonology.Prosody.Structure.Tree · namespace Prosody.Structure.IsTree
A finite tree-shaped prosodic structure is the structure of a
tree, so that with
Prosody.Structure.nonempty_iso_ofTree_iff the ordered trees are, up to isomorphism, exactly
the finite tree-shaped structures. The tree is built from the root: the daughters of a node are
the nodes covering it, listed in their order of precedence, and an address is followed through
those lists to the node it names.
Declarations
The daughters of a node, the nodes covering it, in order of precedence.
- h.daughters a = ⋯.choose
Used by mem_daughters, pairwise_daughters, toTree_eq, walk, walk_cons, walk_singleton
The tree of a node: its label over the trees of its daughters, in order of precedence.
The definition is too large to print here; read it in the source.
Used by toTree_eq, getElem?_toTree, walk_isSome, nodeAt, walk_nodeAt, value_subtree
The node reached from a by following an address through the daughters.
Built from
Used by walk_nil, walk_cons, walk_append, walk_append_eq_some, walk_singleton, le_of_walk, lt_of_walk_cons, eq_nil_of_walk_eq_some_self, exists_walk_eq_some, getElem?_toTree, walk_isSome, le_of_walk_of_le, precedes_of_walk, le_of_walk_of_le_node, precedes_of_walk_of_precedes, nodeAt, walk_nodeAt
Built from ,
The node at a position of the tree of a.
Built from ,
Used by walk_nodeAt, value_subtree
A finite tree-shaped structure is the structure of a tree.