Pages that link to "Item:Q5261531"
From MaRDI portal
The following pages link to State-dependent representation independence (Q5261531):
Displaying 34 items.
- Automata-theoretic semantics of idealized Algol with passive expressions (Q265826) (← links)
- Refactoring and representation independence for class hierarchies (Q428866) (← links)
- A relational realizability model for higher-order stateful ADTs (Q444500) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- A language-independent proof system for full program equivalence (Q510898) (← links)
- The category-theoretic solution of recursive metric-space equations (Q604478) (← links)
- A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation (Q615949) (← links)
- State dependent choice (Q892843) (← links)
- Algorithmic games for full ground references (Q1650867) (← links)
- Finite-state independence (Q1787949) (← links)
- Complete trace models of state and control (Q2233464) (← links)
- Noninterference in a predicative polymorphic calculus for access control (Q2339144) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- A Kripke logical relation for effect-based program transformations (Q2629855) (← links)
- Transfinite Step-Indexing: Decoupling Concrete and Logical Steps (Q2802498) (← links)
- Contextual Approximation and Higher-Order Procedures (Q2811338) (← links)
- Parametric Polymorphism — Universally (Q2947462) (← links)
- Algorithmic Nominal Game Semantics (Q3000592) (← links)
- A Fragment of ML Decidable by Visibly Pushdown Automata (Q3012916) (← links)
- New (Q3178271) (← links)
- Time Bounds for General Function Pointers (Q3178280) (← links)
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types (Q3617747) (← links)
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References (Q3644766) (← links)
- (Q4603450) (← links)
- Relational cost analysis in a functional-imperative setting (Q5020903) (← links)
- Holistic Specifications for Robust Programs (Q5039542) (← links)
- (Q5155670) (← links)
- Universal properties for universal types in bifibrational parametricity (Q5377699) (← links)
- Bifibrational functorial semantics of parametric polymorphism (Q5971398) (← links)
- Modal crash types for intermittent computing (Q6535235) (← links)
- From bounded checking to verification of equivalence via symbolic up-to techniques (Q6535615) (← links)
- Signature restriction for polymorphic algebraic effects (Q6594243) (← links)
- GADTs, functoriality, parametricity: pick two (Q6661153) (← links)