Formalization of the Embedding Path Order for Lambda-Free Higher-Order Terms

Alexander Bentkamp 🌐

October 19, 2018

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This Isabelle/HOL formalization defines the Embedding Path Order (EPO) for higher-order terms without lambda-abstraction and proves many useful properties about it. In contrast to the lambda-free recursive path orders, it does not fully coincide with RPO on first-order terms, but it is compatible with arbitrary higher-order contexts.


BSD License


Session Lambda_Free_EPO