Bibliographic references on advantages of functional languages for refactoring

newer
Re: [Haskell-cafe] Discussion: The...

Nicola Gigante

23 Jun 2015 23 Jun '15

4:11 p.m.

Hi all, I’m writing my master thesis, which is not itself about functional programming but I use Haskell as the language chosen for the implementation of whatever I’m talking about. To motivate the choice more than “I like the language” I’m arguing that since I’m implementing experimental stuff and I’ll need to change the code and refactor very often, a strongly typed language is what I need. I wrote this sentence: "Strongly-typed programming eases the refactoring process by leveraging the compiler to spot wrong transformations before they turn into runtime bugs” Since this thesis is not itself about functional programming this sentence needs to be backed by something. In other words I need to cite some published paper where this is said/surveyed/proved/whatever. So the question: can you help me find referentiable published work relative to how strongly-typed functional programming eases refactoring? A survey or some case-study report or some functional pearl, dunno. Thank you very much in advance, Nicola

Show replies by date

Nicola Gigante

1 Jul 1 Jul

4:27 p.m.

New subject: Bibliographic references on advantages of functional languages for refactoring

...

Il giorno 23/giu/2015, alle ore 18:11, Nicola Gigante ha scritto:

Ping, anyone?

...

Hi all,

I’m writing my master thesis, which is not itself about functional programming but I use Haskell as the language chosen for the implementation of whatever I’m talking about.

To motivate the choice more than “I like the language” I’m arguing that since I’m implementing experimental stuff and I’ll need to change the code and refactor very often, a strongly typed language is what I need.

I wrote this sentence: "Strongly-typed programming eases the refactoring process by leveraging the compiler to spot wrong transformations before they turn into runtime bugs”

Since this thesis is not itself about functional programming this sentence needs to be backed by something. In other words I need to cite some published paper where this is said/surveyed/proved/whatever.

So the question: can you help me find referentiable published work relative to how strongly-typed functional programming eases refactoring? A survey or some case-study report or some functional pearl, dunno.

Thank you very much in advance,

Nicola

Alan & Kim Zimmerman

4:34 p.m.

New subject: Bibliographic references on advantages of functional languages for refactoring

Try http://www.cs.kent.ac.uk/projects/refactor-fp/ Alan On Wed, Jul 1, 2015 at 6:27 PM, Nicola Gigante wrote:

...

...
Il giorno 23/giu/2015, alle ore 18:11, Nicola Gigante < nicola.gigante@gmail.com> ha scritto:

Ping, anyone?

...
Hi all,

I’m writing my master thesis, which is not itself about functional programming but I use Haskell as the language chosen for the implementation of whatever I’m talking about.

To motivate the choice more than “I like the language” I’m arguing that since I’m implementing experimental stuff and I’ll need to change the code and refactor very often, a strongly typed language is what I need.

I wrote this sentence: "Strongly-typed programming eases the refactoring process by leveraging the compiler to spot wrong transformations before they turn into runtime bugs”

Since this thesis is not itself about functional programming this sentence needs to be backed by something. In other words I need to cite some published paper where this is said/surveyed/proved/whatever.

So the question: can you help me find referentiable published work relative to how strongly-typed functional programming eases refactoring? A survey or some case-study report or some functional pearl, dunno.

Thank you very much in advance,

Nicola

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe

Simon Thompson

9:52 p.m.

New subject: Bibliographic references on advantages of functional languages for refactoring

There’s also a discussion about it in this overview paper Refactoring tools for functional languages, Journal of Functional Programming / Volume 23 / Issue 03 / May 2013 http://journals.cambridge.org/repo_A90unxgK http://journals.cambridge.org/repo_A90unxgK Regards Simon

...

On 1 Jul 2015, at 17:34, Alan & Kim Zimmerman wrote:

Try http://www.cs.kent.ac.uk/projects/refactor-fp/ http://www.cs.kent.ac.uk/projects/refactor-fp/

Alan

On Wed, Jul 1, 2015 at 6:27 PM, Nicola Gigante mailto:nicola.gigante@gmail.com> wrote:

...
Il giorno 23/giu/2015, alle ore 18:11, Nicola Gigante mailto:nicola.gigante@gmail.com> ha scritto:

Ping, anyone?

...
Hi all,

I’m writing my master thesis, which is not itself about functional programming but I use Haskell as the language chosen for the implementation of whatever I’m talking about.

To motivate the choice more than “I like the language” I’m arguing that since I’m implementing experimental stuff and I’ll need to change the code and refactor very often, a strongly typed language is what I need.

I wrote this sentence: "Strongly-typed programming eases the refactoring process by leveraging the compiler to spot wrong transformations before they turn into runtime bugs”

Since this thesis is not itself about functional programming this sentence needs to be backed by something. In other words I need to cite some published paper where this is said/surveyed/proved/whatever.

So the question: can you help me find referentiable published work relative to how strongly-typed functional programming eases refactoring? A survey or some case-study report or some functional pearl, dunno.

Thank you very much in advance,

Nicola

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org mailto:Haskell-Cafe@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe

Alexander Berntsen

23 Jul 23 Jul

3:36 p.m.

New subject: Bibliographic references on advantages of functional languages for refactoring

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA512 On 23/06/15 18:11, Nicola Gigante wrote:

...

So the question: can you help me find referentiable published work relative to how strongly-typed functional programming eases refactoring? My master thesis[0] sort of concluded that refactoring is simpler in haskell than c++.

[0] https://github.com/alexander-b/master-thesis - -- Alexander alexander@plaimi.net https://secure.plaimi.net/~alexander -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQIcBAEBCgAGBQJVsQnqAAoJENQqWdRUGk8ByXQP/iVxzRpY6RpbeehiG4hTbONw z1XpGjVz2i5xpPc+QrsB9RWw2XO2Ay6mOU2jPK2k+nU9a81d/2VnrdROAOG4ZTfy 2Emt1v7PgugCtyaUoDAoZ4Gff4kTCwoGOBuXJDSaKA1xhIDA15pDlCMTpp76mINC ff7zYVG//SFztetZOo8wawNWOby64X5KlTGj2+daxVIdAFckod6clOZwUt4PjD/Z JRG0sAjCKN/EndDoErLUrW7gH/t7SLYPDlKn9xOPkKQAuoqm3U+gpXOlVbAKQE/v KNlnRf6DKfAqUHmW5Lfk4z1GqaX9I12Ke4jBMI6xXeDaUK0bFNJB50t3PcbLKWtw CrRVgvvIF8Rshq3rO4MgznvI8++kOQOfGNqvcdaijoda+SZOekAH236GXrl4zZ/0 LccChwZeK0jIBbl7SqSlfT4F603s5hyX66WCyYHR2c9aR2C4jlFYJEAs5kwQIV6P r84Oy+35cpqhfW4wS1g0hgNF+UR1zmCrI5xH6mLlXhILDBad+8cho1mkOLgO6gmY IeeOjlEOrCtjQqLze8XjnMxV2YvVmZ0CWRpTTelAxnR4aeClZ9pW9G4R4WniJKSw 3Cmq8RkFSEpDa5DlJWLzRaE84Ba40XpaG5NdYpBBxq0HPUaJa1yAi7ipAta13Ecd MOeCGB4GSV3NjiUgsWZS =9Mwn -----END PGP SIGNATURE-----

3638

Age (days ago)

3668

Last active (days ago)

List overview

Download

4 comments

4 participants

participants (4)

Alan & Kim Zimmerman
Alexander Berntsen
Nicola Gigante
Simon Thompson