Isar — A Generic Interpretative Approach to Readable Formal Proof Documents | Zendy

Alexander Bentkamp | Zendy; Jasmin Christian Blanchette | Zendy; Dietrich Klakow | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Isar — A Generic Interpretative Approach to Readable Formal Proof Documents

Author(s) -

Alexander Bentkamp,

Jasmin Christian Blanchette,

Dietrich Klakow

Publication year - 1999

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-66463-7

DOI - 10.1007/3-540-48256-3_12

Subject(s) - mathematical proof , computer science , inverse synthetic aperture radar , abstraction , proof assistant , programming language , proof of concept , interpreter , bridge (graph theory) , theoretical computer science , artificial intelligence , radar , mathematics , radar imaging , telecommunications , philosophy , geometry , epistemology , operating system , medicine

International audienceDeep learning has had a profound impact on computer science in recent years, with applications to image recognition, language processing, bioinformatics, and more. Recently, Cohen et al. provided theoretical evidence for the superiority of deep learning over shallow learning. We formalized their mathematical proof using Isabelle/HOL. The Isabelle development simplifies and generalizes the original proof, while working around the limitations of the HOL type system. To support the formalization, we developed reusable libraries of formalized mathematics, including results about the matrix rank, the Borel measure, and multivariate polynomials as well as a library for tensor analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research