(Enter summary)
Abstract: This article presents a method for transforming linear logic proofs that reduces the number
of primitive constructions. Inside formulas, some connectives are replaced by second order
equivalents. Proofs are also transformed and cut elimination may be emulated. This mechanism
leads to proofs without the additives & and \Phi and the constants 1, ?, 0 and ? and where the
modality ! is only introduced with empty environments. As CPS-transformations in -calculus
leads to particular reduction... (Update)
Active bibliography (related documents): More All
0.0: Classical Proofs as Programs, Cut Elimination as Computation - Ogata
(Correct)
0.0: Gentzen-style classical logic as CPS calculus - Ogata
(Correct)
0.0: Phase Semantics for Light Linear Logic - Kanovich, Okada, Scedrov (1997)
(Correct)
Similar documents based on text: More All
0.2: Additives of linear logic and normalization- Part I: a.. - Lorenzo Tortora De
(Correct)
0.2: Universal Interaction Systems with Only Two Agents - Bechet
(Correct)
0.2: A first step towards implementing Dynamic Algebraic Dependencies - Bidoit, De Amo (1995)
(Correct)
BibTeX entry: (Update)
@misc{ bechet-second,
author = "Denis Bechet",
title = "Second Order Connectives and Proof Transformations in Linear Logic",
url = "citeseer.ist.psu.edu/429539.html" }
Citations (may not include all citations):
215
Theoretical Computer Science (context) - Girard - 1987 ACM
17
Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1988
Documents on the same site (http://www-lipn.univ-paris13.fr/~bechet/): More
Limix: a Partial Evaluator for Partially Static Structures - Bechet
(Correct)
Constructing Different Phonological Bracketings From a Proof-Net - Bechet, de Groote (1996)
(Correct)
A Complete Axiomatisation for the Inclusion of.. - Béchet, de Groote.. (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC