Talks and Poster Presentations (with Proceedings-Entry):
U. Neumerkel, M. Triska, J. Wielemaker:
"Declarative language extensions for prolog courses";
Talk: International Conference on Functional Programming, Workshop on Functional and Declarative Programming in Education,
Victoria, BC, Canada;
09-21-2008; in: "Proceedings of the 2008 international workshop on Functional and declarative programming in education",
New York, NY, USA
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.
Teaching Prolog, side-effect free I/O, occurs-check, constraints
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.