Satisfying Subtype Inequalities in Polynomial Space
No abstract available.
Related papers
- Local Search for Solving Satisfiability of Polynomial Formulas CAV 2023
- Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time SAS 1995
- Lower Bounds on Type Inference with Subtypes POPL 1995
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints VMCAI 2008
- Polynomial invariant generation for non-deterministic recursive programs PLDI 2020
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra POPL 2013
- Efficient Subtyping Tests with PQ-Encoding OOPSLA 2001
- Complexity of Subtype Satisfiability over Posets ESOP 2005