Ulrich Scholz wrote: > Dear all, > > I have the problem to represent and manipulate formulas of some first-order > language. The manipulations include the anotation of nodes with further > information and the removal of nodes (simplifications). > > Which data structure would you suggest for this task? How would you perform > the updates? > > For me, this pretty much looks like a task for some imperative language but > I'm sure there is a good way to do it in (ECLiPSe) Prolog. Sounds like a perfect task for a logic programming language. You do tree rewriting, i.e. traverse one tree and construct another one. -- Joachim Schimpf / phone: +44 20 7594 8187 IC-Parc / mailto:J.Schimpf@imperial.ac.uk Imperial College London / http://www.icparc.ic.ac.uk/eclipseReceived on Wed Apr 13 16:53:39 2005
This archive was generated by hypermail 2.1.8 : Wed 16 Nov 2005 06:07:35 PM GMT GMT