Formal P-Category Theory and Normalization by Evaluation in Rocq

TL;DR

This paper formalizes P-category theory in Rocq, extending previous work to include a categorical proof of strong completeness and applying it to normalization by evaluation algorithms for simply typed lambda calculus.

Contribution

It introduces a formalization of P-category theory in Rocq, including a categorical proof of strong completeness and a novel universal property of lambda calculus syntax.

Findings

Formalization of P-category theory in Rocq.

Categorical proof of strong completeness property.

Extraction of normalization programs with derivations.

Abstract

Traditional category theory is typically based on set-theoretic principles and ideas, which are often non-constructive. An alternative approach to formalizing category theory is to use E-category theory, where hom sets become setoids. Our work reconsiders a third approach - P-category theory - from \v{C}ubri\'c et al. (1998) emphasizing a computational standpoint. We formalize in Rocq a modest library of P-category theory - where homs become subsetoids - and apply it to formalizing algorithms for normalization by evaluation which are purely categorical but, surprisingly, do not use neutral and normal terms. \v{C}ubri\'c et al. (1998) establish only a soundness correctness property by categorical means; here, we extend their work by providing a categorical proof also for a strong completeness property. For this we formalize the full universal property of the free Cartesian-closed category, which is not known to have been performed before. We further formalize a novel universal property of unquotiented simply typed lambda-calculus syntax and apply this to a proof of correctness of a categorical normalization by evaluation algorithm. We pair the overall mathematical development with a formalization in the Rocq proof assistant, following the principle that the formalization exists for practical computation. Indeed, it permits extraction of synthesized normalization programs that compute (long) beta-eta-normal forms of simply typed lambda-terms together with a derivation of beta-eta-conversion.