Talk:System U

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Low‑priority 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. Low This article has been rated as Low-priority on the project's priority scale. Computer science Low‑importance 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. Low This article has been rated as Low-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Girard's Paradox

Latest comment: 2 months ago1 comment1 person in discussion

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