Path: utzoo!mnetor!tmsoft!torsqnt!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!mcsun!unido!ecrc!micha
From: micha@ecrc.de (Micha Meier)
Newsgroups: comp.lang.prolog
Subject: Re: Heaps and other data structures (was: interesting exercise)
Message-ID: <1991Feb18.082552.18067@ecrc.de>
Date: 18 Feb 91 08:25:52 GMT
References: <1991Feb12.013413.24312@cs.ubc.ca> <4765@goanna.cs.rmit.oz.au> <1991Feb13.235655.6202@cs.ubc.ca> <17853@cs.utexas.edu> <1991Feb15.124544.5542@ida.liu.se>
Sender: news@ecrc.de
Reply-To: micha@ecrc.de (Micha Meier)
Organization: European Computer-Industry Research Centre
Lines: 20

In article <1991Feb15.124544.5542@ida.liu.se> felkl@aste16.Berkeley.EDU (Feliks Kluzniak) writes:
>
>Actually, this is quite easy.  Conventional implementations of Prolog
>will allow you to create cyclic structures. (But you must know what you
>are doing! In particular don't try to print them, and this includes
>using the debugger.)

This is not quite correct, there are Prolog systems (e.g. Sepia),
which allow you to set a bound on the depth of the terms being printed,
so that you can use even the debugger without any problems.
Besides that, any decent Prolog system allows to use portray/1
in the debugger so that you can decide yourself how deep
and in which form you want to print your infinite terms.

--Micha
--
E-MAIL  micha@ecrc.de            	MAIL	Micha Meier
						ECRC, Arabellastr. 17
                     				8000 Munich 81
						Germany