#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2010

2017

- This year (2)
- Last 5 years (10)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Brian Huffman, Ondrej Kuncar
- CPP
- 2013

Quotients, subtypes, and other forms of type abstraction are ubiquitous in formal reasoning with higher-order logic. Typically, users want to build a library of operations and theorems about an abstract type, but they want to write definitions and proofs in terms of a more concrete representation type, or “raw” type. Earlier work on the Isabelle Quotient… (More)

The paper shows how the code generator of Isabelle/HOL supports data refinement, i.e., providing efficient code for operations on abstract types, e.g., sets or numbers. This allows all tools that employ code generation, e.g., Quickcheck or proof by evaluation, to compute with these abstract types. At the core is an extension of the code generator to deal… (More)

- Ondrej Kuncar
- ITP
- 2011

This paper describes the integration of Squolem, Quantified Boolean Formulas (QBF) solver, with the interactive theorem prover HOL Light. Squolem generates certificates of validity which are based on witness functions. The certificates are checked in HOL Light by constructing proofs based on these certificates. The presented approach allows HOL Light users… (More)

- Ondrej Kuncar, Andrei Popescu
- ITP
- 2016

- Ondrej Kuncar
- CPP
- 2015

Overloaded constant definitions are an important feature of the proof assistant Isabelle because they allow us to provide Haskell-like type classes to our users. There has been an ongoing question as to under which conditions we can practically guarantee that overloading is a safe theory extension, i.e., preserves consistency or is conservative. The natural… (More)

- O. Kunčar
- 2010

The Mizar system is a system for formalization of mathematics. It contains a relatively sophisticated and rich type system, which makes formalization of mathematics in Mizar more intuitive than in other systems. On the other hand, the Mizar type system is very complex and together with obscure implementation of the Mizar verifier there is concern about… (More)

- Ondrej Kuncar, Andrei Popescu
- ITP
- 2015

The interactive theorem prover Isabelle/HOL is based on the well understood Higher-Order Logic (HOL), which is widely believed to be consistent (and provably consistent in set theory by a standard semantic argument). However, Isabelle/HOL brings its own personal touch to HOL: overloaded constant definitions, used to achieve Haskell-like type classes in the… (More)

- Jose Divasón, Ondrej Kuncar, René Thiemann, Akihisa Yamada
- Archive of Formal Proofs
- 2016

- Ondrej Kuncar
- 2016

- Ondrej Kuncar, Andrei Popescu
- ESOP
- 2017