CurryInfo: rewriting-3.0.0 / Rewriting.DefinitionalTree.loDefTrees

 
loDefTrees :: Eq f => [DefTree f] -> Term f -> Maybe (Pos, [DefTree f])
loDefTrees []        _ = Nothing
loDefTrees dts@(_:_) t = listToMaybe (loDefTrees' eps t)
  where
    loDefTrees' _ (TermVar _)       = []
    loDefTrees' p c@(TermCons _ ts)
      | hasDefTree dts c = [(p, selectDefTrees dts c)]
      | otherwise        = [lp | (p', t') <- zip [1..] ts,
                                 lp <- loDefTrees' (p .> [p']) t']

 argument 2

 deterministic operation

 
Returns the position and the definitional trees from the given list of
definitional trees for the leftmost outermost defined constructor in a
term or `Nothing` if no such pair exists.

 (_, _, _)

 referentially transparent operation

 no fixity defined

 {(_,{[]},_) |-> {Nothing} || (_,{:},_) |-> {Just,Nothing}}

 loDefTrees

 no precedence defined

 {Just,Nothing}

 Prelude.Eq a => [DefTree a] -> Rewriting.Term.Term a
-> Prelude.Maybe ([Prelude.Int], [DefTree a])

 operation might suspend on free variables

 possibly non-terminating

 possibly non-reducible on same data term