SpaceLogic

abstract def canDecompose(tp: Type): Boolean

Is the type tp decomposable? i.e.

abstract def decompose(tp: Type): List[Space]

Get components of decomposable types

abstract def isEqualType(tp1: Type, tp2: Type): Boolean

Is tp1 the same type as tp2?

abstract def isSubType(tp1: Type, tp2: Type): Boolean

Is tp1 a subtype of tp2?

abstract def signature(tp: Type): List[Type]

Return term parameter types of the case class tp

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def flatten(space: Space): List[Space]

Flatten space to get rid of Or for pretty print

final def getClass(): Class[_]

def hashCode(): Int

def intersect(a: Space, b: Space): Space

Intersection of two spaces

final def isInstanceOf[T0]: Boolean

def isSubspace(a: Space, b: Space): Boolean

Is a a subspace of b? Equivalent to a - b == Empty, but faster

def minus(a: Space, b: Space): Space

The space of a not covered by b

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def simplify(space: Space): Space

Simplify space using the laws, there's no nested union after simplify

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit