DeepAI AI Chat
Log In Sign Up

Superposition with Lambdas

01/31/2021
by   Alexander Bentkamp, et al.
0

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 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/10/2021

Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses

Higher-order constrained Horn clauses (HoCHC) are a semantically-invaria...
09/21/2022

Capturing Bisimulation-Invariant Exponential-Time Complexity Classes

Otto's Theorem characterises the bisimulation-invariant PTIME queries ov...
09/06/2022

A Generic Type System for Higher-Order Ψ-calculi

The Higher-Order Ψ-calculus framework (HOΨ) is a generalisation of many ...
05/07/2015

LeoPARD --- A Generic Platform for the Implementation of Higher-Order Reasoners

LeoPARD supports the implementation of knowledge representation and reas...
11/05/2021

Choreographies as Functions

We propose a new interpretation of choreographies as functions, whereby ...
08/24/2021

On Decidability of the Bisimilarity on Higher-order Processes with Parameterization

Higher-order processes with parameterization are capable of abstraction ...
05/13/2022

Lash 1.0 (System Description)

Lash is a higher-order automated theorem prover created as a fork of the...