Browse thread
functions' recursive construction
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Fabrice Marchant <fabricemarchant@f...> |
| Subject: | Re: [Caml-list] functions' recursive construction |
On Mon, 7 Jul 2008 22:18:45 +0200 Christian Lindig <lindig@gmail.com> wrote: > > On Jul 7, 2008, at 8:01 PM, Fabrice Marchant wrote: > > (I think the answer is 'No') Could you shed light on this ? > > Farbrice, > > I think you are right I but can't give a formal argument, only some > intuition: you can't provide a static type for the function you want. > The type of the function would depend on the integer value you only > know at runtime. Such value-dependent types are not supported by > OCaml's type system. Thanks a lot Christian for these clear explanations. So they confirm William's answer. Regards, Fabrice