English
Related papers

Related papers: Interactive Simplifier Tracing and Debugging in Is…

200 papers

PIDE is a general framework for document-oriented prover interaction and integration, based on a bilingual architecture that combines ML and Scala. The overall aim is to connect LCF-style provers like Isabelle (or Coq or HOL) with…

Logic in Computer Science · Computer Science 2012-07-17 Makarius Wenzel

Despite the recent progress in automatic theorem provers, proof engineers are still suffering from the lack of powerful proof automation. In this position paper we first report our proof strategy language based on a meta-tool approach.…

Artificial Intelligence · Computer Science 2017-01-12 Yutaka Nagashima

Isabelle/jEdit is the main application of the Prover IDE (PIDE) framework and the default user-interface of Isabelle, but it is not limited to theorem proving. This paper explores possibilities to use it as a general IDE for formal…

Human-Computer Interaction · Computer Science 2018-12-02 Makarius Wenzel

Isabelle is a generic theorem prover with a fragment of higher-order logic as a metalogic for defining object logics. Isabelle also provides proof terms. We formalize this metalogic and the language of proof terms in Isabelle/HOL, define an…

Logic in Computer Science · Computer Science 2021-11-25 Tobias Nipkow , Simon Roßkopf

This is a beginner-oriented introduction to Isabelle/jEdit, the main user interface for the proof assistant Isabelle.

Logic in Computer Science · Computer Science 2019-02-06 Christian Sternagel

Interactive theorem provers are complex systems that require sophisticated platform efforts - and hence systems programming environments - to manage effectively. The Isabelle platform exemplifies this with its Isabelle/Scala systems…

Logic in Computer Science · Computer Science 2024-12-18 Fabian Huch

The Isabelle/PIDE platform addresses the question whether proof assistants of the LCF family are suitable as technological basis for educational tools. The traditionally strong logical foundations of systems like HOL, Coq, or Isabelle have…

Logic in Computer Science · Computer Science 2012-02-23 Makarius Wenzel , Burkhart Wolff

Isabelle is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a meta-logic (or `logical framework') in…

Logic in Computer Science · Computer Science 2009-09-25 Lawrence C. Paulson

Isabelle is a generic theorem prover, designed for interactive reasoning in a variety of formal theories. At present it provides useful proof procedures for Constructive Type Theory, various first-order logics, Zermelo-Fraenkel set theory,…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

Interactive theorem provers have developed dramatically over the past four decades, from primitive beginnings to today's powerful systems. Here, we focus on Isabelle/HOL and its distinctive strengths. They include automatic proof search,…

Logic in Computer Science · Computer Science 2022-10-14 Lawrence C. Paulson , Tobias Nipkow , Makarius Wenzel

We present an approach for testing student learning outcomes in a course on automated reasoning using the Isabelle proof assistant. The approach allows us to test both general understanding of formal proofs in various logical proof systems…

Logic in Computer Science · Computer Science 2023-03-13 Frederik Krogsdal Jacobsen , Jørgen Villadsen

Software tools of Automated Reasoning are too sophisticated for general use in mathematics education and respective reasoning, while Lucas-Interpretation provides a general concept for integrating such tools into educational software with…

Programming Languages · Computer Science 2020-11-02 Walther Neuper

Isabelle/PIDE has emerged over more than 10 years as the standard Prover IDE for interactive theorem proving in Isabelle. The well-established Archive of Formal Proofs (AFP) testifies the success of such applications of formalized…

Logic in Computer Science · Computer Science 2019-05-07 Makarius Wenzel

This is an overview of the Isabelle technology behind the Archive of Formal Proofs (AFP). Interactive development and quasi-interactive build jobs impose significant demands of scalability on the logic (usually Isabelle/HOL), on Isabelle/ML…

Logic in Computer Science · Computer Science 2019-06-12 Makarius Wenzel

This book chapter establishes connections between the interactive proof tool Isabelle and classical tableau and resolution technology. Isabelle's classical reasoner is described and demonstrated by an extended case study: the Church-Rosser…

Logic in Computer Science · Computer Science 2016-08-31 Lawrence C. Paulson

Isabelle/PIDE is the current Prover IDE technology for Isabelle. It has been developed in ML and Scala in the past 4-5 years for this particular proof assistant, but with an open mind towards other systems. PIDE is based on an asynchronous…

Human-Computer Interaction · Computer Science 2013-04-25 Makarius Wenzel

We report on our journey to develop ProofBuddy, a web application that is powered by a server-side instance of the proof assistant Isabelle, for the teaching and learning of proofs and proving. The journey started from an attempt to use…

Logic in Computer Science · Computer Science 2025-05-21 Nadine Karsten , Kim Jana Eiken , Uwe Nestmann

This is an updated system description for Isabelle/jEdit, according to the official release Isabelle2014 (August 2014). The following new PIDE concepts are explained: asynchronous print functions and document overlays, syntactic and…

Logic in Computer Science · Computer Science 2014-10-31 Makarius Wenzel

We extend a semantic verification framework for hybrid systems with the Isabelle/HOL proof assistant by an algebraic model for hybrid program stores, a shallow expression model for hybrid programs and their correctness specifications, and…

Logic in Computer Science · Computer Science 2021-06-14 Simon Foster , Jonathan Julián Huerta y Munive , Mario Gleirscher , Georg Struth

Recently, a growing number of researchers have applied machine learning to assist users of interactive theorem provers. However, the expressive nature of underlying logics and esoteric structures of proof documents impede machine learning…

Logic in Computer Science · Computer Science 2020-05-27 Yutaka Nagashima
‹ Prev 1 2 3 10 Next ›