Skip to main content
SpringerLink
Log in

Decidability of Bounded Higher-Order Unification

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2471))

Included in the following conference series:

Abstract

It is shown that unifiability of terms in the simply typed lambda calculus with β and η rules becomes decidable if there is a bound on the number of bound variables and lambdas in a unifier in η-long β-normal form.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Peter Andrews. An introduction to mathematical logic and type theory: to truth through proof. Academic Press, 1986

    Google Scholar 

  2. Henk P. Barendregt. The Lambda Calculus. Its Syntax and Semantics. North-Holland, Amsterdam, New York, 1984

    MATH  Google Scholar 

  3. Henk P. Barendregt. Functional programming and lambda calculus. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science: Formal Models and Semantics, volume B, chapter 7, pages 321–363. Elsevier, 1990

    Google Scholar 

  4. Arnold Beckmann. Exact bounds for lengths of reductions in typed μ-calculus. J. Symbolic Logic, 66:1277–1285, 2001

    Article  MATH  MathSciNet  Google Scholar 

  5. Richard Bird. Introduction to Functional Programming using Haskell. Prentice Hall, 1998

    Google Scholar 

  6. Franz Baader and Jörg Siekmann. Unification theory. In D.M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, pages 41–125. Oxford University Press, 1994

    Google Scholar 

  7. Rodney.G. Downey and Michael R. Fellows. Parametrized Complexity. Springer, 1999

    Google Scholar 

  8. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science: Formal Models and Semantics, volume B, chapter 6, pages 243–320. Elsevier, 1990

    Google Scholar 

  9. Gilles Dowek. Higher-order unification and matching. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, volume 2, chapter 16, pages 1009–1062. North-Holland, 2001

    Google Scholar 

  10. W. A. Farmer. A unification algorithm for second order monadic terms. Annals of Pure and Applied Logic, 39:131–174, 1988

    Article  MATH  MathSciNet  Google Scholar 

  11. W. A. Farmer. Simple second-order languages for which unification is undecidable. J. Theoretical Computer Science, 87:173–214, 1991

    MathSciNet  Google Scholar 

  12. Robin O. Gandy. Proofs of strong normalization. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 457–477. Academic Press, 1980

    Google Scholar 

  13. Warren. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225–230, 1981

    Article  MATH  MathSciNet  Google Scholar 

  14. J. Roger Hindley. Basic simple type theory. Cambridge tracts in theoretical computer science. Cambridge University Press, 1997

    Google Scholar 

  15. M. Hanus, H. Kuchen, and J. J. Moreno-Navarro. Curry: A truly functional logic language. In Proc. ILPS’95 Workshop on Visions for the Future of Logic Programming, pages 95–107, 1995

    Google Scholar 

  16. J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. Cambridge University Press, 1986

    Google Scholar 

  17. Gérard Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27–57, 1975

    Article  MathSciNet  Google Scholar 

  18. Jan Willem Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 2–116. Oxford University Press, 1992

    Google Scholar 

  19. Jordi Levy and Margus Veanes. On the undecidability of second-order unification. Information and Computation, 159:125–150, 2000

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  21. Tobias Nipkow. Higher-order critical pairs. In Proc. 6th IEEE Symp. LICS, pages 342–349, 1991

    Google Scholar 

  22. Lawrence C. Paulson. Isabelle, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994

    MATH  Google Scholar 

  23. Frank Pfenning. Logical frameworks. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, volume 2, chapter 17, pages 1063–1147. North-Holland, 2001

    Google Scholar 

  24. Helmut Schwichtenberg. Complexity of normalization in the pure typed λ-calculus. In A. S. Troelstra and D. van Dalen, editors, The L.E.J. Brouwer Centenary Symposium. Proceedings of the Conference hold in Noordwijkerhout, 8–13 June, 1981, volume 110 of Studies in Logic and the Foundations of Mathematics, pages 453–458. North Holland, 1982

    Google Scholar 

  25. Helmut Schwichtenberg. An upper bound for reduction sequences in the typed λ-calculus. Archive for Mathematical Logic, 30:405–408, 1991. Dedicated to Kurt Schütte on the occasion of his 80th birthday

    Article  MATH  MathSciNet  Google Scholar 

  26. Manfred Schmidt-Schauß. Decidability of bounded second order unification. Frank report 11, FB Informatik, J.W. Goethe-Universität Frankfurt am Main, 1999. available at http://www.ki.informatik.uni-frankfurt.de/papers/articles.html

  27. Manfred Schmidt-Schauß. A decision algorithm for stratified context unification. Frank-Report 12, Fachbereich Informatik, J. W. Goethe-Universität Frankfurt, Frankfurt, Germany, 1999. accepted for publication in J. Logic and Computation, available at http://www.ki.informatik.uni-frankfurt.de/papers/articles.html

    Google Scholar 

  28. Manfred Schmidt-Schauß. Decidability of bounded second order unification, 2001. submitted for publication

    Google Scholar 

  29. Manfred Schmidt-Schauß and Klaus U. Schulz. On the exponent of periodicity of minimal solutions of context equations. In Proceedings of the 9th Int. Conf. on Rewriting Techniques and Applications, volume 1379 of Lecture Notes in Computer Science, pages 61–75, 1998

    Chapter  Google Scholar 

  30. Manfred Schmidt-Schauß and Klaus U. Schulz. Decidability of bounded higher order unification. Frank report 15, Institut für Informatik, J.W. Goethe-Universität Frankfurt am Main, 2001. also appeared as: Forschungsbericht, Centrum für Informations-und Sprachverarbeitung, Universitét München. The paper is available at http://www.ki.informatik.uni-frankfurt.de/papers/articles.html

  31. Manfred Schmidt-Schauß and Klaus U. Schulz. Solvability of context equations with two context variables is decidable. Journal of Symbolic Computation, 33(1):77–122, 2002

    Article  MATH  MathSciNet  Google Scholar 

  32. Margus Veanes. Farmer’s theorem revisited. Information Processing Letters, 74:47–53, 2000

    Article  MATH  MathSciNet  Google Scholar 

  33. ToMasz Wierzbicki. A decidable variant of the higher order matching. In Proc. RTA’ 02, 2002 to appear.

    Google Scholar 

  34. David A. Wolfram. The clausal theories of types. Number 21 in Cambridge tracts in theoretical computer science. Cambridge University Press, 1993

    Google Scholar 

  35. A.P Zhezherun. Decidability of the unification problem for second order languages with unary function symbols. Kibernetika (Kiev), 5:120–125, 1979. Translated as Cybernetics 15(5): 735–741,1980

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, J.-W.-Goethe-Universität, Postfach 11 19 32, D-60054, Frankfurt, Germany

    Manfred Schmidt-Schauß

  2. CIS, University of Munich, Oettingenstr 67, D-80538, München, Germany

    Klaus U. Schulz

Authors
  1. Manfred Schmidt-Schauß
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus U. Schulz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory for Foundations of Computer Science Division of Informatics, University of Edinburgh, King’s Buildings, Mayfield Road, Edinburgh, EH9 3JZ, UK

    Julian Bradfield

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmidt-Schauß, M., Schulz, K.U. (2002). Decidability of Bounded Higher-Order Unification. In: Bradfield, J. (eds) Computer Science Logic. CSL 2002. Lecture Notes in Computer Science, vol 2471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45793-3_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-45793-3_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44240-0

  • Online ISBN: 978-3-540-45793-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation