Strong Preservation as Completeness in Abstract Interpretation
No abstract available.
Related papers
- An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation TACAS 2005
- Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation VMCAI 2006
- A fine-grained computational interpretation of Girard's intuitionistic proof-nets POPL 2022
- Extending a lambda-Calculus with Explicit Substitution which Preserves Strong Normalisation Into a Confluent Calculus on Open Terms JFP 1997
- The Virtual Recency Abstraction: Strong Updates for Abstract Interpreters with Shared State ECOOP 2026
- Compiling with Abstract Interpretation PLDI 2024
- An abstract interpretation framework for refactoring with application to extract methods with contracts OOPSLA 2012
- lambda-nu, A Calculus of Explicit Substitutions which Preserves Strong Normalisation JFP 1996