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 FmlyPtn
    Definition Classes
    coarse
  • DepFuncFmlyPtn
  • FuncFmlyPtn
  • IdFmlyPtn
  • RecFmlyPtn

case class DepFuncFmlyPtn[TT <: Term with Subs[TT], FV <: Term with Subs[FV], I <: Term with Subs[I], IT <: Term with Subs[IT], DI <: Term with Subs[DI], S <: Term with Subs[S], O <: Term with Subs[O], C <: Term with Subs[C], HTot <: Term with Subs[HTot]](tail: Typ[TT], headfibre: (TT) => FmlyPtn[O, C, FV] { ... /* 5 definitions in type refinement */ }, headlevel: Int = 0) extends RecFmlyPtn[TT, FV, FuncLike[TT, FV], S, O, C] with Product with Serializable

Extending by a constant type A a family of type patterns depending on (a : A).

Linear Supertypes
Serializable, Product, Equals, RecFmlyPtn[TT, FV, FuncLike[TT, FV], S, O, C], FmlyPtn[O, C, FuncLike[TT, FV]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DepFuncFmlyPtn
  2. Serializable
  3. Product
  4. Equals
  5. RecFmlyPtn
  6. FmlyPtn
  7. AnyRef
  8. 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 DepFuncFmlyPtn(tail: Typ[TT], headfibre: (TT) => FmlyPtn[O, C, FV] { ... /* 5 definitions in type refinement */ }, headlevel: Int = 0)

Type Members

  1. type ArgType = AbsPair[TT, S]

    type of total index

    type of total index

    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  2. type Cod = C
    Definition Classes
    FmlyPtn
  3. type FamilyType = FuncLike[TT, FV]

    type of W, i.e., sections to a universe.

    type of W, i.e., sections to a universe.

    Definition Classes
    FmlyPtn
  4. type IterDepFunc = FuncLike[TT, DI]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  5. type IterFunc = FuncLike[TT, I]

    Type of Curried function to X.

    Type of Curried function to X.

    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  6. type IterTypFunc = Func[TT, IT]

    Type of curried function to typ[X]

    Type of curried function to typ[X]

    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  7. type Total = AbsPair[TT, HTot]

    type of the total space, i.e., all terms in some W.

    type of the total space, i.e., all terms in some W.

    Definition Classes
    DepFuncFmlyPtn → FmlyPtn

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 DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] toany2stringadd[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot], B)
    Implicit
    This member is added by an implicit conversion from DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] toArrowAssoc[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. def ->:[TT <: Term with Subs[TT]](tail: Typ[TT]): FmlyPtn[O, C, Func[TT, FuncLike[TT, FV]]]
    Definition Classes
    FmlyPtn
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. def argOpt(l: List[Term]): Option[ArgType]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  10. def contractType(w: FamilyType)(arg: ArgType): Typ[O]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  11. def curry(f: Func[Total, Cod]): IterFunc
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  12. def curryTyp(w: Func[Total, Typ[Cod]]): IterTypFunc
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  13. def depCurry(f: FuncLike[Total, Cod]): IterDepFunc
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  14. def depFill(g: IterDepFunc)(arg: ArgType): FuncLike[O, C]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  15. def depTotalDomain(g: IterDepFunc): SigmaTyp[TT, HTot]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  16. def depUncurry(g: IterDepFunc): FuncLike[Total, Cod]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  17. def domTotal(w: FamilyType): Typ[Total]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  18. def ensuring(cond: (DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]) => Boolean, msg: => Any): DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]
    Implicit
    This member is added by an implicit conversion from DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] toEnsuring[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  19. def ensuring(cond: (DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]) => Boolean): DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]
    Implicit
    This member is added by an implicit conversion from DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] toEnsuring[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  20. def ensuring(cond: Boolean, msg: => Any): DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]
    Implicit
    This member is added by an implicit conversion from DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] toEnsuring[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  21. def ensuring(cond: Boolean): DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]
    Implicit
    This member is added by an implicit conversion from DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] toEnsuring[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  22. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. def fill(g: IterFunc)(arg: ArgType): Func[O, C]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  24. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] toStringFormat[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  25. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  26. val headfibre: (TT) => FmlyPtn[O, C, FV] { ... /* 5 definitions in type refinement */ }
    Definition Classes
    DepFuncFmlyPtn → RecFmlyPtn
  27. val headlevel: Int
  28. def incl(term: O, arg: ArgType, w: FamilyType): Total
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  29. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  30. def iterDepFuncTyp(w: FamilyType, xs: IterTypFunc): Typ[IterDepFunc]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  31. def iterFuncTyp(w: FamilyType, x: Typ[Cod]): Typ[IterFunc]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  32. val me: FmlyPtn[O, C, FuncLike[TT, FV]] { ... /* 5 definitions in type refinement */ }
    Definition Classes
    FmlyPtn
  33. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  35. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  36. def productElementNames: Iterator[String]
    Definition Classes
    Product
  37. def subs(x: Term, y: Term): DepFuncFmlyPtn[TT, FVV, I, IT, DI, SS, O, C, HTot]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  38. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  39. val tail: Typ[TT]
    Definition Classes
    DepFuncFmlyPtn → RecFmlyPtn
  40. def totalDomain(g: IterFunc): SigmaTyp[TT, HTot]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  41. def totalTypDomain(g: IterTypFunc): Typ[Total]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  42. def uncurry(g: IterFunc): Func[Total, Cod]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  43. def uncurryTyp(g: IterTypFunc): Func[Total, Typ[Cod]]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  44. val univLevel: Int

    the universe containing the type

    the universe containing the type

    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  45. def value(x: Total): O

    project an element of the total type to its value, i.e., drop arguments

    project an element of the total type to its value, i.e., drop arguments

    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  46. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  47. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  48. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  49. def withCod[CC <: Term with Subs[CC]](w: Typ[O]): DepFuncFmlyPtn[TT, FVV, I, IT, DI, SS, O, CC, HTot]
    Definition Classes
    DepFuncFmlyPtn → FmlyPtn
  50. def ~>:[TT <: Term with Subs[TT]](tailVar: TT): FmlyPtn[O, C, FuncLike[TT, FuncLike[TT, FV]]]
    Definition Classes
    FmlyPtn

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): (DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot], B)
    Implicit
    This member is added by an implicit conversion from DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] toArrowAssoc[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]] 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 RecFmlyPtn[TT, FV, FuncLike[TT, FV], S, O, C]

Inherited from FmlyPtn[O, C, FuncLike[TT, FV]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromDepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] to any2stringadd[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]]

Inherited by implicit conversion StringFormat fromDepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] to StringFormat[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]]

Inherited by implicit conversion Ensuring fromDepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] to Ensuring[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]]

Inherited by implicit conversion ArrowAssoc fromDepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot] to ArrowAssoc[DepFuncFmlyPtn[TT, FV, I, IT, DI, S, O, C, HTot]]

Ungrouped