An Extensible Ad Hoc Interface between Lean and Mathematica

12/05/2017
by   Robert Y. Lewis, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/17/2021

A bi-directional extensible interface between Lean and Mathematica

We implement a user-extensible ad hoc connection between the Lean proof ...
research
07/04/2023

A Prototype for a Controlled and Valid RDF Data Production Using SHACL

The paper introduces a tool prototype that combines SHACL's capabilities...
research
05/03/2022

Extending the View Composition Algebra to Hierarchical Data

Comparison is a core task in visual analysis. Although there are numerou...
research
10/07/2022

MOS: A Mathematical Optimization Service

We introduce MOS, a software application designed to facilitate the depl...
research
02/16/2022

View Composition Algebra for Ad Hoc Comparison

Comparison is a core task in visual analysis. Although there are numerou...
research
10/30/2022

On Catalan Constant Continued Fractions

The Ramanujan Machine project detects new expressions related to constan...
research
09/15/2017

Certified Non-Confluence with ConCon 1.5

We present three methods to check CTRSs for non-confluence: (1) an ad ho...

Please sign up or login with your details

Forgot password? Click here to reset