University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > Zeno: An automated theorem prover for functional programs

Zeno: An automated theorem prover for functional programs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact William Denman.

Zeno is a new tool for verifying simple properties of Haskell programs through induction and other techniques, which outputs completed proofs to Isabelle. In a comparison with the rippling based tool IsaPlanner and the industrial strength tool ACL2s, using a test suite from the IsaPlanner website, we found that Zeno could prove, in a timely manner, strictly more properties than either. In this talk I will run through an example proof in Zeno and discuss the heuristics we apply to select proof steps and control the search space, along with an interactive demo. You can try our tool out online at

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity