Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

CADE
2008
Springer

favoriteEmaildiscussreport

145views Logical Reasoning» more CADE 2008»

THF0 - The Core of the TPTP Language for Higher-Order Logic

14 years 11 months ago

THF0 - The Core of the TPTP Language for Higher-Order Logic

Download www.ags.uni-sb.de

One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This paper introduces the core of the TPTP language for higher-order logic ? THF0, based on Church's simple type theory. THF0 is a syntactically conservative extension of the untyped first-order TPTP language.

Christoph Benzmüller, Florian Rabe, Geoff Sut

Real-time Traffic

Automated Reasoning | CADE 2008 | First-order Tptp Language | Simple Type Theory | Theorem Provers |

claim paper

Related Content

» Extending the TPTP Language to HigherOrder Logic with Automated Parser Generation

» Progress in the Development of Automated Theorem Proving for HigherOrder Logic

» Resolving Inductive Definitions with Binders in HigherOrder Typed Functional Programming

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2008
Where	CADE
Authors	Christoph Benzmüller, Florian Rabe, Geoff Sutcliffe

Comments (0)