🚀 go-pugleaf

Michael Coffin:
   Prolog almost entirely lacks explicit control structures, which are
   everywhere in conventional languages.

   And unless you are willing to give up explicit control structures,
   things are much more difficult than Prolog.  You have to devise
   ways to represent not just infix notation, which has a fairly
   natural tree representation, but while statements, case statements,
   for loops, blocks, procedures, exit statements, ---the list goes
   on.

There is no reason these things can't be expressed as functions and/or
meta-functions.  For example, a case statement may be represented as a
meta-function which takes two arguments:  (1) a list of function
representations and (2) a selection argument.

Blocks are even simpler -- use the same notation you use to describe
data and pass the results to a meta-function which returns a usable
function.

There are a number of ways to construct for/while loops, ranging from
repeated application of a function to some data (similar to
"foreach"), to a more explicit iteration where you supply a predicate
to determine when the loop is complete.

I'll agree (in advance) that you'll want some sort of meta-function
syntax so that you can take functions as arguments, but that need not
be complex.

-- 
Raul <rockwell@socrates.umd.edu>