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 Presentation extends Serializable

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

Value Members

  1. def acDestabilized(pres: Presentation): Presentation
  2. def acStabilized(pres: Presentation): Presentation
  3. def apply(rank: Int, ws: String*): Presentation

    gives presentation from rank and strings for words.

  4. def balanced(ws: String*): Presentation
  5. def conj(pres: Presentation, k: Int, l: Int): Presentation
  6. def conjRelators(pres: Presentation, k: Int, l: Int): Presentation
  7. val empty: Presentation
  8. def fromString(s: String): Presentation

    parses string to a presentation.

  9. def id(pres: Presentation): Presentation

    moves implemented as functions

  10. def inv(pres: Presentation, k: Int): Presentation
  11. def lftmult(pres: Presentation, k: Int, l: Int): Presentation
  12. def rtmult(pres: Presentation, k: Int, l: Int): Presentation
  13. implicit def rw: upickle.default.ReadWriter[Presentation]
  14. def trivial(n: Int): Presentation
  15. def ttzStab(pres: Presentation): Presentation
  16. def weight(wrdCntn: Double): (Presentation) => Double

    weight where number of relations is fixed.