KiCS-0.9.3: A compiler from Curry to Haskell

Safe HaskellSafe-Infered

Curry.Module.EasyCheck

Documentation

c_test :: Curry t0 => t0 -> Prim (List t0 -> State -> C_Bool) -> State -> List C_TestSource

c_is :: Curry t0 => t0 -> Prim (t0 -> State -> C_Bool) -> State -> List C_TestSource

c_is'46_'35lambda3 :: Curry t220 => Prim (t220 -> State -> C_Bool) -> List t220 -> State -> C_BoolSource

c_isAlways :: Curry t0 => t0 -> State -> Prim (Prim (t0 -> State -> C_Bool) -> State -> List C_Test)Source

c_isEventually :: Curry t0 => t0 -> State -> Prim (Prim (t0 -> State -> C_Bool) -> State -> List C_Test)Source

op_35 :: Curry t0 => t0 -> C_Int -> State -> List C_TestSource

op_45_61_45 :: Curry t0 => t0 -> t0 -> State -> List C_TestSource

op_60_126_62 :: Curry t0 => t0 -> t0 -> State -> List C_TestSource

op_126_62 :: Curry t0 => t0 -> t0 -> State -> List C_TestSource

op_60_126 :: Curry t0 => t0 -> t0 -> State -> List C_TestSource

c_isSameSet :: Curry t0 => List t0 -> List t0 -> State -> C_BoolSource

c_isSubsetOf :: Curry t0 => List t0 -> List t0 -> State -> C_BoolSource

c_subset :: Curry t0 => List t0 -> List t0 -> State -> C_BoolSource

c_forAll :: (Curry t0, Curry t1) => Prim (t0 -> State -> List C_Test) -> t1 -> Prim (t1 -> State -> t0) -> State -> List C_TestSource

c_forAllValues :: (Curry t0, Curry t1) => Prim (t0 -> State -> List C_Test) -> List t1 -> Prim (t1 -> State -> t0) -> State -> List C_TestSource

c_forAllValues'46_'35lambda5 :: (Curry t330, Curry t327) => Prim (t330 -> State -> List C_Test) -> Prim (t327 -> State -> t330) -> t327 -> State -> List C_TestSource

c_for :: Curry t0 => State -> Prim (t0 -> State -> Prim (Prim (t0 -> State -> List C_Test) -> State -> List C_Test))Source

c_forValues :: Curry t0 => State -> Prim (List t0 -> State -> Prim (Prim (t0 -> State -> List C_Test) -> State -> List C_Test))Source

c_suc :: (Curry t0, Curry t1) => Prim (t0 -> State -> List C_Test) -> State -> Prim (Prim (t1 -> State -> t0) -> State -> List C_Test)Source

c_easyCheck2 :: (Curry t0, Curry t1) => State -> Prim (Prim (t0 -> State -> Prim (t1 -> State -> List C_Test)) -> State -> C_IO T0)Source

c_easyCheck3 :: (Curry t0, Curry t1, Curry t2) => State -> Prim (Prim (t0 -> State -> Prim (t1 -> State -> Prim (t2 -> State -> List C_Test))) -> State -> C_IO T0)Source

c_easyCheck4 :: (Curry t0, Curry t1, Curry t2, Curry t3) => State -> Prim (Prim (t0 -> State -> Prim (t1 -> State -> Prim (t2 -> State -> Prim (t3 -> State -> List C_Test)))) -> State -> C_IO T0)Source

c_easyCheck5 :: (Curry t0, Curry t1, Curry t2, Curry t3, Curry t4) => State -> Prim (Prim (t0 -> State -> Prim (t1 -> State -> Prim (t2 -> State -> Prim (t3 -> State -> Prim (t4 -> State -> List C_Test))))) -> State -> C_IO T0)Source

c_verboseCheck2 :: (Curry t0, Curry t1) => State -> Prim (Prim (t0 -> State -> Prim (t1 -> State -> List C_Test)) -> State -> C_IO T0)Source

c_verboseCheck3 :: (Curry t0, Curry t1, Curry t2) => State -> Prim (Prim (t0 -> State -> Prim (t1 -> State -> Prim (t2 -> State -> List C_Test))) -> State -> C_IO T0)Source

c_verboseCheck4 :: (Curry t0, Curry t1, Curry t2, Curry t3) => State -> Prim (Prim (t0 -> State -> Prim (t1 -> State -> Prim (t2 -> State -> Prim (t3 -> State -> List C_Test)))) -> State -> C_IO T0)Source

c_verboseCheck5 :: (Curry t0, Curry t1, Curry t2, Curry t3, Curry t4) => State -> Prim (Prim (t0 -> State -> Prim (t1 -> State -> Prim (t2 -> State -> Prim (t3 -> State -> Prim (t4 -> State -> List C_Test))))) -> State -> C_IO T0)Source

c_leqPair :: (Curry t0, Curry t1) => Prim (t0 -> State -> Prim (t0 -> State -> C_Bool)) -> Prim (t1 -> State -> Prim (t1 -> State -> C_Bool)) -> T2 t0 t1 -> T2 t0 t1 -> State -> C_BoolSource

c_leList :: Curry t0 => Prim (t0 -> State -> Prim (t0 -> State -> C_Bool)) -> List t0 -> List t0 -> State -> C_BoolSource

c_valuesOf :: Curry t0 => State -> Prim (t0 -> State -> List t0)Source

c_diagonal :: Curry t0 => State -> Prim (List (List t0) -> State -> List t0)Source

c_shuffle :: Curry t0 => C_Int -> List t0 -> State -> List t0Source

c_transpose :: Curry t0 => List (List t0) -> State -> List (List t0)Source

c_transpose'46_'35lambda24 :: Curry t151 => List t151 -> List t151 -> State -> List t151Source

c_transpose'46_'35lambda28 :: Curry t151 => List t151 -> List (List t151) -> State -> List (List t151)Source

c_transpose_case_0 :: Curry t0 => List (List t0) -> List t0 -> State -> List (List t0)Source

c_diagonal'46merge'46268_case_6 :: Curry t0 => List t0 -> t0 -> List t0 -> List (List t0) -> State -> List (List t0)Source

c_leList_case_10 :: Curry t0 => Prim (t0 -> State -> Prim (t0 -> State -> C_Bool)) -> t0 -> List t0 -> List t0 -> State -> C_BoolSource

c_leqPair_case_14 :: (Curry t0, Curry t1, Curry t2, Curry t3) => Prim (t3 -> State -> Prim (t3 -> State -> t1)) -> Prim (t2 -> State -> Prim (t0 -> State -> t1)) -> t3 -> t2 -> T2 t3 t0 -> State -> t1Source

c_leqPair_case_13 :: (Curry t3, Curry t4, Curry t2, Curry t1, Curry t0) => Prim (t4 -> State -> Prim (t3 -> State -> t1)) -> Prim (t2 -> State -> Prim (t0 -> State -> t1)) -> t4 -> t2 -> t3 -> t0 -> C_Bool -> State -> t1Source

c_leqPair_case_12 :: (Curry t2, Curry t1, Curry t0) => Prim (t2 -> State -> Prim (t0 -> State -> t1)) -> t2 -> t0 -> C_Bool -> State -> t1Source