Have you considered say proposing a class on theorem proving that uses coq? www.coq.inria.fr . Such a class would entail teaching how to program using the coq term language, which is itself a pure functional language, albeit one with some restrictions related to everything impure. As a matter of course in such a class you would naturally also mention that there are languages such as haskell which lack such restrictions/ have clever ways around them.
-Carter
On Sun, Aug 02, 2009 at 08:36:27AM -0400, Carter Schonwald wrote:I'm a faculty member (postdoc). I've been working in the field of automated
> are you a student (undergrad or grad) or faculty (junior or senior)? These
> are all very different scenarios and accordingly different goals are
> realistic.
theorem proving, but for about a year I'm also very interested in Haskell and
in general in the theory behind functional languages. Since I find FP to be a
very important programming concept, I'd like to achieve that we start teaching
it at the university.
Petr