skip to main content
article
Free Access

A plan-based approach to Prolog recursion

Published:01 June 1993Publication History
First page image

References

  1. [1] J.G. Bonar and B.W. Liffick, A Visual Programming Language for Novices, in "Principles of Visual Programming Languages", Prentice-Hall. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. [2] W.F. Clocksin and C.S. Mellish, Programming in Prolog, Springer-Verlag (1981). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [3] J.D. Newmarch, Logic programming: Prolog and Stream Parallel languages, Prentice-Hall (1990). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] E. Soloway and K. Ehrlich, Empirical Studies of Programming Knowledge, IEEE Trans Software Eng SE-10, 1985.Google ScholarGoogle Scholar
  5. [5] J. Spohrer, E. Soloway and E. Pope, A Goal/Plan Analysis of Buggy Pascal Programs, Human-Computer Interaction 1, 1985.Google ScholarGoogle Scholar
  6. [6] L. Sterling and E.Y. Shapiro, The Art of Prolog: Advanced Programming Techniques, MIT Press (1986). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A plan-based approach to Prolog recursion

      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 25, Issue 2
        June 1993
        65 pages
        ISSN:0097-8418
        DOI:10.1145/152751
        Issue’s Table of Contents

        Copyright © 1993 Author

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 June 1993

        Check for updates

        Qualifiers

        • article

      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!