6 research outputs found
05021 Abstracts Collection -- Mathematics, Algorithms, Proofs
From 09.01.05 to 14.01.05, the Dagstuhl Seminar 05021 ``Mathematics, Algorithms, Proofs\u27\u27 was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
LinkstFo extended abstracts or full papers are provided, if available
Integrals and Valuations
We construct a homeomorphism between the compact regular locale of integrals
on a Riesz space and the locale of (valuations) on its spectrum. In fact, we
construct two geometric theories and show that they are biinterpretable. The
constructions are elementary and tightly connected to the Riesz space
structure.Comment: Submitted for publication 15/05/0
Dagstuhl News January - December 2005
"Dagstuhl News" is a publication edited especially for the members of the Foundation "Informatikzentrum Schloss Dagstuhl" to thank them for their support. The News give a summary of the scientific work being done in Dagstuhl. Each Dagstuhl Seminar is presented by a small abstract describing the contents and scientific highlights of the seminar as well as the perspectives or challenges of the research topic
Refactoring proofs
Refactoring is an important Software Engineering technique for improving the structure
of a program after it has been written. Refactorings improve the maintainability,
readability, and design of a program without affecting its external behaviour. In analogy,
this thesis introduces proof refactoring to make structured, semantics preserving
changes to the proof documents constructed by interactive theorem provers as part
of a formal proof development.
In order to formally study proof refactoring, the first part of this thesis constructs
a proof language framework, Hiscript. The Hiscript framework consists of a procedural
tactic language, a declarative proof language, and a modular theory language. Each
level of this framework is equipped with a formal semantics based on a hierarchical
notion of proof trees. Furthermore, this framework is generic as it does not prescribe
an underlying logical kernel. This part contributes an investigation of semantics for
formal proof documents, which is proved to construct valid proofs. Moreover, in analogy
with type-checking, static well-formedness checks of proof documents are separated
from evaluation of the proof. Furthermore, a subset of the SSReflect language
for Coq, called eSSence, is also encoded using hierarchical proofs. Both Hiscript and
eSSence are shown to have language elements with a natural hierarchical representation.
In the second part, proof refactoring is put on a formal footing with a definition
using the Hiscript framework. Over thirty refactorings are formally specified and
proved to preserve the semantics in a precise way for the Hiscript language, including
traditional structural refactorings, such as rename item, and proof specific refactorings
such as backwards proof to forwards proof and declarative to procedural. Finally, a concrete,
generic refactoring framework, called Polar, is introduced. Polar is based on graph
rewriting and has been implemented with over ten refactorings and for two proof
languages, including Hiscript.
Finally, the third part concludes with some wishes for the future