For any pure type system, if every legal expression in every valid context has a terminating β-reduction sequence, then every β-reduction sequence from every such expression terminates, including reductions inside type annotations.
For any pure type system, if every legal expression in every valid context has a terminating β-reduction sequence, then every β-reduction sequence from every such expression terminates, including reductions inside type annotations.
For any pure type system, if every legal expression in every valid context has a terminating β-reduction sequence, then every β-reduction sequence from every such expression terminates, including reductions inside type annotations.
If correct, resolves the β instance of the Barendregt–Geuvers–Klop normalization conjecture for arbitrary pure type systems.
Does system-wide weak β-normalization imply strong β-normalization for pure type systems?
Publication dates and editorial changes.
OpenAI reports weak-to-strong normalization for pure type systems
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
