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
  • object IndexedConstructorSeqMap
    Definition Classes
    induction
  • Cons
  • Empty

case class Cons[C <: Term with Subs[C], H <: Term with Subs[H], Cod <: Term with Subs[Cod], RD <: Term with Subs[RD], ID <: Term with Subs[ID], TR <: Term with Subs[TR], TI <: Term with Subs[TI], TIntros <: HList, F <: Term with Subs[F], Index <: HList, IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT]](cons: C, pattern: IndexedConstructorPatternMap[Cod, C, H, RD, ID, F, Index, IF, IDF, IDFT], tail: IndexedConstructorSeqMap[Cod, H, TR, TI, TIntros, F, Index, IF, IDF, IDFT])(implicit evidence$3: TermList[Index]) extends IndexedConstructorSeqMap[Cod, H, Func[RD, TR], Func[ID, TI], ::[C, TIntros], F, Index, IF, IDF, IDFT] with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, IndexedConstructorSeqMap[Cod, H, Func[RD, TR], Func[ID, TI], ::[C, TIntros], F, Index, IF, IDF, IDFT], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Cons
  2. Serializable
  3. Product
  4. Equals
  5. IndexedConstructorSeqMap
  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 Cons(cons: C, pattern: IndexedConstructorPatternMap[Cod, C, H, RD, ID, F, Index, IF, IDF, IDFT], tail: IndexedConstructorSeqMap[Cod, H, TR, TI, TIntros, F, Index, IF, IDF, IDFT])(implicit arg0: TermList[Index])

Value Members

  1. val W: IndexedConstructorSeqMap.W.type

    the index type family

    the index type family

    Definition Classes
    Cons → IndexedConstructorSeqMap
  2. val cons: C
  3. def data(X: Typ[Cod]): RD
  4. def dataCons(X: Typ[Cod]): DataCons[H, F, Cod, Index, IF, IDF, IDFT, RD]
  5. val defn: (RD) => (IF) => (H) => Option[Cod]
  6. val family: TypFamilyMap[H, F, Cod, Index, IF, IDF, IDFT]

    the inductive type family

    the inductive type family

    Definition Classes
    Cons → IndexedConstructorSeqMap
  7. def indDataCons(fibre: IDFT): DataCons[H, F, Cod, Index, IF, IDF, IDFT, ID]
  8. def induc(fibre: IDFT): Func[ID, TI]

    the induction function

    the induction function

    Definition Classes
    IndexedConstructorSeqMap
  9. def inducData(fibre: IDFT): ID with Subs[ID]
  10. def inducDataLambda(fibre: IDFT): (IDF) => Func[ID with Subs[ID], TI]
    Definition Classes
    Cons → IndexedConstructorSeqMap
  11. def inducDefn(fibre: IDFT): DataCons[H, F, Cod, Index, IF, IDF, IDFT, ID]
    Definition Classes
    Cons → IndexedConstructorSeqMap
  12. val inducDefn: (ID) => (IDF) => (H) => Option[Cod]
  13. def inducF(fibre: Term): Func[ID, TI]

    the induction function with type casting

    the induction function with type casting

    Definition Classes
    IndexedConstructorSeqMap
  14. val pattern: IndexedConstructorPatternMap[Cod, C, H, RD, ID, F, Index, IF, IDF, IDFT]
  15. def productElementNames: Iterator[String]
    Definition Classes
    Product
  16. def rec(X: Typ[Cod]): Func[RD, TR]

    the recursion function

    the recursion function

    Definition Classes
    IndexedConstructorSeqMap
  17. def recDataLambda(X: Typ[Cod]): (IF) => Func[RD, TR]
    Definition Classes
    Cons → IndexedConstructorSeqMap
  18. def recDefn(X: Typ[Cod]): DataCons[H, F, Cod, Index, IF, IDF, IDFT, RD]

    the raw recursive definition, from which the recursion function is built by lambdas

    the raw recursive definition, from which the recursion function is built by lambdas

    Definition Classes
    Cons → IndexedConstructorSeqMap
  19. def subs(x: Term, y: Term): Cons[C with Subs[C], H, Cod, RD, ID, TR, TI, TIntros, F, Index, IF, IDF, IDFT]
    Definition Classes
    Cons → IndexedConstructorSeqMap
  20. val tail: IndexedConstructorSeqMap[Cod, H, TR, TI, TIntros, F, Index, IF, IDF, IDFT]