Complexity of Subtype Satisfiability over Posets
No abstract available.
Related papers
- Verification of Timed Systems Using POSETs CAV 1998
- SparseAuto: An Auto-scheduler for Sparse Tensor Computations using Recursive Loop Nest Restructuring OOPSLA 2024
- Unscanning by Möbius Inversion (Functional Pearl) ICFP 2026
- Lower Bounds on Type Inference with Subtypes POPL 1995
- Parametric polymorphism and semantic subtyping: the logical connection ICFP 2011
- Satisfying Subtype Inequalities in Polynomial Space SAS 1997
- A Logical Approach to Deciding Semantic Subtyping TOPLAS 2015
- Class hierarchy complementation: soundly completing a partial type graph OOPSLA 2013