A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Programming from Galois connections
2012
The Journal of Logic and Algebraic Programming
Problem statements often resort to superlatives such as in e.g. "...the smallest such number", "...the best approximation", "...the longest such list" which lead to specifications made of two parts: one defining a broad class of solutions (the easy part) and the other requesting one particular such solution, optimal in some sense (the hard part). This article introduces a binary relational combinator which mirrors this linguistic structure and exploits its potential for calculating programs by
doi:10.1016/j.jlap.2012.05.003
fatcat:eekpaf2tpjgwjlrkg5civnjmfy