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)

Volumn 3125, Issue , 2004, Pages 334-356

  De Oliveira, José Nuno Fonseca ^a   De Rodrigues, César Jesus Pereira Cunha ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COMBINATORS; DATA REPRESENTATIONS; HASH TABLE; HASHING TECHNIQUES; POLYMORPHIC FUNCTIONS; RELATIONAL ALGEBRA;

ALGEBRA;

EID: 35048862884     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (22)

1. Chritiene Aarts, Roland Backhouse, Paul Hoogendijk, Ed Voermans, and Jaap van der Woude. A relational theory of datatypes, December 1992.
2. J. Adámek, H. Herrlich, and G.E. Strecker. Abstract and Concrete Categories. John Wiley & Sons, Inc., 1990.
3. K. Backhouse and R.C. Backhouse. Safety of abstract interpretations for free, via logical relations and Galois connections. Science of Computer Programming, 2003. Accepted for publication.
4. R.C. Backhouse. Regular algebra applied to language problems. Available from http://www.cs.nott.ac.uk/~rcb/papers/ (Extended version of Fusion on Languages published in ESOP 2001. Springer LNCS 2028, pp. 107-121.).
5. R.C. Backhouse, P. de Bruin, P. Hoogendijk, G. Malcolm, T.S. Voermans, and J. van der Woude. Polynomial relators. In 2nd Int. Conf. Algebraic Methodology and Software Technology (AMAST'91), pages 303-362. Springer LNCS, 1992.
6. R. Bird and O. de Moor. Algebra of Programming. Series in Computer Science. Prentice-Hall International, 1997. C. A. R. Hoare, series editor.
7. J. Fitzgerald and P.G. Larsen. Modelling Systems: Practical Tools and Techniques for Software Development. Cambridge University Press, 1st edition, 1998.
8. M.M. Fokkinga. Monadic maps and folds for arbitrary datatypes. Memoranda Informatica 94-28, University of Twente, June 1994.
9. M.M. Fokkinga and L. Meertens. Adjunctions. Memoranda Informatica 94-31, University of Twente, June 1994.
10. Paul Hoogendijk. A Generic Theory of Data Types. PhD thesis, University of Eindhoven, The Netherlands, 1997.
11. Paul F. Hoogendijk and Oege de Moor. Container types categorically. Journal of Functional Programming, 10(2):191-225, 2000.
12. E. Horowitz and S. Sahni. Fundamentals of Data Structures. Computer Software Engineering Series. Pitman, 1978. E. Horowitz (Ed.).
13. S.L. Peyton Jones. Haskell 98 Language and Libraries. Cambridge University Press, Cambridge, UK, 2003.
14. Also published as a Special Issue of the Journal of Functional Programming, 13(1) Jan. 2003.
15. Sun Meng and L.S. Barbosa. On refinement of generic state-based software components. In C. Rettray, S. Maharaj, and C. Shankland, editors, 10th Int. Conf. Algebraic Methods and Software Technology (AMAST), Stirling, July 2004. Springer Lect. Notes Comp. Sci. (to appear).
16. J. N. Oliveira. Software Reification using the SETS Calculus. In Tim Denvir, Cliff B. Jones, and Roger C. Shaw, editors, Proc. of the BCS FACS 5th Refinement Workshop, Theory and Practice of Formal Software Development, London, UK, pages 140-171. ISBN 0387197524, Springer-Verlag, 8-10 January 1992. (Invited paper).
17. J. N. Oliveira. Hash Tables - A Case Study in ⊴ -calculation. Technical Report DI/INESC 94-12-1, INESC Group 2361, Braga, December 1994.
18. J. N. Oliveira. 'Fractal' Types: an Attempt to Generalize Hash Table Calculation. In Workshop on Generic Programming (WGP'98), Marstrand, Sweden, June 1998.
19. J. N. Oliveira. Hash tables as transposed data structures, 2004. PURe Project technical report (in preparation).
20. J. C. Reynolds. Types, abstraction and parametric polymorphism. Information Processing 83, pages 513-523, 1983.
21. P. Wadler. Theorems for free! In 4th International Symposium on Functional Programming Languages and Computer Architecture, London, Sep. 1989. ACM.
22. N. Wirth. Algorithms + Data Structures = Programs. Prentice-Hall, 1976.