As a variation on the known theme of Gödel numberings, isomorphisms defining data type transformations in a strongly typed functional language are organized as a finite groupoid using a higher order combinator language that unifies popular data types as diverse as natural numbers, finite sequences, digraphs, hypergraphs and finite permutations with more exotic ones like hereditarily finite functions, sets and permutations. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Tarau, P. (2009). A groupoid of isomorphic data transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5625 LNAI, pp. 170–185). https://doi.org/10.1007/978-3-642-02614-0_17
Mendeley helps you to discover research relevant for your work.