[Haskell-cafe] funct.prog. vs logic prog., practical Haskell
carter.schonwald at gmail.com
Sun Aug 2 09:03:14 EDT 2009
Have you considered say proposing a class on theorem proving that uses coq?
www.*coq*.inria.fr <http://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.
On Sun, Aug 2, 2009 at 8:52 AM, Petr Pudlak <deb at pudlak.name> wrote:
> On Sun, Aug 02, 2009 at 08:36:27AM -0400, Carter Schonwald wrote:
> > are you a student (undergrad or grad) or faculty (junior or senior)?
> > are all very different scenarios and accordingly different goals are
> > realistic.
> I'm a faculty member (postdoc). I've been working in the field of automated
> theorem proving, but for about a year I'm also very interested in Haskell
> in general in the theory behind functional languages. Since I find FP to be
> very important programming concept, I'd like to achieve that we start
> it at the university.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe