We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on beta eta-equivalence classes of.-terms and rely on higher-order unification to achieve refutational completeness. We implemented the calculus in the Zipperposition prover and evaluated it on TPTP and Isabelle benchmarks. The results suggest that superposition is a suitable basis for higher-order reasoning.
机构:
Univ La Reunion, Dept Math & Informat, ERMIT, St Denis 97715 9, Reunion, FranceUniv La Reunion, Dept Math & Informat, ERMIT, St Denis 97715 9, Reunion, France
Delhomme, Christian
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS,
2006,
23
(2-3):
: 221
-
233
机构:
Inst Appl Phys & Computat Math, Beijing 100088, Peoples R ChinaInst Appl Phys & Computat Math, Beijing 100088, Peoples R China
Chang, Li-Na
Luo, Shun-Long
论文数: 0引用数: 0
h-index: 0
机构:
Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R ChinaInst Appl Phys & Computat Math, Beijing 100088, Peoples R China
Luo, Shun-Long
Sun, Yuan
论文数: 0引用数: 0
h-index: 0
机构:
Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R ChinaInst Appl Phys & Computat Math, Beijing 100088, Peoples R China