I've been looking at some of the papers working on Directed HoTT (the idea being that types are (∞,∞)-categories rather than mere ∞-groupoids) and to me it seems like there are two main obstacles:
(1) Many natural constructions are not functors. In particular the equality type itself. If C is a mere category and we have an isomorphism i:(a=b) and a morphism f:b -> c we can't compose i and f to get an element of type (a=c). Indeed a and c need not be isomorphic. So we can't view (a=b) as a dependent type over C. This problem doesn't arise in undirected HoTT because constructions which aren't functorial still respect equivalence. The existing treatments of Directed HoTT face this issue by introducing a constructor that for each type C gives you a type C^core corresponding to its underlying groupoid. To me this seems not in the spirit of Directed HoTT; it's just retreating back to the safety of undirected HoTT as soon as things get tough.
(2) If C is a type in undirected HoTT we get a nice correspondence between spaces B -> C over C and functors C -> U. In particular given a dependent type we can form its Σ-type to get a type over C and given a type over C we can look at its fibers to get a dependent type, and these processes are inverses. This appears not to work in Directed HoTT. If we let U be the category of categories then given a functor C -> U we can use the Grothendieck construction to get a category over C, but not every category over C arises in this way - only the fibrations.
I believe there may be a way to fix both these problems by using profunctors instead of functors.
This would be based on the fact that categories B -> C over a given category C are in correspondence with normal lax functors C -> Prof, where Prof is the 2-category of categories and profunctors. (See here:
https://mathoverflow.net/a/245743/4613)
So my idea would be to make a Directed HoTT in which the type B -> C is still viewed as the (normal lax) functors from B to C, but dependent types are thought of as being lax functors C -> U where we're now thinking of the morphisms in U as being profunctors rather than functors. (In other words the Directed Univalence Axiom would say Hom_U(B,C) ≈ Prof(B,C).)
This immediately fixes obstacle (2) be design, and in fact it also fixes obstacle (1). A morphism f:b -> c does induce a profunctor (a=b) -> (a=c), so we can now think of (a=b) as a dependent type.
Could this idea be useful? Is anyone working on ideas like this?
(It seems that lax functors defined on higher categories fail to respect the principle of equivalence (
https://golem.ph.utexas.edu/category/2009/12/the_problem_with_lax_functors.html), but that they are well defined between *double* categories. So perhaps what we would really want is for types to be ∞-tuple catgories, and for each direction of morphism in U to be the appropriate kind of profunctor. This would fit well with the fact that a classic example of a double category is that of profunctors and functors.)