🚀 go-pugleaf

In article <1605@newsserver.cs.uwindsor.ca>, arindam@cs.uwindsor.ca (Arindam Das) writes:
> Now, In my program i need to do complex traversal of the graph.
> I being at ease in using Prolog (Quintus Prolog), am using it
> comfortably and i am finding that i can develop the code pretty
> quickly.

> However I have to defend the use of Quintus Prolog instead of C.

You just gave the best possible defence.  It wouldn't matter how wonderful
Prolog is if _you_ couldn't use it effectively for _your_ application.
Tell whoever is hassling you that you are "developing an executable
specification" and that you are willing to implement the final version
in C or whatever _IF_ there is a need for a really fast implementation
and _ONCE_ you have measurements on a working executable specification
which tell you what C data structures would be appropriate.  (I have
just pointed out to my 2nd year data-structures-in-Pascal students that
using the building blocks I have given them they can put together over
256 distinct implementations of graphs, and that's only counting versions
based on adjacency matrices/lists.  You need to know what operations your
_whole_ program performs and how often it performs each before you can
choose the best building blocks.)  Point out that it will be easier to
recode to the "right" C implementation from a high level specification
than from a low level one, so that if and when you _do_ need a C version
you are likely to get a better one than if you had started hacking right
away.
-- 
RMIT policy requires the use of Gender Inclusive Language in all publications
and in all information conveyed to students, staff, and potential job
applicants.  Lapses into English are the sole responsibility of the author.
The Constitution of Australia does _not_ guarantee Freedom of Speech.