scientific article; zbMATH DE number 4123722
From MaRDI portal
Publication:4204146
zbMath0686.03030MaRDI QIDQ4204146
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Logarithmic space and permutations, Computation by interaction for space-bounded functional programming, Partial traces on additive categories, On the \(\pi\)-calculus and linear logic, Parsimonious Types and Non-uniform Computation, δο!∈=1 Optimizing optimal λ-calculus implementations, Bialgebras in Rel, A Representation Theorem for Unique Decomposition Categories, Petri nets, Horn programs, linear logic and vector games, Interaction graphs: graphings, Semantics of higher-order quantum computation via geometry of interaction, The geometry of Bayesian programming, Unnamed Item, Causality and true concurrency: A data-flow analysis of the Pi-Calculus, Interaction graphs: additives, Retracing some paths in process algebra, Abstract machines, optimal reduction, and streams, Partially traced categories, A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces, Promonads and String Diagrams for Effectful Categories, A correspondence between maximal abelian sub-algebras and linear logic fragments, Attribute Grammars and Categorical Semantics, Unnamed Item, Unnamed Item, Unnamed Item, Parametric \(\lambda \)-theories, Logic and Geometry of Agents in Agent-Based Modeling, Verificationism and Classical Realizability, Bounded linear logic: A modular approach to polynomial-time computability, Codensity Lifting of Monads and its Dual, Machine semantics, Quantum circuit oracles for abstract machine computations, Proofs as Polynomials, Preface to the special volume, Geometry of interaction. V: Logic in the hyperfinite factor, Towards a geometry of recursion, Linearizing intuitionistic implication, Asymptotic cyclic expansion and bridge groups of formal proofs, Interaction graphs: multiplicatives, Unnamed Item, Unnamed Item, Unnamed Item, On geometry of interaction for polarized linear logic, Rule-Following and the Limits of Formalization: Wittgenstein’s Considerations Through the Lens of Logic, A game-semantic model of computation, Is the Optimal Implementation Inefficient? Elementarily Not, A MALL geometry of interaction based on indexed linear logic, Feedback for linearly distributive categories: Traces and fixpoints, A short note on coherence and self-similarity, Games and full abstraction for FPC., Full abstraction for PCF, A structural approach to reversible computation, Event Domains, Stable Functions and Proof-Nets, Conformal Field Theory as a Nuclear Functor, Handshake Games, Transcendental syntax I: deterministic case, A categorical model for the geometry of interaction
