Hints in Unification
- Cite this paper as:
- Asperti A., Ricciotti W., Sacerdoti Coen C., Tassi E. (2009) Hints in Unification. In: Berghofer S., Nipkow T., Urban C., Wenzel M. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2009. Lecture Notes in Computer Science, vol 5674. Springer, Berlin, Heidelberg
Several mechanisms such as Canonical Structures , Type Classes [13,16], or Pullbacks  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.
Unable to display preview. Download preview PDF.