Article View: comp.lang.prolog
Article #2145Re: Occurs check
From: Matthew Huntbach
Date: Mon, 21 Dec 1992 09:33
Date: Mon, 21 Dec 1992 09:33
11 lines
1042 bytes
1042 bytes
In article <1992Dec18.190711.1063@quintus.com> ludemann@quintus.com (Peter Ludemann) writes: >Without the occurs check, "infinite" or "rational" terms can be produced. >I've seen one practical use for them, for representing the fixpoint >of a recursive program as a term. No doubt, there are other uses. > Yes, that's one of the things I use them for. I'm working on a partial evaluator which allows for infinite terms, and partially eveluates them away to produce recursive logic programs. Matthew Huntbach
Technical Details
Message-ID:
<1992Dec21.093351.4371@dcs.qmw.ac.uk>Path:
arc1-ca.pugleaf.net!sparky!uunet!pipex!bnr.co.uk!uknet!qmw-dcs!mmhReferences:
<24435@alice.att.com> <1992Dec17.185017.17766@cs.uoregon.edu> <1992Dec18.190711.1063@quintus.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!pipex!bnr.co.uk!uknet!qmw-dcs!mmh From: mmh@dcs.qmw.ac.uk (Matthew Huntbach) Newsgroups: comp.lang.prolog Subject: Re: Occurs check Message-ID: <1992Dec21.093351.4371@dcs.qmw.ac.uk> Date: 21 Dec 92 09:33:51 GMT References: <24435@alice.att.com> <1992Dec17.185017.17766@cs.uoregon.edu> <1992Dec18.190711.1063@quintus.com> Sender: usenet@dcs.qmw.ac.uk (Usenet News System) Organization: Computer Science Dept, QMW, University of London, UK. Lines: 11 Nntp-Posting-Host: coffee.dcs.qmw.ac.uk