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
  • sealed abstract class IndexedRecursiveDefinition[H <: Term with Subs[H], F <: Term with Subs[F], C <: Term with Subs[C], Index <: HList, IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT]] extends AnyRef

    indexed version of RecursiveDefinition

    indexed version of RecursiveDefinition

    Definition Classes
    induction
  • Funcs

case class Funcs(ind: Index) extends IndRecFunc[H, C, F] with Product with Serializable

Self Type
Funcs
Linear Supertypes
Serializable, Product, Equals, IndRecFunc[H, C, F], Func[H, C], FuncLike[H, C], (H) => C, Term, Subs[Func[H, C]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Funcs
  2. Serializable
  3. Product
  4. Equals
  5. IndRecFunc
  6. Func
  7. FuncLike
  8. Function1
  9. Term
  10. Subs
  11. AnyRef
  12. 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 Funcs(ind: Index)

Type Members

  1. abstract type Obj <: FuncLike[H, C]
    Definition Classes
    FuncLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from Funcs toany2stringadd[Funcs] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (Funcs, B)
    Implicit
    This member is added by an implicit conversion from Funcs toArrowAssoc[Funcs] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def act(arg: H): C

    the action of the function to define: define this method, but use apply.

    the action of the function to define: define this method, but use apply.

    Definition Classes
    Funcs → Func → FuncLike
  7. def andThen[A](g: (C) => A): (H) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  8. def apply(arg: H): C

    application of the function: use this but define the act method; checks HoTT-type of argument is in the domain and throws exception if it fails.

    application of the function: use this but define the act method; checks HoTT-type of argument is in the domain and throws exception if it fails.

    Definition Classes
    FuncLike → Function1
  9. def applyUnchecked(arg: H): C
    Definition Classes
    FuncLike
  10. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  11. def canApply(arg: H): Boolean

    checks if application is valid; can override to allow for example resizing universes

    checks if application is valid; can override to allow for example resizing universes

    arg

    the argument

    returns

    whether the argument has the correct type.

    Definition Classes
    FuncLike
  12. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  13. val codom: Typ[C]

    codomain

    codomain

    Definition Classes
    Funcs → IndRecFunc → Func
  14. def compose[A](g: (A) => H): (A) => C
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  15. val defnData: Vector[Term]

    definition data for all introduction rules.

    definition data for all introduction rules.

    Definition Classes
    Funcs → IndRecFunc
  16. val depcodom: (H) => Typ[C]
    Definition Classes
    Func → FuncLike
  17. def dependsOn(that: Term): Boolean

    returns whether this depends on that

    returns whether this depends on that

    Definition Classes
    Term
  18. val dom: Typ[H]

    domain

    domain

    Definition Classes
    Funcs → Func → FuncLike
  19. val domW: W.type

    the dependent codomain on the family.

    the dependent codomain on the family.

    Definition Classes
    Funcs → IndRecFunc
  20. def ensuring(cond: (Funcs) => Boolean, msg: => Any): Funcs
    Implicit
    This member is added by an implicit conversion from Funcs toEnsuring[Funcs] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  21. def ensuring(cond: (Funcs) => Boolean): Funcs
    Implicit
    This member is added by an implicit conversion from Funcs toEnsuring[Funcs] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  22. def ensuring(cond: Boolean, msg: => Any): Funcs
    Implicit
    This member is added by an implicit conversion from Funcs toEnsuring[Funcs] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  23. def ensuring(cond: Boolean): Funcs
    Implicit
    This member is added by an implicit conversion from Funcs toEnsuring[Funcs] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  24. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. def equals(that: Any): Boolean
    Definition Classes
    IndRecFunc → AnyRef → Any
  26. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from Funcs toStringFormat[Funcs] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  27. def fromData(data: Vector[Term]): Funcs
  28. lazy val fullIndData: (F, Vector[Term], Typ[C], Vector[Term])
    Definition Classes
    IndRecFunc
  29. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  30. def hashCode(): Int
    Definition Classes
    IndRecFunc → AnyRef → Any
  31. val ind: Index
  32. def indepOf(that: Term): Boolean

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  33. val index: Vector[Term]

    indices of the introduction rules.

    indices of the introduction rules.

    Definition Classes
    Funcs → IndRecFunc
  34. val intros: Vector[Term]
    Definition Classes
    Funcs → IndRecFunc
  35. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  36. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. 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
    Funcs → Subs
  38. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  39. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  40. lazy val outer: IndexedRecursiveDefinition[H, F, C, Index, IF, IDF, IDFT]
  41. def productElementNames: Iterator[String]
    Definition Classes
    Product
  42. def replace(x: Term, y: Term): Func[H, C] with Subs[Func[H, C]]

    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
  43. def subs(x: Term, y: Term): Funcs

    substitute x by y recursively in this.

    substitute x by y recursively in this.

    Definition Classes
    Funcs → Func → FuncLike → Subs
  44. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  45. def toString(): String
    Definition Classes
    IndRecFunc → Function1 → AnyRef → Any
  46. val typ: FuncTyp[H, C]

    the HoTT-type of the term

    the HoTT-type of the term

    Definition Classes
    Funcs → Func → FuncLike → Term
  47. 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
  48. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  49. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  50. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  2. def →[B](y: B): (Funcs, B)
    Implicit
    This member is added by an implicit conversion from Funcs toArrowAssoc[Funcs] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from IndRecFunc[H, C, F]

Inherited from Func[H, C]

Inherited from FuncLike[H, C]

Inherited from (H) => C

Inherited from Term

Inherited from Subs[Func[H, C]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromFuncs to any2stringadd[Funcs]

Inherited by implicit conversion StringFormat fromFuncs to StringFormat[Funcs]

Inherited by implicit conversion Ensuring fromFuncs to Ensuring[Funcs]

Inherited by implicit conversion ArrowAssoc fromFuncs to ArrowAssoc[Funcs]

Ungrouped