Pith. sign in

Algorithmic Conversion with Surjective Pairing: A Syntactic and Untyped Ap- proach

“Algorithmic Conversion with Surjective Pairing: A Syntactic, Untyped Approach · Proceedings of the ACM on Programming Languages · DOI 10.1145/3776672

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

fields

cs.LO 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

Definitional Inversion, Without Normalisation

cs.LO · 2026-07-15 · conditional · novelty 8.0

A domain-theoretic logical-relations technique proves injectivity and no-confusion of type constructors for non-normalising dependent type theories with η laws, including type-in-type systems, without relying on normalisation.

citing papers explorer

Showing 1 of 1 citing paper.

  • Definitional Inversion, Without Normalisation cs.LO · 2026-07-15 · conditional · none · ref 27

    A domain-theoretic logical-relations technique proves injectivity and no-confusion of type constructors for non-normalising dependent type theories with η laws, including type-in-type systems, without relying on normalisation.