Packages

case class DepPair[W <: Term with Subs[W], U <: Term with Subs[U]](first: W, second: U, fibers: TypFamily[W, U]) extends Term with AbsPair[W, U] with Product with Serializable

Dependent pair (a: A, b : B(a)) - element of a Sigma type.

Linear Supertypes
Serializable, Product, Equals, AbsPair[W, U], Term, Subs[AbsPair[W, U]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DepPair
  2. Serializable
  3. Product
  4. Equals
  5. AbsPair
  6. Term
  7. Subs
  8. AnyRef
  9. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new DepPair(first: W, second: U, fibers: TypFamily[W, U])

Value Members

  1. def dependsOn(that: Term): Boolean

    returns whether this depends on that

    returns whether this depends on that

    Definition Classes
    Term
  2. val fibers: TypFamily[W, U]
  3. val first: W
    Definition Classes
    DepPairAbsPair
  4. def indepComponents: Boolean
  5. def indepOf(that: Term): Boolean

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  6. def newobj: DepPair[W, 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
    DepPairSubs
  7. def productElementNames: Iterator[String]
    Definition Classes
    Product
  8. def replace(x: Term, y: Term): AbsPair[W, U] with Subs[AbsPair[W, 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
  9. val second: U
    Definition Classes
    DepPairAbsPair
  10. def subs(x: Term, y: Term): DepPair[W, U]

    substitute x by y recursively in this.

    substitute x by y recursively in this.

    Definition Classes
    DepPairSubs
  11. def toString(): String
    Definition Classes
    AbsPair → AnyRef → Any
  12. lazy val typ: SigmaTyp[W, U]

    the HoTT-type of the term

    the HoTT-type of the term

    Definition Classes
    DepPairTerm
  13. 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