The unary rules that apply to a daughter of type a.
- ManySorted.Language.LocallyFinite.unaryRules a = ManySorted.Language.LocallyFinite.symbols (ManySorted.Signature.of a)
Used by Interpreter.typeDriven
Docs / Semantics / Composition / Basic
import Linglib.Semantics.Composition.Basic
The rules by which meanings combine are the symbols of a many-sorted language over the semantic types: its binary symbols are the modes of combination and its unary symbols the type shifts. A derivation is a term of the language over typed lexical items, and a structure for the language gives each derivation a value.
A derivation is all the semantics is given, and nothing is assumed of where it comes from: a syntactic theory says which derivations its objects have. One way is type-driven: an interpreter reads a bare structure, the words in their constituency and order with a label at each node, and says which rules a node admits by its label and the types of its daughters, so that the derivations over a bare structure are found from the types alone.
ManySorted.Language.Deriv: the derivations of a type over typed lexical items.ManySorted.Language.LocallyFinite.unaryRules, binaryRules: the rules that apply to given
daughters, and ManySorted.Language.motherTypes, the types they give the mother.Interpreter: the rules a node admits by its label and its daughters' types, and
Interpreter.typeDriven, the interpreter that admits every rule that applies.Interpreter.derivs, Interpreter.values: the derivations over a bare structure, and their
values.Interpreter.derivs matches on the derivations of the daughters and does not project from them:
a projection is unfolded again wherever it is inspected, which made checking a sentence's value
some fifty times dearer. A lexicon gives each word typed items and their values separately. With
the values inside the items, a statement over a model with variables in it is still slow to
check. A language has more than one structure on the same domains, values at an index and values
that depend on it, so a structure is an argument and not an instance.
The unary rules that apply to a daughter of type a.
Used by Interpreter.typeDriven
The binary rules that apply to daughters of types l and r.
Used by ManySorted.Language.motherTypes, Interpreter.typeDriven
Used in Semantics/Composition/Interpret, Semantics/Composition/Rules, ParteeBorschev2001
The types of the mothers that the rules of a language give two daughters.
Built from
Used in Bruening2021, Landau2024a, Roussou2010
A derivation of a type from lexical items of the types W supplies.
Used by ManySorted.Language.Deriv.leaf, ManySorted.Language.Deriv.unary, ManySorted.Language.Deriv.binary, ManySorted.Language.Deriv.realize_unary, ManySorted.Language.Deriv.realize_binary, Interpreter.derivs, Interpreter.values
Used in Semantics/Composition/Constituency, Semantics/Composition/Extension, Semantics/Composition/Interpret, Semantics/Composition/PredicateAbstraction, Semantics/Composition/Readings and 3 more
A lexical item.
Built from
Used by ManySorted.Language.Deriv.realize_leaf, Interpreter.derivs
Used in Semantics/Composition/Constituency, Semantics/Composition/Interpret, Semantics/Composition/Readings, Syntax/CCG/Interface, Barker2027 and 2 more
A unary rule applied to a derivation.
Built from
Used by ManySorted.Language.Deriv.realize_unary
Used in Semantics/Composition/Constituency, Semantics/Composition/Interpret, Semantics/Composition/PredicateAbstraction, Semantics/Composition/Readings, Barker2027 and 2 more
A binary rule applied to two derivations.
Built from
Used by ManySorted.Language.Deriv.realize_binary
Used in Semantics/Composition/Constituency, Semantics/Composition/Interpret, Semantics/Composition/PredicateAbstraction, Syntax/CCG/Interface, Barker2027 and 2 more
Built from ,
Built from ,
A type-driven interpreter for a language of rules: the rules a node admits, by its label and the types of its daughters.
The unary rules a node labelled n over a daughter of type a admits.
The binary rules a node labelled n over daughters of types l and r admits.
Used by Interpreter.typeDriven, Interpreter.derivs, Interpreter.length_derivs_le_one, Interpreter.values, Interpreter.mem_values_binary
Used in Semantics/Composition/CallByValue, Semantics/Composition/Constituency, Semantics/Composition/Extension, Semantics/Composition/Mode, Semantics/Composition/PredicateAbstraction and 8 more
The type-driven interpreter of a language: a node admits every rule that applies to the types of its daughters, whatever its label.
Built from , ,
Used by Interpreter.mem_binary_typeDriven
Used in Semantics/Composition/Extension, Semantics/Composition/Interpret, Semantics/Composition/Readings, Syntax/Minimalist/Verbal/Voice/Denotation, Barker2027 and 6 more
The type-driven interpreter admits every binary rule of the language.
Built from
The derivations over a bare structure that an interpreter admits, given the typed items each word may be.
The definition is too large to print here; read it in the source.
Built from , ,
Used by Interpreter.length_derivs_le_one, Interpreter.values
Used in Semantics/Composition/Constituency, Semantics/Composition/Extension, Semantics/Composition/Readings, Wood2023
Where a node admits at most one rule for given daughters and a word is at most one item, a bare structure has at most one derivation.
Built from ,
The values of the derivations over a bare structure, for a lexicon of typed items whose
values ρ gives. The derivations are found from the types alone.
Built from , ,
Used by Interpreter.mem_values_binary
Used in Semantics/Composition/Extension, Semantics/Composition/Readings, Wood2023
A value of a binary node is the value of a rule the node admits, at values of its daughters.
Built from ,