We describe a line of work that started in 2011 towards enriching Isabelle/HOL’s language with coinductive datatypes, which allow infinite values, and with a more expressive notion of inductive datatype than previously supported by any system based on higher-order logic. These (co)datatypes are complemented by definitional principles for (co)recursive functions and reasoning principles for (co)induction. In contrast with other systems offering codatatypes, no additional axioms or logic extensions are necessary with our approach
International audienceNonuniform (or " nested " or " heterogeneous ") data-types are recursively def...
This paper presents a fixedpoint approach to inductive definitions. Instead of using a syntactic tes...
We show how codatatypes can be employed to produce compact, high-level proofs of key results in logi...
We describe a line of work that started in 2011 towards enriching Isabelle/HOL’s language with coind...
International audienceWe describe a line of work that started in 2011 towards enriching Isabelle/HOL...
Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional ...
Abstract—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the defi...
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They su...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
Abstract. Isabelle/HOL has recently been enriched with a definitional package for datatypes and coda...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
Abstract. Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite...
International audienceNonuniform (or " nested " or " heterogeneous ") data-types are recursively def...
This paper presents a fixedpoint approach to inductive definitions. Instead of using a syntactic tes...
We show how codatatypes can be employed to produce compact, high-level proofs of key results in logi...
We describe a line of work that started in 2011 towards enriching Isabelle/HOL’s language with coind...
International audienceWe describe a line of work that started in 2011 towards enriching Isabelle/HOL...
Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional ...
Abstract—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the defi...
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They su...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
Abstract. Isabelle/HOL has recently been enriched with a definitional package for datatypes and coda...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
Abstract. Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite...
International audienceNonuniform (or " nested " or " heterogeneous ") data-types are recursively def...
This paper presents a fixedpoint approach to inductive definitions. Instead of using a syntactic tes...
We show how codatatypes can be employed to produce compact, high-level proofs of key results in logi...