4 ms·
This is nearly impossible. Just imagine decompiling the result of lowering some deeply nested pattern matching.
by sklogic 11y ago
This is nearly impossible. Just imagine decompiling the result of lowering some deeply nested pattern matching.
- j-pb 11y agoOf course you won't get out what you put in, but you might get something. What I found most impressive was this scheme interpreter written in minikanren (schemes prolog) that can produce quine simply be expressing them as logic constraints over multiple programs. http://www.infoq.com/presentations/miniKanren http://www.infoq.com/presentations/miniKanren https://www.cs.indiana.edu/~eholk/papers/sfp2012.pdf https://www.cs.indiana.edu/~eholk/papers/sfp2012.pdf
- sklogic 11y agoInteresting. Yes, in some cases decompilation can return a higher level code than the original, which is quite an interesting an yet very much unexplored area. I only scratched that while I was working on a static code analysis.