The following pages link to (Q2704328):
Displayed 38 items.
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Full abstraction for Reduced ML (Q388212) (← links)
- A relational realizability model for higher-order stateful ADTs (Q444500) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (Q478400) (← links)
- Functions with local state: regularity and undecidability (Q557802) (← links)
- A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation (Q615949) (← links)
- Call-by-push-value: Decomposing call-by-value and call-by-name (Q857915) (← links)
- Local variable scoping and Kleene algebra with tests (Q929964) (← links)
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- The lambda-context calculus (extended version) (Q1044184) (← links)
- Algorithmic games for full ground references (Q1650867) (← links)
- Proving correctness of a compiler using step-indexed logical relations (Q1744423) (← links)
- A theory of bisimulation for a fragment of concurrent ML with local names (Q1882896) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Complete trace models of state and control (Q2233464) (← links)
- On a monadic semantics for freshness (Q2566026) (← links)
- Genericity and the \(\pi\)-calculus (Q2576663) (← links)
- Program equivalence in an untyped, call-by-value functional language with uncurried functions (Q2693299) (← links)
- ML and Extended Branching VASS (Q2988645) (← links)
- Algorithmic Nominal Game Semantics (Q3000592) (← links)
- A Fragment of ML Decidable by Visibly Pushdown Automata (Q3012916) (← links)
- A Nominal Relational Model for Local Store (Q3178267) (← links)
- New (Q3178271) (← links)
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
- A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators (Q3540185) (← links)
- Full Abstraction for Reduced ML (Q3617719) (← links)
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References (Q3644766) (← links)
- (Q4603450) (← links)
- Proof-Relevant Logical Relations for Name Generation (Q4637685) (← links)
- Gradual type theory (Q5019016) (← links)
- (Q5155670) (← links)
- Hard Life with Weak Binders (Q5170666) (← links)
- (Q5377471) (← links)
- Capsules and Closures (Q5739358) (← links)
- From Applicative to Environmental Bisimulation (Q5739359) (← links)
- Semantic preservation for a type directed translation scheme of Featherweight Go (Q6109210) (← links)