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 NodeCoeffSeq
    Definition Classes
    learning
  • Cons
  • Empty

case class Cons[State, V, RDom <: HList, Y](head: NodeCoeffs[State, V, RDom, Y], tail: NodeCoeffSeq[State, V]) extends NodeCoeffSeq[State, V] with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, NodeCoeffSeq[State, V], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Cons
  2. Serializable
  3. Product
  4. Equals
  5. NodeCoeffSeq
  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 Cons(head: NodeCoeffs[State, V, RDom, Y], tail: NodeCoeffSeq[State, V])

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 Cons[State, V, RDom, Y] toany2stringadd[Cons[State, V, RDom, Y]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def +:[RDom <: HList, Y](head: NodeCoeffs[State, V, RDom, Y]): Cons[State, V, RDom, Y]
    Definition Classes
    NodeCoeffSeq
  5. def ->[B](y: B): (Cons[State, V, RDom, Y], B)
    Implicit
    This member is added by an implicit conversion from Cons[State, V, RDom, Y] toArrowAssoc[Cons[State, V, RDom, Y]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  9. def ensuring(cond: (Cons[State, V, RDom, Y]) => Boolean, msg: => Any): Cons[State, V, RDom, Y]
    Implicit
    This member is added by an implicit conversion from Cons[State, V, RDom, Y] toEnsuring[Cons[State, V, RDom, Y]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  10. def ensuring(cond: (Cons[State, V, RDom, Y]) => Boolean): Cons[State, V, RDom, Y]
    Implicit
    This member is added by an implicit conversion from Cons[State, V, RDom, Y] toEnsuring[Cons[State, V, RDom, Y]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: Boolean, msg: => Any): Cons[State, V, RDom, Y]
    Implicit
    This member is added by an implicit conversion from Cons[State, V, RDom, Y] toEnsuring[Cons[State, V, RDom, Y]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: Boolean): Cons[State, V, RDom, Y]
    Implicit
    This member is added by an implicit conversion from Cons[State, V, RDom, Y] toEnsuring[Cons[State, V, RDom, Y]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def find[VarRDom <: HList, VarY](randomVar: RandomVarFamily[VarRDom, VarY]): Option[NodeCoeffs[State, V, VarRDom, VarY]]
    Definition Classes
    Cons → NodeCoeffSeq
  15. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from Cons[State, V, RDom, Y] toStringFormat[Cons[State, V, RDom, Y]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  16. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  17. def getCoeff[RDom <: HList, Y](gen: GeneratorNodeFamily[RDom, Y]): Option[V]
    Definition Classes
    Cons → NodeCoeffSeq
  18. val head: NodeCoeffs[State, V, RDom, Y]
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. val nodeFamilies: Set[GeneratorNodeFamily[_ <: HList, _]]
    Definition Classes
    Cons → NodeCoeffSeq
  22. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  24. val outputs: Vector[RandomVarFamily[_ <: HList, _]]
    Definition Classes
    Cons → NodeCoeffSeq
  25. def productElementNames: Iterator[String]
    Definition Classes
    Product
  26. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  27. val tail: NodeCoeffSeq[State, V]
  28. def update[D <: HList, O](data: Value[D, O, V]): NodeCoeffSeq[State, V]
    Definition Classes
    Cons → NodeCoeffSeq
  29. def updateAll(dataSeq: Seq[Value[_ <: HList, _, V]]): NodeCoeffSeq[State, V]
    Definition Classes
    NodeCoeffSeq
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  32. 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): (Cons[State, V, RDom, Y], B)
    Implicit
    This member is added by an implicit conversion from Cons[State, V, RDom, Y] toArrowAssoc[Cons[State, V, RDom, Y]] 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 Product

Inherited from Equals

Inherited from NodeCoeffSeq[State, V]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromCons[State, V, RDom, Y] to any2stringadd[Cons[State, V, RDom, Y]]

Inherited by implicit conversion StringFormat fromCons[State, V, RDom, Y] to StringFormat[Cons[State, V, RDom, Y]]

Inherited by implicit conversion Ensuring fromCons[State, V, RDom, Y] to Ensuring[Cons[State, V, RDom, Y]]

Inherited by implicit conversion ArrowAssoc fromCons[State, V, RDom, Y] to ArrowAssoc[Cons[State, V, RDom, Y]]

Ungrouped