Unique decomposition categories, Geometry of Interaction and combinatory logic

Authors:
Esfandiar Haghverdi
Affiliations:
Department of Mathematics, University of Ottawa, 585 King Edward St., Ottawa, ON, K1N 6N5, Canada. Email ehaghver@mathstat.uottawa.ca
Venue:
Mathematical Structures in Computer Science
Year:
2000

Citing 9
Cited 8

Algebraic approaches to program semantics

Algebraic approaches to program semantics
Linear logic

Theoretical Computer Science
Notions of computation and monads

Information and Computation
The geometry of optimal lambda reduction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
New foundations for the geometry of interaction

Information and Computation
Geometry of interaction III: accommodating the additives

Proceedings of the workshop on Advances in linear logic
Parallel beta reduction is not elementary recursive

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Geometry of interaction 2: deadlock-free algorithms

COLOG '88 Proceedings of the International Conference on Computer Logic
Retracting Some Paths in Process Algebra

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory

Geometry of Interaction and linear combinatory algebras

Mathematical Structures in Computer Science
A categorical model for the geometry of interaction

Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Proofs as Polynomials

Electronic Notes in Theoretical Computer Science (ENTCS)
From Geometry of Interaction to Denotational Semantics

Electronic Notes in Theoretical Computer Science (ENTCS)
Partially additive categories and fully complete models of linear logic

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
From Coalgebraic to Monoidal Traces

Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a typed geometry of interaction

Mathematical Structures in Computer Science
Towards a typed geometry of interaction

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

In another paper (Abramsky et al. 1999), we have developed Abramsky's analysis of Girard's Geometry of Interaction programme in detail. In this paper, our goal is to study the data ow based computational aspects of that analysis. We introduce unique decomposition categories that provide a suitable categorical framework for such computational analysis. The current study also serves to establish connections with the work on proof nets and paths by Girard and Danos and Regnier in this categorical setting. The latter goal is partially achieved here by the presentation of categorical models for dynamic algebras.