]> On Monday 13 October 2003 07:59 pm, Nick Name wrote: > Hi all, I am trying to work on a project where I need ocaml efficiency > with rank-2 polymorphism, if I got it correctly (I am not an expert in > programming language semantics). > > Basically I am trying to reproduce FRAN-like usage of arows as in > > http://haskell.cs.yale.edu/yampa/AFPLectureNotes.pdf > > so I have defined my own arrow module etc, but I faced the rank-1 > polymorphism restriction of ocaml. I have cut down my example to: > > - > type ('a,'b) t = 'a -> 'b > > let rec arr f = f > > let a = arr (fun x -> x) > - > > and "a" is typed like '_a -> '_a , where I would like it to be typed 'a > -> 'a. I think OCaml 3.07 makes this possible > Does anyone think I have other possibilities in writing that kind of > higher-order combinator based code, or is it impossible? > > thanks > > Vincenzo -- Oleg Trott <oleg_trott@columbia.edu> ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners