Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Theoretical Aspects of Computing

ICTAC 2016: Theoretical Aspects of Computing – ICTAC 2016 pp 179–195Cite as

Unification for \(\lambda \)-calculi Without Propagation Rules

  • Conference paper
  • First Online:

  • 458 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9965))

Abstract

We present a unification procedure for calculi with explicit substitutions (ES) without propagation rules. The novelty of this work is that the unification procedure was developed for the calculi with ES that belong to the paradigm known as “act at a distance”, i.e. explicit substitutions are not propagated to the level of variables, as usual. The unification procedure is proved correct and complete, and enjoy a simple form of substitution, called grafting, instead of the standard capture avoiding variable substitution.

F.L.C. de Moura—Author partially supported by FAPDF.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    We write the type information only in the initial terms of the examples for readability.

References

  1. Abadi, M., Cardelli, L., Curien, P.-L., Lévy, J.-J.: Explicit substitutions. J. Funct. Program. 1(4), 375–416 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Accattoli, B.: An abstract factorization theorem for explicit substitutions. In: Tiwari [36], pp. 6–21

    Google Scholar 

  3. Accattoli, B., Barenbaum, P., Mazza, D.: Distilling abstract machines. In: Jeuring, J., Chakravarty, M.M.T. (eds.) Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming, Gothenburg, Sweden, 1–3 September 2014, pp. 363–376. ACM (2014)

    Google Scholar 

  4. Accattoli, B., Bonelli, E., Kesner, D., Lombardi, C.: A nonstandard standardization theorem. In: Jagannathan, S., Sewell, P. (eds.) POPL, pp. 659–670. ACM (2014)

    Google Scholar 

  5. 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). doi:10.1007/978-3-642-15205-4_30

    Chapter  Google Scholar 

  6. Accattoli, B., Kesner, D.: The permutative \(\lambda \)-calculus. In: Bjørner, N., Voronkov, A. (eds.) LPAR 2012. LNCS, vol. 7180, pp. 23–36. Springer, Heidelberg (2012). doi:10.1007/978-3-642-28717-6_5

    Chapter  Google Scholar 

  7. Accattoli, B., Kesner, D.: Preservation of strong normalisation modulo permutations for the structural lambda-calculus. Logical Methods Comput. Sci. 8(1), 1–44 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Accattoli, B., Dal Lago, U.: On the invariance of the unitary cost model for head reduction. In: Tiwari [36], pp. 22–37

    Google Scholar 

  9. Ayala-Rincón, M., Kamareddine, F.: Unification via the \(\lambda s_e\)-style of explicit substitution. Logical J. IGPL 9(4), 489–523 (2001)

    Article  MATH  Google Scholar 

  10. Ayala-Rincón, M., Kamareddine, F.: On applying the \(\lambda s_e\)-style of unification for simply-typed higher order unification in the pure lambda calculus. Matemática Contemporânea 24, 1–22 (2003)

    MATH  Google Scholar 

  11. de Moura, F.L.C., Kesner, D., Ayala-Rincón, M.: Metaconfluence of calculi with explicit substitutions at a distance. In: Raman, V., Suresh, S.P. (eds.) 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), vol. 29, pp. 391–402. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2014)

    Google Scholar 

  12. de Moura, F.L.C.: Higher-order unification via explicit substitutions at a distance. In: LSFA 2014 (2014). Accepted for short presentation

    Google Scholar 

  13. de Moura, F.L.C., Ayala-Rincón, M., Kamareddine, F.: Higher-order unification: a structural relation between Huet’s method and the one based on explicit substitutions. J. Appl. Logic 6(1), 72–108 (2008)

    Article  MATH  Google Scholar 

  14. de Moura, F.L.C., Kamareddine, F., Ayala-Rincón, M.: Second-order matching via explicit substitutions. In: Baader, F., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3452, pp. 433–448. Springer, Heidelberg (2005). doi:10.1007/978-3-540-32275-7_29

    Chapter  Google Scholar 

  15. Dougherty, D.J.: Higher-order unification via combinators. TCS 114(2), 273–298 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  16. Dowek, G.: Third order matching is decidable. APAL 69, 135–155 (1994)

    MathSciNet  MATH  Google Scholar 

  17. Dowek, G.: Higher-order unification and matching. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 2, pp. 1009–1062. MIT press and Elsevier (2001). Chap. 16

    Google Scholar 

  18. Dowek, G., Hardin, T., Kirchner, C.: Higher order unification via explicit substitutions. Inf. Comput. 157(1–2), 183–235 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  19. Briaud, D., Lescanne, P., Rouyer-Degli, J.: \(\lambda \upsilon \), a calculus of explicit substitutions which preserves strong normalization. JFP 6(5), 699–722 (1996)

    MathSciNet  MATH  Google Scholar 

  20. Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50, 1–102 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  21. Goldfarb, W.: The undecidability of the second-order unification problem. Theoret. Comput. Sci. 13(2), 225–230 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  22. Guillaume, B.: The \(\lambda s_e\)-calculus does not preserve strong normalization. J. Func. Program. 10(4), 321–325 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  23. Huet, G.: The undecidability of unification in third order logic. Inf. Control 22(3), 257–267 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  24. Huet, G.: A unification algorithm for typed lambda-calculus. TCS 1(1), 27–57 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  25. Huet, G.: Résolution d’équations dans les langages d’ordre 1,2,..,\(\omega \). Ph.D. thesis, University Paris-7 (1976)

    Google Scholar 

  26. Kamareddine, F., Ríos, A.: Extending a \(\lambda \)-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms. J. Func. Program. 7, 395–420 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  27. Kesner, D.: A theory of explicit substitutions with safe and full composition. Logical Methods Comput. Sci. 5(31), 1–29 (2009)

    MathSciNet  MATH  Google Scholar 

  28. Lins, R.D.: A new formula for the execution of categorical combinators. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol. 230, pp. 89–98. Springer, Heidelberg (1986). doi:10.1007/3-540-16780-3_82

    Chapter  Google Scholar 

  29. Loader, R.: Higher order \(\beta \) matching is undecidable. Logic J. Interest Group Pure Appl. Logics 11(1), 51–68 (2003)

    MathSciNet  MATH  Google Scholar 

  30. Mellies, P.-A.: Typed \(\lambda \)-calculi with explicit substitutions may not terminate. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol. 902, pp. 328–334. Springer, Heidelberg (1995). doi:10.1007/BFb0014062

    Chapter  Google Scholar 

  31. Milner, R.: Local bigraphs and confluence: two conjectures: (extended abstract). ENTCS 175(3), 65–73 (2007)

    MathSciNet  MATH  Google Scholar 

  32. Padovani, V.: Decidability of fourth-order matching. Math. Struct. Comput. Sci. 10(3), 361–372 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  33. Renaud, F.: Metaconfluence of \({\lambda }\mathtt{j}\): dealing with non-deterministic replacements (2011). http://www.pps.univ-paris-diderot.fr/~renaud/lambdaj_mconf.pdf

  34. Snyder, W., Gallier, J.H.: Higher-order unification revisited: complete sets of transformations. J. Symb. Comput. 8(1/2), 101–140 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  35. Stirling, C.: A game-theoretic approach to deciding higher-order matching. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 348–359. Springer, Heidelberg (2006). doi:10.1007/11787006_30

    Chapter  Google Scholar 

  36. Tiwari, A. (ed.) 23rd International Conference on Rewriting Techniques and Applications (RTA 2012). LIPIcs, Nagoya, Japan, 28 May 2012 – 2 June 2012, vol. 15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)

    Google Scholar 

Download references

Acknowledgements

I want to thank the anonymous referees for comments and suggestions on this work.

Author information

Authors and Affiliations

  1. Departamento de Ciência da Computação, Universidade de Brasília, Brasília, Brazil

    Flávio L. C. de Moura

Authors
  1. Flávio L. C. de Moura
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Flávio L. C. de Moura .

Editor information

Editors and Affiliations

  1. Universidade Federal de Pernambuco Centro de Informática, Recife, Pernambuco, Brazil

    Augusto Sampaio

  2. Deptartment of Electrical Engineering BL, National Taiwan University, Taipei, Taiwan

    Farn Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

de Moura, F.L.C. (2016). Unification for \(\lambda \)-calculi Without Propagation Rules. In: Sampaio, A., Wang, F. (eds) Theoretical Aspects of Computing – ICTAC 2016. ICTAC 2016. Lecture Notes in Computer Science(), vol 9965. Springer, Cham. https://doi.org/10.1007/978-3-319-46750-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46750-4_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46749-8

  • Online ISBN: 978-3-319-46750-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation