Maddy Bowers

New puzzle

2

```python def sat(xs: List[int]): return len(xs) == 7 and xs == xs[::-1] and sum(xs[:2]) == sum(xs[2:]) and all([x!=0 for x in xs]) ``` Solution hidden below so that other people...

Preserve Beta-Normal Eta-Long Form

6

# Beta-normal eta-long form This is the form that dreamcoder programs are in. - `beta-normal`: there are no redexes aka no unapplied lambdas aka nothing of the form `(lambda body)...

Not that we dont want that - but i think we should include both

is there a new extra startup delay before anything gets printed? look into that

- typecheck at the end. Maybe do it as an assertion because if it failed that might indicate that some of our pruning is pruning wrong. I dont think abstractions...

remove `parking_lot` dependency

1

[Rust Mutexs were made much faster in 1.62.0](https://blog.rust-lang.org/2022/06/30/Rust-1.62.0.html#thinner-faster-mutexes-on-linux) meaning `parking_lot` might no longer provide any benefit. Parking lot is a fairly bulky dependency so it'd be nice to get rid...

Two ways to tighten upper bound

1

Two alternatives that I think might be pretty effective at tightening the bound: 1. We can tighten the local upper bound at each location using any arguments that have already...

This only could affect claim-1 results and none of those results are messed up in this way bc we didnt use these values, but we should make the following printouts...

Right now we only do the inv_candidates==1 case since that's such a major focus of this work and we never really look a `cfg.inv_candidates > 1`, however note that due...