case class PairTerm[U <: Term with Subs[U], V <: Term with Subs[V]](first: U, second: V) extends AbsPair[U, V] with Subs[PairTerm[U, V]] with Product with Serializable
Term (a, b) in A times B
- Alphabetic
- By Inheritance
- PairTerm
- Serializable
- Product
- Equals
- AbsPair
- Term
- Subs
- AnyRef
- Any
- by RichTerm
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new PairTerm(first: U, second: V)
Value Members
- def :->[V <: Term with Subs[V]](that: V): Func[PairTerm[U, V], V]
constructor for (pure) lambda functions, see lmbda
- def :~>[V <: Term with Subs[V]](that: V): FuncLike[PairTerm[U, V], V]
constructor for (in general dependent) lambda functions, see lambda
- def =:=(rhs: PairTerm[U, V]): IdentityTyp[PairTerm[U, V]]
equality type 'term = rhs'
equality type 'term = rhs'
- Implicit
- This member is added by an implicit conversion from PairTerm[U, V] toRichTerm[PairTerm[U, V]] performed by method RichTerm in provingground.HoTT.
- Definition Classes
- RichTerm
- def dependsOn(that: Term): Boolean
returns whether
thisdepends onthatreturns whether
thisdepends onthat- Definition Classes
- Term
- val first: U
- def indepOf(that: Term): Boolean
returns whether
thisis independent ofthat.returns whether
thisis independent ofthat.- Definition Classes
- Term
- def newobj: PairTerm[U, V]
A new object with the same type, to be used in place of a variable to avoid name clashes.
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def refl: Refl[PairTerm[U, V]]
reflexivity term
refl : term = termreflexivity term
refl : term = term- Implicit
- This member is added by an implicit conversion from PairTerm[U, V] toRichTerm[PairTerm[U, V]] performed by method RichTerm in provingground.HoTT.
- Definition Classes
- RichTerm
- def replace(x: Term, y: Term): PairTerm[U, V] with Subs[PairTerm[U, 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
- val second: V
- def subs(x: Term, y: Term): PairTerm[U, V]
substitute x by y recursively in
this. - def toString(): String
- Definition Classes
- AbsPair → AnyRef → Any
- lazy val typ: ProdTyp[U, V]
the HoTT-type of the 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