AIType: Type and the dispute over non-termination
A user argues that Type: Type does not imply non-termination, citing an affine lambda calculus that cannot duplicate data. They say they wrote a Lean proof to back the claim.
TLDR
A user disputes an r/haskell commenter’s claim that Type: Type leads to non-termination—computation that never finishes. Their argument is that an affine lambda calculus cannot duplicate data, so its size decreases until it terminates. They say they spent weeks writing a Lean proof after being challenged to prove that a consistent type system with Type: Type is possible.
Combined views
8.9K
1 Source, first seen 7h ago
Type: Type and the dispute over non-termination
A user argues that Type: Type does not imply non-termination, citing an affine lambda calculus that cannot duplicate data. They say they wrote a Lean proof to back the claim.