Skip to content

HORIZON HASKELL Docs lts/ghc-9.14.x45dd5372026-10-11Search names, modules, packages, or :: a typeCtrl K

GHC 9.14.1 · lts/ghc-9.14.x · 45dd537 · 2026-10-11

Moduleghc-9.14.1GHC2021

GHC.Data.BooleanFormula

Boolean formulas without quantifiers and without negation. Such a formula consists of variables, conjunctions (and), and disjunctions (or).

This module is used to represent minimal complete definitions for classes.

12 values

Packageghc-9.14.1
Exports12
LanguageGHC2021
LicenceBSD-3-Clause
SourceBooleanFormula.hs

module Language.Haskell.Syntax.BooleanFormula

valueisFalse :: BooleanFormula (GhcPass p) -> Bool

valueisTrue :: BooleanFormula (GhcPass p) -> Bool

valuebfMap

:: LIdP (GhcPass p) -> LIdP (GhcPass p')
-> BooleanFormula (GhcPass p)
-> BooleanFormula (GhcPass p')

valuebfTraverse

:: Applicative f
=> LIdP (GhcPass p) -> f (LIdP (GhcPass p'))
-> BooleanFormula (GhcPass p)
-> f (BooleanFormula (GhcPass p'))

valueeval :: (LIdP (GhcPass p) -> Bool) -> BooleanFormula (GhcPass p) -> Bool

valuesimplify

:: Eq (LIdP (GhcPass p))
=> LIdP (GhcPass p) -> Maybe Bool
-> BooleanFormula (GhcPass p)
-> BooleanFormula (GhcPass p)

valueisUnsatisfied

:: Eq (LIdP (GhcPass p))
=> LIdP (GhcPass p) -> Bool
-> BooleanFormula (GhcPass p)
-> Maybe (BooleanFormula (GhcPass p))

valueimplies

valueimpliesAtom

:: Eq (IdP (GhcPass p))
=> BooleanFormula (GhcPass p)
-> LIdP (GhcPass p)
-> Bool

valuepprBooleanFormula

:: Rational -> LIdP (GhcPass p) -> SDoc
-> Rational
-> BooleanFormula (GhcPass p)
-> SDoc

valuepprBooleanFormulaNice

valuepprBooleanFormulaNormal

Orphan instances

1 instance

OutputableBndrId p => Outputable (BooleanFormula (GhcPass p))