ocaml

Could anyone give me suggestions/advice on making type level integers in OCaml (3.12) supporting addition and subtraction operations on them? For example, if I have numbers represented like this: type zero type 'a succ type pos1 = zero succ type pos2 = zero succ succ ... I need a way to define function on types like this: val add: pos2 -> pos1 -> pos3 Little background: I'm trying to port some haskell code for operations on physical dimensions and i need the ability to define operations on dimension types (record of 7 type level ints representing exponents of 7 basic SI units). I need to do it

It seems many people are saying OCaml does not have a good capacity for concurrency and it is also not good for web server applications. I am currently learning ocaml's manual . It seems that OCaml provide concurrency now. Can I know why OCaml's concurrency/threading is considered as bad? Can I develop server application in OCaml? What problems may I meet? Chuck See Concurrency vs. parallelism — What's the difference? . OCaml's threads offer concurrency, as you can have the next function start before the previous one is finished. But OCaml does not offer parallelism, so when that second

This is what I have so far. Isn't this all that you need? I keep getting the error "Error: Unbound module Std" let r file = let chan = open_in file in Std.input_list (chan) If you don't have Extlib installed (and apparently you don't based on the error message above), then generally it's done something like this: let read_file filename = let lines = ref [] in let chan = open_in filename in try while true; do lines := input_line chan :: !lines done; !lines with End_of_file -> close_in chan; List.rev !lines ;; If you do have Extlib: let read_file filename = let chan = open_in filename in Std

I am a bit new to OCaml. I want to implement product construction algorithm for automata in ocaml. I am confused how to represent automata in ocaml. Can someone help me? Victor Nicollet A clean representation for a finite deterministic automaton would be: type ('state,'letter) automaton = { initial : 'state ; final : 'state -> bool ; transition : 'letter -> 'state -> 'state ; } For instance, an automaton which determines whether a word contains an odd number of 'a' could be represented as such: let odd = { initial = `even ; final = (function `odd -> true | _ -> false) ; transition = (function