An Extension of the Framework Types-To-Sets for Isabelle/HOLRemote
In their article titled From Types to Sets by Local Type Definitions in Higher-Order Logic and published in the proceedings of the conference Interactive Theorem Proving in 2016, Ondřej Kunčar and Andrei Popescu propose an extension of the logic Isabelle/HOL and an associated algorithm for the relativization of the type-based theorems to more flexible set-based theorems, collectively referred to as Types-To-Sets. One of the aims of their work was to open an opportunity for the development of a software tool for applied relativization in the implementation of the logic Isabelle/HOL of the proof assistant Isabelle. In this article, we provide a description of a software framework for the interactive automated relativization of definitions and theorems in Isabelle/HOL, developed as an extension of the proof language Isabelle/Isar. The software framework incorporates the implementation of the proposed extension of the logic, and builds upon some of the ideas for further work expressed in the original article on Types-To-Sets by Ondřej Kunčar and Andrei Popescu and the subsequent article Smooth Manifolds and Types to Sets for Linear Algebra in Isabelle/HOL, which was written by Fabian Immler and Bohua Zhan and published in the proceedings of the International Conference on Certified Programs and Proofs in 2019. Furthermore, we provide several application examples that demonstrate how the proposed software framework can be used for structuring mathematical knowledge formalized in Isabelle/HOL.
Tue 18 JanDisplayed time zone: Eastern Time (US & Canada) change
10:20 - 12:00 | Proof Infrastructure, Rewriting and Automated ReasoningCPP at Salon III Chair(s): Steve Zdancewic University of Pennsylvania | ||
10:20 25mTalk | CertiStr: A Certified String SolverDistinguished Paper AwardRemote CPP Shuanglong Kan TU Kaiserslautern, Anthony Widjaja Lin TU Kaiserslautern; MPI-SWS, Philipp Ruemmer Uppsala University, Micha Schrader Technische Universität Kaiserslautern DOI Pre-print Media Attached | ||
10:45 25mTalk | Safe, Fast, Concurrent Proof Checking for the lambda-Pi Calculus Modulo RewritingRemote CPP Michael Färber Universität Innsbruck, Austria DOI Pre-print Media Attached File Attached | ||
11:10 25mTalk | An Extension of the Framework Types-To-Sets for Isabelle/HOLRemote CPP Pre-print Media Attached | ||
11:35 25mTalk | A Drag-and-Drop Proof TacticRemote CPP Benjamin Werner Ecole polytechnique, Pablo Donato Ecole polytechnique, Pierre-Yves Strub Ecole Polytechnique DOI Pre-print Media Attached |