Pages that link to "Item:Q4302352"
From MaRDI portal
The following pages link to Games and full completeness for multiplicative linear logic (Q4302352):
Displaying 22 items.
- A game semantics of names and pointers (Q2474444) (← links)
- Maximality and totality of stable functions in the category of stable bifinite domains (Q2475889) (← links)
- From truth to computability. I. (Q2500484) (← links)
- Syntax vs. semantics: A polarized approach (Q2570132) (← links)
- Sequential algorithms and strongly stable functions (Q2570134) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- Some Programming Languages Suggested by Game Models (Extended Abstract) (Q2805154) (← links)
- Game Semantics for Access Control (Q2805155) (← links)
- Contraction-free Proofs and Finitary Games for Linear Logic (Q2805162) (← links)
- From Parity Games to Circular Proofs (Q2842563) (← links)
- Event Domains, Stable Functions and Proof-Nets (Q2864146) (← links)
- Definability and Full Abstraction (Q2864154) (← links)
- Conway Games, Coalgebraically (Q2888495) (← links)
- Equivalences and Congruences on Infinite Conway Games (Q2889179) (← links)
- Game Semantics and the Manifestation Thesis (Q2908761) (← links)
- Quantum coherent spaces and linear logic (Q2998726) (← links)
- Traces for coalgebraic components (Q3005989) (← links)
- Games for Dependent Types (Q3449463) (← links)
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants (Q4917988) (← links)
- (Q5079748) (← links)
- lambda!-calculus, Intersection Types, and Involutions (Q5089015) (← links)
- Game semantics of Martin-Löf type theory (Q6190409) (← links)
