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 scalahott
    Definition Classes
    provingground
  • object ListType
    Definition Classes
    scalahott
  • ListRep
  • ListTerm
  • ListTyp

case class ListRep[U <: Term with Subs[U]](elemTyp: Typ[U]) extends ScalaRep[Term, List[U]] with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, ScalaRep[Term, List[U]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ListRep
  2. Serializable
  3. Product
  4. Equals
  5. ScalaRep
  6. AnyRef
  7. Any
Implicitly
  1. by ScalaTerm
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new ListRep(elemTyp: Typ[U])

Type Members

  1. type tpe = List[U]

    scala type of representing object.

    scala type of representing object.

    Definition Classes
    ScalaRep

Value Members

  1. def ++[UU >: Term <: Term with Subs[UU], X <: Term with Subs[X], Y](codrepfmly: (List[U]) => ScalaRep[X, Y]): SigmaRep[UU, List[U], X, Y]

    scalarep for sum type.

    scalarep for sum type.

    Definition Classes
    ScalaRep
  2. def -->:[W <: Term with Subs[W], X, UU >: Term <: Term with Subs[UU]](that: ScalaRep[W, X]): FuncRep[W, X, UU, List[U]]

    scalarep for function

    scalarep for function

    Definition Classes
    ScalaRep
  3. def :-->[W <: Term with Subs[W], UU >: Term <: Term with Subs[UU]](that: Typ[W]): FuncRep[UU, List[U], W, W]
    Definition Classes
    ScalaRep
  4. def apply(l: List[U]): ListTerm[U]

    HoTT object from the scala one.

    HoTT object from the scala one.

    Definition Classes
    ListRep → ScalaRep
  5. val elemTyp: Typ[U]
  6. def productElementNames: Iterator[String]
    Definition Classes
    Product
  7. def subs(x: Term, y: Term): ListRep[U]
    Definition Classes
    ListRep → ScalaRep
  8. def term: U
    Implicit
    This member is added by an implicit conversion from ListRep[U] toScalaTerm[U, ListRep[U]] performed by method ScalaTerm in provingground.scalahott.ScalaRep.This conversion will take place only if an implicit value of type ScalaRep[U, ListRep[U]] is in scope.
    Definition Classes
    ScalaTerm
  9. val typ: ListTyp[U]

    HoTT type represented.

    HoTT type represented.

    Definition Classes
    ListRep → ScalaRep
  10. def unapply(u: Term): Option[List[U]]

    pattern for matching application of the scala object.

    pattern for matching application of the scala object.

    Definition Classes
    ListRep → ScalaRep