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
  • object FiniteDistributionLearner

    A combinator for learning systems with state finite distributions on vertices.

    A combinator for learning systems with state finite distributions on vertices. Systems are built from components labeled by elements of a set M. The state also has weights for these components. The components are built from: moves (partial functions), partial combinations and islands.

    Definition Classes
    learning
  • Atom
  • CombinationFn
  • Evaluate
  • ExtendM
  • MoveFn
  • NewVertex
  • NormalizeFD
  • ProjectV
  • PtwiseProd
  • Sample

case class Evaluate[V](x: V) extends AdjDiffbleFunction[FiniteDistribution[V], Double] with Product with Serializable

Evaluation at a point for a finite distribution

Linear Supertypes
Serializable, Product, Equals, AdjDiffbleFunction[FiniteDistribution[V], Double], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Evaluate
  2. Serializable
  3. Product
  4. Equals
  5. AdjDiffbleFunction
  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 Evaluate(x: V)

Value Members

  1. def **:(that: (FiniteDistribution[V]) => Double): (FiniteDistribution[V]) => FiniteDistribution[V]

    post-compose by the gradient of this, for instance for a feedback.

    post-compose by the gradient of this, for instance for a feedback.

    Definition Classes
    AdjDiffbleFunction
  2. def *:[C](that: => AdjDiffbleFunction[Double, C]): AdjDiffbleFunction[FiniteDistribution[V], C]

    Composition f *: g is f(g(_))

    Composition f *: g is f(g(_))

    Definition Classes
    AdjDiffbleFunction
  3. def ^:(that: (Double) => Double): (FiniteDistribution[V]) => FiniteDistribution[V]

    Conjugate that by this.

    Conjugate that by this.

    Definition Classes
    AdjDiffbleFunction
  4. val adjDer: (FiniteDistribution[V]) => (Double) => FiniteDistribution[V]
    Definition Classes
    Evaluate → AdjDiffbleFunction
  5. def andthen[C](that: => AdjDiffbleFunction[Double, C]): AdjDiffbleFunction[FiniteDistribution[V], C]
    Definition Classes
    AdjDiffbleFunction
  6. def apply(a: FiniteDistribution[V]): Double
    Definition Classes
    AdjDiffbleFunction
  7. val func: (FiniteDistribution[V]) => Double
    Definition Classes
    Evaluate → AdjDiffbleFunction
  8. def oplus[C, D](that: AdjDiffbleFunction[C, D]): Oplus[FiniteDistribution[V], Double, C, D]
    Definition Classes
    AdjDiffbleFunction
  9. def productElementNames: Iterator[String]
    Definition Classes
    Product
  10. val x: V