English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

Superposition with Lambdas

MPS-Authors
/persons/resource/persons183227

Blanchette,  Jasmin Christian
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons217397

Tourret,  Sophie
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45689

Waldmann,  Uwe
Automation of Logic, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)

arXiv:2102.00453.pdf
(Preprint), 500KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Bentkamp, A., Blanchette, J. C., Tourret, S., Vukmirović, P., & Waldmann, U. (2021). Superposition with Lambdas. Retrieved from https://arxiv.org/abs/2102.00453.


Cite as: http://hdl.handle.net/21.11116/0000-0008-0A44-1
Abstract
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 $\lambda$-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.