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 RecursiveDefinition
    Definition Classes
    induction
  • DataCons
  • Empty

case class DataCons[H <: Term with Subs[H], C <: Term with Subs[C], D <: Term with Subs[D]](data: D, defn: (D) => (Func[H, C]) => (H) => Option[C], cons: Term, tail: RecursiveDefinition[H, C], replacement: (Term) => (Term) => (Typ[C]) => Option[DataCons[H, C, D]] = (_: Term) => (_: Term) => (_: Typ[C]) => None) extends RecursiveDefinition[H, C] with Product with Serializable

an additional case for a RecursiveDefinition, depending on definition data data

Linear Supertypes
Serializable, Product, Equals, RecursiveDefinition[H, C], RecFunc[H, C], Func[H, C], FuncLike[H, C], (H) => C, Term, Subs[Func[H, C]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DataCons
  2. Serializable
  3. Product
  4. Equals
  5. RecursiveDefinition
  6. RecFunc
  7. Func
  8. FuncLike
  9. Function1
  10. Term
  11. Subs
  12. AnyRef
  13. Any
Implicitly
  1. by UnliftOps
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new DataCons(data: D, defn: (D) => (Func[H, C]) => (H) => Option[C], cons: Term, tail: RecursiveDefinition[H, C], replacement: (Term) => (Term) => (Typ[C]) => Option[DataCons[H, C, D]] = (_: Term) => (_: Term) => (_: Typ[C]) => None)

Type Members

  1. abstract type Obj <: FuncLike[H, C]
    Definition Classes
    FuncLike

Value Members

  1. def act(arg: H): C

    the action of the function to define: define this method, but use apply.

    the action of the function to define: define this method, but use apply.

    Definition Classes
    RecursiveDefinition → Func → FuncLike
  2. def andThen[A](g: (C) => A): (H) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(arg: H): C

    application of the function: use this but define the act method; checks HoTT-type of argument is in the domain and throws exception if it fails.

    application of the function: use this but define the act method; checks HoTT-type of argument is in the domain and throws exception if it fails.

    Definition Classes
    FuncLike → Function1
  4. def applyUnchecked(arg: H): C
    Definition Classes
    FuncLike
  5. def baseFunction: ExstFunc
    Definition Classes
    RecFunc
  6. def canApply(arg: H): Boolean

    checks if application is valid; can override to allow for example resizing universes

    checks if application is valid; can override to allow for example resizing universes

    arg

    the argument

    returns

    whether the argument has the correct type.

    Definition Classes
    FuncLike
  7. def caseFn(f: => Func[H, C])(arg: H): Option[C]

    the optional recursive definition if a case is matched

    the optional recursive definition if a case is matched

    Definition Classes
    DataCons → RecursiveDefinition
  8. val codom: Typ[C]

    codomain

    codomain

    Definition Classes
    DataCons → Func
  9. def compose[A](g: (A) => H): (A) => C
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  10. val cons: Term
  11. val data: D
  12. def dataSubs(that: RecursiveDefinition[H, C], x: Term, y: Term): RecursiveDefinition[H, C]
    Definition Classes
    DataCons → RecursiveDefinition
  13. val defn: (D) => (Func[H, C]) => (H) => Option[C]
  14. val defnData: Vector[Term]

    definition data for all introduction rules.

    definition data for all introduction rules.

    Definition Classes
    DataCons → RecFunc
  15. val depcodom: (H) => Typ[C]
    Definition Classes
    Func → FuncLike
  16. def dependsOn(that: Term): Boolean

    returns whether this depends on that

    returns whether this depends on that

    Definition Classes
    Term
  17. val dom: Typ[H]

    domain

    domain

    Definition Classes
    DataCons → Func → FuncLike
  18. def equals(that: Any): Boolean
    Definition Classes
    RecFunc → AnyRef → Any
  19. def fromData(data: Vector[Term]): DataCons[H, C, D]
    Definition Classes
    DataCons → RecursiveDefinition → RecFunc
  20. lazy val fullData: (Typ[H], Typ[C], Vector[Term])
    Definition Classes
    RecFunc
  21. def hashCode(): Int
    Definition Classes
    RecFunc → AnyRef → Any
  22. def indepOf(that: Term): Boolean

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  23. lazy val intros: Vector[Term]
    Definition Classes
    DataCons → RecFunc
  24. def newobj: DataCons[H, C, D]

    A new object with the same type, to be used in place of a variable to avoid name clashes.

    A new object with the same type, to be used in place of a variable to avoid name clashes. Should throw exception when invoked for constants.

    Definition Classes
    DataCons → Subs
  25. def productElementNames: Iterator[String]
    Definition Classes
    Product
  26. def rebuilt: DataCons[H, C, D]
    Definition Classes
    DataCons → RecursiveDefinition
  27. def replace(x: Term, y: Term): Func[H, C] with Subs[Func[H, C]]

    refine substitution so if x and y are both of certain forms such as pairs or formal applications, components are substituted.

    refine substitution so if x and y are both of certain forms such as pairs or formal applications, components are substituted.

    Definition Classes
    Subs
  28. val replacement: (Term) => (Term) => (Typ[C]) => Option[DataCons[H, C, D]]
  29. def subs(x: Term, y: Term): RecursiveDefinition[H, C]

    substitute x by y recursively in this.

    substitute x by y recursively in this.

    Definition Classes
    DataCons → RecursiveDefinition → Func → FuncLike → Subs
  30. val tail: RecursiveDefinition[H, C]
  31. def toString(): String
    Definition Classes
    RecFunc → Function1 → AnyRef → Any
  32. val typ: FuncTyp[H, C]

    the HoTT-type of the term

    the HoTT-type of the term

    Definition Classes
    DataCons → Func → FuncLike → Term
  33. def unlift: PartialFunction[H, B]
    Implicit
    This member is added by an implicit conversion from DataCons[H, C, D] toUnliftOps[H, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if C is a subclass of Option[B] (C <: Option[B]).
    Definition Classes
    UnliftOps
  34. def usesVar(t: Term): Boolean

    returns whether the variable t is used as a variable in a lambda definition.

    returns whether the variable t is used as a variable in a lambda definition.

    Definition Classes
    RecFunc → Term