Tag Archives: Converse-of-a-Function Theorem

Theory and applications of inverting functions as folds.

S-C. Mu and R. S. Bird, Theory and applications of inverting functions as folds. In Science of Computer Programming Vol. 51 Special Issue for Mathematics of Program Construction 2002, pp. 87-116, 2003.
[PDF][GZipped Postscript]

Posted in Journal | Also tagged , | 1 Comment

Rebuilding a tree from its traversals: a case study of program inversion

S-C. Mu and R. S. Bird, Rebuilding a tree from its traversals: a case study of program inversion. In The First Asian Symposium on Programming Languages and Systems, LNCS 2895, pp. 265-282, Bejing, 2003.
[GZipped Postscript]

Posted in Conference | Also tagged , | Leave a comment

A Calculational Approach to Program Inversion

S-C. Mu, A Calculational Approach to Program Inversion. D.Phil Thesis. Oxford University Computing Laboratory. March 2003
[GZipped Postscript][PDF]

Posted in Publication | Also tagged , , , , | Leave a comment

Inverting functions as folds

S-C. Mu and R. S. Bird, Inverting functions as folds. In Sixth International Conference on Mathematics of Program Construction, Dagstuhl, Germany, July 2002
[GZipped Postscript]

Posted in Conference | Also tagged , | Leave a comment

On building trees with minimum height, relationally

S-C. Mu and R. S. Bird, On building trees with minimum height, relationally. In First Asian Workshop on Programming Languages and Systems, Singapore, December 2000.
[GZipped Postscript]

Posted in Workshop | Also tagged , , | Leave a comment

Algebraic Methods for Optimisation Problems (Transfering dissertation)

S-C. Mu, Algebraic Methods for Optimisation Problems. Transfering dissertation.

Posted in Publication | Also tagged , , , | Leave a comment