<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">Here is how I produced my code:<div class=""><br class=""></div><div class=""><a href="https://flownet.com/ron/lambda-calculus.html" class="">https://flownet.com/ron/lambda-calculus.html</a></div><div class=""><br class=""></div><div class="">The λ macro is defined in the introduction.</div><div class=""><br class=""></div><div class="">rg<br class=""><div><br class=""><blockquote type="cite" class=""><div class="">On May 7, 2023, at 6:58 AM, Tim McNerney <<a href="mailto:mc@media.mit.edu" class="">mc@media.mit.edu</a>> wrote:</div><br class="Apple-interchange-newline"><div class=""><div class="">I like the educational angle, which is kinda the antithesis of obfuscation. Calling it the “short, sweet, and elegant contest” captures the spirit.<br class=""><br class="">The obfuscated C winner I most liked was a (tiny) BASIC interpreter compressed into 1,500 bytes of source code. It became completely understandable after I macroexpanded it. <br class=""><br class="">Ron,<br class=""><br class="">I fiddled with your “entry.”<br class="">Transforming lambda into let when appropriate didn’t help readability. The overall style looks Y combinator-ish, which alas I’ve never wrapped my head around. Is there source to source transform that turns this style into recursive code?<br class=""><br class="">--Tim<br class=""><br class=""><blockquote type="cite" class="">On May 7, 2023, at 11:02, Adlai C <<a href="mailto:munchking@gmail.com" class="">munchking@gmail.com</a>> wrote:<br class=""><br class="">On 4/15/23, Ron Garret <<a href="mailto:ron@flownet.com" class="">ron@flownet.com</a>> wrote:<br class=""><blockquote type="cite" class=""><br class=""><blockquote type="cite" class=""><blockquote type="cite" class="">On Apr 15, 2023, at 7:38 AM, Tim McNerney <<a href="mailto:mc@media.mit.edu" class="">mc@media.mit.edu</a>> wrote:<br class=""></blockquote><br class="">Hmm… Is it crazy to contemplate launching an obfuscated Lisp contest?<br class=""></blockquote><br class="">Here is my entry:<br class=""><br class="">((λ f ((λ g (g g)) (λ (h x) ((f (h h)) x))))<br class="">[...]<br class=""></blockquote><br class="">Is part of the competition figuring out the definition of the lambda<br class="">syntactic sugar? It's not necessarily the simplest imaginable<br class="">definition, due to possible ambiguity in the handling of the list<br class="">designator.<br class=""><br class="">I think in general, due to the complexity and diversity of CL, such<br class="">competitions could be divided by theme, where one main competition<br class="">allows anything, with a separate category for entries specifically<br class="">focused on the [ab]use of one specific technique, whether readtables,<br class="">local functions, macros from hell, etc. Ideally such competitions<br class="">eventually produce good examples for educating future students.<br class=""><br class=""></blockquote><br class=""></div></div></blockquote></div><br class=""></div></body></html>