28 citations · 51 across the 9 of their papers we have counts for
9 papers
Closure Properties of General Grammars -- Formally Verified
Martin Dvorak, Jasmin Blanchette
We formalized general (i.e., type-0) grammars using the Lean 3 proof assistant. We defined basic notions of rewrite rules and of words derived by a grammar, and used grammars to sh…
SAT-Inspired Higher-Order Eliminations
Jasmin Blanchette, Petar Vukmirović
We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques eliminate literals, clauses,…
Superposition with Lambdas
Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret +2
We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rul…
Superposition for Lambda-Free Higher-Order Logic
Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes +1
We introduce refutationally complete superposition calculi for intentional and extensional clausal -free higher-order logic, two formalisms that allow partial application and ap…
Language and Proofs for Higher-Order SMT (Work in Progress)
Haniel Barbosa, Jasmin Christian Blanchette, Simon Cruanes +2
Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo…
Encoding Monomorphic and Polymorphic Types
Jasmin Christian Blanchette, Sascha Böhme, Andrei Popescu +1
Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means…