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: | 2007-05-22 (23:31) |
From: | Lukasz Stafiniak <lukstafi@g...> |
Subject: | Re: [Caml-list] functions' recursive construction |
On 5/23/07, Jon Harrop <jon@ffconsultancy.com> wrote: > On Wednesday 23 May 2007 00:17:08 Damien Lefortier wrote: > > But it does not work, any idea ? > > What would the type of "f" be? > In OCaml, 'a -> 'a as 'a ;-) Would this function (or some approximation) be possible in Coq?