Packages

  • package root
    Definition Classes
    root
  • package provingground

    This is work towards automated theorem proving based on learning, using homotopy type theory (HoTT) as foundations and natural language processing.

    This is work towards automated theorem proving based on learning, using homotopy type theory (HoTT) as foundations and natural language processing.

    The implementation of homotopy type theory is split into:

    • the object HoTT with terms, types, functions and dependent functions, pairs etc
    • the package induction with general inductive types and recursion/induction on these.

    The learning package has the code for learning.

    Scala code, including the spire library, is integrated with homotopy type theory in the scalahott package

    We have implemented a functor based approach to translation in the translation package, used for nlp as well as serialization and parsing.

    The library package is contains basic structures implemented in HoTT.

    Definition Classes
    root
  • package translation

    Translation primarily using a functorial framework - see Translator$, for natural language processing as well as serialization, formatted output, parsing, interface with formal languages etc.

    Translation primarily using a functorial framework - see Translator$, for natural language processing as well as serialization, formatted output, parsing, interface with formal languages etc.

    Besides the Translator framework and helper typeclasses is Functors, several structures for concrete languages including our implementation of HoTT are in this package.

    Definition Classes
    provingground
  • object Translator

    General functorial framework for translation.

    General functorial framework for translation.

    Translators with I the input type and O the output type are primarily built from Junctions

    • a pattern which map I => Option[X[O]], with X[_] a functor with traverse, e.g. a tuple or a vector.
    • a builder O => Option[I] to avoid having to specify types too many types, traits Pattern and Builder are defined.

    We also have simpler translators for literals and also wrapping translators for a component type.

    Definition Classes
    translation
  • Builder
  • Empty
  • Junction
  • Mapped
  • MixedJunction
  • OrElse
  • Pattern
  • PolyJunction
  • Simple
  • VarWord

class Pattern[I, X[_]] extends AnyRef

The splitting part of a junction, pattern matching and splitting to a given shape. Crucially, the shape X[_] is determined, so junctions can be built from this, after possibly mapping.

Linear Supertypes
AnyRef, Any
Known Subclasses
Decompose, OrElse, Partial, ConjunctNP, ConjunctSP, DPBase, DPBaseQuant, DPBaseQuantZero, DPBaseZero, DPPPWhich, DPQuant, DPWhich, Det, DisjunctNP, DisjunctSP, DropNP, DropRoot, ExistSP, Exists, IN, IfClause, IfNode, IfSplit, IfTree, IfTreeSent, Iff, It, JJ, JJPP, MD, NN, NNP, NP, NPPP, NPPPWH, NPVP, NPWH, NegVP, PP, Purge, QP, SimpleNPVP, Then, ThenSent, They, VB, VP, VPIf, VerbAdj, VerbNegAdj, VerbNegObj, VerbObj, VerbPP, Which
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Pattern
  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

Instance Constructors

  1. new Pattern(split: (I) => Option[X[I]])(implicit arg0: Traverse[X])

Value Members

  1. def :>>[O](build: (X[I], X[O]) => Option[O]): MixedJunction[I, O, X]
  2. def :>>>[O](build: (X[I], X[O]) => O): MixedJunction[I, O, X]
  3. def >>[O](build: (X[O]) => Option[O]): Junction[I, O, X]
  4. def >>>[O](build: (X[O]) => O): Junction[I, O, X]
  5. def join[O](build: (X[O]) => Option[O]): Junction[I, O, X]
  6. def joinStrict[O](build: (X[O]) => O): Junction[I, O, X]
  7. def map[J](f: (I) => I): Pattern[I, X]
  8. def mixedJoin[O](build: (X[I], X[O]) => Option[O]): MixedJunction[I, O, X]
  9. def mixedJoinStrict[O](sbuild: (X[I], X[O]) => O): MixedJunction[I, O, X]
  10. def unapply(x: I): Option[X[I]]
  11. def ||(that: Pattern[I, X]): Pattern.OrElse[I, [_]X[_]]