KiCS-0.9.3: A compiler from Curry to Haskell

Safe HaskellSafe-Infered

Curry.Module.GraphInductive

Documentation

type C_LNode t0 = T2 C_Int t0Source

type C_Context t0 t1 = T4 (List (T2 t1 C_Int)) C_Int t0 (List (T2 t1 C_Int))Source

type C_Adj t0 = List (T2 t0 C_Int)Source

type C_MContext t0 t1 = C_Maybe (T4 (List (T2 t1 C_Int)) C_Int t0 (List (T2 t1 C_Int)))Source

type C_Context'39 t0 t1 = T3 (List (T2 t1 C_Int)) t0 (List (T2 t1 C_Int))Source

type C_GDecomp t0 t1 = T2 (T4 (List (T2 t1 C_Int)) C_Int t0 (List (T2 t1 C_Int))) (C_Graph t0 t1)Source

type C_Decomp t0 t1 = T2 (C_Maybe (T4 (List (T2 t1 C_Int)) C_Int t0 (List (T2 t1 C_Int)))) (C_Graph t0 t1)Source

type C_LPath t0 = List (T2 C_Int t0)Source

type C_GraphRep t0 t1 = C_FM C_Int (T3 (List (T2 t1 C_Int)) t0 (List (T2 t1 C_Int)))Source

data C_Graph t0 t1 Source

Constructors

C_Gr (C_FM C_Int (T3 (List (T2 t1 C_Int)) t0 (List (T2 t1 C_Int)))) 
C_GraphFail C_Exceptions 
C_GraphOr OrRef (Branches (C_Graph t0 t1)) 

Instances

(Read t0, Read t1) => Read (C_Graph t0 t1) 
(Show t0, Show t1) => Show (C_Graph t0 t1) 
(BaseCurry t0, BaseCurry t1) => BaseCurry (C_Graph t0 t1) 
(Curry t0, Curry t1) => Curry (C_Graph t0 t1) 

op_58_38 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> C_Graph t1 t0 -> State -> C_Graph t1 t0Source

c_matchAny :: (Curry t0, Curry t1) => C_Graph t0 t1 -> State -> T2 (T4 (List (T2 t1 C_Int)) C_Int t0 (List (T2 t1 C_Int))) (C_Graph t0 t1)Source

c_empty :: (Curry t0, Curry t1) => State -> C_Graph t0 t1Source

c_mkGraph :: (Curry t0, Curry t1) => List (T2 C_Int t0) -> List (T3 C_Int C_Int t1) -> State -> C_Graph t0 t1Source

c_buildGr :: (Curry t0, Curry t1) => State -> Prim (List (T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int))) -> State -> C_Graph t1 t0)Source

c_insNode :: (Curry t0, Curry t1) => T2 C_Int t0 -> State -> Prim (C_Graph t0 t1 -> State -> C_Graph t0 t1)Source

c_insEdge :: (Curry t0, Curry t1) => T3 C_Int C_Int t0 -> C_Graph t1 t0 -> State -> C_Graph t1 t0Source

c_insEdge'46_'35selFP3'35pr :: (Curry t213, Curry t212) => T2 (C_Maybe (T4 (List (T2 t213 C_Int)) C_Int t212 (List (T2 t213 C_Int)))) (C_Graph t212 t213) -> State -> List (T2 t213 C_Int)Source

c_insEdge'46_'35selFP4'35la :: (Curry t213, Curry t212) => T2 (C_Maybe (T4 (List (T2 t213 C_Int)) C_Int t212 (List (T2 t213 C_Int)))) (C_Graph t212 t213) -> State -> t212Source

c_insEdge'46_'35selFP5'35su :: (Curry t213, Curry t212) => T2 (C_Maybe (T4 (List (T2 t213 C_Int)) C_Int t212 (List (T2 t213 C_Int)))) (C_Graph t212 t213) -> State -> List (T2 t213 C_Int)Source

c_insEdge'46_'35selFP6'35g'39 :: (Curry t213, Curry t212) => T2 (C_Maybe (T4 (List (T2 t213 C_Int)) C_Int t212 (List (T2 t213 C_Int)))) (C_Graph t212 t213) -> State -> C_Graph t212 t213Source

c_delNode :: (Curry t0, Curry t1) => C_Int -> State -> Prim (C_Graph t0 t1 -> State -> C_Graph t0 t1)Source

c_delEdge :: (Curry t0, Curry t1) => T2 C_Int C_Int -> C_Graph t0 t1 -> State -> C_Graph t0 t1Source

c_insNodes :: (Curry t0, Curry t1) => List (T2 C_Int t0) -> C_Graph t0 t1 -> State -> C_Graph t0 t1Source

c_insEdges :: (Curry t0, Curry t1) => List (T3 C_Int C_Int t0) -> C_Graph t1 t0 -> State -> C_Graph t1 t0Source

c_delNodes :: (Curry t0, Curry t1) => List C_Int -> C_Graph t0 t1 -> State -> C_Graph t0 t1Source

c_delEdges :: (Curry t0, Curry t1) => List (T2 C_Int C_Int) -> C_Graph t0 t1 -> State -> C_Graph t0 t1Source

c_isEmpty :: (Curry t0, Curry t1) => C_Graph t0 t1 -> State -> C_BoolSource

c_match :: (Curry t0, Curry t1) => C_Int -> C_Graph t0 t1 -> State -> T2 (C_Maybe (T4 (List (T2 t1 C_Int)) C_Int t0 (List (T2 t1 C_Int)))) (C_Graph t0 t1)Source

c_match'46_'35lambda5 :: (Curry t146, Curry t148) => C_Int -> T2 (C_FM C_Int (T3 (List (T2 t146 C_Int)) t148 (List (T2 t146 C_Int)))) (T2 C_Int (T3 (List (T2 t146 C_Int)) t148 (List (T2 t146 C_Int)))) -> State -> T2 (C_Maybe (T4 (List (T2 t146 C_Int)) C_Int t148 (List (T2 t146 C_Int)))) (C_Graph t148 t146)Source

c_noNodes :: (Curry t0, Curry t1) => C_Graph t0 t1 -> State -> C_IntSource

c_nodeRange :: (Curry t0, Curry t1) => C_Graph t0 t1 -> State -> T2 C_Int C_IntSource

c_context :: (Curry t0, Curry t1) => C_Graph t0 t1 -> C_Int -> State -> T4 (List (T2 t1 C_Int)) C_Int t0 (List (T2 t1 C_Int))Source

c_lab :: (Curry t0, Curry t1) => C_Graph t0 t1 -> C_Int -> State -> C_Maybe t0Source

c_neighbors :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> Prim (C_Int -> State -> List C_Int))Source

c_neighbors'46_'35lambda7 :: (Curry t416, Curry t415) => T4 (List (T2 t416 C_Int)) C_Int t415 (List (T2 t416 C_Int)) -> State -> List C_IntSource

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

c_pre :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> Prim (C_Int -> State -> List C_Int))Source

c_lsuc :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> Prim (C_Int -> State -> List (T2 C_Int t1)))Source

c_lpre :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> Prim (C_Int -> State -> List (T2 C_Int t1)))Source

c_out :: (Curry t0, Curry t1) => C_Graph t0 t1 -> C_Int -> State -> List (T3 C_Int C_Int t1)Source

c_inn :: (Curry t0, Curry t1) => C_Graph t0 t1 -> C_Int -> State -> List (T3 C_Int C_Int t1)Source

c_outdeg :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> Prim (C_Int -> State -> C_Int))Source

c_indeg :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> Prim (C_Int -> State -> C_Int))Source

c_deg :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> Prim (C_Int -> State -> C_Int))Source

c_deg'46_'35lambda10 :: (Curry t553, Curry t552) => T4 (List (T2 t553 C_Int)) C_Int t552 (List (T2 t553 C_Int)) -> State -> C_IntSource

c_gelem :: (Curry t0, Curry t1) => C_Int -> C_Graph t0 t1 -> State -> C_BoolSource

c_equal :: (Curry t0, Curry t1) => C_Graph t0 t1 -> C_Graph t0 t1 -> State -> C_BoolSource

c_slabNodes :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> List (T2 C_Int t0))Source

c_slabEdges :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> List (T3 C_Int C_Int t1))Source

c_node'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> C_IntSource

c_lab'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> t1Source

c_labNode'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> T2 C_Int t1Source

c_neighbors'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> List C_IntSource

c_suc'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> List C_IntSource

c_pre'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> List C_IntSource

c_lpre'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> List (T2 C_Int t0)Source

c_lsuc'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> List (T2 C_Int t0)Source

c_out'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> List (T3 C_Int C_Int t0)Source

c_inn'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> List (T3 C_Int C_Int t0)Source

c_outdeg'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> C_IntSource

c_indeg'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> C_IntSource

c_deg'39 :: (Curry t0, Curry t1) => T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> C_IntSource

c_labNodes :: (Curry t0, Curry t1) => C_Graph t0 t1 -> State -> List (T2 C_Int t0)Source

c_labNodes'46_'35lambda13 :: (Curry t574, Curry t573) => T2 C_Int (T3 (List (T2 t574 C_Int)) t573 (List (T2 t574 C_Int))) -> State -> T2 C_Int t573Source

c_labEdges :: (Curry t0, Curry t1) => C_Graph t0 t1 -> State -> List (T3 C_Int C_Int t1)Source

c_labEdges'46_'35lambda14 :: (Curry t620, Curry t619) => T2 C_Int (T3 (List (T2 t620 C_Int)) t619 (List (T2 t620 C_Int))) -> State -> List (T3 C_Int C_Int t620)Source

c_nodes :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> List C_Int)Source

c_edges :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> List (T2 C_Int C_Int))Source

c_newNodes :: (Curry t0, Curry t1) => C_Int -> C_Graph t0 t1 -> State -> List C_IntSource

c_ufold :: (Curry t0, Curry t1, Curry t2) => Prim (T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> Prim (t2 -> State -> t2)) -> t2 -> C_Graph t1 t0 -> State -> t2Source

c_ufold'46_'35selFP16'35c :: (Curry t807, Curry t806) => T2 (T4 (List (T2 t807 C_Int)) C_Int t806 (List (T2 t807 C_Int))) (C_Graph t806 t807) -> State -> T4 (List (T2 t807 C_Int)) C_Int t806 (List (T2 t807 C_Int))Source

c_ufold'46_'35selFP17'35g'39 :: (Curry t807, Curry t806) => T2 (T4 (List (T2 t807 C_Int)) C_Int t806 (List (T2 t807 C_Int))) (C_Graph t806 t807) -> State -> C_Graph t806 t807Source

c_gmap :: (Curry t0, Curry t1, Curry t2, Curry t3) => Prim (T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> T4 (List (T2 t2 C_Int)) C_Int t3 (List (T2 t2 C_Int))) -> State -> Prim (C_Graph t1 t0 -> State -> C_Graph t3 t2)Source

c_gmap'46_'35lambda17 :: (Curry t821, Curry t822, Curry t830, Curry t829) => Prim (T4 (List (T2 t821 C_Int)) C_Int t822 (List (T2 t821 C_Int)) -> State -> T4 (List (T2 t830 C_Int)) C_Int t829 (List (T2 t830 C_Int))) -> T4 (List (T2 t821 C_Int)) C_Int t822 (List (T2 t821 C_Int)) -> State -> Prim (C_Graph t829 t830 -> State -> C_Graph t829 t830)Source

c_nmap :: (Curry t0, Curry t1, Curry t2) => Prim (t0 -> State -> t1) -> State -> Prim (C_Graph t0 t2 -> State -> C_Graph t1 t2)Source

c_nmap'46_'35lambda18 :: (Curry t841, Curry t844, Curry t837) => Prim (t841 -> State -> t844) -> T4 (List (T2 t837 C_Int)) C_Int t841 (List (T2 t837 C_Int)) -> State -> T4 (List (T2 t837 C_Int)) C_Int t844 (List (T2 t837 C_Int))Source

c_emap :: (Curry t0, Curry t1, Curry t2) => Prim (t0 -> State -> t1) -> State -> Prim (C_Graph t2 t0 -> State -> C_Graph t2 t1)Source

c_emap'46map1'46213 :: (Curry t0, Curry t1, Curry t2) => Prim (t0 -> State -> t1) -> State -> Prim (List (T2 t0 t2) -> State -> List (T2 t1 t2))Source

c_emap'46map1'46213'46_'35lambda19 :: (Curry t853, Curry t856, Curry t854) => Prim (t853 -> State -> t856) -> T2 t853 t854 -> State -> T2 t856 t854Source

c_emap'46_'35lambda20 :: (Curry t865, Curry t866, Curry t863) => Prim (t865 -> State -> t866) -> T4 (List (T2 t865 C_Int)) C_Int t863 (List (T2 t865 C_Int)) -> State -> T4 (List (T2 t866 C_Int)) C_Int t863 (List (T2 t866 C_Int))Source

c_labUEdges :: (Curry t0, Curry t1) => State -> Prim (List (T2 t0 t1) -> State -> List (T3 t0 t1 T0))Source

c_labUEdges'46_'35lambda21 :: (Curry t249, Curry t250) => T2 t249 t250 -> State -> T3 t249 t250 T0Source

c_labUNodes :: Curry t0 => State -> Prim (List t0 -> State -> List (T2 t0 T0))Source

c_labUNodes'46_'35lambda22 :: Curry t254 => t254 -> State -> T2 t254 T0Source

c_showGraph :: (Curry t0, Curry t1) => C_Graph t0 t1 -> State -> List C_CharSource

c_showNode :: (Curry t0, Curry t1, Curry t2, Curry t3) => T2 t0 (T3 t1 t2 t3) -> State -> List C_CharSource

op_46_58 :: (Curry t0, Curry t1, Curry t2, Curry t3) => State -> Prim (Prim (t0 -> State -> t1) -> State -> Prim (Prim (t2 -> State -> Prim (t3 -> State -> t0)) -> State -> Prim (t2 -> State -> Prim (t3 -> State -> t1))))Source

c_fst4 :: (Curry t0, Curry t1, Curry t2, Curry t3) => T4 t0 t1 t2 t3 -> State -> t0Source

c_fth4 :: (Curry t0, Curry t1, Curry t2, Curry t3) => T4 t0 t1 t2 t3 -> State -> t3Source

c_flip2 :: (Curry t0, Curry t1) => T2 t0 t1 -> State -> T2 t1 t0Source

c_context1 :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> Prim (C_Int -> State -> List (T2 t1 C_Int)))Source

c_context4 :: (Curry t0, Curry t1) => State -> Prim (C_Graph t0 t1 -> State -> Prim (C_Int -> State -> List (T2 t1 C_Int)))Source

c_addSucc :: (Curry t0, Curry t1, Curry t2, Curry t3) => t0 -> t1 -> T3 t2 t3 (List (T2 t1 t0)) -> State -> T3 t2 t3 (List (T2 t1 t0))Source

c_addPred :: (Curry t0, Curry t1, Curry t2, Curry t3) => t0 -> t1 -> T3 (List (T2 t1 t0)) t2 t3 -> State -> T3 (List (T2 t1 t0)) t2 t3Source

c_clearSucc :: (Curry t0, Curry t1, Curry t2, Curry t3, Curry t4) => t0 -> t1 -> T3 t2 t3 (List (T2 t4 t0)) -> State -> T3 t2 t3 (List (T2 t4 t0))Source

c_clearPred :: (Curry t0, Curry t1, Curry t2, Curry t3, Curry t4) => t0 -> t1 -> T3 (List (T2 t2 t0)) t3 t4 -> State -> T3 (List (T2 t2 t0)) t3 t4Source

c_updAdj :: (Curry t0, Curry t1) => C_FM C_Int (T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int))) -> List (T2 t0 C_Int) -> Prim (t0 -> State -> Prim (T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int)) -> State -> T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int)))) -> State -> C_FM C_Int (T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int)))Source

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

c_sortBy'46_'35lambda23 :: Curry t587 => Prim (t587 -> State -> Prim (t587 -> State -> C_Ordering)) -> t587 -> t587 -> State -> C_BoolSource

c_updAdj_case_2 :: (Curry t0, Curry t1) => C_FM C_Int (T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int))) -> Prim (t0 -> State -> Prim (T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int)) -> State -> T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int)))) -> List (T2 t0 C_Int) -> T2 t0 C_Int -> State -> C_FM C_Int (T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int)))Source

c_updAdj_case_1 :: (Curry t1, Curry t0) => C_FM C_Int (T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int))) -> Prim (t0 -> State -> Prim (T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int)) -> State -> T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int)))) -> List (T2 t0 C_Int) -> t0 -> C_Int -> C_Bool -> State -> C_FM C_Int (T3 (List (T2 t0 C_Int)) t1 (List (T2 t0 C_Int)))Source

c_updAdj_case_0 :: (Curry t1, Curry t0) => t1 -> C_Bool -> State -> t0Source

c_showNode_case_3 :: (BaseCurry t, Curry t2, Curry t1, Curry t0) => t0 -> T3 t t1 t2 -> State -> List C_CharSource

c_ufold_case_5 :: (Curry t0, Curry t1, Curry t2) => Prim (T4 (List (T2 t1 C_Int)) C_Int t2 (List (T2 t1 C_Int)) -> State -> Prim (t0 -> State -> t0)) -> t0 -> t -> T2 (T4 (List (T2 t1 C_Int)) C_Int t2 (List (T2 t1 C_Int))) (C_Graph t2 t1) -> C_Bool -> State -> t0Source

c_ufold_case_4 :: (Curry t2, Curry t1, Curry t0) => Prim (T4 (List (T2 t1 C_Int)) C_Int t2 (List (T2 t1 C_Int)) -> State -> Prim (t0 -> State -> t0)) -> t0 -> T2 (T4 (List (T2 t1 C_Int)) C_Int t2 (List (T2 t1 C_Int))) (C_Graph t2 t1) -> C_Bool -> State -> t0Source

c_edgeComp_case_9 :: t -> t1 -> t2 -> t3 -> C_Bool -> State -> C_OrderingSource

c_context_case_15 :: (BaseCurry t1, Curry t0, Curry t2) => t -> t2 -> T2 (C_Maybe t0) t1 -> State -> t0Source

c_context_case_14 :: (Curry t1, Curry t0) => t1 -> C_Maybe t0 -> State -> t0Source

c_nodeRange_case_17 :: (Curry t0, Curry t1) => C_FM t0 t1 -> Prim (C_Maybe (T2 t0 t1) -> State -> C_Int) -> C_Bool -> State -> T2 C_Int C_IntSource

c_nodeRange_case_16 :: (Curry t2, Curry t0, Curry t1) => C_FM t0 t2 -> Prim (C_Maybe (T2 t0 t2) -> State -> t1) -> C_Bool -> State -> T2 t1 t1Source

c_match'46_'35lambda5_case_19 :: (BaseCurry t, BaseCurry t2, Curry t1, Curry t0) => C_Int -> C_FM C_Int (T3 (List (T2 t1 C_Int)) t0 (List (T2 t1 C_Int))) -> T2 t (T3 (List (T2 t1 C_Int)) t2 (List (T2 t1 C_Int))) -> State -> T2 (C_Maybe (T4 (List (T2 t1 C_Int)) C_Int t2 (List (T2 t1 C_Int)))) (C_Graph t0 t1)Source

c_match'46_'35lambda5_case_18 :: (BaseCurry t2, Curry t0, Curry t1) => C_Int -> C_FM C_Int (T3 (List (T2 t1 C_Int)) t0 (List (T2 t1 C_Int))) -> T3 (List (T2 t1 C_Int)) t2 (List (T2 t1 C_Int)) -> State -> T2 (C_Maybe (T4 (List (T2 t1 C_Int)) C_Int t2 (List (T2 t1 C_Int)))) (C_Graph t0 t1)Source

c_delEdge_case_22 :: (Curry t1, Curry t0) => C_Graph t1 t0 -> t -> C_Int -> T2 (C_Maybe (T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)))) (C_Graph t1 t0) -> State -> C_Graph t1 t0Source

c_delEdge_case_21 :: (Curry t0, Curry t1) => C_Graph t1 t0 -> C_Int -> C_Graph t1 t0 -> C_Maybe (T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int))) -> State -> C_Graph t1 t0Source

c_delEdge_case_20 :: (Curry t1, Curry t0) => C_Int -> C_Graph t1 t0 -> T4 (List (T2 t0 C_Int)) C_Int t1 (List (T2 t0 C_Int)) -> State -> C_Graph t1 t0Source

c_matchAny_case_35 :: (Curry t1, Curry t0) => C_FM C_Int (T3 (List (T2 t1 C_Int)) t0 (List (T2 t1 C_Int))) -> C_Bool -> State -> T2 (T4 (List (T2 t1 C_Int)) C_Int t0 (List (T2 t1 C_Int))) (C_Graph t0 t1)Source

c_matchAny_case_34 :: (Curry t0, Curry t1) => C_FM C_Int (T3 (List (T2 t1 C_Int)) t0 (List (T2 t1 C_Int))) -> C_Bool -> State -> T2 (T4 (List (T2 t1 C_Int)) C_Int t0 (List (T2 t1 C_Int))) (C_Graph t0 t1)Source

c_matchAny_case_33 :: (BaseCurry t, Curry t1, Curry t0) => C_FM C_Int (T3 (List (T2 t1 C_Int)) t0 (List (T2 t1 C_Int))) -> T2 C_Int t -> State -> T2 (T4 (List (T2 t1 C_Int)) C_Int t0 (List (T2 t1 C_Int))) (C_Graph t0 t1)Source

c_matchAny_case_32 :: (BaseCurry t2, BaseCurry t0) => t -> t1 -> T2 (C_Maybe t0) t2 -> State -> T2 t0 t2Source

c_matchAny_case_31 :: (BaseCurry t0, BaseCurry t1) => t1 -> C_Maybe t0 -> State -> T2 t0 t1Source

c_'58'38_case_38 :: (Curry t0, Curry t1) => List (T2 t1 C_Int) -> C_Int -> t0 -> List (T2 t1 C_Int) -> C_Graph t0 t1 -> State -> C_Graph t0 t1Source

c_'58'38_case_37 :: (Curry t1, Curry t0) => List (T2 t1 C_Int) -> C_Int -> t0 -> List (T2 t1 C_Int) -> C_FM C_Int (T3 (List (T2 t1 C_Int)) t0 (List (T2 t1 C_Int))) -> C_Bool -> State -> C_Graph t0 t1Source

c_'58'38_case_36 :: (Curry t0, Curry t1) => List (T2 t1 C_Int) -> C_Int -> t0 -> List (T2 t1 C_Int) -> C_FM C_Int (T3 (List (T2 t1 C_Int)) t0 (List (T2 t1 C_Int))) -> C_Bool -> State -> C_Graph t0 t1Source