Abstract
We investigate a new computational interpretation for an intuitionistic focused sequent calculus which is compatible with a resource aware semantics. For that, we associate to Herbelin’s syntax a type system based on non-idempotent intersection types, together with a set of reduction rules –inspired from the substitution at a distance paradigm– that preserves (and decreases the size of) typing derivations. The non-idempotent approach allows us to use very simple combinatorial arguments, only based on this measure decreasingness, to characterize strongly normalizing terms by means of typability. For the sake of completeness, we also study typability (and the corresponding strong normalization characterization) in the reduction calculus obtained from the former one by projecting the explicit substitutions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The node \(\mathtt{hlist}\) counts 2 since it corresponds, in the standard sequent calculus, to an application of an axiom rule followed by a contraction.
References
Accattoli, B., Bonelli, E., Kesner, D., Lombardi, C.: A nonstandard standardization theorem. In: POPL, pp. 659–670. ACM (2014)
Accattoli, B., Kesner, D.: The structural \(\lambda \)-calculus. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 381–395. Springer, Heidelberg (2010)
Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. Logic Comput. 2(3), 297–347 (1992)
Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics (revised Edition), Volume 103 of Studies in Logic and the Foundations of Mathematics. Elsevier Science, New York (1984)
Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. Bull. Symbolic Logic 48, 931–940 (1983)
Bernadet, A., Lengrand, S.: Complexity of strongly normalising \(\lambda \)-terms via non-idempotent intersection types. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 88–107. Springer, Heidelberg (2011)
Bernadet, A., Lengrand, S.: Non-idempotent intersection types and strong normalisation. Log. Methods Comput. Sci. 9(4), 1–46 (2013)
Boudol, G., Curien, P.-L., Lavatelli, C.: A semantics for lambda calculi with resources. Math. Struct. Comput. Sci. 9(4), 437–482 (1999)
Bucciarelli, A., Kesner, D., Ronchi Della Rocca, S.: The inhabitation problem for non-idempotent intersection types. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 341–354. Springer, Heidelberg (2014)
Coppo, M., Dezani-Ciancaglini, M.: A new type-assignment for lambda terms. Archiv für Mathematische Logik und Grundlagenforschung 19, 139–156 (1978)
Coppo, M., Dezani-Ciancaglini, M.: An extension of the basic functionality theory for the \(\lambda \)-calculus. Notre Dame, J. Formal Logic 21, 685–693 (1980)
Coppo, M., Dezani-Ciancaglini, M., Venneri, B.: Functional characters of solvable terms. Math. Logic Q. 27(2–6), 45–58 (1981)
Damiani, F., Giannini, P.: A decidable intersection type system based on relevance. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 707–725. Springer, Heidelberg (1994)
De Benedetti, E., Ronchi Della Rocca, S.: Bounding normalization time through intersection types. In: ITRS, EPTCS, pp. 48–57. Cornell University Library (2013)
de Carvalho, D.: Sémantiques de la logique linéaire et temps de calcul. Université Aix-Marseille II, These de doctorat (2007)
Dyckhoff, R., Urban, C.: Strong normalization of herbelin’s explicit substitution calculus with substitution propagation. J. Logic Comput. 13(5), 689–706 (2003)
Espírito Santo, J., Ivetic, J., Likavec, S.: Characterising strongly normalising intuitionistic terms. Fundamenta Informaticae 121(1–4), 83–120 (2012)
Espírito Santo, J.: Santo. The lambda-calculus and the unity of structural proof theory. Theory Comput. Syst. 45(4), 963–994 (2009)
Espírito Santo, J.: Revisiting the correspondence between cut elimination and normalisation. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 600–611. Springer, Heidelberg (2000)
Gentzen, G.: The collected papers of Gerhard Gentzen (1969)
Ghilezan, S., Ivetic, J., Lescanne, P., Likavec, S.: Intersection types for the resource control lambda calculi. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol. 6916, pp. 116–134. Springer, Heidelberg (2011)
Girard, J.-Y.: Proof-nets: The parallel syntax for proof-theory. In: Logic and Algebra, pp. 97–124. Marcel Dekker (1996)
Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types, Volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1989)
Herbelin, H.: A lambda-calculus structure isomorphic to Gentzen-style sequent calculus structure. In: Pacholski, L., Tiuryn, J. (eds.) CSL1994. LNCS, vol. 933, pp. 61–75. Springer, Heidelberg (1995)
Kesner, D., Ventura, D.: Quantitative types for intuitionistic calculi. Technical Report hal-00980868, Paris Cité Sorbonne (2014)
Kesner, D., Ventura, D.: Quantitative types for the linear substitution calculus. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 296–310. Springer, Heidelberg (2014)
Kfoury, A.: A linearization of the lambda-calculus and consequences. Technical report, Boston University (1996)
Kfoury, A.: A linearization of the lambda-calculus and consequences. J. Logic Comput. 10(3), 411–436 (2000)
Kfoury, A., Wells, J.B.: Principality and type inference for intersection types using expansion variables. Theoret. Comput. Sci. 311(1–3), 1–70 (2004)
Kikuchi, K.: Uniform proofs of normalisation and approximation for intersection types. In: ITRS, Vienna, Austria (2014)
Klop, J.W.: Combinatory reduction systems. Ph.D. thesis, University of Utrecht (1980)
Krivine, J.-L.: Lambda-calculus, Types and Models. Ellis Horwood (1993)
Lengrand, S.: Deriving strong normalisation. In: HOR, pp. 84–88 (2004). http://www-i2.informatik.rwth-aachen.de/HOR04/
Lengrand, S., Lescanne, P., Dougherty, D., Dezani-Ciancaglini, M., van Bakel, S.: Intersection types for explicit substitutions. Inf. Comput. 189, 17–42 (2004)
Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Ann. Pure Appl. Logic 51, 125–157 (1991)
Milner, R.: Local bigraphs and confluence: Two conjectures: (extended abstract). ENTCS 175(3), 65–73 (2007)
Neergaard, P.M., Mairson, H.G.: Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. In: ICFP, pp. 138–149. ACM (2004)
Ong, L., Ramsay.: Verifying higher-order functional programs with pattern matching algebraic data types. In: POPL, pp. 587–598. ACM (2011)
Pagani, M., della Rocca, S.R.: Solvability in resource lambda-calculus. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 358–373. Springer, Heidelberg (2010)
Pottinger, G.: Normalization as a homomorphic image of cut-elimination. Ann. Math. Logic 12, 323–357 (1977)
Pottinger, G.: A type assignment for the strongly normalizable \(\lambda \)-terms. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 561–578. Academic Press, London (1980)
Prawitz, D.: Natural deduction: a proof-theoretical study. Ph.D. thesis, Stockholm University (1965)
Regnier, L.: Une équivalence sur les lambda-termes. Theoret. Comput. Sci. 2(126), 281–292 (1994)
Tait, W.: Intensional interpretations of functionals of finite type I. J. Symbolic Logic 32(2), 198–212 (1967)
Urzyczyn, P.: The emptiness problem for intersection types. J. Symbolic Logic 64(3), 1195–1215 (1999)
Valentini, S.: An elementary proof of strong normalization for intersection types. Arch. Math. Logic 40(7), 475–488 (2001)
van Bakel, S.: Complete restrictions of the intersection type discipline. Theoret. Comput. Sci. 102(1), 135–163 (1992)
Zucker, J.: The correspondence between cut-elimination and normalization. Ann. Math. Logic 7, 1–112 (1974)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Kesner, D., Ventura, D. (2015). A Resource Aware Computational Interpretation for Herbelin’s Syntax. In: Leucker, M., Rueda, C., Valencia, F. (eds) Theoretical Aspects of Computing - ICTAC 2015. ICTAC 2015. Lecture Notes in Computer Science(), vol 9399. Springer, Cham. https://doi.org/10.1007/978-3-319-25150-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-25150-9_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25149-3
Online ISBN: 978-3-319-25150-9
eBook Packages: Computer ScienceComputer Science (R0)