Post #3005539

Here's a fun past time. What's the shortest Agda program you can write that proves false? Constraints: 1. It must typecheck with `agda --safe` + any other flags you like 2. It must construct a term that inhabits an obviously empty type