Abstract
In this work we present a paradigm of focusing proof search based on an incremental construction of retractile (i.e, correct or sequentializable) proof structures of the pure (units free) multiplicative and additive fragment of linear logic. The correctness of proof construction steps (or expansion steps) is ensured by means of a system of graph retraction rules; this graph rewriting system is shown to be convergent, that is, terminating and confluent. Moreover, the proposed proof construction follows an optimal (parsimonious, indeed) retraction strategy that, at each expansion step, allows to take into account (abstract) graphs that are ”smaller” (w.r.t. the size) than the starting proof structures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andreoli, J.-M.: Focussing and Proof Construction. Annals of Pure and Applied Logic 107(1), 131–163 (2001)
Andreoli, J.-M.: Focussing proof-net construction as a middleware paradigm. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 501–516. Springer, Heidelberg (2002)
Andreoli, J.-M., Mazaré, L.: Concurrent Construction of Proof-Nets. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 29–42. Springer, Heidelberg (2003)
Cervesato, I., Pfenning, F., Walker, D., Watkins, K.: A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University (2002)
Chaudhuri, K., Miller, D., Saurin, A.: Canonical Sequent Proofs via Multi-Focusing. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds.) Proc. of International Conference on Theoretical Computer Science (TCS-5). IFIP, vol. 273, pp. 383–396. Springer, Boston (2008)
Danos, V.: La Logique Linéaire appliquée à l’étude de divers processus de normalisation (principalment du λ-calcul). PhD Thesis, Univ. Paris VII (1990)
Fouqueré, C., Mogbil, V.: Rewritings for polarized multiplicative and exponential proof structures. Electronic Notes in Theoretical Computer Science 203(1), 109–121 (2008)
Girard, J.-Y.: Linear Logic. Theoretical Computer Science 50, 1–102 (1987)
Girard, J.-Y.: Proof-nets: The parallel syntax for proof-theory. In: Ursini, Agliano (eds.) Logic and Algebra (1996)
Guerrini, S.: A linear algorithm for MLL proof net correctness and sequentialization. Theoretical Computer Science 412(20), 1958–1978 (2011)
Hughes, D., van Glabbeek, R.: Proof Nets for Unit-free Multiplicative-Additive Linear Logic. In: Proc. of the 18th IEEE Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (2003)
Laurent, O.: Polarized Proof-Nets: Proof-Nets for LC. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 213–227. Springer, Heidelberg (1999)
Laurent, O., Maieli, R.: Cut Elimination for Monomial MALL Proof Nets. In: Proc. of the 23rd IEEE Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (2008)
Maieli, R.: Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 363–377. Springer, Heidelberg (2007)
Miller, D.: A multiple-conclusion specification logic. Theoretical Computer Science 165, 201–232 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Maieli, R. (2014). Construction of Retractile Proof Structures. In: Dowek, G. (eds) Rewriting and Typed Lambda Calculi. RTA TLCA 2014 2014. Lecture Notes in Computer Science, vol 8560. Springer, Cham. https://doi.org/10.1007/978-3-319-08918-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-08918-8_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08917-1
Online ISBN: 978-3-319-08918-8
eBook Packages: Computer ScienceComputer Science (R0)