Bipolar Proof Nets for MALL
Abstract
In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious refinement of Classical Logic. Moreover, we set a correspon- dence between this paradigm and those more pragmatic ones inspired to transactional or distributed systems. In particular we show that the construction of additive proof nets can be interpreted as a model for super-ACID (or co-operative) transactions over distributed transactional systems (typi- cally, multi-databases).
Cite
@article{arxiv.1210.5946,
title = {Bipolar Proof Nets for MALL},
author = {Roberto Maieli},
journal= {arXiv preprint arXiv:1210.5946},
year = {2012}
}
Comments
Proceedings of the "Proof, Computation, Complexity" International Workshop, 17-18 August 2012, University of Copenhagen, Denmark