### Abstract

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.

### License

BSD License

### Topics

- Logic/Rewriting

### Session Lambda_Free_EPO

- Embeddings
- Chop
- Lambda_Free_EPO

### Depends on

- Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms

## Cite

×

Lambda_Free_EPO-AFP

    @article{Lambda_Free_EPO-AFP,
      author  = {Alexander Bentkamp},
      title   = {Formalization of the Embedding Path Order for Lambda-Free Higher-Order Terms},
      journal = {Archive of Formal Proofs},
      month   = {October},
      year    = {2018},
      note    = {\url{https://isa-afp.org/entries/Lambda_Free_EPO.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 18, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Oct 21, 2018 : Isabelle2018