Coordinators #
A coordinator is a word or clitic that links the coordinands of a coordinate construction, such
as and, or, but and nor. This file defines its lexical record, the morph, which says
whether the coordinator is a free word or a bound clitic or affix, the gloss and the semantic
type, and the relations that give the other uses its form has. What a coordinator denotes, an
operation on the set of coordinands that its semantic type fixes, is Coordinator.denote in
Semantics/Composition/Coordinator.lean.
Main definitions #
Coordinator.Role: the semantic type of a coordinator.Coordinator: the morph, gloss and semantic type of a coordinator.Coordinator.Correlative: a pair of correlative coordinators with the single coordinator of the plain construction.Coordinator.IsAlsoComitative: the coordinator's form is a form of a comitative marker, 'and' is 'with'.Coordinator.IsAlsoAdditive: the coordinator's form is that of an additive particle, 'and' is 'too'.
Implementation notes #
- The other uses of a coordinator's form are relations to entries of other categories, not fields:
a comitative use to a comitative marker of the language, an adposition or a case with its
exponents, an additive use to an
AdditiveParticle, and a quantifier use to anIndeterminateQuantifierof the language whose particle is the coordinator. - Analyses that divide the conjunctive coordinators further, such as the two conjunction heads of Mitrović and Sauerland, classify the entries in their own studies.
References #
A coordinator's semantic type is conjunction, disjunction, adversative or negative coordination.
- conjunctive : Role
Conjunction, English and.
- disjunctive : Role
Disjunction, English or.
- adversative : Role
Adversative coordination, English but.
- negative : Role
Negative coordination, English nor, Latin neque.
Instances For
Equations
- Coordinator.instDecidableEqRole x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Coordinator.instReprRole = { reprPrec := Coordinator.instReprRole.repr }
Equations
- One or more equations did not get rendered due to their size.
- Coordinator.instReprRole.repr Coordinator.Role.negative prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Coordinator.Role.negative")).group prec✝
Instances For
A coordinator of a language. Its denotation is not stored, since its semantic type fixes it,
Coordinator.denote.
- morph : Morphology.Morph
The form, a free word or a clitic or affix bound on one side of its host.
- gloss : String
The gloss.
- role : Role
The semantic type.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- instReprCoordinator = { reprPrec := instReprCoordinator.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
An emphatic coordination with correlative coordinators, English both … and, records the coordinators of the two coordinands and the single coordinator of the plain construction.
- first : List Morphology.Morph
The form on the first coordinand.
- second : List Morphology.Morph
The form on the second coordinand.
- single : Coordinator
The coordinator of the plain construction.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Coordinator.instReprCorrelative = { reprPrec := Coordinator.instReprCorrelative.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
A coordinator is also comitative when its morph is one of the forms ms of a marker whose
case values fs include the comitative, so that 'and' is 'with', [Sta00]'s lexical
identity of the coordinator with the comitative marker. The marker is an adposition, with its
morphs and functions, or a case of the language, with its exponents and functions.
Equations
- c.IsAlsoComitative ms fs = (c.morph ∈ ms ∧ Case.com ∈ fs)
Instances For
Equations
- c.instDecidableIsAlsoComitative ms fs = { decide := decide (c.morph ∈ ms) && decide (Case.com ∈ fs), reflects_decide := ⋯ }
A coordinator is also additive when its morph is that of an additive particle a, so that
'and' is 'too', the identity of the two that [Has97] notes and on which
[MS16a] build.
Equations
- c.IsAlsoAdditive a = (c.morph = a.morph)