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

  • Jasmin Christian Blanchette
  • Andrei Paskevich
Conference paper

DOI: 10.1007/978-3-642-38574-2_29

Volume 7898 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Blanchette J.C., Paskevich A. (2013) TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism. In: Bonacina M.P. (eds) Automated Deduction – CADE-24. CADE 2013. Lecture Notes in Computer Science, vol 7898. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jasmin Christian Blanchette
    • 1
  • Andrei Paskevich
    • 2
    • 3
  1. 1.Fakultät für InformatikTechnische Universität MünchenGermany
  2. 2.LRIUniversité Paris-Sud, CNRSFrance
  3. 3.INRIA Saclay – Île-de-FranceFrance