🚀 go-pugleaf

Familiarity with basic discrete mathematics is recognised as an essential
foundation for studying Computing Science. However, many new undergraduates
are unprepared for this and lack motivation to study hard in this area.

So, I am collecting information related to

 Teaching Discrete Mathematics in Computing Science

In particular, I am interested in hearing about experience, advice, 
other surveys on the following:-

1) Methods used in teaching discrete mathematics.
   ----------------------------------------------
   E.g. self-paced learning, Keller, small groups,
   peer tutoring, personalised individual instruction, use of technology
   (e.g for monitoring, assessing, use of bulletin boards, ...)

2) Linking Declarative programming with teaching discrete mathematics.
   -------------------------------------------------------------------
   [I have recently seen a summary collated by Howard Goodman on
    'Animation of formal specifications in a functional language' from
    newsgroups comp.specification.z,comp.lang.functional,comp.specification]

3) Other software support for discrete maths.
   ------------------------------------------
   (Elementary and advanced:- Theorem provers,
    Formal System Development tools, ....)
   [I have recently seen a list collated by Paolo Ciancarini relevant to this
    from newsgroup comp.specification]

Please send any information you think might be useful directly
to me:-


Chris Reade
*---------------------------------------------.
|  email: Chris.Reade@brunel.ac.uk            |
|*---------------------------------------------.
||    Dr. C.M.P.Reade,                         |
||    Department of Computer Science,          |
||    Brunel University,                       |
||    Uxbridge,                                |
||    Middlesex UB8 3PH                        |
*|    U.K.                                    /
 *-------------------------------------------'