test-->>∃ #:steps n passes test if n > than the number of actual reduction steps for a term.
Nobody has claimed this yet.
- Dominant language
- Racket
- Stars
- 112
- Forks
- 42
- PR merge metrics
- No merged PRs in 30d
Description
I noticed in the redex reference that the default #:steps value is 1000.
However, would it be useful if this specific case maybe fails since the reduction
require much smaller number of steps.
(test-->>∃ #:steps 8 ->*
(term (λ (x : Nat) (car (cons (+ 1 2) 2))))
(term (λ (x : Nat) 3)))
Contributor guide
No contributing guide indexed for this repository
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 by reading the Redex reference entry for #:steps and the existing tests for test-->>∃. Reproduce the supplied example to establish its current behavior, then determine the intended rule for cases where the bound exceeds the actual reduction steps. Done means the behavior is agreed and covered by a regression test.
Written by the indexing model from the issue text.
Assessment
- Domain
- testing
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100