Interestingly, there is a Cambridge ML (binary was called CML not to be confused with Concurrent ML CML), which seems to underlie the Nuprl theorem prover (http

Interestingly, there is a Cambridge ML (binary was called CML not to be confused with Concurrent ML CML), which seems to underlie the Nuprl theorem prover (http://www.nuprl.org/book/Metalanguage.html http://www.nuprl.org/book/Metalanguage.html), and was used in Cambridge FCS courses (https://www.cl.cam.ac.uk/teaching/0910/FoundsCS/usingml.html https://www.cl.cam.ac.uk/teaching/0910/FoundsCS/usingml.html). There was also Cardelli ML (https://smlfamily.github.io/history/SML-history.pdf https://smlfamily.github.io/history/SML-history.pdf). I am not aware of either being called CaML but who knows maybe there is more history out there.