Treffer: Inferring type isomorphisms generically

Title:
Inferring type isomorphisms generically
Authors:
ATANASSOW, Frank, JEURING, Johan
Source:
MPC 2004 : mathematics of program construction (Stirling, 12-14 July 2004)Lecture notes in computer science. :32-53
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 37 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Logiciel, Software, Génie logiciel, Software engineering, Développement logiciel, Software development, Desarrollo logicial, Isomorphisme, Isomorphism, Isomorfismo, Langage XML, XML language, Lenguaje XML, Théorie canonique, Canonical theory, Teoría canónica, Type donnée, Data type, Tipo dato, Utilisabilité, Usability, Usabilidad
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institute of Information & Computing Sciences, Utrecht University, Netherlands
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15993820
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15993820
Database:
PASCAL Archive

Weitere Informationen

Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary products. In some canonical cases, the conversion function is uniquely determined solely by the two types involved. In this article we describe and implement a program in Generic Haskell which automatically infers this function by normalizing types w.r.t. an algebraic theory of canonical isomorphisms. A simple generalization of this technique also allows to infer some non-invertible coercions such as projections, injections and ad hoc coercions between base types. We explain how this technique has been used to drastically improve the usability of a Haskell-XML Schema data binding, and suggest how it might be applied to improve other type-safe language embeddings.