`reduce` does not recurse into binder types
Nobody has claimed this yet.
- Dominant language
- Lean
- Stars
- 9.2k
- Forks
- 990
- Avg merge
- 1d 17h
- Merged PRs (30d)
- 175
Description
Prerequisites
Please put an X between the brackets as you perform the following steps:
- Check that your issue is not already filed:
https://github.com/leanprover/lean4/issues - Reduce the issue to a minimal, self-contained, reproducible test case.
Avoid dependencies to Mathlib or Batteries. - Test your test case against the latest nightly release, for example on
https://live.lean-lang.org/#project=lean-nightly
(You can also use the settings there to switch to “Lean nightly”)
Description
reduce does not recurse into binder types, even with skipTypes := false. As a result, the expression computed by reduce is not the input expression's normal form (at the given transparency).
MWE:
import Lean
open Lean Lean.Meta
def Foo := True
def Bar := Foo → Foo
run_meta do
logInfo $ ← reduceAll (.const ``Bar [])
-- Foo → True
Versions
"4.15.0-nightly-2024-11-14"
Impact
Add 👍 to issues you consider important. If others are impacted by this issue, please ask them to add 👍 to it.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the minimal example in the issue and trace Lean.Meta.reduceAll, focusing on how binder types are handled when skipTypes := false. Confirm the current output and make the behavior recurse into those types so the result is the normal form, then rerun the reproducer.
Written by the indexing model from the issue text.
Assessment
- Domain
- compilers
- Issue type
- Bug
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 45/100