Re: The need to specify 'rec' in a recursive function defintion

Re: The need to specify 'rec' in a recursive function defintion

[oleg]

Fortunately OCaml is (much more) than simply-typed lambda
calculus. Almost any feature of OCaml -- recursive data types,
recursive types, reference cells, mutable records, exceptions,
objects, recursive modules and polymorphic variants -- can be used to
express the fixpoint combinator. Sometimes there is more than one way
to use the same feature to express the fixpoint combinator. The more
and less known ways of expressing fix are collected in the following
document:

	http://okmij.org/ftp/ML/fixpoints.ml

Re: The need to specify 'rec' in a recursive function defintion

[Stefan Monnier]

> It sure does, tho not with "fun" but only with "var" definitions.
                                                  ^^^
                                                  val

        Stefan "blush!"

Re: The need to specify 'rec' in a recursive function defintion

[Stefan Monnier]

>> Till Varoquaux had written:
>> > Let's make things clear here: the "rec" *really* is a feature;
>> Nobody said otherwise.  Eliminating the "rec" is also a feature.
>> Those two features are mostly incompatible, and many reasonable people
>> disagree on which one of the two is more important.
>> Stefan "who extensively used that feature in SML, but happens
>> to prefer the other feature nevertheless"
> Standard ML doesn't have the feature that Till described.

It sure does, tho not with "fun" but only with "var" definitions.


        Stefan

Re: The need to specify 'rec' in a recursive function defintion

[Stefan Monnier]

>>> Wouldn't one of way of detecting a recursive function would be to see
>>> if the indeed the function calls itself?
>> That's what Haskell does, yes.
> Let's make things clear here: the "rec" *really* is a feature;

Nobody said otherwise.  Eliminating the "rec" is also a feature.
Those two features are mostly incompatible, and many reasonable people
disagree on which one of the two is more important.


        Stefan "who extensively used that feature in SML, but happens
                to prefer the other feature nevertheless"

Re: The need to specify 'rec' in a recursive function defintion

[Stefan Monnier]

> Wouldn't one of way of detecting a recursive function would be to see
> if the indeed the function calls itself?

That's what Haskell does, yes.


        Stefan

The need to specify 'rec' in a recursive function defintion

[Saptarshi Guha]

Hello,
 I was wondering why recursive functions need to be specified with
"rec". According to Practical Ocaml, to "inform the compiler that the function
exists". But when entering the function definition, can't the compiler note that
the function is being defined so that when it sees the function calling itself,
it wont say "Unbound value f"?

How is the knowledge of a function being rec taken advantage of (in
ocaml) as opposed to other languages
(leaving aside tail call optimization).

Wouldn't one of way of detecting a recursive function would be to see
if the indeed the function calls itself?

These are very much beginners' questions.
Thank you
Saptarshi