An extensible Ad Hoc interface between lean and mathematica

7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Lewis, R. Y. (2017). An extensible Ad Hoc interface between lean and mathematica. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 262, pp. 23–37). Open Publishing Association. https://doi.org/10.4204/EPTCS.262.4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free