[comp.lang.prolog] A preprocessor to simplify applicative Prolog programming

vanroy@bellatrix.uucp (09/02/89)

I have developed an extension to Prolog's DCG notation
to simplify purely applicative Prolog programming.
A preprocessor for C-Prolog and Quintus Prolog
is available by anonymous ftp to arpa.berkeley.edu.
Comments and suggestions for improvements are welcome.
Enjoy!
	Peter Van Roy
	vanroy@bellatrix.berkeley.edu


The following script shows how to get the package from arpa:

% ftp arpa.berkeley.edu
Connected to ucbarpa.Berkeley.EDU.
220 ucbarpa.Berkeley.EDU FTP server (Version 5.47 Sun Aug 6 07:56:21 GMT 1989) ready.
Name (ucbarpa.Berkeley.EDU:(null)): anonymous
Password (ucbarpa.Berkeley.EDU:anonymous): 
331 Guest login ok, send ident as password.
230 Guest login ok, access restrictions apply.
ftp> cd pub
250 CWD command successful.
ftp> binary
200 Type set to I.
ftp> get ExtendedDCG.tar.Z
200 PORT command successful.
150 Opening BINARY mode data connection for ExtendedDCG.tar.Z (23747 bytes).
226 Transfer complete.
23747 bytes received in 0.62 seconds (37 Kbytes/s)
ftp> quit
221 Goodbye.
% uncompress ExtendedDCG.tar.Z
% tar xf ExtendedDCG.tar
% ls
ExtendedDCG.tar		documentation.ms	unify_example.pl
README			example.pl
accumulator.pl		example2.pl
article.ms		expr_example.pl
% 

mattias@emil (Mattias Waldau) (09/02/89)

What is applicative programming in Prolog? Is it declarative programming, i.e. the programmer can ignore Prolog search-strategy or what. Please examplify!

Mattias