Abstract
We introduce a deep inference logical system SBVr which extends SBV [6] with Rename, a self-dual atom-renaming operator. We prove that the cut free subsystem BVr of SBVr exists. We embed the terms of linear λ-calculus with explicit substitutions into formulas of SBVr. Our embedding recalls the one of full λ-calculus into π-calculus. The proof-search inside SBVr and BVr is complete with respect to the evaluation of linear λ-calculus with explicit substitutions. Instead, only soundness of proof-search in SBVr holds. Rename is crucial to let proof-search simulate the substitution of a linear λ-terms for a variable in the course of linear β-reduction. Despite SBVr is a minimal extension of SBV its proof-search can compute all boolean functions, exactly like linear λ-calculus with explicit substitutions can do.
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
Abadi, M., Cardelli, L., Curien, P.-L., Lévy, J.-J.: Explicit substitutions. JFP 1(4), 375–416 (1991)
Blute, R.F., Guglielmi, A., Ivanov, I.T., Panangaden, P., Straßburger, L.: A Logical Basis for Quantum Evolution and Entanglement. Private Communication
Brünnler, K., McKinley, R.: An algorithmic interpretation of a deep inference system. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 482–496. Springer, Heidelberg (2008)
Bruscoli, P.: A purely logical account of sequentiality in proof search. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 302–316. Springer, Heidelberg (2002)
Girard, J.-Y., Taylor, P., Lafont, Y.: Proofs and Types. CUP (1989)
Guglielmi, A.: A system of interaction and structure. ToCL 8(1), 1–64 (2007)
Guglielmi, A., Straßburger, L.: A system of interaction and structure V: The exponentials and splitting. To appear on MSCS (2009)
Honda, K., Yoshida, N.: On the Reduction-based Process Semantics. TCS (151), 437–486 (1995)
Kahramanoğulları, O.: System BV is NP-complete. APAL 152(1-3), 107–121 (2007)
Mairson, H.G.: Linear lambda calculus and ptime-completeness. JFP 14(6), 623–633 (2004)
Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)
Milner, R.: Functions as processes. MSCS 2(2), 119–141 (1992)
Roversi, L.: Linear lambda calculus with explicit substitutions as proof-search in Deep Inference (November 2010), http://arxiv.org/abs/1011.3668
Straßburger, L.: Some observations on the proof theory of second order propositional multiplicative linear logic. In: Curien, P.-L. (ed.) TLCA 2009. LNCS, vol. 5608, pp. 309–324. Springer, Heidelberg (2009)
Straßburger, L., Guglielmi, A.: A system of interaction and structure IV: The exponentials and decomposition. ToCL (2010) (in press)
Straßburger, L.: System NEL is undecidable. In: De Queiroz, R., Pimentel, E., Figueiredo, L. (eds.) WoLLIC 2003. ENTCS, vol. 84. Elsevier, Amsterdam (2003)
van Bakel, S., Vigliotti, M.G.: A logical interpretation of the λ-calculus into the π-calculus, preserving spine reduction and types. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 84–98. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roversi, L. (2011). Linear Lambda Calculus and Deep Inference. In: Ong, L. (eds) Typed Lambda Calculi and Applications. TLCA 2011. Lecture Notes in Computer Science, vol 6690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21691-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-21691-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21690-9
Online ISBN: 978-3-642-21691-6
eBook Packages: Computer ScienceComputer Science (R0)