Question

Just to play around, are there any DSL that

• could be generated randomly
• manipulate text or string and restore them
• works like a reciprocal cipher. e.g. If the generated function is F(), for every string s1 you can get scrambled string s2 = F(s1). Then another G() could be deduced to reverse F(), which G(s2) = s1.
• F() and G() could be the same or different.

And few additional questions:

• any programming language could deduce reverse functions automatically?

• And make sure generated function F() is reversible?

Or any tips where could I start?

Thanks!

Answer 1

To answer my own question:

http://en.wikipedia.org/wiki/Reversible_computing

http://strangepaths.com/reversible-computation/2008/01/20/en/

Looks like it’s mainly in theory CS, so such DSL is yet to be invented.

So far prolog can do reversible functions