International audienceNonuniform (or " nested " or " heterogeneous ") data-types are recursively defined types in which the type arguments vary recursively. They arise in the implementation of finger trees and other efficient functional data structures. We show how to reduce a large class of nonuniform datatypes and codatatypes to uniform types in higher-order logic. We programmed this reduction in the Isabelle/HOL proof assistant, thereby enriching its specification language. Moreover, we derive (co)induction and (co)recursion principles based on a weak variant of parametricity
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
Types in higher-order logic (HOL) are naturally interpreted as nonempty sets. This intuition is refl...
Types in Higher-Order Logic (HOL) are naturally interpreted as nonempty sets—this intuition is refle...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
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...
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They su...
Abstract—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the defi...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
Types in higher-order logic (HOL) are naturally interpreted as nonempty sets. This intuition is refl...
Types in Higher-Order Logic (HOL) are naturally interpreted as nonempty sets—this intuition is refle...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
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...
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They su...
Abstract—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the defi...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
Types in higher-order logic (HOL) are naturally interpreted as nonempty sets. This intuition is refl...
Types in Higher-Order Logic (HOL) are naturally interpreted as nonempty sets—this intuition is refle...