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 andrewscurtis
    Definition Classes
    provingground
  • object SimpleAcEvolution

    Definition Classes
    andrewscurtis
  • Path
  • PickledPath
  • PickledState
  • State

case class Path(rank: Int, steps: Int, wordCntn: Double, size: Double, scale: Double, states: List[State], evolvedStates: List[State], id: String) extends Product with Serializable

Linear Supertypes
Serializable, Product, Equals, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Path
  2. Serializable
  3. Product
  4. Equals
  5. AnyRef
  6. 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 Path(rank: Int, steps: Int, wordCntn: Double, size: Double, scale: Double, states: List[State], evolvedStates: List[State], id: String)

Value Members

  1. val current: State
  2. lazy val evolution: AdjDiffbleFunction[(FiniteDistribution[M], FiniteDistribution[V]), (FiniteDistribution[M], FiniteDistribution[V])]
  3. lazy val evolved: State
  4. val evolvedStates: List[State]
  5. lazy val feedbackM: FiniteDistribution[M]
  6. lazy val feedbackV: FiniteDistribution[V]
  7. val id: String
  8. lazy val imageFeedback: (FiniteDistribution[AtomicMove], FiniteDistribution[Moves])
  9. lazy val imageFeedbackV: FiniteDistribution[V]
  10. lazy val imagePres: FiniteDistribution[Presentation]
  11. val initV: FiniteDistribution[Moves]
  12. def length: Int
  13. lazy val next: Path
  14. lazy val nextM: FiniteDistribution[AtomicMove]
  15. lazy val nextState: State
  16. lazy val nextV: FiniteDistribution[Moves]
  17. def pickle: PickledPath
  18. lazy val presFn: MoveFn[V, Presentation]
  19. lazy val presentationFeedback: FiniteDistribution[Presentation]
  20. def productElementNames: Iterator[String]
    Definition Classes
    Product
  21. final def quickrun(n: Int): Path
    Annotations
    @tailrec()
  22. val rank: Int
  23. final def run(n: Int, callback: (Path) => Unit = (p) => {}): Path
    Annotations
    @tailrec()
  24. val scale: Double
  25. val size: Double
  26. val states: List[State]
  27. val steps: Int
  28. val wordCntn: Double