Directed proof-relevant logical relations in simplicial HoTT
Some intrinsically typed presentations of type theory use equality types in the meta-language to represent object-language judgmental equality. In such equational syntax one can define logical relations by assigning proof-relevant computability predicates to judgmental equivalence classes of types and terms. This approach, however, accounts for judgmental equality but not for reduction, which plays a central role in many logical-relations arguments. This paper develops a directed version of proof-relevant logical relations in simplicial homotopy type theory, a directed type theory with an \emph{inequality} type. In simplicial type theory, we use inequality types to internalize object language reductions and construct object syntax as a directed quotient inductive type. The central observation is that contravariant families in simplicial type theory provide exactly the proof-relevant form of closure under expansion for logical relations: computability evidence can be transported backward along reductions, with the required functoriality and universal property built in. Using this observation, we construct a unary logical relations model with contravariant computability predicates and prove directed Boolean canonicity: every closed Boolean term reduces to either true or false. We then generalize the construction to dependent type formers and universes, where a comonadic flat modality provides the discreteness needed for type conversion and universe predicates. Finally, we extend the method to binary logical relations, separating vertical reduction from horizontal parametricity and obtaining a proof-relevant account of representation independence.