3 citations · 4 across the 7 of their papers we have counts for
1 paper · 2 filters
Aleksy Schubert
We prove that the non-structural subtype entailment problem for finite and regular type expressions is in PSPACE. In this way we close a decidability and complexity gap pending sin…