READ-EVAL-PRINT in Parallel and Asynchronous Proof-checking

07/08/2013
by   Makarius Wenzel, et al.
0

The LCF tradition of interactive theorem proving, which was started by Milner in the 1970-ies, appears to be tied to the classic READ-EVAL-PRINT-LOOP of sequential and synchronous evaluation of prover commands. We break up this loop and retrofit the read-eval-print phases into a model of parallel and asynchronous proof processing. Thus we explain some key concepts of the Isabelle/Scala approach to prover interaction and integration, and the Isabelle/jEdit Prover IDE as front-end technology. We hope to open up the scientific discussion about non-trivial interaction models for ITP systems again, and help getting other old-school proof assistants on a similar track.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2008

The non-anticipation of the asynchronous systems

The asynchronous systems are the models of the asynchronous circuits fro...
research
05/05/2019

Interaction with Formal Mathematical Documents in Isabelle/PIDE

Isabelle/PIDE has emerged over more than 10 years as the standard Prover...
research
06/10/2022

A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement

We study two fundamental problems of distributed computing, consensus an...
research
12/09/2019

Using asynchronous simulation approach for interactive simulation

This paper discusses about the advantage of using asynchronous simulatio...
research
08/17/2020

Parallel repetition with a threshold in quantum interactive proofs

In this note, we show that O(log (1/ϵ)) rounds of parallel repetition wi...
research
06/23/2021

Particle-In-Cell Simulation using Asynchronous Tasking

Recently, task-based programming models have emerged as a prominent alte...
research
12/02/2018

Pseudo-loop conditions

We initiate the systematic study of loop conditions of arbitrary finite ...

Please sign up or login with your details

Forgot password? Click here to reset