From jan@swi.psy.uva.nl Tue Mar 20 10:43:39 2001
Received: from gollem.swi.psy.uva.nl (root@gollem [145.18.152.30])
	by swi.psy.uva.nl (8.11.2/8.11.2) with ESMTP id f2K9hcZ03108;
	Tue, 20 Mar 2001 10:43:38 +0100 (MET)
Received: (from jan@localhost)
	by gollem.swi.psy.uva.nl (8.9.3/8.9.3/SuSE Linux 8.9.3-0.1) id KAA19373;
	Tue, 20 Mar 2001 10:43:38 +0100
Date: Tue, 20 Mar 2001 10:43:38 +0100
Message-Id: <200103200943.KAA19373@gollem.swi.psy.uva.nl>
From: Jan Wielemaker <jan@swi.psy.uva.nl>
Subject: Re: [SWIPL] type checking / inference for SWI
To: "Bernd Fischer" <fisch@ptolemy.arc.nasa.gov>,
   "SWI Prolog (list)" <prolog@swi.psy.uva.nl>
In-Reply-To: Bernd Fischer's message of Mon, 19 Mar 2001 18:48:07 -0800
Phone: +31 - 20 - 525 6121

> is there any implementation of the Mycroft/O'Keefe type inference which
> works for (full) SWI? Or any other good type checker / inference system?
> Do these beasts handle all the nasty stuff as =.. and call?

Not that I know of.  I would definitely be interested in serious
compile-time analysis stuff.

There is a cross-referencer that does a fairly good job on modules
that is used by the PceEmacs colouring in
xpce/prolog/lib/emacs/prolog_xref.pl

	--- Jan

