Kent Petersson and Jan Smith. Program Derivation in Type Theory: The Polish Flag Problem. PMG report 19, Chalmers University of Technology, Goteborg, June 1985.  Home/Search   Document Not in Database   Summary   Related Articles

....solution will then, we think, result in the simplest possible program for the problem; the program one would write in a functional language like ML or KRC. However, the program will not satisfy Dijkstra s requirements concerning space efficiency, which is one of the main points of his solution. In [7] we solved a similar problem, using arrays instead of lists and following Dijkstra s more sophisticated method. 2 The Program Derivation Method As already has been mentioned, programming in type theory is like theorem proving in mathematics. However, since parts of the proofs are used in the ....

....mathematical theorems in a formal system. Being formal is also a necessity when dealing with complex problems since one then certainly need computer support. For our example the solution is so simple that there are no problems in doing the derivation informally. But already in the solution in [7] using arrays, there are so many steps and so much book keeping that it is appropriate to make the derivation in such a way that it could be checked by a computer. So, in order to illustrate the method, our example is carried out in such a detail that it should be straightforward to obtain a ....

Kent Petersson and Jan Smith. Program Derivation in Type Theory: The Polish Flag Problem. PMG report 19, Chalmers University of Technology, Goteborg, June 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC