🚀 go-pugleaf

In article <1992Dec21.195646.3776@cs.brown.edu> mj@cs.brown.edu 
(Mark Johnson) writes:

   >P.S.  I'm interested in this approach.  I know of work by 
   >Hoefeld and Smolka ``Definite Relations over Constraint Languages'',
   >and Chen and D.S. Warren ``C-Logic of Complex Objects'' and
   >``Abductive Logic Programming'' that describe the decomposition
   >into a relational and constraint components. Any other pointers
   >to relevant literature?

  The theoretical treatment of constraint logic programming has been
solidifying lately, and there are several related formal frameworks.
I think a "standard treatment" may well soon emerge. My remarks have
been prompted by work here at SICS on AKL (the Andorra Kernel
Language), which has a reasonable concurrent constraint logic
programming subset. The theory of that subset is quite close in many
ways to the work of Hoefeld and Smolka, but there are some points of
difference in the formal treatment, partly having to do with concurrency.
A paper on this has been in the pipeline for a long time and may or may
not eventually emerge; those who are fanatically interested in this sort
of thing can get a copy directly from me.