Discrete Maths Teaching

Thread View: comp.specification

2 messages

[T] Back to Threads [V] Tree View [G] Group Articles

2 total messages Started by Chris M P Reade Tue, 27 Oct 1992 12:49

Author: Chris M P Reade
Date: Tue, 27 Oct 1992 12:49

46 lines
2381 bytes

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.                                    /
 *-------------------------------------------'

Re: Discrete Maths Teaching

#19

Author: Jean-Pierre JACQUOT
Date: Tue, 03 Nov 1992 17:30

33 lines
1532 bytes

You may have a look at ISETL.

It is an interpreted implementation of SETL. It has been created to
support the course in discrete math which is described in the lecture
book:
       Teaching Discrete Mathematics with ISETL
       N. Baxter, E. Dubinsky, G. Levin
       1989 Springer-Verlag.

The book is really interesting.

The interpretor is very good for education purposes (we use it since 3
years for our introductory computer science course). Among its
qualities:
  - the implementation is correct and contains all interesting
features of SETL
  - it is sufficiently robust and simple to use for students
  - it runs on PC, MAc, UNIX, ... (the sources of version 3 are
available)
  - it is freely distributable (version 3) for education purposes.


Jean-Pierre Jacquot


==============================================================================
Jean-Pierre JACQUOT        CRIN (Centre de Recherche en Informatique de Nancy)
e-mail: jacquot@loria.fr
post:   CRIN   B.P. 239   F-54506 Vandoeuvre-les-Nancy Cedex   FRANCE
phone:  +33  83.91.23.89
fax:    +33  83.41.30.79
==============================================================================

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads