125 search results - page 11 / 25 » Importing HOL into Isabelle HOL |
103
Voted
TPHOL
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
120
click to vote
TLCA
1993
Springer
15 years 6 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
110
click to vote
ITP
2010
15 years 5 months ago
2010
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
115
click to vote
PPDP
2009
Springer
15 years 8 months ago
2009
Springer
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functional pr...
125
click to vote
ENTCS
2006
15 years 1 months ago
2006
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...