- Declarative language extensions for Prolog courses
- 2008 ACM SIGPLAN Workshop on Functional and Declarative Programming in Education (FDPE’08), Victoria, BC, Canada
- Book/source title
- FDPE’08: Proceedings of the 2008 ACM SIGPLAN Workshop on Functional and Declarative Programming in Education
- Pages (from-to)
- New York, NY: Association for Computing Machinery (ACM)
- Document type
- Conference contribution
- Faculty of Science (FNWI)
- Informatics Institute (IVI)
In this paper we present several extensions to support a more declarative view of programming in Prolog. These extensions enable introductory Prolog courses to concentrate on the pure parts of Prolog for longer periods than without. Even quite complex programs can now be written free of any reference to the more problematic constructs. Our extensions include an alternate way to handle the occurs-check, efficient side-effect free I/O with DCGs, and a uniform approach to integer arithmetic that overcomes the disadvantages of arithmetical evaluation and finite domain constraints, but combines and amplifies their strengths. All extensions have been included recently into the SWI-Prolog distribution.
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.