论文信息 - A System for Proving Equivalences of Recursive Programs

A System for Proving Equivalences of Recursive Programs

We present a system for proving equivalences of recursive programs based on program transformations, namely the fold/unfold method and a generalisation of this method.

Laurent Kott

[1] Bruno Courcelle,et al. Algebraic families of interpretations , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[2] Joseph A. Goguen,et al. Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[3] Zohar Manna,et al. A Deductive Approach to Program Synthesis , 1979, TOPL.

[4] J. Shepherdson,et al. Computer programming and formal systems , 1965 .

[5] Zohar Manna,et al. Knowledge and Reasoning in Program Synthesis , 1974, IJCAI.

[6] Irène Guessarian. Semantic Equivalence of Program Schemes and its Syntactic Characterization , 1976, ICALP.

[7] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[8] Gérard Boudol. A new Recursion Induction Principle , 1979, Theoretical Computer Science.