Pure type systems and generalized grounding.
In this paper, I present several philosophical applications of pure type systems. As I explain, many pure type systems are more expressively powerful than the higher-order languages—like the simply typed lambda calculus—on which philosophers have focused. Consequently, pure type systems support the...
| Publicado en: | Philosophical Studies Vol. 183; no. 9; pp. 2603 - 2632 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Springer Nature
Sep2026
|
| Acceso en línea: | Ver este registro en EBSCOhost |