Skip Navigation



Journal of Logic and Computation Advance Access published online on April 23, 2008
Journal of Logic and Computation, doi:10.1093/logcom/exn007
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Arbiser, A.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

The Expansion Problem in Lambda Calculi with Explicit Substitution

Ariel Arbiser

Department of Computer Science, University of Buenos Aires, Pabellón I - Ciudad Universitaria (1428) Buenos Aires, Argentina, E-mail: arbiser{at}dc.uba.ar

Received 30 January 2006.

In this article, we address the problem of expansion with respect to rules of a calculus with explicit substitution. Mainly, we analyse the {lambda}{upsilon}– and {lambda}s–calculi sets of terms having the property of expansion to pure terms, as minimal sets of terms for these calculi. We prove that, contrarily to what happens in the {lambda}x–calculus in which this set is trivial, for {lambda}{upsilon} and {lambda}s they are proper and non-recursive, so a calculus based on a minimal set of terms has a syntax which is not context-free and hence cannot be presented in the usual way.

Keywords: Context-free; expansion; explicit substitution; lambda calculus; lambda s; lambda upsilon; recursiv set



References

  1. Abadi M, Cardelli L, Curien P.-L, Lévy J.-J. Explicit substitutions. Journal of Functional Programming (1991) 1:375–416.
  2. Arbiser A, Bonelli E, Ríos A. Perpetuality in a lambda calculus with explicit substitution and composition. (2002) Proceedings of the WAIT 2002, 31 JAIIO. SADIO (Sociedad Argentina de Informática e Investigación Operativa): Santa Fe.
  3. Arbiser A. Explicit Substitution Systems and Subsystems. (2005) University of Buenos Aires. PhD Thesis.
  4. Barendregt HP. The Lambda Calculus: its Syntax and Semantics. In: Studies in Logic and the Foundations of Mathematics 103 (1984) Amsterdam: North-Holland. revised edition.
  5. Barendregt HP. Lambda calculi with types. In: Handbook of Logic in Computer Science—Abramsky S, Gabbay D, Maibaum TSE, eds. (1992) vol. 2. Oxford: Oxford University Press. 117–309. ch. 2.
  6. Bloo R. Preservation of Termination for Explicit Substitutions. (1997) Eindhoven University. PhD thesis.
  7. de Bruijn N. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church–Rosser Theorem. Indagations Mathematicae (1972) 34:381–392.
  8. Church A, Rosser JB. Some Properties of Conversion. Transactions of the American Mathematical Society (1936) 39:472–482.[CrossRef][ISI]
  9. Davis M, Weyuker E. Computability, Complexity and Languages: Fundamentals of Theoretical Computer Science. (1994) New York: Academic Press.
  10. Kamareddine F, Ríos A. A {lambda}-calculus à la de Bruijn with explicit substitutions. Proceedings of PLILP'95 (1995) 982:45–62. Lecture Notes in Computer Science.
  11. Herbelin H. Expicit substitutions and reducibility. Journal of Logic and Computation (2001) 11:429–449.
  12. Kamareddine F, Ríos A. Relating the {lambda}{sigma}- and {lambda}s-styles of explicit substitutions. Journal of Logic and Computation (2000) 10:349–380.[Abstract/Free Full Text]
  13. Lescanne P, Rouyer-Degli J, Benaissa Z, Briaud D. Lambda-upsilon, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming (1996) 6:699–722.
  14. Polonovski E. Substitutions Explicites, Logique et Normalisation. (2004) Université de Paris VII. PhD Thesis.
  15. Rose KH. Explicit cyclic substitutions. In: Proceedings CTRS '92 - 3rd International Workshop on Conditional Term Rewriting Systems, Lecture Notes in Computer Science 656—Rusinowitch M, Rémy J.-L, eds. (1992) Pont-a-Mousson, France: Springer-Verlag. 36–50.
  16. van Raamsdonk F, Severi P, Sørensen MH, Xi H. Perpetual reductions in lambda calculus. Journal of Information and Computation (1999) 149:173–225.[CrossRef]
  17. Waldmann J. The Combinator S. (1998) Friedrich–Schiller-Universität Jena. PhD thesis.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Arbiser, A.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?