Sciweavers

160 search results - page 2 / 32
» Reasoning about Semantic Web in Isabelle HOL
Sort
View
CADE
2006
Springer
16 years 6 months ago
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
Christian Urban, Stefan Berghofer
CADE
2005
Springer
16 years 6 months ago
Nominal Techniques in Isabelle/HOL
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
Christian Urban, Christine Tasson
TPHOL
2008
IEEE
16 years 10 days ago
Imperative Functional Programming with Isabelle/HOL
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
Lukas Bulwahn, Alexander Krauss, Florian Haftmann,...
UTP
2010
15 years 4 months ago
Unifying Theories in Isabelle/HOL
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we explain how we have developed an Isabelle/HOL theo...
Abderrahmane Feliachi, Marie-Claude Gaudel, Burkha...
ESOP
2011
Springer
14 years 9 months ago
General Bindings and Alpha-Equivalence in Nominal Isabelle
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
Christian Urban, Cezary Kaliszyk