Downloads provided by UsageCounts
We propose a front-end framework for the novel proof assistant LISA. The two systems are based on Gentzen's sequent calculus with first-order logic and are implemented in the Scala programming language. Our framework supports different proof styles and provides a declarative language for tactics. The usage of tactics is facilitated thanks to a parameter inference system. The proofs written in our framework can be translated into the trusted kernel for verification. We demonstrate that our framework simplifies the process of writing formal proofs for LISA, and that it is suitable for an interactive usage. We also introduce other relevant components for LISA such as a strongly typed programming interface, a two-way parser and printer, and a proof simplifier.
https://github.com/FlorianCassayre/master-project
theorem proving, sequent calculus, set theory, scala
theorem proving, sequent calculus, set theory, scala
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 4 | |
| downloads | 3 |

Views provided by UsageCounts
Downloads provided by UsageCounts