scientific article; zbMATH DE number 4179372
From MaRDI portal
Publication:3203017
Recommendations
Cited in
(29)- Bounded linear logic: A modular approach to polynomial-time computability
- On the \(\pi\)-calculus and linear logic
- Full abstraction for PCF
- Petri nets, Horn programs, linear logic and vector games
- On paradoxes in normal form
- A game-semantic model of computation
- A structural approach to reversible computation
- Interaction graphs: graphings
- The geometry of semaphore programs
- scientific article; zbMATH DE number 4123722 (Why is no real title available?)
- A correspondence between maximal abelian sub-algebras and linear logic fragments
- Dynamic game semantics
- δο!∈=1 Optimizing optimal λ-calculus implementations
- lambda!-calculus, Intersection Types, and Involutions
- Abstract machines, optimal reduction, and streams
- On the ``no deadlock criterion: from Herbrand's theorem to \textit{geometry of interaction}
- Geometry of interaction. V: Logic in the hyperfinite factor
- Musings around the geometry of interaction, and coherence
- Towards a geometry of recursion
- Proofs as Polynomials
- Asymptotic cyclic expansion and bridge groups of formal proofs
- Zeta functions and the (linear) logic of Markov processes
- On strictifying extensional reflexivity in compact closed categories
- The frame problem and the semantics of classical proofs
- Principal types as partial involutions
- Two views on unification: terms as strategies
- A categorical model for the geometry of interaction
- Interaction graphs: additives
- Machine semantics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3203017)
