Newsgroups: comp.lang.prolog
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!news.duke.edu!news-feed-1.peachnet.edu!gatech!newsxfer.itd.umich.edu!nntp.cs.ubc.ca!fornax!jamie
From: jamie@cs.sfu.ca (Jamie Andrews)
Subject: Re: Rational Infinite Trees
Message-ID: <1994Sep6.182658.8408@cs.sfu.ca>
Organization: Faculty of Applied Science, Simon Fraser University
References: <34fmos$572@omnifest.uwm.edu>
Date: Tue, 6 Sep 1994 18:26:58 GMT
Lines: 15

In article <34fmos$572@omnifest.uwm.edu>,
Mark Hopkins <mark@omnifest.uwm.edu> wrote:
>   Who else besides Colmerauer (in his formulation of Prolog-II) does
>something with rational infinite trees?  Or larger classes of infinite
>trees?  In his presentations he provided no prior references to the
>concept.

     Well, they're basically a subset of the labelled directed
graphs... but I haven't seen any earlier references to building
a new logic by taking FOL and replacing FOL-style terms with
them.  Perhaps the folks on sci.logic would know.

--Jamie.
  jamie@cs.sfu.ca
"Make sure Reality is not twisted after insertion"
