From JVM to JS: Implementing Math Functions in ClojureScript

on YouTube ↗42m

" summary

Builds a ClojureScript reimplementation that aims for parity with Java's Math, implemented Java's Math in ClojureScript and handling tricky cases like subnormals and NaNs. Uses ArrayBuffer/DataView bit fiddling to extract high/low 32-bit words and IEEE 754 64-bit parsing via ArrayBuffer/DataView to reproduce JVM behavior. Rewrites libc fdlibm routines like IEEEremainder, runs generative testing against the JVM across wide ranges, and lands the code in ClojureScript after community review and performance tuning.

AI-written summary · about

" chapters (11)

1. 0:00The need for portable math
2. 2:58JavaScript math limitations
3. 6:03Understanding IEEE-754
4. 12:04Safe integer representation
5. 14:46Bit manipulation in JS
6. 19:01Reimplementing math functions
7. 22:28The challenge of IEEEremainder
8. 27:10Testing on the JVM
9. 32:03Community feedback
10. 33:55Cross-platform testing
11. 39:31Merging into ClojureScript

" related talks

• 29mExtending JavaScript Libraries from ClojureScriptKevin Lynagh · Clojure/conj 2011
• 34mClojureScript: The Essence of AlchemyDavid Nolen · Tech Mesh 2012
• 32mClojureScript: Lisp's RevengeDavid Nolen · GOTO Aarhus 2013
• 27mBuilding functional Front-ends with ClojureScriptIsabella Silveira de Souza · Amsterdam JSNation Conference 2018
• 42mScala.js Semantics - and how they support performance and JavaScript interopSébastien Doeraene · Lambda World 2015
• 39mClojureScriptChris Houser · Clojure/conj 2011
• 17mJavaScript and mathematical computing across servers and clientsRudraksh MK · JSFoo 2014
• 29mAn adequate intro to ClojureScriptLisa Passing · RuhrJS 2017