Term Rewriting and All That, 1998. ,
Normal Form Transformations, pp.273-333 ,
DOI : 10.1016/B978-044450813-3/50007-2
Rewrite-based Equational Theorem Proving with Selection and Simplification, Journal of Logic and Computation, vol.4, issue.3, pp.217-247, 1994. ,
DOI : 10.1093/logcom/4.3.217
Extending Sledgehammer with SMT Solvers, J. Autom. Reasoning, vol.37, issue.1-2, pp.109-128, 2013. ,
DOI : 10.1007/BFb0028402
Encoding Monomorphic and Polymorphic Types, LNCS, vol.7795, pp.493-507, 2013. ,
DOI : 10.1007/978-3-642-36742-7_34
URL : http://arxiv.org/abs/1609.08916
TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism, LNCS, vol.7898, pp.414-420, 2013. ,
DOI : 10.1007/978-3-642-38574-2_29
URL : https://hal.archives-ouvertes.fr/hal-00825086
More SPASS with Isabelle, Interactive Theorem Proving, pp.345-360, 2012. ,
DOI : 10.1007/978-3-642-32347-8_24
URL : https://hal.archives-ouvertes.fr/hal-00760392
Implementing polymorphism in SMT solvers, Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning, SMT '08/BPR '08, pp.1-5, 2008. ,
DOI : 10.1145/1512464.1512466
Expressing Polymorphic Types in a Many-Sorted Language, FroCoS, pp.87-102, 2011. ,
DOI : 10.1007/978-3-540-78800-3_24
URL : https://hal.archives-ouvertes.fr/inria-00591414
Handling Polymorphism in Automated Deduction, LNCS, vol.4603, pp.263-278, 2007. ,
DOI : 10.1007/978-3-540-73595-3_18
Substitution tree indexing, Rewriting Techniques and Applications, pp.117-131, 1995. ,
DOI : 10.1007/3-540-59200-8_52
Simple and Efficient Clause Subsumption with Feature Vector Indexing, Automated Reasoning and Mathematics, pp.45-67, 2013. ,
DOI : 10.1007/BF00881918
Combining Superposition, Sorts and Splitting, pp.1965-2013 ,
DOI : 10.1016/B978-044450813-3/50029-1
Type classes and overloading in higher-order logic, TPHOLs, pp.307-322, 1997. ,
DOI : 10.1007/BFb0028402