Article ID Journal Published Year Pages File Type
6875633 Theoretical Computer Science 2018 37 Pages PDF
Abstract
We also solve the impredicativity problem in λProlog semantics, namely how to give a definition of truth without appealing to induction on subformula structure. In the last section we give a simple semantics-based conservative extension proof that the language hoHH(C) satisfies a uniformity property along the lines of [39].
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Kripke semantics for higher-order type theory applied to constraint logic programming languages
Authors
, ,