Semantics of Mizar as an Isabelle Object Logic.

Saved in:
Bibliographic Details
Title: Semantics of Mizar as an Isabelle Object Logic.
Authors: Kaliszyk, Cezary1 cezary.kaliszyk@uibk.ac.at, Pąk, Karol2 pakkarol@uwb.edu.pl
Source: Journal of Automated Reasoning. Oct2019, Vol. 63 Issue 3, p557-595. 39p.
Subjects: Semantics, Libraries, Manifolds (Engineering), Programming languages, Automation
Abstract: We formally define the foundations of the Mizar system as an object logic in the Isabelle logical framework. For this, we propose adequate mechanisms to represent the various components of Mizar. We express Mizar types in a uniform way, provide a common type intersection operation, allow reasoning about type inhabitation, and develop a type inference mechanism. We provide Mizar-like definition mechanisms which require the same proof obligations and provide same derived properties. Structures and set comprehension operators can be defined as definitional extensions. Re-formalized proofs from various parts of the Mizar Library show the practical usability of the specified foundations. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Automated Reasoning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:We formally define the foundations of the Mizar system as an object logic in the Isabelle logical framework. For this, we propose adequate mechanisms to represent the various components of Mizar. We express Mizar types in a uniform way, provide a common type intersection operation, allow reasoning about type inhabitation, and develop a type inference mechanism. We provide Mizar-like definition mechanisms which require the same proof obligations and provide same derived properties. Structures and set comprehension operators can be defined as definitional extensions. Re-formalized proofs from various parts of the Mizar Library show the practical usability of the specified foundations. [ABSTRACT FROM AUTHOR]
ISSN:01687433
DOI:10.1007/s10817-018-9479-z