🚀 go-pugleaf

Sure, you can represent abstract data types in Prolog. The main problem is
that axiomatic specifications of abstract data types are functional, so you
have to add an output argument to each of the functions to get the
corresponding Prolog predicates. The stack example is straightforward :

%	Create an empty stack

createstack(createstack).

%	Check if a stack is empty (succeeds iff true)

isemptystack(createstack).

%	Push an item

push(Item, Stack, push(Item, Stack)).

%	Retrieve the top of a stack, fail if it's empty

top(push(Item, _), Item).

%	Pop an item off a stack, fail if the stack is empty

pop(push(_, Stack), Stack).

If you'd like an error indication for top() or pop() applied to an empty
stack (instead of failure), you can do something like

	pop(push(_, Stack), Stack).
	pop(createstack, Stack).

This predicate still fails if it is applied to something which isn't a stack.


				Jens Kilian
--
Internet: kilian@seas.gwu.edu		SnailMail: 4715 MacArthur Blvd.
(I don't know any other addresses ...)		   Washington, DC 20007
"Sie hawwe-mer so e bekannt Physionomie, ich mahn, ich misst Ihne kenne.
 Sinn-Se net, um Vergebung, der Herr Assesser Ranft ?"