Packages

object Deducer extends Serializable

Generating terms from given ones using the main HoTT operations, and the adjoint of this generation. This is viewed as deduction. Generation is a map on probability distributions, but the adjoint regards truncated distributions as the tangent space, and restricts domain to finite distributions.

Linear Supertypes
Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Deducer
  2. Serializable
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. class HashedUnifInv[U <: Term with Subs[U]] extends (Term) => Set[(U, Term)]
  2. type InvMap = Vector[(Term, Set[(Term, Term)])]

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def appln(rec: => (ProbabilityDistribution[Term]) => ProbabilityDistribution[Term])(p: ProbabilityDistribution[Term]): ProbabilityDistribution[Option[Term]]

    generating optionally using function application, with function and argument generated recursively; to be mixed in using <+?>

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def eqSubs(rec: => (ProbabilityDistribution[Term]) => ProbabilityDistribution[Term])(p: ProbabilityDistribution[Term])(save: (Term, IdentityTyp[Term], Term) => Unit): ProbabilityDistribution[Option[Term with Subs[Term]]]
  9. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  10. def feedback(absTheorems: FiniteDistribution[Typ[Term]], absThmsByProofs: FiniteDistribution[Typ[Term]], proofs: Map[Typ[Term], FiniteDistribution[Term]], vars: Vector[Weighted[Term]], lambdaWeight: Double, piWeight: Double): FiniteDistribution[Term]
  11. def flow(fd: FiniteDistribution[Term], shifts: FiniteDistribution[Term]): FiniteDistribution[Term]
  12. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  14. def hashedUnifInv[U <: Term with Subs[U]](term: Term, hashedInvMap: Map[ShapeTree, Vector[(Term, Set[(U, Term)])]]): Set[(U, Term)]
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. def lambda(varweight: Double)(rec: => (ProbabilityDistribution[Term]) => ProbabilityDistribution[Term])(p: ProbabilityDistribution[Term]): ProbabilityDistribution[Option[Term]]

    generating optionally as lambdas, with function and argument generated recursively; to be mixed in using <+?> avoid having value a universe

  17. def lambdaValue[U <: Term with Subs[U]](variable: U): (Term) => Option[Term]

    given a type, returns optionally values of lambda terms with variable of the given type with variable in values from the above variable object

  18. def memAppln(rec: => (ProbabilityDistribution[Term]) => ProbabilityDistribution[Term])(p: ProbabilityDistribution[Term])(save: (Term, Term, Term) => Unit): ProbabilityDistribution[Option[Term]]
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  22. def pi(varweight: Double)(rec: => (ProbabilityDistribution[Term]) => ProbabilityDistribution[Term])(p: ProbabilityDistribution[Term]): ProbabilityDistribution[Option[Term]]

    generating optionally as pi's, with function and argument generated recursively; to be mixed in using <+?>

  23. def piValue[U <: Term with Subs[U]](variable: U): (Term) => Option[Term]
  24. def proofEntropies(fd: FiniteDistribution[Term]): Vector[Weighted[Typ[U] forSome {type U >: x$2.type <: Term with Subs[U], val x$2: Term}]]
  25. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  26. def toString(): String
    Definition Classes
    AnyRef → Any
  27. def unifInv[U <: Term with Subs[U]](term: Term, invMap: Vector[(Term, Set[(U, Term)])]): Set[(U, Term)]
  28. def unpickle(str: String): TermPopulation
  29. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  30. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  31. 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

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped