An Abstract Domain to Infer Ordinal-Valued Ranking Functions
Abstract elided by the publisher.
Related papers
- The Abstract Domain of Segmented Ranking Functions SAS 2013
- An Abstract Domain to Infer Octagonal Constraints with Absolute Value SAS 2014
- Static Inference of Properties of Applicative Programs POPL 1984
- Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML ICFP 1999
- Practical type inference for arbitrary-rank types JFP 2007
- Lifted termination analysis by abstract interpretation and its applications GPCE 2021
- AUTOMAP: Inferring Rank-Polymorphic Function Applications with Integer Linear Programming OOPSLA 2024
- Simple, partial type-inference for System F based on type-containment ICFP 2005