autoproof-0.0.0.0: Propositional logic library
Copyright(c) Artem Mavrin 2021
LicenseBSD3
Maintainerartemvmavrin@gmail.com
Stabilityexperimental
PortabilityPOSIX
Safe HaskellSafe
LanguageHaskell2010

AutoProof.Internal.Utils.PrettyPrintable

Description

Defines the PrettyPrintable class.

Synopsis

Documentation

class PrettyPrintable a where Source #

Class for types that can be "pretty-printed" in a human-readable format.

Minimal complete definition

pretty | prettys

Methods

pretty :: a -> String Source #

Pretty-print a value.

prettys :: a -> ShowS Source #

Difference-list representation of a pretty-printed value.

Instances

Instances details
PrettyPrintable String Source # 
Instance details

Defined in AutoProof.Internal.Utils.PrettyPrintable

Methods

pretty :: String -> String Source #

prettys :: String -> ShowS Source #

PrettyPrintable a => PrettyPrintable (Formula a) Source # 
Instance details

Defined in AutoProof.Internal.Formula.Types

Methods

pretty :: Formula a -> String Source #

prettys :: Formula a -> ShowS Source #

PrettyPrintable a => PrettyPrintable (Judgement a) Source # 
Instance details

Defined in AutoProof.Internal.Judgement

Methods

pretty :: Judgement a -> String Source #

prettys :: Judgement a -> ShowS Source #

PrettyPrintable a => PrettyPrintable (Proof a) Source # 
Instance details

Defined in AutoProof.Internal.Proof.Types

Methods

pretty :: Proof a -> String Source #

prettys :: Proof a -> ShowS Source #

prettySeq :: (Foldable t, PrettyPrintable a) => t a -> String Source #

Pretty-print a collection of pretty-printable values.

prettysSeq :: (Foldable t, PrettyPrintable a) => t a -> ShowS Source #

Difference-list representation of a pretty-printed collection of pretty-printable values.