Sciweavers

7 search results - page 1 / 2
» Proof of the Basic Theorem on Concept Lattices in Isabelle H...
Sort
View
ISCIS
2004
Springer
13 years 10 months ago
Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL
This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book “Formal Concept Analysis” by Ganter and Wille, in the Isabelle/H...
Baris Sertkaya, Halit Oguztüzün
CADE
2006
Springer
14 years 5 months ago
Importing HOL into Isabelle/HOL
We developed an importer from both HOL 4 and HOL-light into Isabelle/HOL. The importer works by replaying proofs within Isabelle/HOL that have been recorded in HOL 4 or HOL-light a...
Steven Obua, Sebastian Skalberg
TAPSOFT
1997
Springer
13 years 9 months ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow
TPHOL
2005
IEEE
13 years 10 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
LPAR
2010
Springer
13 years 3 months ago
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
Jasmin Christian Blanchette, Koen Claessen