Abstract
Standardization is a fundamental notion for connecting programming languages and rewriting calculi. Since both programming languages and calculi rely on substitution for defining their dynamics, explicit substitutions (ES) help further close the gap between theory and practice.
This paper focuses on standardization for the linear substitution calculus, a calculus with ES capable of mimicking reduction in lambda-calculus and linear logic proof-nets. For the latter, proof-nets can be formalized by means of a simple equational theory over the linear substitution calculus.
Contrary to other extant calculi with ES, our system can be equipped with a residual theory in the sense of Lévy, which is used to prove a left-to-right standardization theorem for the calculus with ES but without the equational theory. Such a theorem, however, does not lift from the calculus with ES to proof-nets, because the notion of left-to-right derivation is not preserved by the equational theory. We then relax the notion of left-to-right standard derivation, based on a total order on redexes, to a more liberal notion of standard derivation based on partial orders.
Our proofs rely on Gonthier, Lévy, and Melliès' axiomatic theory for standardization. However, we go beyond merely applying their framework, revisiting some of its key concepts: we obtain uniqueness (modulo) of standard derivations in an abstract way and we provide a coinductive characterization of their key abstract notion of external redex. This last point is then used to give a simple proof that linear head reduction --a nondeterministic strategy having a central role in the theory of linear logic-- is standard.
Supplemental Material
- M. Abadi, L. Cardelli, P. L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 4(1):375--416, 1991.Google Scholar
Cross Ref
- B. Accattoli. An abstract factorization theorem for explicit substitutions. In RTA, pages 6--21, 2012.Google Scholar
- B. Accattoli. Evaluating functions as processes. In TERMGRAPH, pages 41--55, 2013.Google Scholar
Cross Ref
- B. Accattoli. Jumping around the box: graphical and operational studies on λ-calculus and Linear Logic. PhD thesis, La Sapienza University of Rome, february 2011.Google Scholar
- B. Accattoli and U. Dal Lago. On the invariance of the unitary cost model for head reduction. In RTA, pages 22--37, 2012.Google Scholar
- B. Accattoli and D. Kesner. The structural λ-calculus. In CSL, pages 381--395, 2010. Google Scholar
Digital Library
- B. Accattoli, P. Barenbaum, and D. Mazza. Distilling abstract machines. Submitted, 2013. https://sites.google.com/site/beniaminoaccattoli/machines.pdf?attredirects=0.Google Scholar
- H. P. Barendregt, R. Kennaway, J. W. Klop, and M. R. Sleep. Needed reduction and spine strategies for the lambda calculus. Information and Computation, 75(3):191--231, 1987. Google Scholar
Digital Library
- R. Bloo and K. Rose. Preservation of strong normalization in named lambda calculi with explicit substitution and garbage collection. In Computing Science in the Netherlands, pages 62--72. Netherlands Computer Science Research Foundation, 1995.Google Scholar
- G. Boudol. Computational semantics of term rewriting systems. In Algebraic methods in semantics, pages 169--236. Cambridge University Press, 1986. Google Scholar
Digital Library
- H. S. Bruggink. Equivalence of reductions in higher-order rewriting. PhD thesis, Utrecht University, 2008.Google Scholar
- D. Clark and R. Kennaway. Some properties of non-orthogonal term graph rewriting systems. In SEGRAGRA, volume 2 of ENTCS, pages 36--45, 1995.Google Scholar
- H. Curry and R. Feys. Combinatory Logic. Number Vol. 1 in Studies in logic and the foundations of mathematics. North-Holland, 1958.Google Scholar
- V. Danos and L. Regnier. Head linear reduction, 2003. http://iml.univ-mrs.fr/~regnier/articles/pam.ps.gz.Google Scholar
- V. Danos, H. Herbelin, and L. Regnier. Game semantics & abstract machines. In LICS, pages 394--405, 1996. Google Scholar
Digital Library
- D. de Carvalho, M. Pagani, and L. Tortora de Falco. A semantic measure of the execution time in linear logic. Theor. Comput. Sci., 412(20):1884--1902, 2011. Google Scholar
Digital Library
- T. Ehrhard and L. Regnier. Böhm trees, krivine's machine and the taylor expansion of lambda-terms. In CiE, pages 186--197, 2006. Google Scholar
Digital Library
- J.-Y. Girard. Linear logic. Theoretical Computer Science, 50(1):1--101, 1987. Google Scholar
Digital Library
- G. Gonthier, J.-J. Lévy, and P.-A. Melli`es. An abstract standardisation theorem. In LICS, pages 72--81, 1992.Google Scholar
- G. Huet. Residual theory in λ-calculus: A formal development. Journal of Functional Programming, 4(3):371--394, 1994.Google Scholar
Cross Ref
- G. Huet and J.-J. Lévy. Computations in orthogonal rewriting systems, I and II. In Computational Logic - Essays in Honor of Alan Robinson, pages 395--414, 1991.Google Scholar
- G. Huet and J.-J. Lévy. Call by Need computations in non ambiguous linear term rewriting systems. Technical Report 359, INRIA, 1979.Google Scholar
- D. Kesner and S. Lengrand. Resource operators for lambda-calculus. Information and Computation, 205(4):419--473, 2007. Google Scholar
Digital Library
- D. Kesner and S. O'Conchúir. Milner's lambda calculus with partial substitutions, 2008. http://www.pps.univ-paris-diderot.fr/~kesner/papers/shortpartial.pdf.Google Scholar
- Z. Khasidashvili and J. R. W. Glauert. Discrete normalization and standardization in deterministic residual structures. In ALP, pages 135--149, 1996. Google Scholar
Digital Library
- J. W. Klop. Combinatory Reduction Systems. Phd thesis, Utrecht University, 1980.Google Scholar
- J.-J. Lévy. Réductions correctes et optimales dans le lambda calcul. Thése d'Etat, Univ. Paris VII, France, 1978.Google Scholar
- L. Maranget. Optimal derivations in weak lambda-calculi and in orthogonal terms rewriting systems. In POPL, pages 255--269, 1991. Google Scholar
Digital Library
- G. Mascari and M. Pedicini. Head linear reduction and pure proof net extraction. Theoretical Computer Science, 135(1):111--137, 1994. Google Scholar
Digital Library
- P.-A. Melliès. Axiomatic rewriting theory I: A diagrammatic standardization theorem. In Processes, Terms and Cycles: Steps on the Road to Infinity, volume 3838 of LNCS, pages 554--638. Springer, 2005. Google Scholar
Digital Library
- P.-A. Melliès. Axiomatic rewriting theory VI: Residual theory revisited. In RTA, pages 24--50, 2002. Google Scholar
Digital Library
- P.-A. Melliès. Description Abstraite de système de réécriture. PhD thesis, Paris 7 University, 1996.Google Scholar
- R. Milner. Local bigraphs and confluence: Two conjectures. ENTCS, 175(3):65--73, 2007. Google Scholar
Digital Library
- L. Paolini and S. Ronchi Della Rocca. Parametric parameter passing lambda-calculus. Information and Computation, 189(1):87--106, 2004. Google Scholar
Digital Library
- G. D. Plotkin. Call-by-name, call-by-value and the lambda-calculus. Theoretical Computer Science, 1(2):125--159, 1975.Google Scholar
Cross Ref
- L. Regnier. Une équivalence sur les lambda-termes. Theoretical Computer Science, 2(126):281--292, 1994. Google Scholar
Digital Library
- M. Takahashi. Parallel reductions in λ-calculus. Inf. Comput., 118(1): 120--127, 1995. Google Scholar
Digital Library
- Terese. Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003.Google Scholar
- V. van Oostrom. Normalisation in weakly orthogonal rewriting. In RTA, pages 60--74, 1999. Google Scholar
Digital Library
- V. van Oostrom and R. C. de Vrijer. Four equivalent equivalences of reductions. ENTCS, 70(6):21--61, 2002.Google Scholar
- H. Xi. Upper bounds for standardizations and an application. Journal of Symbolic Logic, 64(1):291--303, 1999.Google Scholar
Cross Ref
Index Terms
A nonstandard standardization theorem
Recommendations
Distilling abstract machines
ICFP '14It is well-known that many environment-based abstract machines can be seen as strategies in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear logic led to the linear substitution calculus (LSC), a new approach to ...
A nonstandard standardization theorem
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesStandardization is a fundamental notion for connecting programming languages and rewriting calculi. Since both programming languages and calculi rely on substitution for defining their dynamics, explicit substitutions (ES) help further close the gap ...
The lambda-context calculus (extended version)
We present the Lambda Context Calculus. This simple lambda-calculus features variables arranged in a hierarchy of strengths such that substitution of a strong variable does not avoid capture with respect to abstraction by a weaker variable. This allows ...







Comments