case class SymbEquality[U <: Term with Subs[U]](name: AnySym, typ: IdentityTyp[U]) extends Equality[U] with Symbolic with Product with Serializable
- Alphabetic
- By Inheritance
- SymbEquality
- Serializable
- Product
- Equals
- Symbolic
- Equality
- Term
- Subs
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new SymbEquality(name: AnySym, typ: IdentityTyp[U])
Value Members
- def &&(that: Equality[U]): Equality[U]
- Definition Classes
- Equality
- def &&&(that: Equality[U]): Equality[U]
- Definition Classes
- Equality
- def **:[V <: Term with Subs[V]](f: Func[U, V]): Equality[V]
- Definition Classes
- Equality
- def *:[V <: Term with Subs[V]](f: Func[U, V]): Equality[V]
- Definition Classes
- Equality
- def dependsOn(that: Term): Boolean
returns whether
thisdepends onthatreturns whether
thisdepends onthat- Definition Classes
- Term
- def equals(that: Any): Boolean
- Definition Classes
- Symbolic → AnyRef → Any
- lazy val hashCode: Int
- Definition Classes
- Symbolic → AnyRef → Any
- def indepOf(that: Term): Boolean
returns whether
thisis independent ofthat.returns whether
thisis independent ofthat.- Definition Classes
- Term
- val lhs: U
- Definition Classes
- Equality
- def lift[V <: Term with Subs[V]](f: Func[U, Typ[V]]): Func[V, V]
- Definition Classes
- Equality
- def liftWit[V <: Term with Subs[V]](f: Func[U, Typ[V]]): Func[V, V]
- Definition Classes
- Equality
- val name: AnySym
- Definition Classes
- SymbEquality → Symbolic
- def newobj: SymbEquality[U]
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
- SymbEquality → Subs
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def replace(x: Term, y: Term): Equality[U] with Subs[Equality[U]]
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
- val rhs: U
- Definition Classes
- Equality
- def subs(x: Term, y: Term): Equality[U]
substitute x by y recursively in
this.substitute x by y recursively in
this.- Definition Classes
- SymbEquality → Subs
- lazy val sym: Equality[U]
- Definition Classes
- Equality
- lazy val symWit: Equality[U]
- Definition Classes
- Equality
- def toString(): String
- Definition Classes
- SymbEquality → Symbolic → AnyRef → Any
- val typ: IdentityTyp[U]
the HoTT-type of the term
the HoTT-type of the term
- Definition Classes
- SymbEquality → Equality → Term
- def usesVar(t: Term): Boolean
returns whether the variable
tis used as a variable in a lambda definition.returns whether the variable
tis used as a variable in a lambda definition.- Definition Classes
- Term