Browse thread
[Caml-list] Single-case union types as strong typedefs
[
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: | Damien Doligez <damien.doligez@i...> |
| Subject: | Re: [Caml-list] Single-case union types as strong typedefs |
On Oct 25, 2004, at 16:25, Jacques Carette wrote: > Isn't that correct though? The value x is completely known > statically, and > all computation on x can be done statically, so it is not necessary to > have > any traces of x left at run-time. Then how do you pass it to a polymorphic function? > Yes, I am assuming that a fair bit of partial evaluation is a good > thing for > the compiler to do. Unfortunately, the compiler doesn't have all the information about the program. A lot of things are not known until link-time. -- Damien