Article View: comp.lang.prolog
Article #195Re: call/n (was finding min/max no. from a list)
From: Fernando Pereira
Date: Tue, 14 Apr 1992 13:57
Date: Tue, 14 Apr 1992 13:57
17 lines
1386 bytes
1386 bytes
In article <10207@goanna.cs.rmit.oz.au> ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe) writes: >If you stare at examples like this long enough, you suddenly realise >that the last two arguments are _exactly_ the CP and CE registers of >the WAM, and that the only difference between this "optimised" binary >Prolog and the WAM is that the continuation environments are kept on >the heap instead of on a special continuation stack. Rather like the relationship between continuation-passing and stack-based implementations of a functional language, isn't it? I wonder what interesting variations for Prolog implementation might be hidden in the most recent literature on CP-style compilation, such as Andrew Appel's book... Fernando Pereira 2D-447, AT&T Bell Laboratories 600 Mountain Ave, PO Box 636 Murray Hill, NJ 07974-0636 pereira@research.att.com
Technical Details
Message-ID:
<22569@alice.att.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!rutgers!att!att!dptg!ulysses!andante!alice!pereiraReferences:
<1992mar23.124535.88051@link-1.ts.bcc.ac.uk> <1992Apr10.225619.20691@quintus.com> <10207@goanna.cs.rmit.oz.au>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!rutgers!att!att!dptg!ulysses!andante!alice!pereira From: pereira@alice.att.com (Fernando Pereira) Newsgroups: comp.lang.prolog Subject: Re: call/n (was finding min/max no. from a list) Message-ID: <22569@alice.att.com> Date: 14 Apr 92 13:57:48 GMT References: <1992mar23.124535.88051@link-1.ts.bcc.ac.uk> <1992Apr10.225619.20691@quintus.com> <10207@goanna.cs.rmit.oz.au> Reply-To: pereira@alice.UUCP () Organization: AT&T, Bell Labs Lines: 17