atp-haskell-1.10: Translation from Ocaml to Haskell of John Harrison's ATP code

Safe HaskellNone
LanguageHaskell98

Data.Logic.ATP.PropExamples

Description

Some propositional formulas to test, and functions to generate classes.

Copyright (c) 2003-2007, John Harrison. (See "LICENSE.txt" for details.)

Synopsis

Documentation

data Knows a Source

Constructors

K String a (Maybe a) 

Instances

Eq a => Eq (Knows a) Source 
Ord a => Ord (Knows a) Source 
Show a => Show (Knows a) Source 
(Num a, Show a) => Pretty (Knows a) Source 
Num a => HasFixity (Knows a) Source 
IsAtom (Knows Integer) Source 

mk_knows :: (IsPropositional formula, AtomOf formula ~ Knows a) => String -> a -> formula Source

mk_knows2 :: (IsPropositional formula, AtomOf formula ~ Knows a) => String -> a -> a -> formula Source

prime :: (IsPropositional formula, Ord formula, AtomOf formula ~ Knows Integer) => Integer -> formula Source

ramsey :: (IsPropositional pf, AtomOf pf ~ Knows Integer, Ord pf) => Integer -> Integer -> Integer -> pf Source

Generate assertion equivalent to R(s,t) <= n for the Ramsey number R(s,t)