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

•  case class Deducer(applnWeight: Double = 0.2, lambdaWeight: Double = 0.2, piWeight: Double = 0.2, varWeight: Double = 0.3, vars: Vector[Weighted[Term]] = Vector(), propDecay: Double = 0.5, cutoff: Double = 0.01, feedbackScale: Double = 0.1, abstractionWeight: Double = 0.3, genMemory: Double = 0.8) extends Product with Serializable

  Definition Classes

  learning

• BufferedRun
• Sampler
• absBucket
• bucket

provingground.learning.Deducer

absBucket