scientific article

zbMath0716.03047MaRDI QIDQ3203017

Jean-Yves Girard

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear logicoperator algebra\(C^ *\)-algebrasaxiomatic theory of algorithms

Mathematics Subject Classification ID

Selfadjoint operator algebras ((C^*)-algebras, von Neumann ((W^*)-) algebras, etc.) (46L99) Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05)

Related Items (23)

On the \(\pi\)-calculus and linear logic ⋮ δο!∈=1 Optimizing optimal λ-calculus implementations ⋮ Petri nets, Horn programs, linear logic and vector games ⋮ Interaction graphs: graphings ⋮ Interaction graphs: additives ⋮ Abstract machines, optimal reduction, and streams ⋮ A correspondence between maximal abelian sub-algebras and linear logic fragments ⋮ Bounded linear logic: A modular approach to polynomial-time computability ⋮ Machine semantics ⋮ Proofs as Polynomials ⋮ Geometry of interaction. V: Logic in the hyperfinite factor ⋮ Musings around the geometry of interaction, and coherence ⋮ Towards a geometry of recursion ⋮ Asymptotic cyclic expansion and bridge groups of formal proofs ⋮ On paradoxes in normal form ⋮ Zeta functions and the (linear) logic of Markov processes ⋮ On strictifying extensional reflexivity in compact closed categories ⋮ lambda!-calculus, Intersection Types, and Involutions ⋮ Dynamic game semantics ⋮ A game-semantic model of computation ⋮ Full abstraction for PCF ⋮ A structural approach to reversible computation ⋮ A categorical model for the geometry of interaction

This page was built for publication: