Adyghe case #
This file defines the cases of Adyghe. Caponigro and Polinsky distinguish three, the absolutive in -r and the ergative and the oblique, which share the suffix -m. A noun without a case suffix is read as non-specific. The oblique marks every indirect argument, each licensed by an applicative head on the verb. Caponigro and Polinsky note an analysis with two cases, absolutive and oblique, built on the identity of the ergative and oblique exponents.
Main definitions #
Adyghe.Case,Adyghe.Case.label: the three cases, and the comparative value each is named for.Adyghe.Case.exponents: the case suffixes of a noun.
References #
@[instance_reducible]
Equations
- Adyghe.instDecidableEqCase x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
@[instance_reducible]
Equations
- Adyghe.instFintypeCase = { elems := { val := ↑Adyghe.Case.enumList, nodup := Adyghe.Case.enumList_nodup }, complete := Adyghe.instFintypeCase._proof_1 }
@[instance_reducible]
Equations
- Adyghe.instReprCase = { reprPrec := Adyghe.instReprCase.repr }
Equations
- Adyghe.instReprCase.repr Adyghe.Case.abs prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Adyghe.Case.abs")).group prec✝
- Adyghe.instReprCase.repr Adyghe.Case.erg prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Adyghe.Case.erg")).group prec✝
- Adyghe.instReprCase.repr Adyghe.Case.obl prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Adyghe.Case.obl")).group prec✝
Instances For
The comparative value a case is named for.
Equations
Instances For
The case suffixes of a noun, the ergative and the oblique syncretic in -m.