Sciweavers

4 search results - page 1 / 1
» A Recursion Combinator for Nominal Datatypes Implemented in ...
Sort
View
CADE
2006
Springer
14 years 5 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
14 years 5 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
1999
IEEE
13 years 9 months ago
Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering
Abstract. Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and mo...
Stefan Berghofer, Markus Wenzel
TYPES
2000
Springer
13 years 8 months ago
Executing Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
Stefan Berghofer, Tobias Nipkow