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
  • class IndexedConstructorPatterns[C <: Term with Subs[C], H <: Term with Subs[H], F <: Term with Subs[F]] extends AnyRef

    Definition Classes
    coarse
  • CnstDepFuncPtn
  • CnstFncPtn
  • DepFuncPtn
  • Family
  • FuncPtn
  • PartialiConstructorSeq
  • RecursiveiConstructorPattern
  • iConstructor
  • iConstructorDefn
  • iConstructorPattern
  • iConstructorSeq
  • iConstructorTyp
  • iW

case class iW(index: Ind) extends iConstructorPattern[H] with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, iConstructorPattern[H], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. iW
  2. Serializable
  3. Product
  4. Equals
  5. iConstructorPattern
  6. AnyRef
  7. 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 iW(index: Ind)

Type Members

  1. type InducDataType = C
    Definition Classes
    iW → iConstructorPattern
  2. type RecDataType = C

    (scala) type of data for recursion corresponding to the single constructor

    (scala) type of data for recursion corresponding to the single constructor

    Definition Classes
    iW → iConstructorPattern
  3. type iConstructorType = H

    type of a constructor for this pattern.

    type of a constructor for this pattern.

    Definition Classes
    iConstructorPattern

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 iW toany2stringadd[iW] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def -->:(thatInd: (IterFuncPtn[H, Cod, F], Ind)): FuncPtn[F, H]
    Definition Classes
    iConstructorPattern
  5. def ->[B](y: B): (iW, B)
    Implicit
    This member is added by an implicit conversion from iW toArrowAssoc[iW] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. def apply(tps: F): Typ[H]
    Definition Classes
    iW → iConstructorPattern
  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 codClass[CC <: Term with Subs[CC]](w: Typ[H]): IndexedConstructorPatterns[CC, H, F]
    Definition Classes
    iConstructorPattern
  11. def constructor(tp: => F, name: AnySym): iConstructorDefn[iConstructorType with Subs[iConstructorType]]

    constructor for this pattern given inductive type and name.

    constructor for this pattern given inductive type and name.

    Definition Classes
    iConstructorPattern
  12. def ensuring(cond: (iW) => Boolean, msg: => Any): iW
    Implicit
    This member is added by an implicit conversion from iW toEnsuring[iW] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. def ensuring(cond: (iW) => Boolean): iW
    Implicit
    This member is added by an implicit conversion from iW toEnsuring[iW] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. def ensuring(cond: Boolean, msg: => Any): iW
    Implicit
    This member is added by an implicit conversion from iW toEnsuring[iW] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  15. def ensuring(cond: Boolean): iW
    Implicit
    This member is added by an implicit conversion from iW toEnsuring[iW] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  16. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from iW toStringFormat[iW] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  18. def funcFrom[T <: Term with Subs[T]](tail: Typ[T], fmly: FamilyType): CnstFncPtn[T, H]
    Definition Classes
    iConstructorPattern
  19. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  20. def inClass[CC <: Term with Subs[CC]](w: Typ[H])(that: IndexedConstructorPatterns[CC, H, F]): iConstructorPattern[H]
    Definition Classes
    iW → iConstructorPattern
  21. val index: Ind

    argument for the final image

    argument for the final image

    Definition Classes
    iW → iConstructorPattern
  22. def inducDataTyp(w: F, xs: Func[Total, Typ[Cod]])(cons: H): Typ[Cod]
    Definition Classes
    iW → iConstructorPattern
  23. def inducDefCase(cons: iConstructorType, data: InducDataType, f: => DI): (Total) => Option[Cod]
    Definition Classes
    iW → iConstructorPattern
  24. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  27. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  28. def piOf[T <: Term with Subs[T]](tailVar: T, fmly: FamilyType): CnstDepFuncPtn[U, H, RecDataType, InducDataType, Nothing] forSome {type U >: tailVar.type <: Term with Subs[U]}
    Definition Classes
    iConstructorPattern
  29. def productElementNames: Iterator[String]
    Definition Classes
    Product
  30. def recDataTyp(w: F, x: Typ[Cod]): Typ[RecDataType]

    domain containing the recursion data for the constructor, i.e., the HoTT type of recursion data.

    domain containing the recursion data for the constructor, i.e., the HoTT type of recursion data.

    Definition Classes
    iW → iConstructorPattern
  31. def recDefCase(cons: iConstructorType, data: RecDataType, f: => I): (Total) => Option[Cod]

    given a term, matches to see if this is the image of a given (quasi)-constructor.

    given a term, matches to see if this is the image of a given (quasi)-constructor. returns simplification (wrapped in Some) if the term matches.

    cons

    constructor, actually quasi-constructor, with which to match.

    data

    definition data for the image of the constructor.

    f

    the function being defined, to be applied recursively.

    Definition Classes
    iW → iConstructorPattern
  32. def subs(x: Term, y: Term): iW
    Definition Classes
    iW → iConstructorPattern
  33. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  34. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  35. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  36. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  37. def withCod[CC <: Term with Subs[CC]](w: Typ[H]): iConstructorPattern[H]
    Definition Classes
    iConstructorPattern

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): (iW, B)
    Implicit
    This member is added by an implicit conversion from iW toArrowAssoc[iW] 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 iConstructorPattern[H]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromiW to any2stringadd[iW]

Inherited by implicit conversion StringFormat fromiW to StringFormat[iW]

Inherited by implicit conversion Ensuring fromiW to Ensuring[iW]

Inherited by implicit conversion ArrowAssoc fromiW to ArrowAssoc[iW]

Ungrouped