Superposition with Lambdas - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Superposition with Lambdas


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 βη-equivalence classes of λ-terms and rely on higher-order unification to achieve refuta-tional 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.
Fichier principal
Vignette du fichier
conf.pdf (472.54 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02296038 , version 1 (24-09-2019)



Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović, Uwe Waldmann. Superposition with Lambdas. CADE-27 - The 27th International Conference on Automated Deduction, Aug 2019, Natal, Brazil. pp.55-73, ⟨10.1007/978-3-030-29436-6_4⟩. ⟨hal-02296038⟩
87 View
153 Download



Gmail Mastodon Facebook X LinkedIn More