MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Disjoint Sums over Type Classes in HOL (1999) [1 citations — 1 self]

Download:
Download as a PDF | Download as a PS
by Norbert Volker
Proceedings of TPHOLs’99
http://cswww.sx.ac.uk/FSS/people/../papers/tphol99.ps.gz
Add To MetaCart

Abstract:

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. 1

Citations

361 The foundation of a generic theorem prover – Paulson - 1989
173 Introducing Z: A Specification Language and its Formal Semantics; Cambridge – Spivey - 1988
119 The system F of variable types, fifteen years later. Theoretical Com-puter Science – Girard - 1986
98 Introduction to HOL – Gordon, Melham - 1993
45 A fixedpoint approach to implementing (co)inductive definitions – Paulson - 1994
39 Should Your Specification Language Be Typed – Paulson - 1999
36 A Structure Preserving Encoding of Z in Isabelle/HOL – Kolyang, Wolff - 1996
35 Type classes and overloading in higher-order logic – Wenzel
21 HOLCF: Eine konservative Erweiterung von HOL um LCF – Regensburger - 1994
19 A higher-order calculus and theory abstraction – Luo - 1991
14 A Structure Preserving Encoding of Z in Isabelle /HOL – Kolyang, Wolff - 1996
7 A logic for the schema calculus – Henson, Reeves - 1998
6 Set theory, higher order logic or both – Gordon - 1996
2 editors. HASKELL98: A Non-strict, Purely Functional Language – Jones, Hughes - 1999
1 Sets, types and typechecking – Turner