Huet, Gerard, "Specifications, Algorithms, Axiomatisations and Proofs Commented Case Studies In the Coq Proof Assistant", Summer School on Logic of Computation, Marktoberdorf, 1995 http://citeseer.nj.nec.com/huet95specifications.html  Home/Search   Document Details and Download   Summary   Related Articles

....intended to provide a general theory library to prove string results. The prelude file in PVS formalizes strings as finite sequences of characters. It is set up to use a specific alphabet, and is intended for rewriting. G. Huet uses a formulation of binary alternating words to prove a card trick [H1995]. His intent is the illustration of the use of the Coq Proof Assistant [BCF1999] J. Traugott uses the string theory of Manna and Waldinger to derive recursive sorting algorithms [T1989] As is Manna and Waldinger s work, this is a pencil and paper formalization utilizing the deductive synthesis ....

Huet, Gerard, "Specifications, Algorithms, Axiomatisations and Proofs Commented Case Studies In the Coq Proof Assistant", Summer School on Logic of Computation, Marktoberdorf, 1995 http://citeseer.nj.nec.com/huet95specifications.html

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