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. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from DataCons[H, C, D] toany2stringadd[DataCons[H, C, D]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (DataCons[H, C, D], B)
    Implicit
    This member is added by an implicit conversion from DataCons[H, C, D] toArrowAssoc[DataCons[H, C, D]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if C is a subclass of Option[Nothing] (C <: Option[Nothing]).
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. 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
  7. def andThen[A](g: (C) => A): (H) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  8. 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
  9. def applyUnchecked(arg: H): C
    Definition Classes
    FuncLike
  10. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  11. def baseFunction: ExstFunc
    Definition Classes
    RecFunc
  12. 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
  13. 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
  14. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  15. val codom: Typ[C]

    codomain

    codomain

    Definition Classes
    DataCons → Func
  16. def compose[A](g: (A) => H): (A) => C
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  17. val cons: Term
  18. val data: D
  19. def dataSubs(that: RecursiveDefinition[H, C], x: Term, y: Term): RecursiveDefinition[H, C]
    Definition Classes
    DataCons → RecursiveDefinition
  20. val defn: (D) => (Func[H, C]) => (H) => Option[C]
  21. val defnData: Vector[Term]

    definition data for all introduction rules.

    definition data for all introduction rules.

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

    returns whether this depends on that

    returns whether this depends on that

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

    domain

    domain

    Definition Classes
    DataCons → Func → FuncLike
  25. def ensuring(cond: (DataCons[H, C, D]) => Boolean, msg: => Any): DataCons[H, C, D]
    Implicit
    This member is added by an implicit conversion from DataCons[H, C, D] toEnsuring[DataCons[H, C, D]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  26. def ensuring(cond: (DataCons[H, C, D]) => Boolean): DataCons[H, C, D]
    Implicit
    This member is added by an implicit conversion from DataCons[H, C, D] toEnsuring[DataCons[H, C, D]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  27. def ensuring(cond: Boolean, msg: => Any): DataCons[H, C, D]
    Implicit
    This member is added by an implicit conversion from DataCons[H, C, D] toEnsuring[DataCons[H, C, D]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  28. def ensuring(cond: Boolean): DataCons[H, C, D]
    Implicit
    This member is added by an implicit conversion from DataCons[H, C, D] toEnsuring[DataCons[H, C, D]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  29. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  30. def equals(that: Any): Boolean
    Definition Classes
    RecFunc → AnyRef → Any
  31. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from DataCons[H, C, D] toStringFormat[DataCons[H, C, D]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  32. def fromData(data: Vector[Term]): DataCons[H, C, D]
    Definition Classes
    DataCons → RecursiveDefinition → RecFunc
  33. lazy val fullData: (Typ[H], Typ[C], Vector[Term])
    Definition Classes
    RecFunc
  34. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  35. def hashCode(): Int
    Definition Classes
    RecFunc → AnyRef → Any
  36. def indepOf(that: Term): Boolean

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  37. lazy val intros: Vector[Term]
    Definition Classes
    DataCons → RecFunc
  38. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  39. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  40. 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
  41. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  42. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  43. def productElementNames: Iterator[String]
    Definition Classes
    Product
  44. def rebuilt: DataCons[H, C, D]
    Definition Classes
    DataCons → RecursiveDefinition
  45. 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
  46. val replacement: (Term) => (Term) => (Typ[C]) => Option[DataCons[H, C, D]]
  47. 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
  48. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  49. val tail: RecursiveDefinition[H, C]
  50. def toString(): String
    Definition Classes
    RecFunc → Function1 → AnyRef → Any
  51. val typ: FuncTyp[H, C]

    the HoTT-type of the term

    the HoTT-type of the term

    Definition Classes
    DataCons → Func → FuncLike → Term
  52. 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
  53. 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
  54. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  55. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  56. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  2. def →[B](y: B): (DataCons[H, C, D], B)
    Implicit
    This member is added by an implicit conversion from DataCons[H, C, D] toArrowAssoc[DataCons[H, C, D]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if C is a subclass of Option[Nothing] (C <: Option[Nothing]).
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from RecursiveDefinition[H, C]

Inherited from RecFunc[H, C]

Inherited from Func[H, C]

Inherited from FuncLike[H, C]

Inherited from (H) => C

Inherited from Term

Inherited from Subs[Func[H, C]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion UnliftOps fromDataCons[H, C, D] to UnliftOps[H, B]

Inherited by implicit conversion any2stringadd fromDataCons[H, C, D] to any2stringadd[DataCons[H, C, D]]

Inherited by implicit conversion StringFormat fromDataCons[H, C, D] to StringFormat[DataCons[H, C, D]]

Inherited by implicit conversion Ensuring fromDataCons[H, C, D] to Ensuring[DataCons[H, C, D]]

Inherited by implicit conversion ArrowAssoc fromDataCons[H, C, D] to ArrowAssoc[DataCons[H, C, D]]

Ungrouped