another wish: checking for unbound identifiers

From: Christian Lynbech <lynbech_at_daimi.aau.dk>
Date: Mon, 29 Apr 1996 11:36:23 +0200

>>>>> "Rob" == Rob DeLine <rdeline_at_cs.cmu.edu> writes:

Rob> The software I work on consists of 8000 lines of STklos code and takes a
Rob> minute or so to load. There's nothing more frustrating than waiting for it
Rob> to load, playing with it for a minute, and then having it crash because of
Rob> a small typo in the code.

This functionality does not need to be built in to STk, it could be
provided by a separate tool you just run (ala C lint) to check the
code. I believe there exists several possibilities. One is to use one
of the existing scheme compilers such as `hobbit' or `stalin' to check
the code.

You may also want to check out Andrew K. Wright's thesis "Practical
Soft Typing". I still have to get round to reading it, but he
describes ways to lay down a type-discipline on top of standard
scheme. This is probably beyond your immediate requirements, but there
is also a tool to go along with the thesis. And since he graduated
from Rice, it may even be somewhat integrated with the DrScheme
mentioned by Lars Thomas Hansen.

Check out the ftp site at /anonymous_at_cs.rice.edu:/public/wright.


---------------------------+--------------------------------------------------
Christian Lynbech | Computer Science Department, University of Aarhus
Office: R0.32 | Ny Munkegade, Building 540, DK-8000 Aarhus C
Phone: +45 8942 3218 | lynbech_at_daimi.aau.dk -- www.daimi.aau.dk/~lynbech
---------------------------+--------------------------------------------------
Hit the philistines three times over the head with the Elisp reference manual.
                                        - petonic_at_hal.com (Michael A. Petonic)
Received on Mon Apr 29 1996 - 11:39:14 CEST