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 induction

    Much of the richness of HoTT is in the definitions of Inductive types (and their indexed counterparts) and of (dependent) functions on these by recursion and induction These are implemented using several layers of recursive definitions and diagonals (i.e., fixed points).

    Much of the richness of HoTT is in the definitions of Inductive types (and their indexed counterparts) and of (dependent) functions on these by recursion and induction These are implemented using several layers of recursive definitions and diagonals (i.e., fixed points). In HoTT, recursion and induction are applications of (dependent) functions rec_W,X and ind_W, Xs to the definition data.

    It is useful to capture information regarding inductive types and the recursion and induction functions in scala types. Our implementation is designed to do this.

    Inductive Type Definitions

    Inductive types are specified by introduction rules. Each introduction rule is specified in ConstructorShape (without specifying the type) and ConstructorTL including the specific type. The full definition is in ConstructorSeqTL.

    Recursion and Induction functions

    These are defined recursively, first for each introduction rule and then for the inductive type as a whole. A subtlety is that the scala type of the rec_W,X and induc_W, Xs functions depends on the scala type of the codomain X (or family Xs). To make these types visible, some type level calculations using implicits are done, giving traits ConstructorPatternMap and ConstructorSeqMap that have recursive definition of the recursion and induction functions, the former for the case of a single introduction rule. Traits ConstructorSeqMapper and ConstructorPatternMapper provide the lifts.

    Indexed Versions

    There are indexed versions of all these definitions, to work with indexed inductive type families.

    Definition Classes
    provingground
  • package coarse

    an earlier implementation of induction, without clean separation of codomain scala types; use induction instead

    an earlier implementation of induction, without clean separation of codomain scala types; use induction instead

    Definition Classes
    induction
  • object BaseConstructorTypes
    Definition Classes
    coarse
  • SmallBool
  • SmallNat

case object SmallBool extends SmallTyp with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, SmallTyp, Typ[Term], Term, Subs[Typ[Term]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SmallBool
  2. Serializable
  3. Product
  4. Equals
  5. SmallTyp
  6. Typ
  7. Term
  8. Subs
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. type Obj = Term

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

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

    Definition Classes
    SmallTyp → Typ

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): Term

    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. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def ##: Int
    Definition Classes
    AnyRef → Any
  5. def &&[UU >: Term <: 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
  6. def &:[UU >: Term <: Term with Subs[UU], V <: Term with Subs[V]](variable: V): SigmaTyp[V, UU]
    Definition Classes
    Typ
  7. def ++[UU >: Typ[Term] <: 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
  8. def ->:[W <: Term with Subs[W], UU >: Term <: Term with Subs[UU]](that: Typ[W]): FuncTyp[W, UU]

    function type: this -> that

    function type: this -> that

    Definition Classes
    Typ
  9. def ::(name: String): Term

    symbolic object with given name

    symbolic object with given name

    Definition Classes
    Typ
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def Var(implicit factory: NameFactory): Term

    new variable from a factory.

    new variable from a factory.

    Definition Classes
    Typ
  12. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  13. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  14. def dependsOn(that: Term): Boolean

    returns whether this depends on that

    returns whether this depends on that

    Definition Classes
    Term
  15. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  17. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  18. def indepOf(that: Term): Boolean

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. def newobj: Typ[Term]

    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
    SmallTyp → Subs
  22. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  24. def obj: Term

    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
  25. def productElementName(n: Int): String
    Definition Classes
    Product
  26. def productElementNames: Iterator[String]
    Definition Classes
    Product
  27. def replace(x: Term, y: Term): Typ[Term] with Subs[Typ[Term]]

    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
  28. def subs(x: Term, y: Term): Typ[Term]

    substitute x by y recursively in this.

    substitute x by y recursively in this.

    Definition Classes
    SmallTyp → Subs
  29. def sym(implicit name: Name): Term

    shortcut for symbolic object

    shortcut for symbolic object

    Definition Classes
    Typ
  30. def symbObj(name: AnySym): Term with Subs[Term]

    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
  31. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  32. val typ: Universe

    type of a type is a universe.

    type of a type is a universe.

    Definition Classes
    SmallTyp → Typ → Term
  33. lazy val typlevel: Int
    Definition Classes
    Typ
  34. 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
  35. def variable(name: AnySym): Term

    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
    SmallTyp → Typ
  36. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  37. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  38. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  39. def ||[UU >: Term <: 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
  40. def ~>:[UU >: Term <: 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

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from SmallTyp

Inherited from Typ[Term]

Inherited from Term

Inherited from Subs[Typ[Term]]

Inherited from AnyRef

Inherited from Any

Ungrouped