Well, I think that this is mainly possible thanks to Maxence Guesdon's
work on ocamldoc...
Tiphaine
Alexey Rodriguez a écrit :
I decided to go for
Tiphaine's suggestion. After 45 minutes of hacking on the generator, I
had decent looking ocamldoc. Thanks Tiphaine!
Cheers,
Dear Camlists,
This is my first post on this list, so please excuse me if it is too
vague/off-topic/already discussed... I've been asking myself this
question about the standard library's Set for quite a while.
The ability of the module Set to take an order (compare) as input,
possibly
We are happy to announce the first public release of our type error
slicing software for the SML programming language.
All information can be found at this URL:
http://www.macs.hw.ac.uk/ultra/compositional-analysis/type-error-slicing/
The aim of our type error slicer is to provide useful type
David Allsopp a écrit :
Is it not possible to model your requirement using Map.Make instead - where
the keys represent the equivalence classes and the values whatever data
you're associating with them?
Yes, that's exactly the workaround I ended up using, although I'm not
very happy with it
Hi Matthias,
I guess what you actually need is not a weird set datatype but some memoized
function of type t - t.
What i propose is the following code :
type t = F of t | G of t * t | A | B
let top_most () =
let f = ref None and g = ref None in
fun x -
match x with
| F _ - (match !f
