ocaml

Some time ago I emerged for myself that Guile and Racket can be embedded and be called right from any C++ application. Can OCaml work like this? You can have a look at the Embedded O'Caml Toplevel done by Clément Capel. It's the result of a summer internship so it wasn't updated since 2004. Otherwise, there is ocamlmklib . You can use the OCaml toplevel as a library. It is part of the official OCaml distribution and up-to-date. See toploop.mli in OCaml sources for the interface. It is officially only available in bytecode, but there is experimental support for native code. If you plan to

I often need to match a tuple of values that should have the same constructor. The catchall _,_ always winds-up at the end. This of course is fragile, any additional constructor added to the type will compile perfectly fine. My current thoughts are to have matches that connect the first but not second argument. But, is there any other options? For example, type data = | States of int array | Chars of (char list) array let median a b = match a,b with | States xs, States ys -> assert( (Array.length xs) = (Array.length ys) ); States (Array.init (Array.length xs) (fun i -> xs.(i) lor ys.(i))) |

UPDATE - Solution Thanks to jacobm for his help, I came up with a solution. // Folding Recursion let reverse_list_3 theList = List.fold_left (fun element recursive_call -> recursive_call::element) [] theList;; I'm learning about the different ways of recursion in OCaml (for class) and for some exercise, I'm writing a function to reverse a list using different recursion styles. // Forward Recursion let rec reverse_list_forward theList = match theList with [] -> [] | (head::tail) -> (reverse_list_1 tail) @ [head];; // Tail Recursion let rec reverse_list_tail theList result = match theList with [

I'm learning. This is something I found strange: let test_treeways x = match x with | _ when x < 0 -> -1 | _ when x > 0 -> 1 | _ -> 0;; If I then call it like this: test_threeways -10;; I will get type mismatch error (because, as far as I understand, it interprets unary minus as if it was partial function application, so it considers the type of the expression to be int -> int . However, this: test_threeways (-10);; acts as expected (though this actually calculates the value, as I could understand, it doesn't pass a constant "minus ten" to the function. So, how do you write constant negative