pure project 🧫

🧫 implement all by nothing but only lexical closure . 🧬

____

^{你要像一个主人一样去展开和安排一切，而不是自作聪明地以为只需要像个奴隶一样来被安排被展开这样来面对这一切。}
_{这就是这一项目的全部意义了。}

^{You should do unfold do scheme for everything like a manager of the world, not think yourself clever to be managed to be setted up just like a slave and thing that is enough just face to everything in this world like that.}
_{That's the only point of this, this project or you can say this work, a work of mine.}

_{^_...}
_{^{父性位虚故虚唯之}}
^{_{Vater (The place of the Law) is Real Nothing, Then it shows like WHOLE THING JUST AS A NATURED LIER and THEN IT'S REALLY NOTHING AGAIN ... SO Only The (La) Pure Thing (Nothing) shall be there (la vater) AND IS BETTER THAN ANY & EVERY FXXKING THING !!!}}

Docs

Intro

This is a theoretical verification in Functional Programming studies.

The only one necessary thing of a language for this pure project is a lexical closure feature, means it bind its free variables by the lexical scoping, not the dynamic scoping, and this also called closure or function closure. That means there is a first-classed function means all function is valve and it will pick all the symbol where it be defined which is needed by it-self. With out such thing, all of this projec shall not works.

And with such feature, we can make these things:

Laziness -- without lexical closure feature, then we'll must get the laziness just from a language design and implementation.
Currying -- if we don't have the closure feature, then we cannot do any currying things that means no (elegant) pipe then I shall give up this pure project at its begin.
Tuple -- we can get numbers of values and let them applies one by one onto a picker, and then we just give a specific picker to get the specific value we've just given in.
Iterator -- we have the tuple now and an iterator (or List or Sequence) is just a special 2 length tuple whith a value as the head and a closure as the tail which can just get the next such tuple. (and you can do almost everything with it such as you can just simply take a Iterator <Tuple <...>> as a Table <...> ...)
Pipeline -- a simple pipe is just a λxf.fx while we're all in currying style and a Y(λgxf.g(fx)) could be a yard that always can give a closure to its next parameter, and with such thing we can just play pure functional programming with out any OO Method grammar to make the nesting callings be listing callings (like pipeline (x) (f) (f) (f) ... (sys.out)).

And, with these things, we can do almost (maybe full) things about the compute works, and just with clear, clean, and declarative code expressions.

Thanks for

CS3110 from Cornell University
ISMISM courses by Liu Si Mo also called Wei Ming Zi
Lacanian Psychoanalysis theory from the Lacanianists
Dialectic or Logic method from Georg Wilhelm Friedrich Hegel, Karl Marx and the Leninists
Lambda Calculate from Alonzo Church and Currying theory
Lexical Closure feature that provide this project almost
The Functional Programming For The Rest of Us | defmacro which told me the CPS Programming
Rain World game which give me some idea for the names

Implementations

[ ] TypeScript
[ ] Rust
[ ] Java
[ ] ...

pure-symbols / pure.lexicals

readme

pure project 🧫

Docs

Intro

Thanks for

Implementations

Further Reading