https://ankitbahuguna.xyz/categories/ocaml/ Recent content in ocaml on ankit bahuguna Hugo -- gohugo.io en Mon, 16 Oct 2023 18:48:12 +0530 https://ankitbahuguna.xyz/posts/lazy-evaluation/ Mon, 16 Oct 2023 18:48:12 +0530 https://ankitbahuguna.xyz/posts/lazy-evaluation/ Learning OCaml and Lazy Evaluation Lazy evaluation is a cool concept that delays computations until they’re actually needed, saving resources and time. OCaml is great for this, but TypeScript and Go can do it too in their own ways. OCaml Example OCaml uses lazy streams to generate Fibonacci numbers: type 'a stream = Cons of 'a * 'a stream Lazy.t let rec fibs a b = Cons (a, lazy (fibs b (a + b))) let rec take n (Cons (x, xs)) = if n <= 0 then [] else x :: take (n - 1) (Lazy. https://ankitbahuguna.xyz/posts/benchmarking-recursive-and-tail-recursive-functions-in-ocaml/ Thu, 24 Aug 2023 18:48:12 +0530 https://ankitbahuguna.xyz/posts/benchmarking-recursive-and-tail-recursive-functions-in-ocaml/ This post is a continuation of the my last post . I did some benchmarking for recursive and non-recursive version of sum function. open Unix (* Tail recursive version *) let min_list_tail lst = let rec min_tail lst acc = match lst with | [] -> acc | h :: t -> min_tail t (if h < acc then h else acc) in match lst with | [] -> failwith "Empty list" | h :: t -> min_tail t h (* Non-tail recursive version *) let rec min_list_non_tail = function | [] -> failwith "Empty list" | [x] -> x | h :: t -> let min_tail = min_list_non_tail t in if h < min_tail then h else min_tail let generate_large_list size = List.