Article View: comp.lang.prolog
Article #2151Recursive program fixpoint as a term
From: Greg Bond
Date: Mon, 21 Dec 1992 17:35
Date: Mon, 21 Dec 1992 17:35
8 lines
775 bytes
775 bytes
In the discussion concerning the occurs check, two respondents mentioned representing recursive program fixpoints as terms. Could someone give me some references on this topic? -- Greg Bond -----> bond@sce.carleton.ca (613) 788 2600 (ext.1835) Dept. of Systems and Computer Engineering, Carleton University Ottawa, ON, Canada K1S 5B6
Technical Details
Message-ID:
<bond.724959323@regulus.sce.carleton.ca>Path:
arc1-ca.pugleaf.net!sparky!uunet!noc.near.net!hri.com!spool.mu.edu!uwm.edu!zaphod.mps.ohio-state.edu!cs.utexas.edu!torn!nott!cunews!bondShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!noc.near.net!hri.com!spool.mu.edu!uwm.edu!zaphod.mps.ohio-state.edu!cs.utexas.edu!torn!nott!cunews!bond From: bond@sce.carleton.ca (Greg Bond) Newsgroups: comp.lang.prolog Subject: Recursive program fixpoint as a term Message-ID: <bond.724959323@regulus.sce.carleton.ca> Date: 21 Dec 92 17:35:23 GMT Sender: news@cunews.carleton.ca (News Administrator) Organization: Carleton University Lines: 10