From Exponential to Polynomial-Time Security Typing via Principal Types
Abstract elided by the publisher.
Related papers
- Deciding ML Typability is Complete for Deterministic Exponential Time POPL 1990
- Run-time principals in information-flow type systems TOPLAS 2007
- Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy APLAS 2011
- Principal Type Schemes for Gradual Programs POPL 2015
- Secure implementations of typed channel abstractions POPL 2007
- Practical SMT-based type error localization ICFP 2015
- Algorithmic Aspects of Type Inference with Subtypes POPL 1992
- How Profilers Can Help Navigate Type Migration OOPSLA 2023