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 FiberProduct[A, Q, B](base: ProbabilityDistribution[A], quotient: (A) => Q, fibers: (Q) => 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. FiberProduct
  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 FiberProduct(base: ProbabilityDistribution[A], quotient: (A) => Q, fibers: (Q) => ProbabilityDistribution[B])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from FiberProduct[A, Q, B] toany2stringadd[FiberProduct[A, Q, B]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (FiberProduct[A, Q, B], B)
    Implicit
    This member is added by an implicit conversion from FiberProduct[A, Q, B] toArrowAssoc[FiberProduct[A, Q, B]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. 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
  6. 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
  7. 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
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. val base: ProbabilityDistribution[A]
  11. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  12. def condMap[B](f: ((A, B)) => Option[B]): ProbabilityDistribution[B]
    Definition Classes
    ProbabilityDistribution
  13. def conditioned(p: ((A, B)) => Boolean): ProbabilityDistribution[(A, B)]
    Definition Classes
    ProbabilityDistribution
  14. def ensuring(cond: (FiberProduct[A, Q, B]) => Boolean, msg: => Any): FiberProduct[A, Q, B]
    Implicit
    This member is added by an implicit conversion from FiberProduct[A, Q, B] toEnsuring[FiberProduct[A, Q, B]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  15. def ensuring(cond: (FiberProduct[A, Q, B]) => Boolean): FiberProduct[A, Q, B]
    Implicit
    This member is added by an implicit conversion from FiberProduct[A, Q, B] toEnsuring[FiberProduct[A, Q, B]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  16. def ensuring(cond: Boolean, msg: => Any): FiberProduct[A, Q, B]
    Implicit
    This member is added by an implicit conversion from FiberProduct[A, Q, B] toEnsuring[FiberProduct[A, Q, B]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  17. def ensuring(cond: Boolean): FiberProduct[A, Q, B]
    Implicit
    This member is added by an implicit conversion from FiberProduct[A, Q, B] toEnsuring[FiberProduct[A, Q, B]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  18. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. def fibProduct[Q, B](quot: ((A, B)) => Q, fibers: (Q) => ProbabilityDistribution[B]): FiberProduct[(A, B), Q, B]
    Definition Classes
    ProbabilityDistribution
  20. val fibers: (Q) => ProbabilityDistribution[B]
  21. 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
  22. def flatMap[B](f: ((A, B)) => ProbabilityDistribution[B]): ProbabilityDistribution[B]
    Definition Classes
    ProbabilityDistribution
  23. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from FiberProduct[A, Q, B] toStringFormat[FiberProduct[A, Q, B]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  24. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. def map[B](f: ((A, B)) => B): ProbabilityDistribution[B]
    Definition Classes
    ProbabilityDistribution
  27. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  28. def next: (A, B)

    the next random value

    the next random value

    Definition Classes
    FiberProduct → ProbabilityDistribution
  29. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  31. def product[B](that: ProbabilityDistribution[B]): Product[(A, B), B]
    Definition Classes
    ProbabilityDistribution
  32. def productElementNames: Iterator[String]
    Definition Classes
    Product
  33. val quotient: (A) => Q
  34. def randomVariable: Iterator[(A, B)]
    Definition Classes
    ProbabilityDistribution
  35. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  36. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  37. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  38. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  2. def →[B](y: B): (FiberProduct[A, Q, B], B)
    Implicit
    This member is added by an implicit conversion from FiberProduct[A, Q, B] toArrowAssoc[FiberProduct[A, Q, B]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from Serializable

Inherited from scala.Product

Inherited from Equals

Inherited from ProbabilityDistribution[(A, B)]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromFiberProduct[A, Q, B] to any2stringadd[FiberProduct[A, Q, B]]

Inherited by implicit conversion StringFormat fromFiberProduct[A, Q, B] to StringFormat[FiberProduct[A, Q, B]]

Inherited by implicit conversion Ensuring fromFiberProduct[A, Q, B] to Ensuring[FiberProduct[A, Q, B]]

Inherited by implicit conversion ArrowAssoc fromFiberProduct[A, Q, B] to ArrowAssoc[FiberProduct[A, Q, B]]

Ungrouped