News for hackers. Stuff that matters.
Re:Lisp as the Maxwell’s Equations of Software by martyalain on Tuesday November 08, 2022 @07:03AM (#33518218)
I thought the same thing for a long time, I found s-expressions very elegant. Then I discovered lambda-calculus, with its scary syntax but based on a process I could understand, text-rewriting. So I had the idea to explore the lambda-calculus using s-expressions and patiently rebuilt booleans, pairs, lists, recursion and beyond a real complete Turing language, for instance:

- http://lambdaway.free.fr/lambdawalks - http://lambdaway.free.fr/lambdawalks/?view=lambdacode5

No need for cons, car, cdr and other historical names. We can rebuild everything from scratch, from abstractions and applications. No need for Lisp, Scheme, Common Lisp and other Clojure, even if they remain excellent examples. So in my opinion the Maxwell equations of computation are to be seen more in the lambda-calculus than in LISP and its dialects. We just need to make the syntax a little more human.

Re:Lisp as the Maxwell’s Equations of Software by jerf on Wednesday November 09, 2022 @10:02AM (#33532534)
For the reasons you give, it is perhaps more reasonable to say that Lisp is a Maxwell's Equations of software. But there are several. Forth has another reasonable claim to it, despite unpopularity, and Turing Machines have a claim too, despite their extreme unpopularity as a programming methodology. I don't know array languages well enough to know but I bet they have one too.

There isn't really a unique set of Maxwell's equations in software.

Re:Lisp as the Maxwell’s Equations of Software by kragen on Wednesday November 09, 2022 @11:06AM (#33533581)
i wasn't able to get a runnable forth to less than a couple of pages written in itself https://github.com/kragen/stoneknifeforth but schönfinkel's ski-combinators are maybe the simplest practical basis

    s f g x → f x (g x)
    k a b   → a
    i = s k k (one of many possible definitions)
maybe wolfram knows of a simpler alternative

my favorite is abadi and cardelli's object-calculus on which i based bicicleta. it has two reduction rules rather than the λ-calculus's one. using a hybrid of bicicleta's syntax and abadi and cardelli's

    {f = ς(v)b, g = ς(v)c, ...}{f = ς(v)d} → {f = ς(v)d, g = ς(v)c, ...}
    {f = ς(v)b, g = ς(v)c, ...}.f          → b[{f = ς(v)b, g = ς(v)c, ...}/v]
the first of these derives an inherited object with a new definition for method f. the second one invokes method f on an object, which is evaluated by replacing its self-variable v with the object itself throughout its body, using the standard β-reduction semantics with α-renaming that we're familiar with from the λ-calculus (b[x/y] means b but with x replacing y)

despite the simplicity of the semantics the ς-calculus is enormously more usable for actually writing down functions than the λ-calculus

they published a bunch of papers and a book on this but they were more interested in static typing than anything else. a paper on one imperative variation of the thing is http://lucacardelli.name/Papers/PrimObjImpSIPL.A4.pdf

you can implement a turing machine in a few lines of c, making it internally simpler than the other alternatives, but as you point out it's unusable

Re:Lisp as the Maxwell’s Equations of Software by gradschool on Wednesday November 09, 2022 @12:02PM (#33534504)
> maybe wolfram knows of a simpler alternative

Wolfram on combinators:

https://writings.stephenwolfram.com/2020/12/combinators-a-ce...

not any simpler, but maybe these are:

https://en.wikipedia.org/wiki/Iota_and_Jot

Re:Lisp as the Maxwell’s Equations of Software by kragen on Wednesday November 09, 2022 @01:31PM (#33535883)
oh yeah, how could I forget iota and jot, that was stupid of me
Re:Lisp as the Maxwell’s Equations of Software by Gordonjcp on Wednesday November 09, 2022 @04:11PM (#33537892)
> but schönfinkel's ski-combinators are maybe the simplest practical basis

Okay, but how much code goes into creating those operators?

Re:Lisp as the Maxwell’s Equations of Software by kragen on Wednesday November 09, 2022 @04:45PM (#33538352)
it depends on what you're implementing them in, but in a term-rewriting language all you need is the two lines above. in js you need to implement some kind of term-rewriting. in 02006 i wrote a compiler from λ-calculus (using \ for λ, so you can write for example \x.\y.x for λx.λy.x, which is equivalent to the k combinator) to an augmented sk-combinator language in js that's at http://canonical.org/~kragen/tmp/sk.html

the definitions of s and k in it are

    S: [3, function(f, g, x) { return App(App(f, x), App(g, x)) }],
    K: [2, function(k, _) { return Ind(k) }],
which are used as templates for matching by the 33-line-long sk_reduce function, which i'll spare you here

the λ-calculus parser, the compiler from λ-calculus to sk-combinators, the sk-combinator parser, and the sk-combinator evaluator together are 391 lines of js

if you just want to define the s and k combinators in js they look like this

    s = f => g => x => f(x)(g(x))
    k = a => b => a
but that is depending on the js interpreter to do the actual evaluation

more recently i implemented a term-rewriting language in i386 assembly, it's about 800 bytes and 400 instructions: http://canonical.org/~kragen/sw/dev3/qfitzah.s but i haven't quite figured out how to handle arithmetic, i/o, and variadic lists

i think you could probably implement sk combinatory logic in about half a page of c if you were okay with leaking memory, you don't really need the flexibility of variadic lists and arbitrary identifiers in the sk-combinator language. every term is either a function application (of one function to one argument), s, or k

Re:Lisp as the Maxwell’s Equations of Software by Gordonjcp on Thursday November 10, 2022 @11:21AM (#33548763)
> it depends on what you're implementing them in, but in a term-rewriting language all you need is the two lines above

Okay, so what do I type those two lines into to implement that? How many lines of code does that involve?

> more recently i implemented a term-rewriting language in i386 assembly, it's about 800 bytes and 400 instructions: http://canonical.org/~kragen/sw/dev3/qfitzah.s but i haven't quite figured out how to handle arithmetic, i/o, and variadic lists

Have you considered having a parameter stack that arithmetic operators pull their arguments from and push their results onto? Oh wait... ;-)

Re:Lisp as the Maxwell’s Equations of Software by kragen on Thursday November 10, 2022 @12:12PM (#33549737)
> so what do I type those two lines into to implement that? How many lines of code does that involve?

i just answered that in the comment you are replying to

> Have you considered having a parameter stack

this is a remarkably bad answer to my explanation of how much code i needed to write a self-compiling forth that generates machine code

what is wrong with you

i am sad now

Re:Lisp as the Maxwell’s Equations of Software by mannykannot on Wednesday November 09, 2022 @10:08AM (#33532626)
I was going to say I had heard that this was the intention of Lisp's creators, then I thought I had better check, and immediately found this:

Lisp had assignments and goto before it had recursion, and started as a dialect of Fortran! It was only later that Lisp programmers investigated the benefits of pure functions. Lisp was not based on lambda calculus, but rather Kleene's work on recursive functions. At the time, McCarthy had heard of lambda calculus but had not yet studied it!

https://crypto.stanford.edu/~blynn/lambda/lisp.html

Re:Lisp as the Maxwell’s Equations of Software by kazinator on Wednesday November 09, 2022 @10:23AM (#33532867)
The list processing in Lisp was inspired by FLPL: Fortran List Processing Language. This was more like a library of Fortran routines than a language, but in 1958 the term library for routines of code didn't even exist. Making new words of any kind was language development.

FLPL already used the CAR and CDR terminology in its naming, with extra characters: XCARF and XCDRF (and others). The "extract CAR function" and "extract CDR function".

Re:Lisp as the Maxwell’s Equations of Software by bmitc on Wednesday November 09, 2022 @03:16PM (#33537229)
As far as I understand, McCarthy was into Godel, recursive functions, mathematics, and AI in trying to create Lisp to study these, not so much computability and the like. I think that's at least one line of thinking that causes people to say that McCarthy discovered Lisp instead of inventing it.
Re:Lisp as the Maxwell’s Equations of Software by alexisread on Wednesday November 09, 2022 @10:11AM (#33532676)
Nice take on lambda calc! It looks like you're making use of beta-reduction for the eval engine. Shen has a more formal take on lambda calc, and I think it's useful for more advanced constructs like type checking. Shen actually uses K-lambda (a lispish version of lambda calc) as part of it's compiler Sequent-calc->Prolog->Shen->K-lambda->VM:

https://shenlanguage.org/TBoS/tbos_170.html

Re:Lisp as the Maxwell’s Equations of Software by mattgreenrocks on Wednesday November 09, 2022 @10:33AM (#33533021)
This is really cool, thanks for linking that.
Re:Lisp as the Maxwell’s Equations of Software by martyalain on Wednesday November 09, 2022 @10:57AM (#33533436)
My first goal was to write in a wiki using a light and extended HTML. I then discovered LISP and lambda-calculus. I built an "inverted" evaluator working directly on s-expressions (without AST), ignoring words (which therefore did not have to be protected by apostrophes and quotation marks), like in basic HTML. I can thus write wiki pages that are lambdatalk programs, mixing pure text and code effortlessly. It's my all-purpose tool.
Re:Lisp as the Maxwell’s Equations of Software by all2 on Thursday November 10, 2022 @11:03AM (#33548430)
Do you have a write up on this tool somewhere? This sounds really cool!
Re:Lisp as the Maxwell’s Equations of Software by martyalain on Thursday November 10, 2022 @01:05PM (#33550591)
Thank you, everything starts in this page http://lambdaway.free.fr/lambdawalks
Re:Lisp as the Maxwell’s Equations of Software by voxl on Wednesday November 09, 2022 @12:31PM (#33534941)
How is beta reduction not "formal"???
Re:Lisp as the Maxwell’s Equations of Software by alexisread on Wednesday November 09, 2022 @01:20PM (#33535717)
Sorry I wasn't clear - beta-reduction is formal, I was trying to refer to the extension of the formal treatment of lambdas to cover proofs, formal logic and typechecking. Shen does this for typechecking.
Re:Lisp as the Maxwell’s Equations of Software by User23 on Wednesday November 09, 2022 @10:25AM (#33532903)
No need for those pesky variable names that make term rewriting clunk either[1]! The entire hygiene problem just disappears. Your style guide section on naming will also be greatly simplified.

[1] https://en.wikipedia.org//wiki/De_Bruijn_index

Re:Lisp as the Maxwell’s Equations of Software by martyalain on Wednesday November 09, 2022 @10:44AM (#33533228)
I agree with you, but so far I have never been able to get into the logic of de Bruijn's clues. As for example John Tromp knows how to do. (https://tromp.github.io/) But I don't despair of getting there one day...
Re:Lisp as the Maxwell’s Equations of Software by tromp on Wednesday November 09, 2022 @10:43AM (#33533198)
I agree that Maxwell’s Equations of Software should be based on lambda calculus, the binary version of which [1] admits a much more concise 29 byte self-interpreter

        (λ11)(λλλ1(λλλλ3(λ5(3(λ2(3(λλ3(λ1 2 3)))(4(λ4(λ3 1(2 1))))))(1(2(λ1 2))(λ4(λ4(λ2(1 4)))5))))(3 3)2)(λ1((λ1 1)(λ1 1)))
[1] https://tromp.github.io/cl/Binary_lambda_calculus.html
Re:Lisp as the Maxwell’s Equations of Software by martyalain on Wednesday November 09, 2022 @10:45AM (#33533241)
I agree with you, but so far I have never been able to get into the logic of de Bruijn's clues. As for example John Tromp knows how to do. (https://tromp.github.io/) But I don't despair of getting there one day...
Re:Lisp as the Maxwell’s Equations of Software by qsort on Wednesday November 09, 2022 @11:39AM (#33534097)
A picture is worth a thousand words: https://en.wikipedia.org/wiki/De_Bruijn_index#/media/File:De...

It's literally just notation:

- It doesn't matter how you name variables. (if you want to sound cool: "lambda terms are invariant under alpha-conversion")

- Each new variable introduces a scope.

- Therefore, how scopes are nested defines the entire expression.

- Instead of the usual way, we represent scopes with numbers, with the index representing "how nested the scope is". Imagine it's python, and you're pressing tab that many times.

Re:Lisp as the Maxwell’s Equations of Software by pierrebai on Wednesday November 09, 2022 @01:46PM (#33536098)
Syntax and layout ware worth yet a few more orders of magnitude of words. But that argument has slipped past LISPers forever. I'll just let them keep scratching their heads why Python got so popular when LISP was around for so long and is /clearly/ superior.
Re:Lisp as the Maxwell’s Equations of Software by thrown_22 on Wednesday November 09, 2022 @03:41PM (#33537526)
Python is popular because the majority of programs are extremely simple.

Look at how ugly decorators are in python when in lisp you get them for free and they don't even need a name.

Re:Lisp as the Maxwell’s Equations of Software by lispm on Wednesday November 09, 2022 @05:11PM (#33538709)
I don't think LISPers are scratching their head about this. Lisp syntax is optimized towards meta-programming. Generating and processing code is built-in and supported with central mechanisms: READ, EVAL, PRINT, s-expressions, macros, ...

Python is optimized towards simple pseudo-code like imperative OOP. That's easier for most programmers.

Re:Lisp as the Maxwell’s Equations of Software by voldacar on Wednesday November 09, 2022 @06:02PM (#33539423)
What world are you living in where popularity is somehow a way of judging quality? The masses love marvel movies and fast food
Re:Lisp as the Maxwell’s Equations of Software by lisper on Wednesday November 09, 2022 @12:01PM (#33534466)
Note that the person you were responding to is John Tromp. :-)
Re:Lisp as the Maxwell’s Equations of Software by SkyMarshal on Wednesday November 09, 2022 @12:02PM (#33534495)
> As for example John Tromp knows how to do.

You might not have noticed the userid of the person you're replying to ;)

Re:Lisp as the Maxwell’s Equations of Software by martyalain on Wednesday November 09, 2022 @12:08PM (#33534586)
yes, I hadn't noticed that. I wish I could understand it better.
Re:Lisp as the Maxwell’s Equations of Software by deltasevennine on Wednesday November 09, 2022 @10:54AM (#33533377)
lambda calculus is turing complete. But so are turing machines. So why not have turing machines be the Maxwells equations of software.

Maybe there's an infinite amount of mathematical theories that are turing complete. Why is lambda calculus chosen as the foundational one?

I would argue, the Maxwells equation of software should be MORE foundational. Not some arbitrarily specific turing complete language.

This is what I think it should be (link is a comment in the same thread): https://news.ycombinator.com/item?id=33533321

Re:Lisp as the Maxwell’s Equations of Software by mejutoco on Wednesday November 09, 2022 @11:40AM (#33534128)
I find Lambda calculus and term rewriting much more elegant and easy to understand. I don't think there is a simpler Turing-complete language (maybe Game of Life?).

For Turing machines I recommend the book "The annotated Turing".

Re:Lisp as the Maxwell’s Equations of Software by deltasevennine on Wednesday November 09, 2022 @12:20PM (#33534775)
Well if game of life is simpler, why not game of life?

What does it mean to be Maxwells Equations? Does it mean absolutely most fundamental? Most practical? What?

Maybe there's something more fundamental then turing. Thanks for the book recommendation

Re:Lisp as the Maxwell’s Equations of Software by d0mine on Wednesday November 09, 2022 @02:39PM (#33536786)
> What does it mean to be Maxwells Equations?

In a word: elegant.

Re:Lisp as the Maxwell’s Equations of Software by sfpotter on Wednesday November 09, 2022 @03:23PM (#33537317)
It means much more than just being elegant!

Maxwell’s equations are arguably the most successful existing physical theory. They are incredibly accurate over a huge range of scales. They are used in essentially unaltered form all over modern day engineering and have astonishing predictive power.

On top of this, they are a useful tool without modification! They are the working tool for all electrical engineers. They’re not some lower-level substrate that exists in the background. They are used directly to model and generate other, simpler approximate theories (such as geometric and physical optics) which are powerful and elegant in their own right.

I don’t think Lisp, lambda calculus, Turing machines, or similar can make this kind of claim.

Re:Lisp as the Maxwell’s Equations of Software by kragen on Wednesday November 09, 2022 @05:59PM (#33539379)
what it means to say maxwell's equations have 'predictive power' is that we can

1. take a situation observed or designed in the contingent universe,

2. translate it into the abstract entities maxwell's equations talk about,

3. deduce consequences in the world of abstract entities,

4. translate those consequences back into the contingent universe, and then

5. find that the consequences in the contingent universe are within narrow uncertainty bounds we translated from the abstract world of ideas

the meaning of turing universality is precisely that any turing-complete programmable system can be used to model any other logical or mathematical system, including other turing-complete systems, in exactly the same way that maxwell's equations model electromagnetism

for example, you can model risc-v execution in lisp and predict what a risc-v processor will do, you can model lisp execution in the λ-calculus and predict what a lisp interpreter will do, you can model the λ-calculus in a turing machine and predict what λ-reduction will do, and you can model a turing machine in a risc-v processor and predict what the turing machine will do

there is a significant sense in which this sort of modeling is much more perfect than the kind done with maxwell's equations

when we apply maxwell's equations, we are subject to measurement error in steps 1 and 5; our measurements are never complete and correct, and heisenberg's uncertainty principle strongly suggests that they never can be. and in step 3, because maxwell's equations are continuous-time continuous-space differential equations, we often also introduce numerical error in our calculations as well, because we usually have to integrate them numerically rather than algebraically

on the other hand, in the case of computational universality all the entities being discussed are discrete, algebraic, mathematically abstract entities, so our simulations are absolutely perfect unless we run out of memory or suffer a rare hardware error

obviously these universal machines are not limited to modeling other universal machines; we can also use lisp or turing machines or risc-v processors to model things like gravitation, taxation, or maxwell's equations. and they are obviously also the main working tool for all electrical engineers today, having displaced slide rules and load lines generations ago

ultimately, though, we are also using maxwell's equations (and other equations describing electromagnetism, like the ebers-moll transistor model) to design our electronic computers which we use to simulate lisp

Re:Lisp as the Maxwell’s Equations of Software by sfpotter on Wednesday November 09, 2022 @07:42PM (#33540544)
I think you're confused about the premise of this discussion. The comparison is not between Maxwell's equations and lambda calculus, it's between lambda calculus and other theoretical constructs in CS.

Maxwell's equations are "the Maxwell's equations" of physics because they are "the most successful" physical theory: i.e., incredible accuracy, wide applicability, and concision. This is relative to other physical theories. (I guess you could debate whether this is actually the case---obviously this is all subjective, and not everyone agrees. Maybe someone thinks Einstein's field equations should really be "the Maxwell's equations" of physics.)

To say that the lambda calculus or anything else are "the Maxwell's equations" of computer science is to say that they have the same set of properties relative to other let's theoretical constructs in computer science. But is this actually the case? It seems like Turing machines, lambda calculus, etc. are all similar in terms of relative modeling utility and concision. I disagree that they are widely applicable---in practice, just about any commonly used programming language is far more widely applicable than anything of these. And as you pointed out, by Turing universality, they're all logically equivalent---so the question of difference in modeling "power" is not relevant here.

I guess I just don't think it makes much sense to talk about anything in CS being "the Maxwell's equations" of CS. In physics, a wide variety of disparate physical phenomena are being modeled, with individual models having a quite varied range of power and applicability. In CS, things are much different.

Incidentally, even if you simulate Maxwell's equations on a computer using Lisp, a Turing machine, or whatever else, you will not go far if you insist on algebraically exact computations. :-) As you say yourself, you must integrate them numerically, which means numerical error introduced through your discretization. But I honestly can't say I understand your point including this information above.

Re:Lisp as the Maxwell’s Equations of Software by kragen on Wednesday November 09, 2022 @07:54PM (#33540658)
there are lots of equivalent formulations of maxwell's equations (cf. https://en.wikipedia.org/wiki/Mathematical_descriptions_of_t... for a few); the ∇× ∇· one we most commonly use is quite a bit more compact and usable than maxwell's own formulation because vector calculus was, to a significant degree, invented to systematize maxwell's equations. there's apparently an even more compact form of them in terms of clifford algebras that i don't understand yet, \left(\frac{1}{c} \dfrac{\partial}{\partial t} + \boldsymbol\nabla \right) \mathbf F = \mu_0 c (c \rho - \mathbf J).

similarly there are lots of equivalent formulations of universal computation. lisp and the λ-calculus are analogous to the geometric-algebra formulation above and the more commonly used form in terms of vector field derivatives: they look very different, and they make different problems easy, but ultimately they all model the same thing, just like the various formulations of maxwell's equations

maxwell's equations are the maxwell's equations of classical electrodynamics, not of physics. without a lot of extra assumptions they won't get you very far in understanding why solid things are solid (which depends on the pauli exclusion principle) or why some nuclei break down or how transistors work or how stars can burn or why mercury's orbit precesses or why hot things go from red to orange to yellow when you heat them further

my point about modeling maxwell's equations in lisp (etc.) is that lisp (etc.) can model maxwell's equations (at least, as well as anything else we know of can model them), so if we're looking for incredible accuracy, wide applicability, and concision, lisp (etc.) would seem to trump maxwell's equations — but good luck trying to build a computer without electromagnetism, maybe you can in some sense do it on a neutron star but not with atoms

Re:Lisp as the Maxwell’s Equations of Software by earleybird on Wednesday November 09, 2022 @06:02PM (#33539427)
The lambda calculus is useful without modification. It can also be used to model other simpler languages or logics which are power and elegant in their own right.

So, yes, since I've used the lc in these ways I believe the same claim can be made regarding the lambda calculus.

Re:Lisp as the Maxwell’s Equations of Software by deltasevennine on Wednesday November 09, 2022 @04:02PM (#33537781)
elegance is a human attribute. Opinionated and open to interpretation. So Maxwells equations are an opinionated choice? I don't think so.
Re:Lisp as the Maxwell’s Equations of Software by tromp on Wednesday November 09, 2022 @11:16AM (#33533735)
Because Turing machines are so cumbersome compared to lambda calculus that a universal Turing machine takes thousands of bits [1].

[1] http://www.verostko.com/tur-doc.html#B0,%20Universal%20Turin...

Re:Lisp as the Maxwell’s Equations of Software by solomatov on Wednesday November 09, 2022 @12:01PM (#33534477)
I would change it a bit. Lambda calculus (in Martin-Lof type theory) are Maxwell equations of logic. But, lambda calculus has very little real use in programming. There should be something else here.
Re:Lisp as the Maxwell’s Equations of Software by justinhj on Wednesday November 09, 2022 @12:12PM (#33534654)
The Curry-Howard correspondence suggests the analogy of computation with lambda calculus and logical proof systems. As a non-expert it seems that same analogy extends roughly to lambda calculus and a lisp system
Re:Lisp as the Maxwell’s Equations of Software by voxl on Wednesday November 09, 2022 @12:29PM (#33534914)
The Curry-Howard Correspondence is about proof systems. You would have a very hard time finding a proof theorist that says it's okay to have an undecidable proof checker or an inconsistent one.

For that reason, only _typed_ lambda calculi have any hope of corresponding to a proof system. You could rephrase Lisp as a Unityped system, but I seriously doubt it would be consistent.

Perhaps a para-consistent logic might work, but we're getting very exotic here.

Re:Lisp as the Maxwell’s Equations of Software by justinhj on Wednesday November 09, 2022 @02:41PM (#33536817)
Interesting, thanks
Re:Lisp as the Maxwell’s Equations of Software by hither_shores on Wednesday November 09, 2022 @05:06PM (#33538639)
> You could rephrase Lisp as a Unityped system, but I seriously doubt it would be consistent.

It's not. (x -> x) is always inhabited, so if you have a fixed point combinator (x -> x) -> x then every theorem is true.

Re:Lisp as the Maxwell’s Equations of Software by thrown_22 on Wednesday November 09, 2022 @03:25PM (#33537347)
>So I had the idea to explore the lambda-calculus using s-expressions and patiently rebuilt booleans, pairs, lists, recursion and beyond a real complete Turing language, for instance:

Syntax is not semantics.

The only thing that s-expressions do that is mathematically interesting is make the abstract syntax tree of expressions explicit in a way that standard notation does not. The whole point of them is that they make string rewriting into tree rewriting which is vastly easier and lets you write your own DSLs a breeze.

From a practical point of view they are also the simplest way to serialize any expression which is why I can type them out in a text only comment as they are. Meanwhile doing the same with a math (or lambda calculus) expression requires a type setting system like latex to be understandable.

Lisp has decided that application is nameless in its syntax which means that things like ((lambda (x) (+ x 1)) 2) work when semantically they mean (apply (lambda (x) (+ x 1)) 2). This makes programming with multivariable functions very clean but partial application incredibly messy, e.g. ((((lambda (x) (lambda (y) (lambda (z) (+ x y z)))) 1) 2) 3). This is not something that can be fixed because the ABS of partial application when thought of as a tree is indeed very messy. The only reason why it works in languages like Haskell as well as it does is that as long as you only have single variable function - goodbye thunks and multivariable functions - you can treat the partial application trees as a list instead.

You can of course do the same in lisp using a DSL:

    '(partial
      ((lambda (x)) (lambda (y)) (lambda (z)) (lambda (w) (+ x y z w)))
      (1 2 3 4))
But it doesn't fit very well with the rest of the language and feel quite pointless.
Re:Lisp as the Maxwell’s Equations of Software by martyalain on Wednesday November 09, 2022 @04:57PM (#33538513)
@thrown: This makes programming with multivariable functions very clean but partial application incredibly messy

In lambdatalk the implementation of lambdas does not make them closures (no free variables) but is such that they accept de facto partial application and a number of values higher than the number of arguments. This compensates for the lack of closure. So for instance:

((lambda (x)) (lambda (y)) (lambda (z)) (lambda (w) (+ x y z w))) (1 2 3 4))

is written this way

{{{{{lambda {x y z w} {+ x y z w}} 1} 2} 3} 4} -> 10

and obviously

{{lambda {x y z w} {+ x y z w}} 1 2 3 4} -> 10

Re:Lisp as the Maxwell’s Equations of Software by martyalain on Wednesday November 09, 2022 @11:13PM (#33542114)
About "We just need to make the syntax a little more human", see for instance http://lambdaway.free.fr/lambdawalks/?view=sierpinsky4