Zippy -- Generic White-Box Proof Search with Zippers
Logic in Computer Science
2025-03-27 v1 Programming Languages
Abstract
We present a framework for tree-based proof search, called Zippy. Unlike existing proof search tools, Zippy is largely independent of concrete search tree representations, search-algorithms, states and effects. It is designed to create analysable and navigable proof searches that are open to customisation and extensions by users. Zippy is founded on concepts from functional programming theory, particularly zippers, arrows, monads, and lenses. We implemented the framework in Isabelle's metaprogramming language Isabelle/ML.
Keywords
Cite
@article{arxiv.2503.20413,
title = {Zippy -- Generic White-Box Proof Search with Zippers},
author = {Kevin Kappelmann},
journal= {arXiv preprint arXiv:2503.20413},
year = {2025}
}