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 TruncatedFiniteDistribution extends Serializable
    Definition Classes
    learning
  • Geom

object Geom extends TruncatedFiniteDistribution[VarValueSet[FiniteDistribution]]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Geom
  2. TruncatedFiniteDistribution
  3. Serializable
  4. Product
  5. Equals
  6. GenTruncatedFiniteDistribution
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. def mapsSum[X, Y](first: Map[X, FiniteDistribution[Y]], second: Map[X, FiniteDistribution[Y]]): Map[X, FiniteDistribution[Y]]
    Definition Classes
    GenTruncatedFiniteDistribution
  2. def nodeCoeffDist[Y](initState: VarValueSet[FiniteDistribution])(nodeCoeffs: NodeCoeffs[VarValueSet[FiniteDistribution], Double, HNil, Y], epsilon: Double): FiniteDistribution[Y]
    Definition Classes
    GenTruncatedFiniteDistribution
  3. def nodeCoeffFamilyMap[Dom <: HList, Y](initState: VarValueSet[FiniteDistribution])(nodeCoeffs: NodeCoeffs[VarValueSet[FiniteDistribution], Double, Dom, Y], baseDist: FiniteDistribution[Dom], epsilon: Double): Map[Dom, FiniteDistribution[Y]]
    Definition Classes
    GenTruncatedFiniteDistribution
  4. val nodeCoeffSeq: NodeCoeffSeq[VarValueSet[FiniteDistribution], Double]
    Definition Classes
    TruncatedFiniteDistribution
  5. def nodeDist[Y](initState: VarValueSet[FiniteDistribution])(generatorNode: GeneratorNode[Y], epsilon: Double): FiniteDistribution[Y]

    recursively determines the finite distribution given a generator node; the main work is done here

    recursively determines the finite distribution given a generator node; the main work is done here

    Y

    values of the corresponding random variable

    initState

    initial state

    generatorNode

    generator node to resolve

    epsilon

    cutoff

    returns

    distribution corresponding to the output random variable

    Definition Classes
    TruncatedFiniteDistribution → GenTruncatedFiniteDistribution
  6. def nodeFamilyDist[Dom <: HList, Y](initState: VarValueSet[FiniteDistribution])(generatorNodeFamily: GeneratorNodeFamily[Dom, Y], baseDist: FiniteDistribution[Dom], epsilon: Double): Map[Dom, FiniteDistribution[Y]]
    Definition Classes
    GenTruncatedFiniteDistribution
  7. def productElementNames: Iterator[String]
    Definition Classes
    Product
  8. def updateAll(dataSeq: Seq[Value[_ <: HList, _, Double]]): TruncatedFiniteDistribution[VarValueSet[FiniteDistribution]]

    update coefficients, to be used in complex islands

    update coefficients, to be used in complex islands

    dataSeq

    the new coefficients

    returns

    TruncatedFiniteDistribution with updated coefficients

    Definition Classes
    TruncatedFiniteDistribution
  9. def varDist[Y](initState: VarValueSet[FiniteDistribution])(randomVar: RandomVar[Y], epsilon: Double): FiniteDistribution[Y]

    finite distribution for a random variable

    finite distribution for a random variable

    Y

    values of the random variable

    initState

    initial state

    randomVar

    random variable whose distribution is returned

    epsilon

    cutoff

    returns

    finite distribution for the given random variable

    Definition Classes
    GenTruncatedFiniteDistribution
  10. def varFamilyDist[RDom <: HList, Y](initState: VarValueSet[FiniteDistribution])(randomVarFmly: RandomVarFamily[RDom, Y], epsilon: Double): Map[RDom, FiniteDistribution[Y]]
    Definition Classes
    GenTruncatedFiniteDistribution
  11. def varListDist[Dom <: HList](initState: VarValueSet[FiniteDistribution])(vl: RandomVarList[Dom], epsilon: Double): FiniteDistribution[Dom]

    finite distribution for a list of random variables

    finite distribution for a list of random variables

    Dom

    the HList giving the type of the variable list

    initState

    initial state

    vl

    list of random variables

    epsilon

    cutoff

    returns

    finite distribution of Dom

    Definition Classes
    GenTruncatedFiniteDistribution
  12. val varWeight: Double
    Definition Classes
    TruncatedFiniteDistribution