On non-structural subtype entailment

09/06/2021

∙

by   Aleksy Schubert, et al.

∙

0

∙

share

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 since 1996.