Path: ...!news.mixmin.net!news.swapon.de!fu-berlin.de!uni-berlin.de!not-for-mail
From: ram@zedat.fu-berlin.de (Stefan Ram)
Newsgroups: comp.lang.lisp
Subject: Re: Writing HG LISP in Python, kind of
Date: 14 Apr 2025 09:56:26 GMT
Organization: Stefan Ram
Lines: 39
Expires: 1 Mar 2026 11:59:58 GMT
Message-ID: <code-20250414105007@ram.dialup.fu-berlin.de>
References: <Python-20250412150133@ram.dialup.fu-berlin.de>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
X-Trace: news.uni-berlin.de BjkZfY75UepUWx41UVjw6QDo5esPr/X7TPQfkMkISzL2vz
Cancel-Lock: sha1:cZ69YZ9wEXWlkFRl38aZvPIrbJg= sha256:OnQlHqM0dsWt2MOb8oaaPWxet/wg7Qd3invJEcW8SPk=
X-Copyright: (C) Copyright 2025 Stefan Ram. All rights reserved.
	Distribution through any means other than regular usenet
	channels is forbidden. It is forbidden to publish this
	article in the Web, to change URIs of this article into links,
        and to transfer the body without this notice, but quotations
        of parts in other Usenet posts are allowed.
X-No-Archive: Yes
Archive: no
X-No-Archive-Readme: "X-No-Archive" is set, because this prevents some
	services to mirror the article in the web. But the article may
	be kept on a Usenet archive server with only NNTP access.
X-No-Html: yes
Content-Language: en-US
Bytes: 2846

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.