Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy
Abstract elided by the publisher.
Related papers
- Algorithms with polynomial interpretation termination proof JFP 2001
- "Sometimes" and "Not Never" Revisited: On Branching Versus Linear Time POPL 1983
- Relating complexity and precision in control flow analysis ICFP 2007
- Algorithmic Aspects of Type Inference with Subtypes POPL 1992
- From Exponential to Polynomial-Time Security Typing via Principal Types ESOP 2011
- EREQ: Regular Expressions with Quantifiers and Incremental Quantifier Elimination PLDI 2026
- Model checking of hierarchical state machines TOPLAS 2001
- Fast Polynomial Evaluation for Correctly Rounded Elementary Functions using the RLIBM Approach CGO 2023