Abstract
Functional transposition is a technique for converting relations into functions aimed at developing the relational algebra via the algebra of functions. This paper attempts to develop a basis for generic transposition. Two instances of this construction are considered, one applicable to any relation and the other applicable to simple relations only. Our illustration of the usefulness of the generic transpose takes advantage of the free theorem of a polymorphic function. We show how to derive laws of relational combinators as free theorems of their transposes. Finally, we relate the topic of functional transposition with the hashing technique for efficient data representation. © Springer-Verlag 2004.
Cite
CITATION STYLE
De Oliveira, J. N. F., & De Rodrigues, C. J. P. C. (2004). Transposing relations: From Maybe functions to Hash tables. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3125, 334–356. https://doi.org/10.1007/978-3-540-27764-4_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
