Additives of linear logic and normalization: part I: A (restricted) Church--Rosser property

Authors:
Lorenzo Tortora de Falco
Affiliations:
Équipe de Logique Mathématique, Université Paris VII, 2 Place Jussieu, 75251 Paris Cedex 05, France
Venue:
Theoretical Computer Science - Linear logic
Year:
2003

Citing 4
Cited 6

Linear logic

Theoretical Computer Science
Programming with proofs

Journal of Information Processing and Cybernetics
Proof-nets and the Hilbert space

Proceedings of the workshop on Advances in linear logic
Light linear logic

Information and Computation

Linear logic and elementary time

Information and Computation - Special issue: ICC '99
Obsessional experiments for linear logic proof-nets

Mathematical Structures in Computer Science
Linear logic and polynomial time

Mathematical Structures in Computer Science
Uniform Circuits, & Boolean Proof Nets

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Strong normalization property for second order linear logic

Theoretical Computer Science
Linear logic by levels and bounded time complexity

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a generalized cut-elimination procedure for proof-nets of fall linear logic (without constants), for which we prove a (restricted) Church-Rosser property.