Disjoint sums over type classes in hol

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The standard versions of HOL only support disjoint sums over finite families of types. This paper introduces disjoint sums over type classes containing possibly a countably infinite number of monomorphic types. The result is a monomorphic sum type together with an overloaded function which represents the family of injections. Model-theoretic reasoning shows the soundness of the construction. In order to axiomatize the disjoint sums in HOL, datatypes are introduced which mirror the syntactic structure of type classes. The association of a type with its image in the sum type is represented by a HOL function carrier. This allows a translation of the set-theoretic axiomatization of disjoint sums to HOL. As an application, a sum type U is presented which contains isomorphic copies of many familiar HOL types. Finally, a Z universe is constructed which can server as the basis of a HOL model of the Z schema calculus.

Cite

CITATION STYLE

APA

Völker, N. (1999). Disjoint sums over type classes in hol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1690, pp. 5–18). Springer Verlag. https://doi.org/10.1007/3-540-48256-3_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free