Packages

Definition Classes: root

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). 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

Definition Classes: induction

ConstructorPatternMap

ConstructorPatternMapper

IndexedConstructorPatternMap

IndexedConstructorPatternMapper

IndexedConstructorSeqDom

IndexedConstructorSeqMap

IndexedConstructorSeqMapper

IndexedConstructorShape

IndexedInductiveDefinition

IndexedIterFuncPtnMap

IndexedIterFuncPtnMapper

IndexedIterFuncShape

IndexedRecursiveDefinition

provingground.induction

IndexedIterFuncPtnMap

Companion class IndexedIterFuncPtnMap

object IndexedIterFuncPtnMap

Linear Supertypes

AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

IndexedIterFuncPtnMap
AnyRef
Any

Hide All
Show All

Visibility

Public
Protected

Type Members

case class IdIterPtnMap[H <: Term with Subs[H], Fb <: Term with Subs[Fb], Index <: HList, C <: Term with Subs[C], F <: Term with Subs[F], IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT]](family: TypFamilyMap[H, Fb, C, Index, IF, IDF, IDFT], index: Index)(implicit evidence$2: TermList[Index]) extends IndexedIterFuncPtnMap[H, Fb, Index, C, H, C, C, IF, IDF, IDFT] with Product with Serializable
The identity family
case class IndexedDepFuncIterPtnMap[TT <: Term with Subs[TT], V <: Term with Subs[V], T <: Term with Subs[T], D <: Term with Subs[D], H <: Term with Subs[H], Fb <: Term with Subs[Fb], Index <: HList, C <: Term with Subs[C], F <: Term with Subs[F], IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT]](tail: Typ[TT], headfibre: (TT) => IndexedIterFuncPtnMap[H, Fb, Index, C, V, T, D, IF, IDF, IDFT])(implicit evidence$4: TermList[Index]) extends IndexedIterFuncPtnMap[H, Fb, Index, C, FuncLike[TT, V], FuncLike[TT, T], FuncLike[TT, D], IF, IDF, IDFT] with Product with Serializable
case class IndexedFuncIterPtnMap[TT <: Term with Subs[TT], V <: Term with Subs[V], T <: Term with Subs[T], D <: Term with Subs[D], H <: Term with Subs[H], Fb <: Term with Subs[Fb], Index <: HList, C <: Term with Subs[C], F <: Term with Subs[F], IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT]](tail: Typ[TT], head: IndexedIterFuncPtnMap[H, Fb, Index, C, V, T, D, IF, IDF, IDFT])(implicit evidence$3: TermList[Index]) extends IndexedIterFuncPtnMap[H, Fb, Index, C, Func[TT, V], Func[TT, T], FuncLike[TT, D], IF, IDF, IDFT] with Product with Serializable

Value Members

final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0
Definition Classes
Any
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(arg0: AnyRef): Boolean
Definition Classes
AnyRef → Any
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def toString(): String
Definition Classes
AnyRef → Any
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated
Deprecated

Packages

Inductive Type Definitions

Recursion and Induction functions

Indexed Versions

IndexedIterFuncPtnMap

Companion class IndexedIterFuncPtnMap

object IndexedIterFuncPtnMap

Type Members

Value Members

Deprecated Value Members

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

Inductive Type Definitions

Recursion and Induction functions

Indexed Versions

IndexedIterFuncPtnMap

Companion class IndexedIterFuncPtnMap

object IndexedIterFuncPtnMap

Type Members

Value Members

Deprecated Value Members

Inherited from AnyRef

Inherited from Any

Ungrouped

IndexedIterFuncPtnMap