We focus on generic (or polytypic) programming and program derivation. We are interested in studying the definition of recursive operators on datatypes as well as their associated calculational theory. In particular, we study the derivation of fusion laws for the different operators, as they are a fundamental tool for eliminating many of the intermediate data structures that arise in compositions of recursive functions.

By now, we only give some pointers to our work. In the near future, we intend to include more information in this page.

References

Fusion of Monadic (Co)Recursive Programs
Alberto Pardo
In Workshop on Generic Programming, Marstrand, Sweden, June 1998.

Monadic Corecursion: Definition, Fusion Laws and Applications
Alberto Pardo
In ETAPS'98 Workshop on Coalgebraic Methods in Computer Science, Lisbon, March 1998. Volume 11 of Electronic Notes in Theoretical Computer Science.

A Calculational Approach to Strong Datatypes
Alberto Pardo
In Selected papers from 8th Nordic Workshop on Programming Theory, Oslo, Dec. 1996. Research Report 240, Department of Informatics, University of Oslo, May 1997.