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 Deducer extends Serializable

    Generating terms from given ones using the main HoTT operations, and the adjoint of this generation.

    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.

    Definition Classes
    learning
  • HashedUnifInv

class HashedUnifInv[U <: Term with Subs[U]] extends (Term) => Set[(U, Term)]

Linear Supertypes
(Term) => Set[(U, Term)], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. HashedUnifInv
  2. Function1
  3. AnyRef
  4. 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 HashedUnifInv(invMap: Vector[(Term, Set[(U, Term)])])

Value Members

  1. def andThen[A](g: (Set[(U, Term)]) => A): (Term) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  2. def apply(term: Term): Set[(U, Term)]
    Definition Classes
    HashedUnifInv → Function1
  3. def compose[A](g: (A) => Term): (A) => Set[(U, Term)]
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  4. val hashedInvMap: Map[ShapeTree, Vector[(Term, Set[(U, Term)])]]
  5. def toString(): String
    Definition Classes
    Function1 → AnyRef → Any