Inferring Type Isomorphisms Generically

Atanassow, Frank; Jeuring, Johan

doi:10.1007/978-3-540-27764-4_4

Cited by 13 publications

(14 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Atanassow et al show how canonical isomorphisms (corresponding to laws for zeros, units, and associativity) between types can induce the value-level conversion functions [4]. They provide an encoding in the polytypic programming language Generic Haskell involving a universal representation of types, and demonstrate how it can be applied to mappings between XML Schema and Haskell datatypes.…”

Section: Generic Functional Programmingmentioning

confidence: 98%

Coupled Transformation of Schemas, Documents, Queries, and Constraints

Visser

2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Coupled transformation occurs when multiple software artifacts must be transformed in such a way that they remain consistent with each other. For instance, when a database schema is adapted in the context of system maintenance, the persistent data residing in the system's database needs to be migrated to conform to the adapted schema. Also, queries embedded in the application code and any declared referential constraints must be adapted to take the schema changes into account. As another example, in XML-to-relational data mapping, a hierarchical XML Schema is mapped to a relational SQL schema with appropriate referential constraints, and the XML documents and queries are converted into relational data and relational queries. The 2LT project is aimed at providing a formal basis for coupled transformation. This formal basis is found in data refinement theory, point-free program calculation, and strategic term rewriting. We formalize the coupled transformation of a data type by an algebra of information-preserving data refinement steps, each witnessed by appropriate data conversion functions. Refinement steps are modeled by so-called twolevel rewrite rules on type expressions that synthesize conversion functions between redex and reduct while rewriting. Strategy combinators are used to composed two-level rewrite rules into complete rewrite systems. Point-free program calculation is applied to optimized synthesize conversion function, to migrate queries, and to normalize data type constraints. In this paper, we provide an overview of the challenges met by the 2LT project and we give a sketch of the solutions offered.

show abstract

Section: Generic Functional Programmingmentioning

confidence: 98%

Coupled Transformation of Schemas, Documents, Queries, and Constraints

Visser

2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…This paper is an extended version of our paper UUXML: a type-preserving XML Schema-Haskell data binding [3] presented at the Practical Aspects of Declarative Languages Conference in 2004, and our paper about inferring type isomorphisms generically [4] presented at the Mathematics of Program Construction Conference in 2004.…”

Section: Outlinementioning

confidence: 99%

Customizing an XML–Haskell data binding with type isomorphism inference in Generic Haskell

Atanassow

Jeuring

2007

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…• Functions like map, crush, and transpose, which manipulate elements of a parametrised datatype such as lists Jeuring, 1998, Norell andJansson, 2004]. • Data conversion Jeuring, 2002, Atanassow andJeuring, 2004]. • Test data generation [Koopman et al, 2003, Lämmel andPeyton Jones, 2005].…”

Section: Design Of the Benchmark Suitementioning

confidence: 99%

Comparing libraries for generic programming in haskell

Rodriguez

Jeuring

Jansson

et al. 2008

Proceedings of the First ACM SIGPLAN Symposium on Haskell

Self Cite

View full text Add to dashboard Cite

Datatype-generic programming is defining functions that depend on the structure, or "shape", of datatypes. It has been around for more than 10 years, and a lot of progress has been made, in particular in the lazy functional programming language Haskell. There are more than 10 proposals for generic programming libraries or language extensions for Haskell. To compare and characterize the many generic programming libraries in a typed functional language, we introduce a set of criteria and develop a generic programming benchmark: a set of characteristic examples testing various facets of datatype-generic programming. We have implemented the benchmark for nine existing Haskell generic programming libraries and present the evaluation of the libraries. The comparison is useful for reaching a common standard for generic programming, but also for a programmer who has to choose a particular approach for datatype-generic programming.

show abstract

Inferring Type Isomorphisms Generically

Cited by 13 publications

References 29 publications

Coupled Transformation of Schemas, Documents, Queries, and Constraints

Coupled Transformation of Schemas, Documents, Queries, and Constraints

Customizing an XML–Haskell data binding with type isomorphism inference in Generic Haskell

Comparing libraries for generic programming in haskell

Contact Info

Product

Resources

About