Article ID Journal Published Year Pages File Type
434405 Science of Computer Programming 2007 36 Pages PDF
Abstract

This paper introduces a type-preserving XML Schema–Haskell data binding (or, translation) UUXML, and shows how to customize it by exploiting the theory of canonical isomorphisms to automatically infer coercions between the machine-generated types and an equivalent, more natural, user-defined set of types. We show how to implement the inference mechanism in Generic Haskell.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics