Pages that link to "Item:Q1854393"
From MaRDI portal
The following pages link to On full abstraction for PCF: I, II and III (Q1854393):
Displaying 50 items.
- Games and full abstraction for FPC. (Q1854351) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Comparing hierarchies of types in models of linear logic (Q1881220) (← links)
- Games characterizing Levy-Longo trees (Q1884875) (← links)
- Adapting innocent game models for the Böhm tree \(\lambda\)-theory (Q1884886) (← links)
- Polarized games (Q1886321) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Deterministic concurrent strategies (Q1941878) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Continuous probability distributions in concurrent games (Q2134837) (← links)
- Game semantics for constructive modal logic (Q2142094) (← links)
- A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus (Q2200839) (← links)
- Weighted models for higher-order computation (Q2216134) (← links)
- Complete trace models of state and control (Q2233464) (← links)
- Bayesian strategies: probabilistic programs as generalised graphical models (Q2233478) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- Combinatorial structure of type dependency (Q2254771) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- Program equivalence in linear contexts (Q2346993) (← links)
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency (Q2350494) (← links)
- Characteristic bisimulation for higher-order session processes (Q2357655) (← links)
- Modular strategies for recursive game graphs (Q2368953) (← links)
- Game semantics approach to higher-order complexity (Q2396718) (← links)
- Latent semantic analysis of game models using LSTM (Q2423769) (← links)
- Third-order Idealized Algol with iteration is decidable (Q2474055) (← links)
- Angelic semantics of fine-grained concurrency (Q2474441) (← links)
- Second-order type isomorphisms through game semantics (Q2474443) (← links)
- A game semantics of names and pointers (Q2474444) (← links)
- Infinite trace equivalence (Q2474445) (← links)
- Decidability and syntactic control of interference (Q2481977) (← links)
- A stable programming language (Q2492185) (← links)
- Asynchronous games. II: The true concurrency of innocence (Q2503039) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- Syntax vs. semantics: A polarized approach (Q2570132) (← links)
- Games for complexity of second-order call-by-name programs (Q2570133) (← links)
- Sequential algorithms and strongly stable functions (Q2570134) (← links)
- Genericity and the \(\pi\)-calculus (Q2576663) (← links)
- Classical By-Need (Q2802497) (← links)
- Game semantics for access control (Q2805155) (← links)
- An algebraic account of references in game semantics (Q2805167) (← links)
- From parity games to circular proofs (Q2842563) (← links)
- A categorical semantics of higher order store (Q2842823) (← links)
- Adjunction models for call-by-push-value with stacks (Q2842825) (← links)
- Processes and games (Q2851048) (← links)
- Definability and full abstraction (Q2864154) (← links)
- A quantum game semantics for the measurement calculus (Q2870204) (← links)
- Probabilistic \(\pi\)-calculus and event structures (Q2870289) (← links)
- A Semantical Approach to Equilibria and Rationality (Q2888496) (← links)
- Continuity in Semantic Theories of Programming (Q2963952) (← links)
- Aristotle on Universal Quantification: A Study from the Point of View of Game Semantics (Q2963961) (← links)
