runtimeverification / runtimeverification/haskell-backend
SMT type needs new representation
Nobody has claimed this yet.
- Dominant language
- Haskell
- Stars
- 224
- Forks
- 43
- PR merge metrics
- No merged PRs in 30d
Description
Now we have SMT a ~ Maybe Solver -> LoggerT IO a. I'm wondering if the SMT action itself makes sense when there's no solver, basically we might actually want something like SMT a ~ Maybe (Solver -> LoggerT IO a).
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 locating the SMT type definition and its usages, especially the Solver and LoggerT IO composition described in the issue. Determine whether the intended representation is Maybe (Solver -> LoggerT IO a), then identify the affected callers and tests; done means the chosen representation is implemented consistently and its behavior is covered.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- backend
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100