Boundness

Morphological boundness of a lexical item: a free word versus a bound clitic or suffix. A general per-entry morphological feature, not specific to any one construction — relevant to acquisition ([Cla17] argues free morphemes are acquired more readily than bound ones) and to coordination typology ([MS16]), among others.

inductive Boundness : Type

Morphological boundness: free word vs bound clitic/suffix.

• free : Boundness

  Independent word (Hungarian "is", English "and").

• bound : Boundness

  Clitic or suffix (Georgian "-c", Latin "-que").

@[implicit_reducible]

instance instDecidableEqBoundness : DecidableEq Boundness

Equations

• instDecidableEqBoundness x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[implicit_reducible]

instance instReprBoundness : Repr Boundness

Equations

• instReprBoundness = { reprPrec := instReprBoundness.repr }

def instReprBoundness.repr : Boundness → Nat → Std.Format

Equations

• instReprBoundness.repr Boundness.free prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Boundness.free")).group prec✝
• instReprBoundness.repr Boundness.bound prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Boundness.bound")).group prec✝

def instBEqBoundness.beq : Boundness → Boundness → Bool

Equations

• instBEqBoundness.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)

@[implicit_reducible]

instance instBEqBoundness : BEq Boundness

Equations

• instBEqBoundness = { beq := instBEqBoundness.beq }