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

case class Cons[TSS <: HList, HShape <: HList, H <: Term with Subs[H], ConstructorType <: Term with Subs[ConstructorType], TIntros <: HList](name: AnySym, pattern: ConstructorShape[HShape, H, ConstructorType], tail: ConstructorSeqDom[TSS, H, TIntros]) extends ConstructorSeqDom[::[HShape, TSS], H, ::[ConstructorType, TIntros]] with Product with Serializable

prepending an introduction rule, given name and shape.

Linear Supertypes
Serializable, Product, Equals, ConstructorSeqDom[::[HShape, TSS], H, ::[ConstructorType, TIntros]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Cons
  2. Serializable
  3. Product
  4. Equals
  5. ConstructorSeqDom
  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(name: AnySym, pattern: ConstructorShape[HShape, H, ConstructorType], tail: ConstructorSeqDom[TSS, H, TIntros])

Value Members

  1. def induc[C <: Term with Subs[C]](W: Typ[H], Xs: Func[H, Typ[C]]): InducType forSome {type InducType <: Term with Subs[InducType]}

    existential typed ind_W, X, used by the method indE of ConstructorSeqTL

    existential typed ind_W, X, used by the method indE of ConstructorSeqTL

    Definition Classes
    ConstructorSeqDom
  2. val introArgsVec: Vector[Int]
    Definition Classes
    Cons → ConstructorSeqDom
  3. def intros(typ: Typ[H]): ::[intros._1.type.Obj with Subs[intros._1.type.Obj], TIntros] forSome {val _1: Typ[ConstructorType]}

    returns introduction rules, given an inductive type.

    returns introduction rules, given an inductive type.

    Definition Classes
    Cons → ConstructorSeqDom
  4. def mapped[C <: Term with Subs[C]](W: Typ[H]): ConstructorSeqMap[C, H, RecType, InducType, TIntros] forSome {type RecType <: Term with Subs[RecType], type InducType <: Term with Subs[InducType], type TIntros <: HList}

    given a codomain, returns a mapped version, i.e.

    given a codomain, returns a mapped version, i.e. one with all the types needed for recursion and induction.

    Definition Classes
    Cons → ConstructorSeqDom
  5. val name: AnySym
  6. val numIntros: Int
    Definition Classes
    Cons → ConstructorSeqDom
  7. val pattern: ConstructorShape[HShape, H, ConstructorType]
  8. def productElementNames: Iterator[String]
    Definition Classes
    Product
  9. def rec[C <: Term with Subs[C]](W: Typ[H], X: Typ[C]): RecType forSome {type RecType <: Term with Subs[RecType]}

    existential typed rec_W, X, used by the method recE of ConstructorSeqTL

    existential typed rec_W, X, used by the method recE of ConstructorSeqTL

    Definition Classes
    ConstructorSeqDom
  10. def subs(x: Term, y: Term): Cons[TSS, HShape, H, ConstructorType, TIntros]
    Definition Classes
    Cons → ConstructorSeqDom
  11. val tail: ConstructorSeqDom[TSS, H, TIntros]