1. 17
  1.  

  2. 6

    Röda allows programming with pipelines:

    primes := [2]
    seq 3, 10000 | { primes += i if [ i % p != 0 ] for p in primes } for i
    print p for p in primes
    

    and supports explicitly pulling and pushing from and to the pipeline:

    duplicate {
    	pull value
    	push value
    	push value
    }
    

    The relationship becomes clearer with this formulation of duplicate:

    duplicate {
    	for value; do
    		push value
    		push value
    	done
    }
    
    1. 4

      Sounds like Dataflow Programming. People interested in such a construct should look into dataflow languages:

      https://en.wikipedia.org/wiki/Dataflow_programming

    2. 1

      I love what I see. The only two hard point are the diacritics in files and the java runtime