Get the latest tech news
F (2006)
is a pure functional concatenative language originally designed as an extension of False. F contains the list-operations of K3 and the dip combinator of Joy.
The criterion for dividing related pairs is simply this: the derived definition must not be egregiously inefficient when compared to the primitive it supplants. The initial state of the interpreter consists of an environment containing the F words of the prelude, an empty result stack, and a string (character-vector) to be evaluated. F began as an exercise in extending Wouter van Oormerssen's concatenative language False, but it rapidly acquired a life of its own.
Or read this on Hacker News