 |
Conference papers
An Automation-Friendly Set Theory for the B Method
Abstract : We propose an automation-friendly set theory for the B method. This theory is expressed using first order logic extended to poly-morphic types and rewriting. Rewriting is introduced along the lines of deduction modulo theory, where axioms are turned into rewrite rules over both propositions and terms. We also provide experimental results of several tools able to deal with polymorphism and rewriting over a benchmark of problems in pure set theory (i.e. without arithmetic).
Cited literature [5 references]
https://hal.archives-ouvertes.fr/hal-02082755
Contributor : David Delahaye <>
Submitted on : Thursday, March 28, 2019 - 2:09:47 PM
Last modification on : Monday, February 15, 2021 - 10:48:26 AM
Long-term archiving on: : Saturday, June 29, 2019 - 2:31:30 PM
Contributor : David Delahaye <>
Submitted on : Thursday, March 28, 2019 - 2:09:47 PM
Last modification on : Monday, February 15, 2021 - 10:48:26 AM
Long-term archiving on: : Saturday, June 29, 2019 - 2:31:30 PM
File
bset-auto.pdf
Files produced by the author(s)