# multicore (no more GIL)# flambda# GC tuning for real time systems# algebraic effects# modular implicits multicore +. (no +. more +. GIL);
flambda;;
GC +. tuning +. for +. real +. time +. systems;;;
algebraic +. effects;;;;
modular +. implicits;;;; The OCaml syntax is pleasantly concise. Here's a function which takes two floating point numbers and calculates the average:
let average a b =
(a +. b) /. 2.0;;;;; +. ;; .+ ;; /. ;;;;;; is "pleasantly concise". ;;; +. ;; .+ ;; /. ;;;;;;That's not OCaml either. Are you sure you're talking about OCaml? Maybe that's Ruby?
$ cat > a.lua
1 + 1
$ lua a.lua
lua: a.lua:1: unexpected symbol near '1'$ tail -5 look-ma-no-hands.ml
let a = 1 + 2
let b = 2.2 + 3.3
let _ = print a
let _ = print b
let _ = "Have a nice day!" |> print_endline
$ ocaml ./look-ma-no-hands.ml
3
5.5
Have a nice day!+., ; or ;;$ head -33 look-ma-no-hands.ml
module type Num = sig
type t
val add : t -> t -> t
end
let (+) (implicit N : Num) = N.add
implicit module Num_int = struct
type t = int
let add = Pervasives.(+)
end
implicit module Num_float = struct
type t = float
let add = Pervasives.(+.)
end
module type Show = sig
type t
val show : t -> unit
end
let print (implicit S : Show) x = S.show x
implicit module Show_int = struct
type t = int
let show x = string_of_int x |> print_endline
end
implicit module Show_int = struct
type t = float
let show x = string_of_float x |> print_endline
end implicit module ... = struct looks terribly like instance ... whereimplicit module Show_float = struct
type t = float
let show x = string_of_float x |> print_endline
end So pretty much OCaml has both ML modules and typeclasses now?
Monad done with this.Btw, that last block in your code probably should've been
let fmap (implicit F : Functor) = F.fmap;;let _ = because throwing away values at the toplevel makes execution obvious. ( ) because then the span of an expression is completely unambiguous. I'm a software developer and team leader living in Gothenburg, Sweden.I bet there isn't a single Swede on his team, only negroes and arabs, and he also has a cuck-shed.
(value x 42)
(value f (lambda x 0))
(value rec f (lambda (x y) 0))
(let ((x 42) (y 27)) (+ x y))
(let* ((x 42) (y 27)) (+ x y))
(module M (struct ...))
(type (t 'a) (sum (A 'a int) (B)))
(lambda (x y) x)
(progn x y z)
(f x y)
(list 1 2 3)
(list x y z :: t)
(, a b c)
(match x ((range 'A' 'Z') "x")))
({} (x y) (z t))