1. TPS: A theorem-proving system for classical type theory
2. Rewrite-based Equational Theorem Proving with Selection and Simplification
3. Resolution Theorem Proving
4. Barbosa , H. , Reynolds , A. , Ouraoui , D.E. , Tinelli , C. , Barrett , C.W. Extending SMT solvers to higher-order logic . In CADE-27 (LNCS , Vol. 11716), P. Fontaine, ed., (2019). Springer, 35-- 54 . Barbosa, H., Reynolds, A., Ouraoui, D.E., Tinelli, C., Barrett, C.W. Extending SMT solvers to higher-order logic. In CADE-27 (LNCS, Vol. 11716), P. Fontaine, ed., (2019). Springer, 35--54.
5. Bentkamp , A. , Blanchette , J. , Tourret , S. , Vukmirović , P. Superposition for full higher-order logic . In CADE-28 (LNCS , Vol. 12699), A. Platzer, G. Sutcliffe, eds. (2021). Springer, 396-- 412 . Bentkamp, A., Blanchette, J., Tourret, S., Vukmirović, P. Superposition for full higher-order logic. In CADE-28 (LNCS, Vol. 12699), A. Platzer, G. Sutcliffe, eds. (2021). Springer, 396--412.