Abstract
Boxes are a key tool introduced by linear logic proof nets to implement lambda-calculus beta-reduction. In usual graph reduction, on the other hand, there is no need for boxes: the part of a shared graph that may be copied or erased is reconstructed on the fly when needed. Boxes however play a key role in controlling the reductions of nets and in the correspondence between nets and terms with explicit substitutions.
We show that boxes can be represented in a simple and efficient way by adding a jump, i.e. an extra connection, for every explicit sharing position (exponential cut) in the graph, and we characterize our nets by a variant of Lamarche’s correctness criterion for essential nets. The correspondence between explicit substitutions and jumps simplifies the already known correspondence between explicit substitutions and proof net exponential cuts.
Partially supported by the MIUR PRIN grant “CONCERTO” and by the Sapienza S.M.F.N. grant “Applicazione di Strumenti Logici alla Progettazione e Analisi di Sistemi Software”.
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
Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Languages. Cambridge Tracts in Theoretical Computer Science, vol. 45. Cambridge University Press, Cambridge (1998)
Cosmo, R.D., Kesner, D., Polonovski, E.: Proof nets and explicit substitutions. Mathematical Structures in Computer Science 13(3), 409–450 (2003)
Di Giamberardino, P., Faggian, C.: Jump from parallel to sequential proofs: Multiplicatives. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 319–333. Springer, Heidelberg (2006)
Girard, J.-Y.: Linear logic. Theoretical Computer Science 50(1), 1–102 (1987)
Girard, J.-Y.: Quantifiers in linear logic II. In: Prépublications de l’Équipe de Logique 19. Université Paris VII, Paris (1991)
Guerrini, S., Martini, S., Masini, A.: Coherence for sharing proof nets. Theoretical Computer Science 294(3), 379–409 (2003)
Kesner, D.: The theory of calculi with explicit substitutions revisited. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 238–252. Springer, Heidelberg (2007)
Lamarche, F.: Proof nets for intuitionistic linear logic I: Essential nets. Preliminary report (April 1994)
Mackie, I.: Linear logic with boxes. In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 309–320 (1998)
Murawski, A.S., Ong, C.-H.L.: Dominator trees and fast verification of proof nets. In: LICS 2000: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, pp. 181–191. IEEE Computer Society, Los Alamitos (2000)
Peyton Jones, S.: The Implementation of Functional Programming Languages. International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1987)
Plump, D.: Term graph rewriting. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation: Applications, Languages and Tools, ch. 1, vol. 2, pp. 3–61. World Scientific, Singapore (1999)
Regnier, L.: Lambda-calcul et réseaux. Thèse de doctorat, Université Paris, 7 (1992)
Wadsworth, C.P.: Semantics and pragmatics of the lambda-calculus. Phd Thesis, Oxford, ch. 4 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Accattoli, B., Guerrini, S. (2009). Jumping Boxes . In: Grädel, E., Kahle, R. (eds) Computer Science Logic. CSL 2009. Lecture Notes in Computer Science, vol 5771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04027-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-04027-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04026-9
Online ISBN: 978-3-642-04027-6
eBook Packages: Computer ScienceComputer Science (R0)