🚀 go-pugleaf

In article <1316@ucl-cs.uucp> D.Parrott@cs.ucl.ac.uk writes:

>DACTL has similar aims to FLIC but is not restricted to functional
>programming.

That is a  little confusing to  say the least.   Dactl is specifically
aimed at  parallel implementations of declarative  languages.  It is a
language based on the theory of graph-rewriting (graph-rewriting is to
term-rewriting as graph reduction is to string reduction), but with an
explicit  encoding of strategy.   It  is non-deterministic,  and  will
support (almost) all    features  of languages   such  as Standard  ML
(including assignments, and imperative I/O).  Annotations may be used 
to specify such notions as locality etc.

The reference you give is also rather out of date (I think that might even
be to Dactl0 rather than Dactl1 -- the latter is an almost entirely different
language).  Try:

%A J.R.W. Gluert
%A K. Hammond
%A J.R. Kennaway
%A G.A. Papadopoulos
%A M.R. Sleep
%T DACTL: Some Introductory Papers
%R Internal Report SYS-C88-08, University of East Anglia
%D 1987
%Z Language description, implementation overviews.

%A K. Hammond
%T Implementing Functional Languages for parallel machines
%R PhD thesis, University of East Anglia
%D 1988
%Z Implementing SML using Dactl

%A K. Hammond
%T Parallel SML: a functional language and its implementation in Dactl
%I Pitman Press
%D December, 1990
%Z Published version of above -- much more detail on Dactl, with a
   simple introduction and several (largish) examples, including a
   parallel type-inference engine.

%A G.A. Papadopoulos
%R PhD thesis, University of East Anglia
%D 1989
%Z PARLOG/Concurrent Prolog in Dactl, direct implementation of full GHC
   I don't have the title to hand.

Kevin
-- 
This Signature Intentionally Left Blank.	E-mail: kh@cs.glasgow.ac.uk