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 ConstructorShape
    Definition Classes
    induction
  • CnstDepFuncConsShape
  • CnstFuncConsShape
  • FuncConsShape
  • IdShape

case class FuncConsShape[HS <: HList, H <: Term with Subs[H], HC <: Term with Subs[HC], F <: Term with Subs[F]](tail: IterFuncShape[H, F], head: ConstructorShape[HS, H, HC]) extends ConstructorShape[::[FuncConsShape.type, HS], H, Func[F, HC]] with Product with Serializable

ConstructorShape corresponding to an introduction rule of the form (.. -> W) -> head

Linear Supertypes
Serializable, Product, Equals, ConstructorShape[::[FuncConsShape.type, HS], H, Func[F, HC]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. FuncConsShape
  2. Serializable
  3. Product
  4. Equals
  5. ConstructorShape
  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 FuncConsShape(tail: IterFuncShape[H, F], head: ConstructorShape[HS, H, HC])

Value Members

  1. def -->:(that: IdShape.type): FuncConsShape[::[FuncConsShape.type, HS], H, Func[F, HC], H]

    returns shape that -> this' where that must be the shape for inductive type W

    returns shape that -> this' where that must be the shape for inductive type W

    Definition Classes
    ConstructorShape
  2. def -->:[F <: Term with Subs[F]](that: IterFuncShape[H, F]): FuncConsShape[::[FuncConsShape.type, HS], H, Func[F, HC], F]

    returns shape that -> this' where that is of the form W, A -> W etc; invoking this is an error if we that is independent of W

    returns shape that -> this' where that is of the form W, A -> W etc; invoking this is an error if we that is independent of W

    Definition Classes
    ConstructorShape
  3. def ->:[T <: Term with Subs[T]](tail: Typ[T]): CnstFuncConsShape[::[FuncConsShape.type, HS], H, Func[F, HC], T, Nothing]

    returns shape tail ->: this where tail must be independent of the inductive type W being defined.

    returns shape tail ->: this where tail must be independent of the inductive type W being defined.

    Definition Classes
    ConstructorShape
  4. def apply(tp: Typ[H]): FuncTyp[F, HC]

    returns HoTT type of the introduction rule given the (inductive) type W (to be the head).

    returns HoTT type of the introduction rule given the (inductive) type W (to be the head).

    Definition Classes
    FuncConsShape → ConstructorShape
  5. val head: ConstructorShape[HS, H, HC]
  6. val introArgs: Int
    Definition Classes
    FuncConsShape → ConstructorShape
  7. def lift[Cod <: Term with Subs[Cod], RecDataType <: Term with Subs[RecDataType], InducDataType <: Term with Subs[InducDataType]](implicit mp: ConstructorPatternMapper[::[FuncConsShape.type, HS], Cod, Func[F, HC], H, RecDataType, InducDataType]): ConstructorPatternMap[Cod, Func[F, HC], H, RecDataType, InducDataType]

    lift to ConstructorPatternMap using an implicit ConstructorPatternMapper, which could from the mapper method.

    lift to ConstructorPatternMap using an implicit ConstructorPatternMapper, which could from the mapper method.

    Definition Classes
    ConstructorShape
  8. def mapped[Cod <: Term with Subs[Cod]]: ConstructorPatternMap[Cod, Func[F, HC], H, RecDataType, InducDataType] forSome {type RecDataType <: Term with Subs[RecDataType], type InducDataType <: Term with Subs[InducDataType]}

    lift to ConstructorPatternMap using the result of the mapper method.

    lift to ConstructorPatternMap using the result of the mapper method.

    Definition Classes
    ConstructorShape
  9. def mapper[C <: Term with Subs[C]]: ConstructorPatternMapper[::[FuncConsShape.type, HS], C, Func[F, HC], H, RecDataType, InducDataType] forSome {type RecDataType <: Term with Subs[RecDataType], type InducDataType <: Term with Subs[InducDataType]}

    helper to give ConstructorPatternMap when scala type of codomain is specified.

    helper to give ConstructorPatternMap when scala type of codomain is specified.

    Definition Classes
    FuncConsShape → ConstructorShape
  10. def productElementNames: Iterator[String]
    Definition Classes
    Product
  11. def subs(x: Term, y: Term): FuncConsShape[HS, H, HC, F]
    Definition Classes
    FuncConsShape → ConstructorShape
  12. def symbcons(name: AnySym, tp: Typ[H]): ConstructorShape.symbcons._1.type.Obj with Subs[ConstructorShape.symbcons._1.type.Obj] forSome {val _1: Typ[Func[F, HC]]}

    returns term giving introduction rule given inductive type and name

    returns term giving introduction rule given inductive type and name

    Definition Classes
    ConstructorShape
  13. val tail: IterFuncShape[H, F]
  14. def ~>:[T <: Term with Subs[T]](tailVar: T): CnstDepFuncConsShape[::[FuncConsShape.type, HS], H, Func[F, HC], T, Nothing]

    returns dependent shape tail ~>: this where tail must be independent of the inductive type W being defined.

    returns dependent shape tail ~>: this where tail must be independent of the inductive type W being defined.

    Definition Classes
    ConstructorShape