# Tree Neural Networks in HOL4

arXiv: https://arxiv.org/abs/2009.01827 · HTML: https://mlsanity.com/paper/2009.01827/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 3 Sep 2020.

## Built on by (most cited first, 2 of 2)

- [Learning Program Synthesis for Integer Sequences from Scratch](https://mlsanity.com/paper/2202.11908/) (2022)
- [Learning Equational Theorem Proving](https://mlsanity.com/paper/2102.05547/) (2021)

## Abstract (arXiv)

We present an implementation of tree neural networks within the proof assistant HOL4. Their architecture makes them naturally suited for approximating functions whose domain is a set of formulas. We measure the performance of our implementation and compare it with other machine learning predictors on the tasks of evaluating arithmetical expressions and estimating the truth of propositional formulas.