Skip to main content
Springer Nature Link
Log in

A system for proving equivalences of recursive programs

  • Tuesday Afternoon
  • Conference paper
  • First Online:
5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 (CADE 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 87))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Bibliography

  1. ADJ "Initial algebra semantics and continuous algebras", J. of ACM, 24, 1, pp. 68–95 (1977)

    Google Scholar 

  2. J. Arsac, Y. Kodratoff "Some methods for transformation of recursive procedures into iterative ones", LITP Report, Université Paris VI (1979)

    Google Scholar 

  3. D. Begay, L. Kott "Preuve de programme sans induction", 5th Coll. de Lille, Rapport de l'Université de Poitiers (1980)

    Google Scholar 

  4. G. Boudol, L. Kott "Recursion induction principle revisited", submitted to TCS (1980)

    Google Scholar 

  5. R. Burstall, J. Darlington "A transformation system for developping recursive programs", J. of ACM, 24, 1, pp. 44–67 (1977)

    Article  Google Scholar 

  6. B. Courcelle "Infinite trees in normal form and recursive equations having a unique solution", L.A. 226 Report 79-06, Université de Bordeaux (1979)

    Google Scholar 

  7. B. Courcelle, M. Nivat "Algebraic families of interpretations", 17th FOCS, Houston (1976)

    Google Scholar 

  8. M. Feather "ZAP program transformation system", Ph. D. Thesis, Edinburgh University (1979)

    Google Scholar 

  9. I. Guessarian "Semantic equivalence of program schemes and its syntactic characterisation", 3rd ICALP, Edinburgh (1976)

    Google Scholar 

  10. G. Huet, B. Lang "Proving and applying program transformations with second order patterns", Acta Inf., 11, pp. 31–55 (1978)

    Google Scholar 

  11. L. Kott "About transformation system: a theoretical study" in "Transformations de Programmes", B. Robinet ed., pp. 232–247 (1978)

    Google Scholar 

  12. L. Kott "Des substitutions dans les systèmes d'équations algébriques sur le magma", Doctoral Dissertation, Université Paris VII (1979)

    Google Scholar 

  13. L. Kott "Second order subtree replacements", submitted to 21st FOCS (1980)

    Google Scholar 

  14. Z. Manna, R. Waldinger "Knowledge and reasoning in program synthesis", Artif. Intel. J., 6, 2, pp. 175–208 (1975)

    Google Scholar 

  15. J. Mac Carthy "A basis for a mathamatical theory of computation", in "Computer Programming and Formal Systems" (1963)

    Google Scholar 

  16. M. Nivat "Interprétation universelle d'un schéma de programme récursif", Informatica, 7, 1, pp. 9–16 (1977)

    Google Scholar 

  17. Z. Manna, R. Waldinger "A deductive approach to program synthesis", ACM ToPLaS, 2, 1, pp. 90–121 (1980)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.A. du CNRS 248 "Informatique Théorique et Programmation", UER de Mathématiques, Université Paris VII, 2, pl. Jussieu, F-75221, Paris Cedex 05

    Laurent Kott

Authors
  1. Laurent Kott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Robert Kowalski

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kott, L. (1980). A system for proving equivalences of recursive programs. In: Bibel, W., Kowalski, R. (eds) 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980. CADE 1980. Lecture Notes in Computer Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10009-1_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-10009-1_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10009-6

  • Online ISBN: 978-3-540-38140-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics