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 learning
    Definition Classes
    provingground
  • trait ExpressionEquationSolver extends AnyRef

    Solve equations based on expressions (approximately), and compute various related quantities The actual solving is done after translating the equations to ones based on indices, for the sake of efficiency.

    Solve equations based on expressions (approximately), and compute various related quantities The actual solving is done after translating the equations to ones based on indices, for the sake of efficiency. Other methods let one construct new expression-equation-solvers, including by export.

    Definition Classes
    learning
  • FixedExpressionProbs

case class FixedExpressionProbs(p: Map[Expression, Double]) extends Product with Serializable

Linear Supertypes
Serializable, Product, Equals, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. FixedExpressionProbs
  2. Serializable
  3. Product
  4. Equals
  5. AnyRef
  6. 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 FixedExpressionProbs(p: Map[Expression, Double])

Value Members

  1. def backMap(exp: Expression): Map[Expression, Double]
  2. def entropyProjection(hW: Double = 1, klW: Double = 1): Vector[Double]

    Composite entropy projected perpendicular to the equations.

  3. def entropyProjectionTask(hW: Double = 1, klW: Double = 1): Task[Vector[Double]]
  4. lazy val eqnGradients: Vector[Vector[Double]]

    Gradients of equations for expression

  5. lazy val eqnGradientsTask: Task[Vector[Vector[Double]]]
  6. def expressionGeneratorsTask(exp: Expression): Task[Vector[(Term, Double)]]
  7. def expressionProjectionTask(exp: Expression): Task[Vector[Double]]
  8. def flatEntropyProjectionTask(pow: Double, hW: Double = 1, klW: Double = 1): Task[Vector[Double]]
  9. def fullBackMap(base: Map[Expression, Double], cutoff: Double): Map[Expression, Double]
  10. def fullBackMapExp(exp: Expression, cutoff: Double): Map[Expression, Double]
  11. def jet(expr: Expression): Jet[Double]

    Recursive jet for an expression, with variables transformed by sigmoid.

  12. def jetCoordinates(jt: Jet[Double]): Map[Expression, Double]
  13. def jetTask(expr: Expression): Task[Jet[Double]]
  14. lazy val onEqnGradientsTask: Task[Vector[Vector[Double]]]
  15. val p: Map[Expression, Double]
  16. def productElementNames: Iterator[String]
    Definition Classes
    Product
  17. final def recFullBackMap(base: Map[Expression, Double], cutoff: Double, accum: Map[Expression, Double]): Map[Expression, Double]
    Annotations
    @tailrec()
  18. lazy val spireVarProbs: Map[Expression, Jet[Double]]
  19. lazy val typGradGeneratorsTask: Map[Typ[Term], Task[Vector[(Term, Double)]]]