State-dependent representation independence
DOI10.1145/1480881.1480925zbMATH Open1315.68080OpenAlexW2100559921WikidataQ60142689 ScholiaQ60142689MaRDI QIDQ5261531FDOQ5261531
Authors: Amal Ahmed, Derek Dreyer, Andreas Rossberg 
Publication date: 3 July 2015
Published in: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.413.3977
Recommendations
abstract data typeslocal stateexistential typesrepresentation independencestep-indexed logical relations
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Abstract data types; algebraic specification (68Q65)
Cited In (35)
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
- Automata-theoretic semantics of idealized Algol with passive expressions
- Title not available (Why is that?)
- Complete trace models of state and control
- Refactoring and representation independence for class hierarchies
- Algorithmic nominal game semantics
- A Kripke logical relation for effect-based program transformations
- Signature restriction for polymorphic algebraic effects
- Universal properties for universal types in bifibrational parametricity
- A relational realizability model for higher-order stateful ADTs
- Observational program calculi and the correctness of translations
- The category-theoretic solution of recursive metric-space equations
- Title not available (Why is that?)
- Transfinite Step-Indexing: Decoupling Concrete and Logical Steps
- Algorithmic games for full ground references
- Program equivalence in a simple language with state
- A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation
- Bifibrational functorial semantics of parametric polymorphism
- Title not available (Why is that?)
- Parametric Polymorphism — Universally
- State dependent choice
- Contextual Approximation and Higher-Order Procedures
- Finite-state independence
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State
- Holistic Specifications for Robust Programs
- New
- Time Bounds for General Function Pointers
- A language-independent proof system for full program equivalence
- A fragment of ML decidable by visibly pushdown automata
- Noninterference in a predicative polymorphic calculus for access control
- GADTs, functoriality, parametricity: pick two
- Modal crash types for intermittent computing
- From bounded checking to verification of equivalence via symbolic up-to techniques
- Relational cost analysis in a functional-imperative setting
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
This page was built for publication: State-dependent representation independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261531)
