Skip to main content
SpringerLink
Log in

LEMMA: A system for automated synthesis of recursive programs in equational theories

  • System Description
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1995)

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

Included in the following conference series:

  • 764 Accesses

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.

References

  1. S. Biundo. A synthesis system mechanizing proofs by induction. In B. Du Boulay et al, editor, Advances in Artificial Intelligence, volume 2, pages 287–296. Elsevier Science Publishers B.V. (North-Holland), 1987.

    Google Scholar 

  2. S. Biundo. Automated synthesis of recursive algorithms as a theorem prooving tool. In 8th European Conference on Artificial Intelligence, pages 553–558, Munich (Germany), August 1988.

    Google Scholar 

  3. R. Burstall and J. Darlington. A transformational system for developing recursive programs. JACM, 24(1):44–67, January 1977.

    Article  Google Scholar 

  4. J. Chazarain and E. Kounalis. On proving formulas ∀x∃yφ(x,y). In 12th Conference on Automated Deduction, CADE-94, volume 814 of LNCS, pages 118–132, Nancy (France), 1994.

    Google Scholar 

  5. N. Dershowitz. Synthesis by completion. In 9th International Joint Conference on Artificial Intelligence, volume 1, pages 208–214, Los Angeles (USA), 1985.

    Google Scholar 

  6. N. Dershowitz and E. Pinchover. Inductive synthesis of equational programs. In 8th National Conference on Artificial Intelligence (AAAI-90), pages 234–239, Boston (USA), 1990. MIT Press.

    Google Scholar 

  7. N. Dershowitz and U. Reddy. Deductive and inductive synthesis of equational programs. Journal of Symbolic Computation, 15:467–494, 1993.

    Google Scholar 

  8. L. Fribourg. Extracting logic programs from proofs that use extended prolog execution and induction. In J.-M. Jacquet, editor, Constructing Logic Programs, chapter 2, pages 39–66. John Wiley & Sons Ltd, 1993.

    Google Scholar 

  9. E. Kounalis. Testing for inductive (co)-reducibility in rewrite systems. In A. Arnold, editor, 15th Colloquium on Trees in Algebra and Programming (CAAP 90), volume 431 of LNCS, pages 221–238, Copenhagen (Denmark), May 1990. Springer-Verlag. Full paper in Theoretical Computer Science, 1992.

    Google Scholar 

  10. E. Kounalis. A simplification-based approach to program synthesis. In 10th European Conference on Artificial Intelligence (ECAI 92), pages 82–86, Vienna (Austria), August 1992.

    Google Scholar 

  11. Z. Manna and R. Waldinger. A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems, 2(1):90–121, 1980.

    Article  Google Scholar 

  12. Z. Manna and R. Waldinger. Fundamentals of deductive program synthesis. IEEE Transactions on Software Engineering, 18(8):674–704, 1992.

    Article  Google Scholar 

  13. U. Reddy. Rewriting techniques for program synthesis. In N. Dershowitz, editor, 3rd International Conference on Rewriting Techniques and Applications, volume 355 of LNCS, pages 388–403, Chapell Hill (USA), 1989. Springer-Verlag.

    Google Scholar 

  14. D. Smith. Derived preconditions and their use in program synthesis. In D. W. Loveland, editor, 6th Conference on Automated Deduction, volume 138 of LNCS, New York (USA), 1982. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'lnformatique I3S, Université de Nice Sophia Antipolis, 250 Av. Albert Einstein, Bat 4, 06560, Valbonne, France

    Jacques Chazarain & Serge Muller

Authors
  1. Jacques Chazarain
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serge Muller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jieh Hsiang

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chazarain, J., Muller, S. (1995). LEMMA: A system for automated synthesis of recursive programs in equational theories. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-59200-8_76

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49223-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation