From: glimming@kth.se   
      
   Dear AI researchers,   
      
   I am a research student at Stockholm University and I have fornally   
   developed a notion of recursion   
   on objects, this is defined in category theory/denotational semantics   
   as a universal construction.   
      
   I wonder if you have any examples of algorithms which are   
   self-mutating, or which must compute on a data-set that includes   
   operations (as opposed to values). For example, a graph where each node   
   contains not just values but also functions/operations, would fall into   
   this class of data. Ideally, the algorithm itself must change during   
   the computation, but this is not a requirement for an example.   
      
   Textbooks algorithms such as graph algorithms does not seem to fall   
   into this category, and I very much need to find some good examples of   
   this recursion principle in practise.   
      
   (I do have other examples, but they are more oriented to programming   
   methodology and to the theory of object-oriented programs (e.g.   
   inheritance can be captured with this scheme).)   
      
   PS. Forgive me for these slightly wild claims. This is on-going   
   research and my opinion on these matters may change (or be reinforced,   
   I hope)!   
      
   Best Wishes   
   Johan Glimming   
   http://www.glimming.com/   
      
   In case you answer, please do send me a carbon copy (cc:) to   
   glimming--AT--kth.se because I am not a frequent reader groups.   
      
   [ comp.ai is moderated.  To submit, just post and be patient, or if ]   
   [ that fails mail your article to , and ]   
   [ ask your news administrator to fix the problems with your system. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)