Hints in Unification

  • Andrea Asperti
  • Wilmer Ricciotti
  • Claudio Sacerdoti Coen
  • Enrico Tassi
Conference paper

DOI: 10.1007/978-3-642-03359-9_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5674)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Andrea Asperti
    • 1
  • Wilmer Ricciotti
    • 1
  • Claudio Sacerdoti Coen
    • 1
  • Enrico Tassi
    • 1
  1. 1.Department of Computer ScienceUniversity of BolognaBolognaItaly

Personalised recommendations