In this chapter we will go through few examples to show basic ideas behind Prolog programming. But first, just few notes about using Prolog systems. A Prolog program is a set of procedures (the order is indifferent), each procedure consists of one or more clauses (the order of clauses is important).
You will be using either either on PCs, Linux machines or Macs, or on remus.rutgers.edu.
What is Prolog?
One of Prolog's most useful features is the simple way it lets us state generalizations. To say that Vincent enjoys burgers we just write: enjoys(vincent,X) :- burger(X).
There are two Prolog techinques that will be important in the implementation of the recognizer: First, database manipulation, and second, failure driven loops. So, before actually implementing the recognizer, we will briefly explain what you have to know.
[Contents] [Top] [Help] [(c)] [Contact] Terms Basic Prolog elements Prolog-specific characters
The generic name for all forms of Prolog data is "term". The data your program works with is all terms of one form or another.
SWI Prolog is the default prolog on the IT and the Grad suns.
A list is either empty or it is composed of a first element (head) and a tail, which is a list itself.
[ edit ] Lists
Scheme is a functional programming language and one of the two main dialects of the programming language Lisp .
Lisp done right, according to some.
MIT/GNU Scheme is an implementation of the Scheme programming language, providing an interpreter, compiler, source-code debugger, integrated Emacs-like editor, and a large runtime library. MIT/GNU Scheme is best suited to programming large applications with a rapid development cycle.