Formula

sbt.internal.util.logic.Formula

See theFormula companion object

sealed abstract class Formula

A formula consists of variables, negation, and conjunction (and). (Disjunction is not currently included- it is modeled at the level of a sequence of clauses. This is less convenient when defining clauses, but is not less powerful.)

Attributes

Companion: object
Graph
Supertypes: class Object

trait Matchable

class Any
Known subtypes: class And

object True.type

class Literal

class Atom

class Negated

Members list

Value members

Concrete methods

Constructs a formula that is true iff this formula and f are both true.

Attributes

Constructs a clause that proves atoms when this formula is true.

Attributes

In this article

Generated with