News for hackers. Stuff that matters.
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.