An LLM-based multi-agent system for Haskell refactoring reports reduced cyclomatic complexity and memory allocation on two codebases, but the evaluation lacks reproducibility and contains inconsistent numbers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SE 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Distributed Approach to Haskell Based Applications Refactoring with LLMs Based Multi-Agent Systems
An LLM-based multi-agent system for Haskell refactoring reports reduced cyclomatic complexity and memory allocation on two codebases, but the evaluation lacks reproducibility and contains inconsistent numbers.