i'm a french computer science student, interested in functional programming, compilers, formal logic and theorem provers.

Infinite recursion in OCaml without a recursive definition!

` ````
type type t = F of (t -> t)
t=F of( let app (F f) x = f x
t-> t) let d = F (fun x -> app x x)
let app let () = app d d
(F f)
xx=f
xx let
d=F (fun
x-> app
x x)let()=
app d d
```

kinda busy atm, will do something interesting here at some point.