Packages

sealed trait MathExpr extends AnyRef

Expression in a language to represent terms in HoTT and trees representing them in prose, including partially collapsed trees. At the level of structure, we do not make distinctions between words and phrases; the distinction is specific to trees, where a word is a leaf.

We model expressions that will mostly become Terms in HoTT, mostly following Naproche. At the upper level are sentential phrases. We typically start with a tree that encodes a sentential phrase.

Linear Supertypes
AnyRef, Any
Known Subclasses
Leaf, Node, Vec, AP, AreAdj, ConjSP, ConjunctNP, ConjunctSP, Core, DP, A, Card, Every, No, Some, That, The, This, Zero, DisjSP, DisjunctNP, DisjunctSP, ExistentialSP, Exists, ForAllSP, Formula, IfThen, Iff, IsAdj, IsAdjPrep, IsNoun, IsPrep, IsSuchThat, It, JJ, JJPP, NN, NP, NPVP, NegSP, NegVP, PP, Prep, By, From, In, Into, Modulo, Of, Over, To, Under, With, SP, SuchThat, ThatIsSP, They, VB, VP, VPIf, Variable, VerbAdj, VerbObj, VerbPP, Which, BiEquationalDefinition, BiEquationalDefinitionSP, BiImplicationDefiniendum, BiImplicationDefiniendumSP, CopulaDefiniendum, CopulaDefiniendumNP, CopulaDefinition, CopulaDefinitionSP, Raw
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MathExpr
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected