Handling Polymorphism in Automated Deduction

@inproceedings{Couchot2007HandlingPI,
  title={Handling Polymorphism in Automated Deduction},
  author={Jean-François Couchot and St{\'e}phane Lescuyer},
  booktitle={CADE},
  year={2007}
}
Polymorphism has become a common way of designing short and reusable programs by abstracting generic definitions from typespecific ones. Such a convenience is valuable in logic as well, because it unburdens the specifier from writing redundant declarations of logical symbols. However, top shelf automated theorem provers such as Simplify, Yices or other SMT-LIB ones do not handle polymorphism. To this end, we present efficient reductions of polymorphism in both unsorted and many-sorted first… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
22 Citations
26 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Combining the Coq Proof Assistant with First-Order Decision Procedures

  • N. Ayache, J. C. Filliâtre
  • Unpublished
  • 2006
Highly Influential
3 Excerpts

The YICES SMT Solver (2006) avaliable at http://yices.csl.sri.com/tool-paper.pdf

  • B. Dutertre, L. de Moura
  • 2006
Highly Influential
5 Excerpts

Handling Polymorphism in Automated Deduction

  • J. F. Couchot, S. Lescuyer
  • 2007
1 Excerpt

Codage de la logique du premier ordre polymorphe multi-sortée dans la logique sans sortes

  • S. Lescuyer
  • Master’s thesis (in english) pp. 28–58
  • 2006

The Satisfiability Modulo Theories Library (SMT-LIB) (2006) http://www.SMT-LIB.org

  • S. Ranise, C. Tinelli
  • 2006
2 Excerpts

Similar Papers

Loading similar papers…