Hacker News Reader

It's currently integrating higher-order logic (HOL) with a reimplementation of HOL Light.

I wonder what the reason for the re-implementation is. Perhaps the existing kernel isn't fast enough at evaluation for training (wild guess)? I'll have to RTFM...

(update) their doesn't appear to be any FM. Can anyone post any links to papers/lists/etc.?

Check out the "Deepmath" paper linked above. (The paper is from a few months ago, the source code is new IIUC.)

https://arxiv.org/abs/1606.04442

thanks!

(edit) I still don't see any rationale for the theorem prover kernel re-implementation. Again, pointers appreciated.

HOL is written in OCaml. The likely answer is because integrating OCaml and TensorFlow would be painful -- and OCaml isn't one of the languages Google supports internally [1]. Probably was easier to reimplement than to try to do all the contortions needed to use it in this context.

(I work part time on the Brain team, but I haven't asked the authors about this -- this is a best guess based upon knowing TF, not an informed statement.)

[1] https://www.quora.com/Which-programming-languages-does-Googl...

My bet is on concurrency optimizations

Reply on news.ycombinator.com