skip to main content
article

On using scheme to introduce prolog

Published:03 March 2006Publication History
Skip Abstract Section

Abstract

The traditional way to teach Prolog is to have students start by writing recursive mathematical definitions of the problems they are trying to solve. While this is an effective technique, it does not fit well into a Programming Languages course that uses a single demonstration language to illustrate the different paradigms. Thus, we have developed an approach to introduce students to Prolog via our demonstration language, Scheme. Additionally, we performed an experiment to determine if the Scheme to Prolog approach is as effective at introducing Prolog as the more traditional recursive mathematical definition approach.

References

  1. Lu, James and Jerud Mead. http://www.eg.bucknell.edu/~cs208/subpages/Tutorials/PrologT/prolog/prolog.html. Bucknell Univerisy. 2002.Google ScholarGoogle Scholar
  2. Sterling, Leon and Ehud Shapiro. The Art of Prolog. MIT Press. 1994.Google ScholarGoogle Scholar
  3. Tucker, Allen and Robert Noonan. Programming Languages, Principles and Paradigms. McGraw-Hill. 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Wick, Michael R and Daniel E. Stevenson. "A Reductionist Approach to a Course on Programming Languages," SIGCSE, February 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On using scheme to introduce prolog

      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 38, Issue 1
        March 2006
        553 pages
        ISSN:0097-8418
        DOI:10.1145/1124706
        Issue’s Table of Contents
        • cover image ACM Conferences
          SIGCSE '06: Proceedings of the 37th SIGCSE technical symposium on Computer science education
          March 2006
          612 pages
          ISBN:1595932593
          DOI:10.1145/1121341

        Copyright © 2006 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 3 March 2006

        Check for updates

        Qualifiers

        • article
      • Article Metrics

        • Downloads (Last 12 months)8
        • Downloads (Last 6 weeks)4

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader