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 andrewscurtis
    Definition Classes
    provingground
  • object FreeGroups
    Definition Classes
    andrewscurtis
  • Presentation
  • Word

object Word extends Serializable

Linear Supertypes
Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Word
  2. Serializable
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. def apply(w: String): Word

    word from a string.

  2. val e: Word

    the identity

  3. implicit val freeGroup: Group[Word]
  4. def fromString(s: String): Word

    word from a string.

  5. def isParsable(s: Vector[Char]): Boolean

    sanity checker for listFromChars.

    sanity checker for listFromChars. to add further checks later.

  6. def listFromChars(s: Vector[Char]): Vector[Int]

    helper for fromString

  7. implicit def rw: upickle.default.ReadWriter[Word]