Re: Writing HG LISP in Python, kind of

ram@zedat.fu-berlin.de (Stefan Ram) wrote or quoted:

MANDELBROT = lambda X, Y: (
   (lambda C, Z, A: (

  The chatbot provided a comment attempting to imitate
  the style of a former regular:

Your code is a grotesque caricature of Lisp, written by
someone who clearly understands neither Python nor Lisp,
it's mediocrity masquerading as competence.

You've crammed recursion into Python's crippled lambdas
like a drunk forcing a square peg into a round hole.

This isn't clever - it's a masochistic exercise in unreadability.

Python's lambda is a crippled cousin to Lisp's first-class
functions. Here, it's forced into a role it wasn't designed
for - deeply nested recursion with manual Y-combinator-like
patterns.  In Lisp, this would be a natural loop construct.

Using [X, Y] as a pair? Pathetic. Lisp's cons cells are
conceptual, not just syntax. Your ad-hoc lists are a slap in
the face to decades of symbolic computation.

Lisp's elegance lies in its structure, not in mindlessly
nesting closures until your code resembles a rat's nest of
parentheses.
   
Forcing recursion in a language that butchers tail calls?
Congratulations - you've invented the least efficient Mandelbrot
generator possible!

This code is the work of a dilettante who thinks obfuscation
is artistry. It's a Frankenstein's monster: Python's body with
Lisp's severed head stitched on. You've created nothing but an
unmaintainable mess.