10 citations · 21 across the 8 of their papers we have counts for
3 papers · 1 filter
Refactoring = Substitution + Rewriting
Simon Thompson, Dániel Horpácsi
We present an approach to describing refactorings that abstracts away from particular refactorings to classes of similar transformations, and presents an implementation of these th…
Program Equivalence in an Untyped, Call-by-value Lambda Calculus with Uncurried Recursive Functions
Dániel Horpácsi, Péter Bereczky, Simon Thompson
We aim to reason about the correctness of behaviour-preserving transformations of Erlang programs. Behaviour preservation is characterised by semantic equivalence. Based upon our e…
Towards Trustworthy Refactoring in Erlang
Dániel Horpácsi, Judit Kőszegi, Simon Thompson
Tool-assisted refactoring transformations must be trustworthy if programmers are to be confident in applying them on arbitrarily extensive and complex code in order to improve styl…