From: janburse@fastmail.fm   
      
   Thanks for asking. I made the Prolog system   
   source code docu a little bit clearer now:   
      
    From the JavaScript file "machine.mjs":   
      
   /**   
     * Run a callback once, i.e. no choice point or trailing left   
     * behind. Callbacks are run with auto-yield disabled and   
     * promises are not accepted, i.e. run "stackless" on top of the   
     * given main stack or side stack. "stackless" because completion,   
     * i.e. return or exception by the callback, is the only context switch.   
     */   
   export function launch(form, buf, params);   
      
   /**   
     * Run a task once, i.e. no choice point or trailing left   
     * behind. Tasks are run with auto-yield enabled and promises are   
     * accepted, i.e. run "stackfull" on top of the given main stack   
     * or side stack. "stackfull" because not only completion, i.e.   
     * return or exception by the task, cause a context switch, but   
     * also await of an auto-yield or promise.   
     */   
   export async function launch_async(form, buf, params);   
      
   You find this in the Dogelog Player GIT.   
      
   Lawrence D'Oliveiro schrieb:   
   > On Tue, 20 Feb 2024 17:09:53 +0100, Mild Shock wrote:   
   >   
   >> The idea is that threads use a bouncer semaphore to get a permission to   
   >> execute and thus become “coroutines”.   
   >   
   > But they are still stackful coroutines, not stackless.   
   >   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)