Recursive Transcompiling is the process of applying the notion of [[Source-to-source compiler|Transcompiling]] recursively, to create a pipeline of transformations which repeatedly turn one technology into another.
{{R to section}}
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 [[Source-to-source compiler|Transcompiler]] pipeline produces, that information is preserved<ref>{{cite web | url=http://martinfowler.com/bliki/TransparentCompilation.html | title=Transparent Compilation | date=February 12, 2013 | accessdate=February 13, 2013 | author=Fowler, Martin}}</ref>. It might take on many different shapes and sizes, but by the time it comes back to A (v2), having been transcompiled 6 times in the pipeline above, 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]].
