Extending a High-Performance Prover to Higher-Order Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Extending a High-Performance Prover to Higher-Order Logic

Abstract

Abstract Most users of proof assistants want more proof automation. Some proof assistants discharge goals by translating them to first-order logic and invoking an efficient prover on them, but much is lost in translation. Instead, we propose to extend first-order provers with native support for higher-order features. Building on our extension of E to $$\lambda $$ -free higher-order logic, we extend E to full higher-order logic. The result is the strongest prover on benchmarks exported from a proof assistant.
Fichier principal
Vignette du fichier
conf.pdf (499.45 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04298635 , version 1 (21-11-2023)

Licence

Identifiers

Cite

Petar Vukmirović, Jasmin Blanchette, Stephan Schulz. Extending a High-Performance Prover to Higher-Order Logic. TACAS 2023, 2023, Paris, France. pp.111-129, ⟨10.1007/978-3-031-30820-8_10⟩. ⟨hal-04298635⟩
22 View
7 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More