Jump to content

Recursive transcompiling

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Eejai42 (talk | contribs) at 19:30, 23 September 2016 (Added the first draft of a description of Recursive transcompiling, which is a derivative of Transcompiling. A page about transcompiling already existed.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Recursive Transcompiling is the process of applying the notion of Transcompiling recursively, to create a pipeline of transformations which repeatedly turn one thing into another.

By repeating this process, one can turn A -> B -> C -> D -> E -> F and then back into A(v2). Some information will be preserved through this pipeline, from A -> A(v2), and that information (at an abstract level) demonstrates what each of the components A-F agree on.

In each of the different versions that the Transcompiler pipeline produces, that information is preserved. It might take many different shapes, but by the time it comes back to A (v2), having been transcompiled 6 times in the pipeline, the information returns to it's original state.

This information which survives the transform through each format, from A-F-A(v2), is (by definition) derivative content or derivative code.