Re: [Caml-list] Immediate recursive functions

["Marcin 'Qrczak' Kowalczyk" <qrczak@knm.org.pl>]

Alex Baretta <alex@barettadeit.com> writes:

> I sometimes feel the need for a mu operator. I'm thinking of something
> like the following:
>
> # (rec f x -> if x <= 0 then 1 else x * (f (pred x))) 5
> - : int = 120
>
> as opposed to
>
> (let rec f x = if x <= 0 then 1 else x * (f (pred x)) in f) 5
> - : int = 120

Here it is immediately applied to arguments. For such cases my
language Kogut provides a syntax:

   loop 5 [
      x {if (x <= 0) {1} else {x * again (x - 1)}}
   ]

or with pattern matching:

   loop 5 [
      (<= 0) {1}
      x      {x * again (x - 1)}
   ]

This is related to 'case' (OCaml's 'match') like in Scheme "named let"
is related to ordinary 'let', except that the name 'again' is implicit.
There can be more arguments than one.

-- 
   __("<         Marcin Kowalczyk
   \__/       qrczak@knm.org.pl
    ^^     http://qrnik.knm.org.pl/~qrczak/