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 ScalaUniv extends Serializable
    Definition Classes
    scalahott
  • DepFunc
  • FineSymbTyp
  • FineUniv
  • FuncTypUniv
  • HigherUniv
  • PiTypUniv

case class PiTypUniv[W <: Term with Subs[W], U <: Term with Subs[U]](domuniv: Typ[Typ[W]], codomuniv: Typ[Typ[U]]) extends Typ[PiTyp[W, U]] with Product with Serializable

Universe with objects Pi-Types

Annotations
@deprecated
Deprecated

(Since version 14/12/2016) Use PiDefn

Linear Supertypes
Serializable, Product, Equals, Typ[PiTyp[W, U]], Term, Subs[Typ[PiTyp[W, U]]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PiTypUniv
  2. Serializable
  3. Product
  4. Equals
  5. Typ
  6. Term
  7. Subs
  8. AnyRef
  9. 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 PiTypUniv(domuniv: Typ[Typ[W]], codomuniv: Typ[Typ[U]])

Type Members

  1. type Obj = PiTyp[W, U]

    scala type of objects with this HoTT-type (refining U)

    scala type of objects with this HoTT-type (refining U)

    Definition Classes
    PiTypUnivTyp

Value Members

  1. object Elem

    Pattern for element of the given type.

    Pattern for element of the given type.

    Definition Classes
    Typ
  2. def !:(term: Term): PiTyp[W, U]

    checks term is of this type and returns it; useful for documentation.

    checks term is of this type and returns it; useful for documentation.

    Definition Classes
    Typ
  3. def &&[UU >: PiTyp[W, U] <: Term with Subs[UU], V <: Term with Subs[V]](that: Typ[V]): ProdTyp[UU, V]

    returns product type, mainly to use for "and" for structures

    returns product type, mainly to use for "and" for structures

    Definition Classes
    Typ
  4. def &:[UU >: PiTyp[W, U] <: Term with Subs[UU], V <: Term with Subs[V]](variable: V): SigmaTyp[V, UU]
    Definition Classes
    Typ
  5. def ++[UU >: Typ[PiTyp[W, U]] <: Typ[Term] with Subs[UU], VV <: Term with Subs[VV], V <: Typ[VV] with Subs[V]](those: V): SigmaTyp[UU, VV]

    returns Sigma-Type, mainly to use as "such that", for example a group type is this with product etc.

    returns Sigma-Type, mainly to use as "such that", for example a group type is this with product etc. dependent on this.

    Definition Classes
    Typ
  6. def ->:[W <: Term with Subs[W], UU >: PiTyp[W, U] <: Term with Subs[UU]](that: Typ[W]): FuncTyp[W, UU]

    function type: this -> that

    function type: this -> that

    Definition Classes
    Typ
  7. def ::(name: String): PiTyp[W, U]

    symbolic object with given name

    symbolic object with given name

    Definition Classes
    Typ
  8. def Var(implicit factory: NameFactory): PiTyp[W, U]

    new variable from a factory.

    new variable from a factory.

    Definition Classes
    Typ
  9. val codomuniv: Typ[Typ[U]]
  10. def dependsOn(that: Term): Boolean

    returns whether this depends on that

    returns whether this depends on that

    Definition Classes
    Term
  11. val domuniv: Typ[Typ[W]]
  12. def indepOf(that: Term): Boolean

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  13. def newobj: Nothing

    A new object with the same type, to be used in place of a variable to avoid name clashes.

    A new object with the same type, to be used in place of a variable to avoid name clashes. Should throw exception when invoked for constants.

    Definition Classes
    PiTypUnivSubs
  14. def obj: PiTyp[W, U]

    factory for producing objects of the given type.

    factory for producing objects of the given type. can use {{innervar}} if one wants name unchanged.

    Definition Classes
    Typ
  15. def productElementNames: Iterator[String]
    Definition Classes
    Product
  16. def replace(x: Term, y: Term): Typ[PiTyp[W, U]] with Subs[Typ[PiTyp[W, U]]]

    refine substitution so if x and y are both of certain forms such as pairs or formal applications, components are substituted.

    refine substitution so if x and y are both of certain forms such as pairs or formal applications, components are substituted.

    Definition Classes
    Subs
  17. def subs(x: Term, y: Term): PiTypUniv[W, U]

    substitute x by y recursively in this.

    substitute x by y recursively in this.

    Definition Classes
    PiTypUnivSubs
  18. def sym(implicit name: Name): PiTyp[W, U]

    shortcut for symbolic object

    shortcut for symbolic object

    Definition Classes
    Typ
  19. def symbObj(name: AnySym): PiTyp[W, U] with Subs[PiTyp[W, U]]

    A symbolic object with this HoTT type, and with scala-type Obj

    A symbolic object with this HoTT type, and with scala-type Obj

    Definition Classes
    Typ
  20. lazy val typ: HigherUniv[PiTyp[W, U]]

    type of a type is a universe.

    type of a type is a universe.

    Definition Classes
    PiTypUnivTypTerm
  21. lazy val typlevel: Int
    Definition Classes
    Typ
  22. def usesVar(t: Term): Boolean

    returns whether the variable t is used as a variable in a lambda definition.

    returns whether the variable t is used as a variable in a lambda definition.

    Definition Classes
    Term
  23. def variable(name: AnySym): PiTyp[W, U]

    A symbolic object with this HoTT type, and with scala-type Obj

    A symbolic object with this HoTT type, and with scala-type Obj

    Definition Classes
    PiTypUnivTyp
  24. def ||[UU >: PiTyp[W, U] <: Term with Subs[UU], V <: Term with Subs[V]](that: Typ[V]): PlusTyp[UU, V]

    returns coproduct type, mainly to use for "or".

    returns coproduct type, mainly to use for "or".

    Definition Classes
    Typ
  25. def ~>:[UU >: PiTyp[W, U] <: Term with Subs[UU], V <: Term with Subs[V]](variable: V): GenFuncTyp[V, UU]

    dependent function type (Pi-Type) define by a lambda: this depends on the variable, which hence gives a type family; note that a new variable is created and substituted in this to avoid name clashes.

    dependent function type (Pi-Type) define by a lambda: this depends on the variable, which hence gives a type family; note that a new variable is created and substituted in this to avoid name clashes.

    Definition Classes
    Typ