Reference : Going Polymorphic - TH1 Reasoning for Leo-III
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Going Polymorphic - TH1 Reasoning for Leo-III
Steen, Alexander mailto [> >]
Wisniewski, Max [> >]
Benzmüller, Christoph mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
IWIL Workshop and LPAR Short Presentations
Kalpa Publications in Computing, Volume 1
Maun, Botswana
IWIL Workshop and LPAR Short Presentations
7 May 2017
Thomas Eiter, David Sands, Geoff Sutcliffe and Andrei Voronkov
[en] Polymorphism Automated Reasoning ; LEO Prover ; Higher Order Logic
[en] While interactive proof assistants for higher-order logic (HOL) commonly admit reasoning within rich type systems, current theorem provers for HOL are mainly based on simply typed lambda-calculi and therefore do not allow such flexibility. In this paper, we present modifications to the higher-order automated theorem prover Leo-III for turning it into a reasoning system for rank-1 polymorphic HOL.
To that end, a polymorphic version of HOL and a suitable paramodulation-based calculus are sketched. The implementation is evaluated using a set of polymorphic TPTP THF problems.
Researchers ; Professionals ; Students

File(s) associated to this reference

Fulltext file(s):

Open access
Going_Polymorphic_-_TH1_Reasoning_for_Leo-III.pdfPublisher postprint533.31 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.