Advisor(s)
Abstract(s)
Since the observation in 2006 that it is possible to embed IPC into the atomic polymorphic λ-calculus (a predicative fragment of system F with universal instantiations restricted to atomic formulas) different such embeddings appeared in the literature. All of them comprise the Russell-Prawitz translation of formulas, but have different strategies for the translation of proofs. Although these embeddings preserve proof identity, all fail in delivering preservation of reduction steps. In fact, they translate the commuting conversions of IPC to β-equality, or to other kinds of reduction or equality generated by new principles added to system F. The cause for this is the generation of redexes by the translation itself. In this paper, we present an embedding of IPC into atomic system F, still based on the same translation of formulas, but which maps commuting conversions to syntactic identity, while simulating the other kinds of reduction steps present in IPC by βη-reduction. In this sense the translation achieves a truly commuting-conversion-free image of IPC in atomic system F.
Description
Keywords
Pedagogical Context
Citation
José Espírito Santo, Gilda Ferreira, How to avoid the commuting conversions of IPC, Theoretical Computer Science, Volume 1033, 2025, 115101, ISSN 0304-3975, https://doi.org/10.1016/j.tcs.2025.115101.
Publisher
Elsevier BV
