Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computational processes. The Isabelle/HOL proof assistant has recently been extended with a definitional package that supports both. We describe a complete procedure for deriving nonemptiness witnesses in the general mutually recursive, nested case—nonemptiness being a proviso for introducing types in higher-order logic
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
Abstract—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the defi...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
International audienceDatatypes and codatatypes are useful for specifying and reasoning about (possi...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional ...
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...
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They su...
International audienceNonuniform (or " nested " or " heterogeneous ") data-types are recursively def...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
Abstract—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the defi...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
International audienceDatatypes and codatatypes are useful for specifying and reasoning about (possi...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional ...
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...
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They su...
International audienceNonuniform (or " nested " or " heterogeneous ") data-types are recursively def...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
Abstract—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the defi...