Datatypes freely generated by their constructors are well supported in mainstream proof assistants. Algebraic specification languages offer more expressive datatypes on axiomatic means: nonfree datatypes generated from constructors modulo equations. We have implemented an Isabelle/HOL package for nonfree datatypes, without compromising foundations. The use of the package, and its nonfree iterator in particular, is illustrated with examples: bags, polynomials and λ-terms modulo α-equivalence. The many-sorted metatheory of nonfree datatypes is formalized as an ordinary Isabelle theory and is animated by the package into user-specified instances. HOL lacks a type of types, so we employ an ad hoc construction of a universe embedding the relevan...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
Types in higher-order logic (HOL) are naturally interpreted as nonempty sets. This intuition is refl...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
Datatypes freely generated by their constructors are well supported in mainstream proof assistants. ...
Abstract. Datatypes freely generated by their constructors are well supported in mainstream proof as...
Isabelle features a Haskell-like type system with ordered type classes al-ready since 1991 (see [Nip...
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 ...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
The interactive theorem prover Isabelle/HOL is based on the well understood higher-order logic (HOL)...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
Types in Higher-Order Logic (HOL) are naturally interpreted as nonempty sets—this intuition is refle...
We represent a theory of (a fragment of) Isabelle/HOL in Isabelle/HOL. The purpose of this exercise ...
Abstract. HOL types are naturally interpreted as nonempty sets—this intuition is reflected in the ty...
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They su...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
Types in higher-order logic (HOL) are naturally interpreted as nonempty sets. This intuition is refl...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...
Datatypes freely generated by their constructors are well supported in mainstream proof assistants. ...
Abstract. Datatypes freely generated by their constructors are well supported in mainstream proof as...
Isabelle features a Haskell-like type system with ordered type classes al-ready since 1991 (see [Nip...
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 ...
Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computat...
The interactive theorem prover Isabelle/HOL is based on the well understood higher-order logic (HOL)...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
Types in Higher-Order Logic (HOL) are naturally interpreted as nonempty sets—this intuition is refle...
We represent a theory of (a fragment of) Isabelle/HOL in Isabelle/HOL. The purpose of this exercise ...
Abstract. HOL types are naturally interpreted as nonempty sets—this intuition is reflected in the ty...
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They su...
Nonuniform (or “nested” or “heterogeneous”) datatypes are recursively defined types in which the typ...
Types in higher-order logic (HOL) are naturally interpreted as nonempty sets. This intuition is refl...
Higher-order logic (HOL) forms the basis of several popular interactive theorem provers. These follo...