This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science
Girard's Paradox redirects here. It's arguably one of the central problems in programming language design (everyone from the CS side intuits that TYPE : TYPE, but this paradox seems to tell us we can't have this, not, at least, without being very clever elsewhere). But the only example on this page is utterly innocuous: that you can iterate the identity function (the only function in T->T that has to exist) on an element of an inhabited type is the minimal example of what you _do_ want, not an elucidation of the difficulty posed by the paradox. Sadly, I'm not a logician and I came to find an understanding I don't yet have, but minimally could we unlink Girard's Paradox from this page so someone would be motivated to present it? StephenPSpackman (talk) 16:38, 2 June 2025 (UTC)[reply]
