Newsgroups: comp.lang.prolog
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!europa.eng.gtefsd.com!howland.reston.ans.net!EU.net!uknet!festival!dcs.ed.ac.uk!smk
From: smk@dcs.ed.ac.uk (Stefan Kahrs)
Subject: Re: Rational Infinite Trees
In-Reply-To: mark@omnifest.uwm.edu's message of 5 Sep 1994 13:07:24 -0500
Message-ID: <SMK.94Sep12174309@may.dcs.ed.ac.uk>
Sender: cnews@dcs.ed.ac.uk (UseNet News Admin)
Organization: University of Edinburgh, LFCS
References: <34fmos$572@omnifest.uwm.edu>
Date: Mon, 12 Sep 1994 17:43:09 GMT
Lines: 30

In article <34fmos$572@omnifest.uwm.edu> mark@omnifest.uwm.edu (Mark Hopkins) writes:

%       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.

Examples

(i)
Cardone/Coppo "Two extensions of Curry's Type Inference System"
in P. Odifreddi (ed.) "Logic and Computer Science", Academic Press 1990.
The "recursive types" extension uses regular trees.

(ii)
Ariola/Klop "Cyclic Lambda Graph Rewriting"
in proceedings LICS'94.  That doesn't even mention regular trees
(as far as I remember), but "trees+cycles" is exactly the same thing.

(iii)
Goubalt/Hankin "A Lattice for the Abstract Interpretation of Term
Graph Rewriting Systems" in Sleep/Plasmeijer/van Eekelen "Term Graph
Rewriting", John Wiley 1993

An earlier reference is
	Courcelle "Fundamental properties of infinite trees"
	TCS 25, 95-169 (1983)

--
Stefan Kahrs
