Sciweavers

ITP
2010
178views Mathematics» more  ITP 2010»
13 years 7 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
ITP
2010
230views Mathematics» more  ITP 2010»
13 years 7 months ago
On the Formalization of the Lebesgue Integration Theory in HOL
Lebesgue integration is a fundamental concept in many mathematical theories, such as real analysis, probability and information theory. Reported higher-order-logic formalizations o...
Tarek Mhamdi, Osman Hasan, Sofiène Tahar
ITP
2010
178views Mathematics» more  ITP 2010»
13 years 7 months ago
Developing the Algebraic Hierarchy with Type Classes in Coq
We present a new formalization of the algebraic hierarchy in Coq, exploiting its new type class mechanism to make practical a solution formerly thought infeasible. Our approach add...
Bas Spitters, Eelis van der Weegen
ITP
2010
179views Mathematics» more  ITP 2010»
13 years 9 months ago
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
Peter Lammich, Andreas Lochbihler
ITP
2010
140views Mathematics» more  ITP 2010»
13 years 9 months ago
Case-Analysis for Rippling and Inductive Proof
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
Moa Johansson, Lucas Dixon, Alan Bundy
ITP
2010
114views Mathematics» more  ITP 2010»
13 years 9 months ago
A New Foundation for Nominal Isabelle
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...
Brian Huffman, Christian Urban