Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Logic-Based Program Synthesis and Transformation

LOPSTR 2010: Logic-Based Program Synthesis and Transformation pp 234–248Cite as

The First-Order Nominal Link

  • Conference paper

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

Abstract

We define a morphism from nominal syntax, which supports binding, to standard (first-order) syntax. We use this morphism to extend Paterson and Wegman’s linear first-order unification algorithm in order to deal with terms modulo alpha-equivalence. The nominal unification algorithm obtained is quadratic in time.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Calvès, C.: Complexity and implementation of nominal algorithms, Ph.D. thesis, King’s College London (2010), http://www.dcs.kcl.ac.uk/pg/calves/thesis.pdf

  2. Calvès, C., Fernández, M.: Nominal matching and alpha-equivalence. In: Hodges, W., de Queiroz, R. (eds.) WOLLIC 2008. LNCS (LNAI), vol. 5110, pp. 111–122. Springer, Heidelberg (2008)

    Google Scholar 

  3. Calvès, C., Fernández, M.: A polynomial nominal unification algorithm. Theoretical Computer Science 403(2-3), 285–306 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Clouston, R.A., Pitts, A.M.: Nominal equational logic. Electronic Notes in Theoretical Computer Science 172, 223–257 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fernández, M., Gabbay, M.J.: Nominal rewriting. Information and Computation 205(6), 917–965 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gabbay, M.J., Mathijssen, A.: Nominal (universal) algebra: Equational logic with names and binding. Journal of Logic and Computation 19(6), 1455–1508 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13(3), 341–363 (2002)

    Article  MATH  Google Scholar 

  8. Leroy, X., Doligez, D., Frisch, A., Garrigue, J., Rémy, D., Vouillon, J.: The Objective Caml system. In: Documentation and User’s Manual. INRIA, France (2008)

    Google Scholar 

  9. Levy, J., Villaret, M.: Nominal unification from a higher-order perspective. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 246–260. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Levy, J., Villaret, M.: An efficient nominal unification algorithm. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, Edinburgh, Scottland, UK, July 11-13. LIPIcs, vol. 6, pp. 209–226. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)

    Google Scholar 

  11. Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation 1(4), 497–536 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  12. Paterson, M.S., Wegman, M.N.: Linear unification. In: Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, pp. 181–186. ACM Press, New York (1976)

    Google Scholar 

  13. Peyton Jones, S.L.: The Implementation of Functional Programming Languages. Prentice-Hall International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1987)

    MATH  Google Scholar 

  14. Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and computation 186(2), 165–193 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Qian, Z.: Unification of higher-order patterns in linear time and space. Journal of Logic and Computation 6(3), 315–341 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  16. Shinwell, M.R., Pitts, A.M., Gabbay, M.J.: FreshML: Programming with binders made simple. In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pp. 263–274. ACM Press, New York (2003)

    Chapter  Google Scholar 

  17. Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. Theoretical Computer Science 323(1), 473–498 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, King’s College London, Strand, London, WC2R 2LS, UK

    Christophe Calvès & Maribel Fernández

Authors
  1. Christophe Calvès
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maribel Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ELP-DSIC, U. Politécnica de Valencia, Spain

    María Alpuente

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calvès, C., Fernández, M. (2011). The First-Order Nominal Link. In: Alpuente, M. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2010. Lecture Notes in Computer Science, vol 6564. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20551-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20551-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20550-7

  • Online ISBN: 978-3-642-20551-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation