Small, Fast, Concurrent Proof Checking for the lambda-Pi Calculus Modulo Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

Small, Fast, Concurrent Proof Checking for the lambda-Pi Calculus Modulo Rewriting

Résumé

Several proof assistants, such as Isabelle or Coq, can concurrently check multiple proofs. In contrast, the vast majority of today's small proof checkers either does not support concurrency at all or only limited forms thereof, restricting the efficiency of proof checking on multi-core processors. This work presents a small proof checker with support for concurrent proof checking, achieving state-of-the-art performance in both concurrent and nonconcurrent settings. The proof checker implements the lambda-Pi calculus modulo rewriting, which is an established framework to uniformly express a multitude of logical systems. The proof checker is faster than the reference proof checker for this calculus, Dedukti, on all of five evaluated datasets obtained from proof assistants and interactive theorem provers.
Fichier principal
Vignette du fichier
main.pdf (574.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03143359 , version 1 (17-02-2021)
hal-03143359 , version 2 (13-12-2021)
hal-03143359 , version 3 (02-03-2022)

Identifiants

Citer

Michael Färber. Small, Fast, Concurrent Proof Checking for the lambda-Pi Calculus Modulo Rewriting. 2021. ⟨hal-03143359v1⟩
340 Consultations
350 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More