We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They support mutual and nested (co)recursion through well-behaved type constructors, including mixed recursion–corecursion, and are complemented by syntaxes for introducing primitive (co)recursive functions and by a general proof method for reasoning coinductively. As a case study, we ported Isabelle’s Coinductive library to use the new commands, eliminating the need for tedious ad hoc constructions
International audienceNonuniform (or " nested " or " heterogeneous ") data-types are recursively def...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They su...
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 ...
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...
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...
Abstract—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the defi...
International audienceNonuniform (or " nested " or " heterogeneous ") data-types are recursively def...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They su...
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 ...
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...
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...
Abstract—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the defi...
International audienceNonuniform (or " nested " or " heterogeneous ") data-types are recursively def...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...