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 scalahott
    Definition Classes
    provingground
  • object LinNormBound
    Definition Classes
    scalahott
  • ConjGen
  • Gen
  • PowerBound
  • Triang

case class Gen(n: Int) extends LinNormBound with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, LinNormBound, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Gen
  2. Serializable
  3. Product
  4. Equals
  5. LinNormBound
  6. AnyRef
  7. 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 Gen(n: Int)

Value Members

  1. def *:(n: Int): LinNormBound
    Definition Classes
    LinNormBound
  2. def ++(that: LinNormBound): LinNormBound
    Definition Classes
    LinNormBound
  3. def +:(n: Int): LinNormBound
    Definition Classes
    LinNormBound
  4. val bnd: QField.LocalTerm with Subs[QField.LocalTerm]
    Definition Classes
    LinNormBound
  5. val bound: Rational
    Definition Classes
    LinNormBound
  6. val el: FreeGroup.LocalTerm
    Definition Classes
    LinNormBound
  7. lazy val fullProof: Term
    Definition Classes
    LinNormBound
  8. lazy val fullTheorem: Typ[Term]
    Definition Classes
    LinNormBound
  9. val n: Int
  10. def productElementNames: Iterator[String]
    Definition Classes
    Product
  11. lazy val proof: PosWit
    Definition Classes
    LinNormBound
  12. lazy val theorem: Pos
    Definition Classes
    LinNormBound
  13. val toString: String
    Definition Classes
    Gen → AnyRef → Any
  14. lazy val wit: PosWit
    Definition Classes
    GenLinNormBound
  15. val word: Word
    Definition Classes
    LinNormBound