skip to main content
article
Free Access

Derivation of recursive algorithms for CS2

Published:01 March 1996Publication History
First page image

References

  1. 1 Edsger W. Dijkstra and W. H. J. Feijen, A Method of Programming, 1988, Addison-Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 David Gries, The Science of Programming, 1981, Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Edward Cohen, Programming in the 1990's: An introduction to the calculation of programs, 1990, Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Anne Kaldewaij, Programming: The Derivatzon of Algorithms, 1990, Prentice Hall. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Edsger W. Dijkstra, A Discipline of Programming, 1976, Prentice Hall. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 David Gries and Fred Schneider, A Logical Approach to Discrete Mathematics, 1994, Springer Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Richard Denman, David A. Naumann, Walter Potter, and Gary Richter, Derivation of Programs for Freshmen, SIGCSE Bulletin, Volume 23, Number 1, March 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Alain J. Martin, A General Proof Rule for Procedures in Predicate Transformer Semantics, Acta Informatica 20.Google ScholarGoogle Scholar
  9. 9 Bijlsma, Wiltink, and Matthews, Equivalence of the Gries and Martin Proof Rules for Procedure Calls, Acta informatica 26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Bijlsma, Matthews, and Wiltink, A Sharp Proof Rule for Procedures in wp Semantics, Acta Informatica 26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Pierre America and Frank de Boer, Proving Total Correctness of Recursive Procedures, CWI report R8904.Google ScholarGoogle Scholar
  12. 12 David A. Naumann, On the Essence of Oberon, in Jurg Gutknecht, editor, Proceedings, Conference on Programming Languages and System A rchztectures, March 1994, Springer LNCS 782. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 David A. Naumann, Predicate Transformer Semantics of an Oberon-Like Language, in Ernst-Rudiger Olderog, editor, Programming Concepts, Methods and Calculi, Elsevier, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Derivation of recursive algorithms for CS2

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM SIGCSE Bulletin
      ACM SIGCSE Bulletin  Volume 28, Issue 1
      March 1996
      379 pages
      ISSN:0097-8418
      DOI:10.1145/236462
      Issue’s Table of Contents
      • cover image ACM Conferences
        SIGCSE '96: Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
        March 1996
        447 pages
        ISBN:089791757X
        DOI:10.1145/236452

      Copyright © 1996 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 March 1996

      Check for updates

      Qualifiers

      • article
    • Article Metrics

      • Downloads (Last 12 months)20
      • Downloads (Last 6 weeks)5

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!