Chapter

Theorem Proving in Higher Order Logics

Volume 5674 of the series Lecture Notes in Computer Science pp 84-98

Hints in Unification

  • Andrea AspertiAffiliated withLancaster UniversityDepartment of Computer Science, University of Bologna
  • , Wilmer RicciottiAffiliated withLancaster UniversityDepartment of Computer Science, University of Bologna
  • , Claudio Sacerdoti CoenAffiliated withLancaster UniversityDepartment of Computer Science, University of Bologna
  • , Enrico TassiAffiliated withLancaster UniversityDepartment of Computer Science, University of Bologna

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Several mechanisms such as Canonical Structures [14], Type Classes [13,16], or Pullbacks [10] have been recently introduced with the aim to improve the power and flexibility of the type inference algorithm for interactive theorem provers. We claim that all these mechanisms are particular instances of a simpler and more general technique, just consisting in providing suitable hints to the unification procedure underlying type inference. This allows a simple, modular and not intrusive implementation of all the above mentioned techniques, opening at the same time innovative and unexpected perspectives on its possible applications.