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
  • object HoTT

    Core of Homotopy Type Theory (HoTT) implementation.

    Core of Homotopy Type Theory (HoTT) implementation. Includes: - terms : Term, - types : Typ - universes - functions and dependent functions (see [FuncLike], [Func]) - function types FuncTyp and pi-types PiDefn, - lambda definitions LambdaLike, - pairs PairTerm and dependent pairs DepPair - product types ProdTyp and sigma types SigmaTyp - Coproduct types PlusTyp, the Unit type Unit and the empty type Zero - recursion and induction functions for products, coproducts

    General inductive types are not implemented here, but in the induction package.

    Definition Classes
    provingground
  • object IdentityTyp extends Serializable
    Definition Classes
    HoTT
  • InducFn
  • RecFn

case class RecFn[U <: Term with Subs[U], V <: Term with Subs[V]](domain: Typ[U], target: Typ[V], data: Func[U, V], start: U, end: U) extends IndRecFunc[Term, V, Func[U, Func[U, Typ[Term]]]] with Product with Serializable

recursive definition on identity type families

Self Type
RecFn[U, V]
Linear Supertypes
Serializable, Product, Equals, IndRecFunc[Term, V, Func[U, Func[U, Typ[Term]]]], Func[Term, V], FuncLike[Term, V], (Term) => V, Term, Subs[Func[Term, V]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RecFn
  2. Serializable
  3. Product
  4. Equals
  5. IndRecFunc
  6. Func
  7. FuncLike
  8. Function1
  9. Term
  10. Subs
  11. AnyRef
  12. 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 RecFn(domain: Typ[U], target: Typ[V], data: Func[U, V], start: U, end: U)

Type Members

  1. abstract type Obj <: FuncLike[Term, V]
    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 RecFn[U, V] toany2stringadd[RecFn[U, V]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (RecFn[U, V], B)
    Implicit
    This member is added by an implicit conversion from RecFn[U, V] toArrowAssoc[RecFn[U, V]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if V is a subclass of Option[Nothing] (V <: Option[Nothing]).
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def act(t: Term): V

    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
    RecFnFuncFuncLike
  7. def andThen[A](g: (V) => A): (Term) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  8. def apply(arg: Term): V

    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: Term): V
    Definition Classes
    FuncLike
  10. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  11. def canApply(arg: Term): 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
  12. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  13. lazy val codom: Typ[V]

    codomain

    codomain

    Definition Classes
    RecFnIndRecFuncFunc
  14. def compose[A](g: (A) => Term): (A) => V
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  15. val data: Func[U, V]
  16. val defnData: Vector[Func[U, V]]

    definition data for all introduction rules.

    definition data for all introduction rules.

    Definition Classes
    RecFnIndRecFunc
  17. val depcodom: (Term) => Typ[V]
    Definition Classes
    FuncFuncLike
  18. def dependsOn(that: Term): Boolean

    returns whether this depends on that

    returns whether this depends on that

    Definition Classes
    Term
  19. lazy val dom: IdentityTyp[U]

    domain

    domain

    Definition Classes
    RecFnFuncFuncLike
  20. lazy val domW: Func[U, Func[U, IdentityTyp[U]]]

    the dependent codomain on the family.

    the dependent codomain on the family.

    Definition Classes
    RecFnIndRecFunc
  21. val domain: Typ[U]
  22. val end: U
  23. def ensuring(cond: (RecFn[U, V]) => Boolean, msg: => Any): RecFn[U, V]
    Implicit
    This member is added by an implicit conversion from RecFn[U, V] toEnsuring[RecFn[U, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  24. def ensuring(cond: (RecFn[U, V]) => Boolean): RecFn[U, V]
    Implicit
    This member is added by an implicit conversion from RecFn[U, V] toEnsuring[RecFn[U, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  25. def ensuring(cond: Boolean, msg: => Any): RecFn[U, V]
    Implicit
    This member is added by an implicit conversion from RecFn[U, V] toEnsuring[RecFn[U, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  26. def ensuring(cond: Boolean): RecFn[U, V]
    Implicit
    This member is added by an implicit conversion from RecFn[U, V] toEnsuring[RecFn[U, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  27. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  28. def equals(that: Any): Boolean
    Definition Classes
    IndRecFunc → AnyRef → Any
  29. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from RecFn[U, V] toStringFormat[RecFn[U, V]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  30. def fromData(data: Vector[Term]): RecFn[U, V]
  31. lazy val fullIndData: (Func[U, Func[U, Typ[Term]]], Vector[Term], Typ[V], Vector[Term])
    Definition Classes
    IndRecFunc
  32. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  33. def hashCode(): Int
    Definition Classes
    IndRecFunc → AnyRef → Any
  34. def indepOf(that: Term): Boolean

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  35. val index: Vector[U]

    indices of the introduction rules.

    indices of the introduction rules.

    Definition Classes
    RecFnIndRecFunc
  36. val intros: Vector[Term]
    Definition Classes
    RecFnIndRecFunc
  37. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  38. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  39. def newobj: Nothing

    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
    RecFnSubs
  40. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  41. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  42. def productElementNames: Iterator[String]
    Definition Classes
    Product
  43. def replace(x: Term, y: Term): Func[Term, V] with Subs[Func[Term, V]]

    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
  44. val start: U
  45. def subs(x: Term, y: Term): RecFn[U with Subs[U], V]

    substitute x by y recursively in this.

    substitute x by y recursively in this.

    Definition Classes
    RecFnFuncFuncLikeSubs
  46. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  47. val target: Typ[V]
  48. def toString(): String
    Definition Classes
    IndRecFunc → Function1 → AnyRef → Any
  49. lazy val typ: FuncTyp[Term, V]

    the HoTT-type of the term

    the HoTT-type of the term

    Definition Classes
    RecFnFuncFuncLikeTerm
  50. def unlift: PartialFunction[Term, B]
    Implicit
    This member is added by an implicit conversion from RecFn[U, V] toUnliftOps[Term, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if V is a subclass of Option[B] (V <: Option[B]).
    Definition Classes
    UnliftOps
  51. 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
    Term
  52. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  53. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  54. 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): (RecFn[U, V], B)
    Implicit
    This member is added by an implicit conversion from RecFn[U, V] toArrowAssoc[RecFn[U, V]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if V is a subclass of Option[Nothing] (V <: 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 IndRecFunc[Term, V, Func[U, Func[U, Typ[Term]]]]

Inherited from Func[Term, V]

Inherited from FuncLike[Term, V]

Inherited from (Term) => V

Inherited from Term

Inherited from Subs[Func[Term, V]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion UnliftOps fromRecFn[U, V] to UnliftOps[Term, B]

Inherited by implicit conversion any2stringadd fromRecFn[U, V] to any2stringadd[RecFn[U, V]]

Inherited by implicit conversion StringFormat fromRecFn[U, V] to StringFormat[RecFn[U, V]]

Inherited by implicit conversion Ensuring fromRecFn[U, V] to Ensuring[RecFn[U, V]]

Inherited by implicit conversion ArrowAssoc fromRecFn[U, V] to ArrowAssoc[RecFn[U, V]]

Ungrouped