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
  • object ProbabilityDistribution
    Definition Classes
    provingground
  • CondMapped
  • Conditioned
  • FiberProduct
  • FlatMapped
  • Flattened
  • Mapped
  • Mixin
  • MixinOpt
  • Mixture
  • Product
  • Scaled
  • Sum

case class Product[A, B](first: ProbabilityDistribution[A], second: ProbabilityDistribution[B]) extends ProbabilityDistribution[(A, B)] with scala.Product with Serializable

Linear Supertypes
Serializable, scala.Product, Equals, ProbabilityDistribution[(A, B)], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Product
  2. Serializable
  3. Product
  4. Equals
  5. ProbabilityDistribution
  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 Product(first: ProbabilityDistribution[A], second: ProbabilityDistribution[B])

Value Members

  1. def <++>(components: => Vector[Weighted[ProbabilityDistribution[(A, B)]]]): Mixture[(A, B)]

    mix in weighted distributions; the mixed in distributions are called by name, so can depend on this distribution.

    mix in weighted distributions; the mixed in distributions are called by name, so can depend on this distribution.

    Definition Classes
    ProbabilityDistribution
  2. def <+>(mixin: => ProbabilityDistribution[(A, B)], weight: Double): Mixin[(A, B)]

    generates from the mixed in distribution with probability _weight_, otherwise defaults to this distribution; as the mixed in distribution is called by name, it may depend on the present one.

    generates from the mixed in distribution with probability _weight_, otherwise defaults to this distribution; as the mixed in distribution is called by name, it may depend on the present one.

    Definition Classes
    ProbabilityDistribution
  3. def <+?>(mixin: => ProbabilityDistribution[Option[(A, B)]], weight: Double): MixinOpt[(A, B)]

    generates from the mixed in optional valued distribution with probability weight, otherwise, or if the optional returns None, defaults to this distribution; the mixed in distribution is call by name, so may depend on this distribution.

    generates from the mixed in optional valued distribution with probability weight, otherwise, or if the optional returns None, defaults to this distribution; the mixed in distribution is call by name, so may depend on this distribution.

    Definition Classes
    ProbabilityDistribution
  4. def condMap[B](f: ((A, B)) => Option[B]): ProbabilityDistribution[B]
    Definition Classes
    ProbabilityDistribution
  5. def conditioned(p: ((A, B)) => Boolean): ProbabilityDistribution[(A, B)]
    Definition Classes
    ProbabilityDistribution
  6. def fibProduct[Q, B](quot: ((A, B)) => Q, fibers: (Q) => ProbabilityDistribution[B]): FiberProduct[(A, B), Q, B]
    Definition Classes
    ProbabilityDistribution
  7. def findFut(p: ((A, B)) => Boolean, maxloops: Long): Future[Option[(A, B)]]

    Find element satisfying predicate, runs concurrently, returning future

    Find element satisfying predicate, runs concurrently, returning future

    Definition Classes
    ProbabilityDistribution
  8. val first: ProbabilityDistribution[A]
  9. def flatMap[B](f: ((A, B)) => ProbabilityDistribution[B]): ProbabilityDistribution[B]
    Definition Classes
    ProbabilityDistribution
  10. def map[B](f: ((A, B)) => B): ProbabilityDistribution[B]
    Definition Classes
    ProbabilityDistribution
  11. def next: (A, B)

    the next random value

    the next random value

    Definition Classes
    Product → ProbabilityDistribution
  12. def product[B](that: ProbabilityDistribution[B]): Product[(A, B), B]
    Definition Classes
    ProbabilityDistribution
  13. def productElementNames: Iterator[String]
    Definition Classes
    Product
  14. def randomVariable: Iterator[(A, B)]
    Definition Classes
    ProbabilityDistribution
  15. val second: ProbabilityDistribution[B]