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]
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]
S-C. Mu, Algebraic Methods for Optimisation Problems. Transfering dissertation.
S. Seres and S-C. Mu, Optimisation problems in logic programming: an algebraic approach. In Proceedings of LPSE’00, July 2000.
[GZipped Postscript]
T-R. Chuang and S-C. Mu, Out-of-core functional programming with type-based primitives. In 2nd International Workshop on Practical Aspects of Declarative Languages, January 2000.
[GZipped Postscript]
A Haskell quine. That is, a program whose output is itself.
Programs and profiling results accompanying the paper Countdown: a case study in origami programming. [GZipped Tarball]
The injective language Inv, together with the language X, the XEditor, and the HaXml embedding. [GZipped Tarball]
Do you know that the S combinator is injective? I have a simple algebraic proof and Nakano actually constructed its inverse.