Success!

My thesis has been successfully defended. Have a look at:

• My final report
• The slides presented at my defense
• My test cases and example programs
• My patch to GHC 6.12
• My patch to the GHC base package
• My patch to the GHC array package
• My patch to the GHC containers package
• My patch to the GHC unix package

Defense Scheduled

My defense is scheduled for Tuesday, July 27, at 3:00 p.m. My report is now available online. It is not necessarily in its final form, yet.

The Approved Proposal

Okay, so I got the proposal approved a few weeks ago, but I have been too busy doing productive work to write about it here. I'll summarize the proposal in this post. To write a program exclusively with total functions, some restriction on recursion must be enforced. In my system, this restriction can be summarized as that recursion must be syntactically structural. This means that the argument of a recursive call must have been bound by a pattern-matching deconstruction of the actual parameter. My proposal is to implement this rule, along with a few other necessary details, as a GHC language extension, to provide a total standard library, and to write certain example programs in the total discipline. I will then attempt to draw conclusions about what further work is necessary to make total functional programming practical. Of course, there are many details that I've left out here. It's especially interesting to see how the concept of syntactic structural recursion must be expanded to deal with functions of higher arity, higher-order functions, and mutual recursion.

Welcome

I am a student in the Department of Computer Science at the Rochester Institute of Technology. I am currently in the process of getting my MS thesis proposal approved. This will be happening any day now, at which time I will post the proposal online and write more about the work I've already done. For now, I will leave you with just the title, "Practical Programming with Total Functions."