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

case class MixedJunction[I, O, X[_]](split: (I) => Option[X[I]], build: (X[I], X[O]) => Option[O])(implicit evidence$2: Traverse[X]) extends Translator[I, O] with Product with Serializable

A mixed junction given by splitting optionally to a given shape, and building from the same shape using both the input and its traslation.

The shape is functorial, typically made of tuples and lists, and Option gives a natural transformation. These allow applying the recursive translator on the components.

Linear Supertypes
Serializable, Product, Equals, Translator[I, O], (I) => Option[O], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MixedJunction
  2. Serializable
  3. Product
  4. Equals
  5. Translator
  6. Function1
  7. AnyRef
  8. Any
Implicitly
  1. by UnliftOps
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new MixedJunction(split: (I) => Option[X[I]], build: (X[I], X[O]) => Option[O])(implicit arg0: Traverse[X])

Value Members

  1. def andThen[A](g: (Option[O]) => A): (I) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  2. def apply(inp: I): Option[O]
    Definition Classes
    Translator → Function1
  3. val build: (X[I], X[O]) => Option[O]
  4. def compose[A](g: (A) => I): (A) => Option[O]
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def elseOr(that: Translator[I, O]): OrElse[I, O]

    OrElse combinator, tries other translator first, then this one.

    OrElse combinator, tries other translator first, then this one. Other translator must be preprended

    Definition Classes
    Translator
  6. def flip: (X[Option[O]]) => Option[X[O]]
  7. def map[X](fn: (O) => X, ufn: (X) => O): Mapped[I, O, X]
    Definition Classes
    Translator
  8. def orElse(that: Translator[I, O]): OrElse[I, O]

    OrElse combinator, tries other translator if the first fails.

    OrElse combinator, tries other translator if the first fails.

    Definition Classes
    Translator
  9. def productElementNames: Iterator[String]
    Definition Classes
    Product
  10. def recTranslate(leafMap: => (I) => Option[O]): (I) => Option[O]
    Definition Classes
    MixedJunction → Translator
  11. val split: (I) => Option[X[I]]
  12. def toString(): String
    Definition Classes
    Function1 → AnyRef → Any
  13. def unlift: PartialFunction[I, O]
    Implicit
    This member is added by an implicit conversion from MixedJunction[I, O, X] toUnliftOps[I, O] performed by method UnliftOps in scala.Function1.
    Definition Classes
    UnliftOps
  14. def ||(that: Translator[I, O]): OrElse[I, O]

    OrElse combinator, tries other translator if the first fails.

    OrElse combinator, tries other translator if the first fails.

    Definition Classes
    Translator
  15. def ||:(that: Translator[I, O]): OrElse[I, O]

    OrElse combinator, tries other translator first, then this one.

    OrElse combinator, tries other translator first, then this one. Other translator must be preprended

    Definition Classes
    Translator