Author Archives: Shin

Programming from Galois connections

By Shin | Published: April 25, 2012

Shin-Cheng Mu and José Nuno Oliveira. Programming from Galois connections. In the Journal of Logic and Algebraic Programming , Vol 81(6), pages 680–704, August 2012.
[PDF]

Posted in Journal, Publication | Leave a comment

Proving the Church-Rosser Theorem Using a Locally Nameless Representation

By Shin | Published: November 21, 2011

Around 2 years ago, for an earlier project of mine (which has not seen its light yet!) in which I had to build a language with variables and prove its properties, I surveyed a number of ways to handle binders. For some background, people have noticed that, when proving properties about a language with bound [...]

Posted in Research Blog | 1 Comment

Constructing list homomorphisms from proofs

By Shin | Published: October 4, 2011

Yun-Yan Chi and Shin-Cheng Mu. Constructing list homomorphisms from proofs. In the 9th Asian Symposium on Programming Languages and Systems (APLAS 2011), LNCS 7078, pages 74-88. [PDF]

Posted in Conference, Publication | Leave a comment

Generalising and dualising the third list-homomorphism theorem

By Shin | Published: September 8, 2011

Shin-Cheng Mu and Akimasa Morihata. Generalising and dualising the third list-homomorphism theorem. In the 16th ACM SIGPLAN International Conference on Functional Programming (ICFP 2011), pages 385-391.
[PDF]

Posted in Conference, Publication | Leave a comment

Calculating Programs from Galois Connections

By Shin | Published: December 10, 2010

One is often amazed that, once two functions are identified as a Galois connection, a long list of nice and often useful properties follow from one concise, elegant defining equation. But how does one construct a program from a specification given as a Galois connection?

Posted in Research Blog | Tagged , | 14 Comments

Programming from Galois connections — principles and applications

By Shin | Published: December 9, 2010

Shin-Cheng Mu and José Nuno Oliveira. Programming from Galois connections — principles and applications. Technical Report TR-IIS-10-009, Academia Sinica, December 2010.
[PDF]

Posted in Publication | Tagged , | Leave a comment

Programming from Galois connections

By Shin | Published: December 9, 2010

Shin-Cheng Mu and José Nuno Oliveira. Programming from Galois connections. In the 12th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS #12), LNCS 6663, pages 294-313. May 30 – June 3, 2011.
[PDF]

Posted in Conference, Publication | Tagged , | Leave a comment

Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning

By Shin | Published: October 8, 2010

Shin-Cheng Mu, Yu-Han Lyu, and Akimasa Morihata. Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning. In the 6th ACM SIGPLAN workshop on Generic programming (WGP 2010), pages 97-108, Sep. 2010. [PDF]

Posted in Publication, Workshop | Tagged , , | Leave a comment

Evaluating Simple Polynomials

By Shin | Published: July 12, 2010

I had a chance to show the students, in 25 minutes, what functional program calculation is about. The student have just been exposed to functional programming a week ago in a three-hour course, and I have talked to them about maximum segment sum way too many times.

Posted in Research Blog | Tagged | 11 Comments

Sum of Squares of Differences

By Shin | Published: July 11, 2010

Given an array of integers having at least two elements, compute the sum of squares of the difference between all pairs of elements. It is not hard to quickly write up a O(N²) program using nested loops, which, I have to confess, is what I would do before reading Kaldewaij’s book and realised that it is possible to do the task in linear time using one loop.

Posted in Research Blog | Tagged , | 2 Comments