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 32 items.
- Infinitary affine proofs (Q5268998) (← links)
- (Q5382449) (← links)
- Global State Considered Helpful (Q5415641) (← links)
- On Natural Non-dcpo Domains (Q5452201) (← links)
- On-the-Fly Techniques for Game-Based Software Model Checking (Q5458322) (← links)
- A Theory for Game Theories (Q5458834) (← links)
- Computing with Functionals—Computability Theory or Computer Science? (Q5479568) (← links)
- Denotational Semantics with Nominal Scott Domains (Q5501931) (← links)
- Towards Ludics Programming: Interactive Proof Search (Q5504660) (← links)
- On the reification of semantic linearity (Q5741580) (← links)
- Epistemic Strategies and Games on Concurrent Processes (Q5901384) (← links)
- An Explicit Framework for Interaction Nets (Q5902126) (← links)
- A fully abstract denotational semantics for the calculus of higher-order communicating systems (Q5940933) (← links)
- Innocent game models of untyped \(\lambda\)-calculus (Q5958298) (← links)
- Finitary PCF is not decidable (Q5958762) (← links)
- Free \(\mu\)-lattices (Q5960406) (← links)
- Smart Choices and the Selection Monad (Q6135751) (← links)
- Arboreal Categories: An Axiomatic Theory of Resources (Q6135784) (← links)
- Game semantics of Martin-Löf type theory (Q6190409) (← links)
- Make flows small again: revisiting the flow framework (Q6535380) (← links)
- Canonicity of proofs in constructive modal logic (Q6541161) (← links)
- Zeta functions and the (linear) logic of Markov processes (Q6597969) (← links)
- The far side of the cube. An elementary introduction to game semantics (Q6612782) (← links)
- An axiomatic account of a fully abstract game semantics for general references (Q6612783) (← links)
- Deconstructing general references via game semantics (Q6612784) (← links)
- A tale of additives and concurrency in game semantics (Q6612786) (← links)
- The game semantics of game theory (Q6612787) (← links)
- On strictifying extensional reflexivity in compact closed categories (Q6612801) (← links)
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers (Q6612803) (← links)
- (Towards a) statistical probabilistic lazy lambda calculus (Q6612804) (← links)
- Disentangling parallelism and interference in game semantics (Q6635506) (← links)
- Concrete categories and higher-order recursion. With applications including probability, differentiability, and full abstraction (Q6649494) (← links)
