The following pages link to (Q3203017):
Displayed 21 items.
- Interaction graphs: graphings (Q345705) (← links)
- Geometry of interaction. V: Logic in the hyperfinite factor (Q534694) (← links)
- Musings around the geometry of interaction, and coherence (Q534708) (← links)
- Towards a geometry of recursion (Q534710) (← links)
- A categorical model for the geometry of interaction (Q817846) (← links)
- Interaction graphs: additives (Q892169) (← links)
- Machine semantics (Q959818) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- On the \(\pi\)-calculus and linear logic (Q1342247) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- On paradoxes in normal form (Q2288281) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- A correspondence between maximal abelian sub-algebras and linear logic fragments (Q4599613) (← links)
- Dynamic game semantics (Q4988428) (← links)
- δο!∈=1 Optimizing optimal λ-calculus implementations (Q5055822) (← links)
- lambda!-calculus, Intersection Types, and Involutions (Q5089015) (← links)
- Abstract machines, optimal reduction, and streams (Q5108536) (← links)
- Proofs as Polynomials (Q5415631) (← links)
- Asymptotic cyclic expansion and bridge groups of formal proofs (Q5945614) (← links)