Dice Question Streamline Icon: https://streamlinehq.com

Syntactic model forms a strict LFDC

Prove that the well-typed syntactic fragment of the bidirectional substructural dependent type theory for left-fibred double categories, quotiented by judgmental equality, forms a strict left-fibred double category equipped with type-level weakening, function types, product types, and the corresponding structural properties.

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper presents a bidirectional type theory intended as the internal language of LFDCs, with rules designed to compute semantic denotations. While partial admissibility results for weakening and substitution are proved, the central completeness step—showing that the syntactic fragment itself carries the full strict LFDC structure—remains to be formally established.

This result would close the soundness-completeness loop by demonstrating that the syntax is not only interpretable in strict LFDCs but also itself constitutes such a structure, justifying the use of the type theory as a canonical model and enabling further metatheoretic developments.

References

I leave to future work a full proof that the well typed syntactic fragment of this type theory, quotiented by judgmental equality as defined in Def. \ref{judgmental}, forms a strict LFDC with type-level weakening, function types, products, and the appropriate structural properties.

Foundations of Substructural Dependent Type Theory (2401.15258 - Aberlé, 27 Jan 2024) in Section: Syntactic Completeness