SigmaTyper

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def adaptSigmaPropToBoolean(items: Seq[Value[SType]], expectedTypes: Seq[SType]): Seq[Value[SType]]

final def asInstanceOf[T0]: T0

def assignConcreteCollection(cc: ConcreteCollection[SType], newItems: Seq[Value[SType]]): Value[SCollection[SType]]

def assignType(env: Map[String, SType], bound: SValue, expected: Option[SType] = None): SValue

Rewrite tree to typed tree.

def bimap[T <: SType](env: Map[String, SType], op: String, l: Value[T], r: Value[T])(mkNode: (Value[T], Value[T]) ⇒ SValue)(tArg: SType, tRes: SType): SValue

def bimap2[T <: SType](env: Map[String, SType], op: String, l: Value[T], r: Value[T])(newNode: (Value[T], Value[T]) ⇒ SValue): SValue

val builder: SigmaBuilder

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

def typecheck(bound: SValue): SValue

def unmap[T <: SType](env: Map[String, SType], op: String, i: Value[T])(newNode: (Value[T]) ⇒ SValue)(tArg: SType): SValue

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit