Computer algorithms: introduction to design and analysis (2nd ed.)
Computer algorithms: introduction to design and analysis (2nd ed.)
Programming: the derivation of algorithms
Programming: the derivation of algorithms
Teaching formal programming to first year computer science students
SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
Models of computation and formal languages
Models of computation and formal languages
The Science of Programming
A Method of Programming
Tutorial on the Irish School of the VDM
VDM '91 Proceedings of the 4th International Symposium of VDM Europe on Formal Software Development-Volume 2: Tutorials
| Hi-index | 0.00 |
We consider some simple optimisation problems and employ a non-traditional method to solve them. We try to model both the problem and solution domains as algebraic structures, attempting to characterise the join operations on these domains. In each of the examples chosen, these structures turn out to be monoids and we make use of the homomorphisms between the problem and solution structures to construct recursive programs. We argue that this method employs a particular conceptual model which is easy to use and may produce nice results.