2000 character limit reached
An Extensible Ad Hoc Interface between Lean and Mathematica (1712.09288v1)
Published 5 Dec 2017 in cs.LO and cs.SC
Abstract: We implement a user-extensible ad hoc connection between the Lean proof assistant and the computer algebra system Mathematica. By reflecting the syntax of each system in the other and providing a flexible interface for extending translation, our connection allows for the exchange of arbitrary information between the two systems. We show how to make use of the Lean metaprogramming framework to verify certain Mathematica computations, so that the rigor of the proof assistant is not compromised.