Biconditional

Instance Constructors

new Biconditional(p: Logic[P, A], q: Logic[P, A])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def &(q: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
Annotations
@inline()
final def <==(a: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
final def <==>(q: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ==>(c: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
final def and(q: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
Annotations
@inline()
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def contramap[B](f: (B) ⇒ A): Logic[P, B]

Definition Classes
Logic
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
final def ifelse(ifPass: Logic[P, A], ifFail: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
final def iff(q: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
Annotations
@inline()
final def implies(c: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
Annotations
@inline()
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def not: Logic[P, A]

Definition Classes
Logic
Annotations
@inline()
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def or(q: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
Annotations
@inline()
val p: Logic[P, A]
val q: Logic[P, A]
final def rename(n: ⇒ String): Logic[P, A]

Definition Classes
Logic
final def rename_:(name: ⇒ String): Logic[P, A]

Definition Classes
Logic
Annotations
@inline()
final def run(x: (P[A]) ⇒ Eval)(implicit F: Contravariant[P]): Eval

Definition Classes
Logic
final def subst[B <: A]: Logic[P, B]

Definition Classes
Logic
Annotations
@inline()
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def unary_~: Logic[P, A]

Definition Classes
Logic
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def |(q: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
Annotations
@inline()
final def ⇐(a: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
Annotations
@inline()
final def ⇔(q: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
Annotations
@inline()
final def ∧(q: Logic[P, A]): Logic[P, A]

Definition Classes
Logic
final def ∨(q: Logic[P, A]): Logic[P, A]

Definition Classes
Logic

Related Doc: package prop

final case class Biconditional[P[_], A](p: Logic[P, A], q: Logic[P, A]) extends Logic[P, A] with Product with Serializable

Instance Constructors

new Biconditional(p: Logic[P, A], q: Logic[P, A])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def &(q: Logic[P, A]): Logic[P, A]

final def <==(a: Logic[P, A]): Logic[P, A]

final def <==>(q: Logic[P, A]): Logic[P, A]

final def ==(arg0: Any): Boolean

final def ==>(c: Logic[P, A]): Logic[P, A]

final def and(q: Logic[P, A]): Logic[P, A]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def contramap[B](f: (B) ⇒ A): Logic[P, B]

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

final def getClass(): Class[_]

final def ifelse(ifPass: Logic[P, A], ifFail: Logic[P, A]): Logic[P, A]

final def iff(q: Logic[P, A]): Logic[P, A]

final def implies(c: Logic[P, A]): Logic[P, A]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def not: Logic[P, A]

final def notify(): Unit

final def notifyAll(): Unit

final def or(q: Logic[P, A]): Logic[P, A]

val p: Logic[P, A]

val q: Logic[P, A]

final def rename(n: ⇒ String): Logic[P, A]

final def rename_:(name: ⇒ String): Logic[P, A]

final def run(x: (P[A]) ⇒ Eval)(implicit F: Contravariant[P]): Eval

final def subst[B <: A]: Logic[P, B]

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

final def unary_~: Logic[P, A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def |(q: Logic[P, A]): Logic[P, A]

final def ⇐(a: Logic[P, A]): Logic[P, A]

final def ⇔(q: Logic[P, A]): Logic[P, A]

final def ∧(q: Logic[P, A]): Logic[P, A]

final def ∨(q: Logic[P, A]): Logic[P, A]

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Logic[P, A]

Inherited from AnyRef

Inherited from Any

Ungrouped