Theoretical Computer Science
Proof-nets and the Hilbert space
Proceedings of the workshop on Advances in linear logic
Information and Computation
Geometry of interaction 2: deadlock-free algorithms
COLOG '88 Proceedings of the International Conference on Computer Logic
Phase semantics for light linear logic
Theoretical Computer Science - Linear logic
Stratified coherence spaces: a denotational semantics for light linear logic
Theoretical Computer Science - Implicit computational complexity
Quantitative Game Semantics for Linear Logic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The geometry of linear higher-order recursion
ACM Transactions on Computational Logic (TOCL)
Light types for polynomial time computation in lambda calculus
Information and Computation
Context semantics, linear logic, and computational complexity
ACM Transactions on Computational Logic (TOCL)
Towards a typed geometry of interaction
Mathematical Structures in Computer Science
Light logics and optimal reduction: Completeness and complexity
Information and Computation
A modified GoI interpretation for a linear functional programming language and its adequacy
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Towards a typed geometry of interaction
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Elementary linear logic revisited for polynomial time and an exponential time hierarchy
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
| Hi-index | 0.00 |
We introduce a geometry of interaction model given by an algebra of clauses equipped with resolution (following [10]) into which proofs of Elementary Linear Logic can be interpreted. In order to extend geometry of interaction computation (the so called execution formula) to a wider class of programs in the algebra than just those coming from proofs, we define a variant of execution (called weak execution). Its application to any program of clauses is shown to terminate with a bound on the number of steps which is elementary in the size of the program. We establish that weak execution coincides with standard execution on programs coming from proofs.