Javascript Interactive Higher-Order Theorem Prover

Automated Reasoning in Higher Order Logic

Automated Reasoning in Higher Order Logic

Math Gate

Scunak

This page was created and is maintained by Chad E Brown.

Here's an example of a third-order matching problem with a solution which is not ground

Consider the problem F(lambda x . a) =? a

A solution is F |-> lambda x . x Y, which is not ground.

This example is on p. 66 of Prehofer 98.