[Date Prev] [Date Next] [Thread Prev] [Thread Next] Date Index Thread Index Search archive:
Date:Mon Apr 7 23:51:55 1993 
Subject:Re: **** looking for implementation of unification algorithm **** 
From:Renga Sundararajan 
Volume-ID:930408.01 


>> Would it not be possible by some analysis akin to the application of
>> strictness analysis to the abolition of procrastination to *predict* that
>> an occurs check is not required? After all, the ways in which a clausal
>> variable can get into a data-structure are limited.

>> Robin Popplestone.

  This has been done. Earliest work is by David Plaisted on detecting
  when occurs-check is needed. This was followed by
  Jones and Sondergaard (I think) whose abstract interpretation-based
  analysis identifies head-goal unifcations where occurs-check can be
  safely omitted. In recent logic programming conferences, there were
  papers on "Programs not subject to occurs-check"

  If there is interest, I can dig up the references.

 Renganathan

----------------------------------------------------------------------------
Renga Sundararajan                      phone:  503-346-1380 (voice mail)
                                                503-346-4408 (C.I.S office)
Dept of Computer & Information Science	
University of Oregon			domain: renga@cs.uoregon.edu 
Eugene, OR, USA  97403-1202		fax:	503-346-5373
----------------------------------------------------------------------------


--

----------------------------------------------------------------------------
Renga Sundararajan                      phone:  503-346-1380 (voice mail)
                                                503-346-4408 (C.I.S office)
Dept of Computer & Information Science	
University of Oregon			domain: renga@cs.uoregon.edu 
Eugene, OR, USA  97403-1202		fax:	503-346-5373
----------------------------------------------------------------------------