Path: utzoo!mnetor!uunet!husc6!tut.cis.ohio-state.edu!uwmcsd1!ig!agate!ucbvax!CE.HP.COM!wunder%hpcerb
From: wunder%hpcerb@CE.HP.COM (Walter Underwood)
Newsgroups: comp.ai.digest
Subject: AIList V6 #48 - Constraint Languages & TK!Solver
Message-ID: <8803082102.AA16881@hpcerb>
Date: 8 Mar 88 21:02:16 GMT
Sender: usenet@ucbvax.BERKELEY.EDU
Organization: The Internet
Lines: 14
Approved: ailist@kl.sri.com

Wm Leler's book discusses TK!Solver's algorithms and deficiencies,
and uses the same contraint program as an example for his language,
Bertrand.  He also discusses the systems mentioned in other articles
here: Sketchpad, ThingLab, IDEAL, Steele's work, and others that I
can't remember right now.

The main contribution of Wm's work is a firm theoretical foundation
for constraint languages, plus the implementation work to make them
run fast.  He shows Turing equivalence, shows how to add constraints
to enforce datatypes, etc.

Bertrand is implemented in Scheme.

Walter Underwood