Return-Path: <kfoury@cs.bu.edu> Received: from cs.bu.edu (cs [128.197.12.2]) by cs3.bu.edu (8.12.11/8.12.11) with ESMTP id i9H43CDZ032663 for <cs520@cs3.bu.edu>; Sun, 17 Oct 2004 00:03:12 -0400 Received: from cs.bu.edu (h000c41248e2b.ne.client2.attbi.com [24.34.20.189]) (authenticated bits=0) by cs.bu.edu (8.12.2/8.12.2) with ESMTP id i9H439dF014379 for <cs520@cs.bu.edu>; Sun, 17 Oct 2004 00:03:09 -0400 (EDT) Message-ID: <4171EEFA.8090006@cs.bu.edu> Date: Sun, 17 Oct 2004 00:03:06 -0400 From: Assaf Kfoury <kfoury@cs.bu.edu> Organization: Boston University User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.6) Gecko/20040413 Debian/1.6-5 X-Accept-Language: en To: cs520 Course Account <cs520@cs.bu.edu> Subject: more on homework assignments and implementations Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-Spam-HitLevel: X-Spam-DCC: Servercave: cs3.bu.edu 1183; Body=2 Fuz1=2 Fuz2=2 X-Spam-Checker-Version: SpamAssassin 3.0.0 (2004-09-13) on cs3.bu.edu X-Spam-Level: X-Spam-Status: No, score=-0.6 required=10.0 tests=AWL,BAYES_00, RCVD_IN_NJABL_PROXY autolearn=no version=3.0.0 X-Spam-Pyzor: Reported 0 times. Status: RO X-Mozilla-Status: 8001 X-Mozilla-Status2: 00000000 X-UIDL: 411f69ec0000140b
Hello all,
After further discussion with Hongwei (who taught CS 520 last year) and
others, this is what we will do:
(1) Implementation #3 (the current one) will be the last in this
semester. It will be due on Monday, November 1 (not on October 25 as
previously announced).
(2) Problem Set 07 (to be posted on October 22 and due on November 1)
will consist of mandatory problems in addition to optional problems.
You will have a choice between doing the optional problems and
completing implementation #3.
(3) After Problem Set 07, all homework assignments will consist of only
mandatory problems, because there will be no implementation after
implementation #3.
[I need to justify this change in policy a little. I now think it was a
mistake to allow students in the class to use any language for their
implementations. I should have required all implementations to be in
SML, and then allowed students to use parsers already written in SML, so
that they would put most of their efforts into semantics aspects of the
interpretation of programming languages (evaluation, type-checking, and
type-inference) and not get bogged down in the syntactic analysis.
There are such parsers available for download from the webpages of CS
520 offered last year (Fall 2003), for various versions of the lambda
calculus (typed and untyped), and there is also a very similar
fully-written parser for the pure untyped lambda calculus in Chapter 8
of Paulson's book on SML. Paulson's book is the programming reference
for the course.]
[The theory of parsing is marginal to CS 520. More on parsers and how to
use them will be in the compiler course (CS 525) and the software
engineering course (CS 511), both of which will be offered in Spring 2005.]
Assaf
This archive was generated by hypermail 2b29 : Fri Nov 19 2004 - 17:00:43 EST