Skip to content

HORIZON HASKELL Docs lts/ghc-10.0.x04404a62026-10-19Search packagesCtrl K

Theme: |

GHC 10.0.0.20260917 · lts/ghc-10.0.x · 04404a6 · 2026-10-19

Moduleghc-10.0.0.20260917GHC2024

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.

Synopsis

value isFalse
value isTrue
value bfMap
value bfTraverse
value eval
value simplify
value isUnsatisfied
value implies
value impliesAtom
value pprBooleanFormula
value pprBooleanFormulaNice
value pprBooleanFormulaNormal

Packageghc-10.0.0.20260917
Exports12
LanguageGHC2024
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))