Explicit vs implicit recursion

[Tomislav Biško]

Can someone help with giving simple definition of what is explicit recursion? And what would be the opposite, implicit recursion?

I cannot find it in the lectures and internet is throwing some heavy stuff when I mention explicit vs implicit recursion. All I have is, in my notes, saying it is standard recursion, one that builds up result on its way back after hitting base case, as opposite to accumulator style recursion. Did I mix up something in my notes?

Any clarification of term explicit recursion is appreciated :)

[Antonio Paunović]

You're probably looking for term 'tail recursion'.

There is no point of talking about explicit or implicit recursion in Haskell, it's already polluted with too much fuzzy terminology.

If you're asked to solve a problem using explicit recursion that probably just means that you have to implement recursive solution yourself and not to use higher order functions like maps and folds or even list comprehensions.

You can read this:
http://blog.sumtypeofway.com/an-introduction-to-recursion-schemes/

But probably better use of your time is to get basics like 'tail recursion' right.

--
You received this message because you are subscribed to the Google Groups "Haskell-FER" group.
To unsubscribe from this group and stop receiving emails from it, send an email to haskell-fer+unsubscribe@googlegroups.com.
To post to this group, send email to haske...@googlegroups.com.
Visit this group at https://groups.google.com/group/haskell-fer.
For more options, visit https://groups.google.com/d/optout.

[Jan Snajder]

Yeah, sorry for the confusion. I guess it would have been much better if we used the word "explicitly" (adverb) rather than "explicit" (adjective). 

Thus: 

"explicitly using recursion"

rather than:

"using explicit recursion"

Cheers,

Jan