There is code, search for 'examples'.

It concludes by implementing a fold:

   define
   {
       [Fold]<- {
           rearrange
           {
               rearrange
               {
                   dequote
                   choose
                   quote Result
                   pair pair pair {[Fold]<-} Function Result Remainder
                   Remainder
               }
               {Result Remainder}
               dequote Function Base <-[terms] Source
           }
           {Function Base Source}
        }
   }
   {
       [Fold]<- {[literal]<-} {} {1 2 3}
   }

great example! as someone who writes a Fold function every day, this explains the power of the language very well. ;)

As is clearly explained on the web page, this is not a programming language for everyday tasks, it's an early stage proof of concept that can be used to explore how computer science might be expressed in unusual ways.

Implementing fold would be something of a milestone in such a language.