Docs / Morphology / Exponence / Containment / SupersetRule

Lexical entries over a containment hierarchy

import Linglib.Morphology.Exponence.Containment.SupersetRule · namespace Morphology

A SupersetRule is a nanosyntax lexical entry over an n-grade containment hierarchy, storing an initial span. By the Superset Principle it spells out every grade its span contains, and spellout (SupersetRule.spellout) selects the matching entry storing the least structure. Elsewhere insertion is spellout over the reversed hierarchy, so the two engines generate the same fully realized patterns, the contiguous ones. On partial patterns they part: spellout gaps propagate upward, Elsewhere gaps downward.

References

Declarations

A nanosyntax lexical entry over an n-grade containment hierarchy stores the constituent [0, spans], with no contextual condition, in the pointer-free idealization of Caha 2009.

structure SupersetRuleL31–38
(n : ℕ) (F : Type u_2) :
Type u_2
  • exponent : F

    The exponent the entry spells out.

  • spans : Fin n

    The upper end of the stored constituent [0, spans].

Derives DecidableEq, Repr.

Used by instExponenceRuleSupersetRuleFin, SupersetRule.applies_iff, SupersetRule.exponent_eq, SupersetRule.applySet_subset_iff, SupersetRule.applySet_ssubset_iff, SupersetRule.spellout, SupersetRule.spellout_realizes, SupersetRule.spellout_eq_none_of_le, SupersetRule.spellout_eq_of_le_spans, SupersetRule.spellout_eq_some_of_filter_of_le, SupersetRule.isContiguous_spellout, SpanRule.toSupersetRule, SupersetRule.Generable

Used in Morphology/Nanosyntax/Lexicalization, Morphology/Nanosyntax/TreeSpellout, Bobaljik2012, Bubnov2026, Dekier2021

L52
L56–58

Superset spellout

Superset spellout realizes at each grade the exponent of the matching entry storing the least structure, the first listed on ties, and none where no entry matches.

@[reducible, inline] abbrev SupersetRule.spelloutL64–67
{n : ℕ} {F : Type u_1} (v : RuleSet (SupersetRule n F)) :
Paradigm n (Option F)

Built from

Used by SupersetRule.spellout_realizes, SupersetRule.spellout_eq_none_of_le, SupersetRule.spellout_eq_of_le_spans, SupersetRule.spellout_eq_some_of_filter_of_le, SupersetRule.isContiguous_spellout, SpanRule.realize_eq_spellout_rev, SupersetRule.Generable

Used in Morphology/Nanosyntax/Lexicalization, Morphology/Nanosyntax/TreeSpellout, Bobaljik2012, Bubnov2026, Dekier2021

L75–79
L86–95

Duality

L122–124
L126–134