Skip to Main content Skip to Navigation
Conference papers

TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism

Abstract : The TPTP World is a well-established infrastructure for automatic theorem provers. It defines several concrete syntaxes, notably an untyped first-order form (FOF) and a typed first-order form (TFF0), that have become de facto standards. This paper introduces the TFF1 format, an extension of TFF0 with rank-1 polymorphism. The format is designed to be easy to process by existing reasoning tools that support ML-style polymorphism. It opens the door to useful middleware, such as monomorphizers and other translation tools that encode polymorphism in FOF or TFF0. Ultimately, the hope is that TFF1 will be implemented in popular automatic theorem provers.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Andrei Paskevich Connect in order to contact the contributor
Submitted on : Wednesday, May 22, 2013 - 10:08:54 PM
Last modification on : Sunday, June 26, 2022 - 11:58:51 AM
Long-term archiving on: : Tuesday, April 4, 2017 - 10:21:00 AM


Files produced by the author(s)


  • HAL Id : hal-00825086, version 1



Jasmin Blanchette, Andrei Paskevich. TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism. CADE - 24th International Conference on Automated Deduction - 2013, Jun 2013, Lake Placid, NY, United States. pp.414-420. ⟨hal-00825086⟩



Record views


Files downloads