Re: Info on translating functional programming to PROLOG

Article View: comp.lang.prolog

Article #603

#603

From: Sanjai Narain
Date: Mon, 19 Mar 1990 00:49

9 lines
804 bytes

The LOG(F) system is based upon translating a first-order, lazy functional
language into efficient Prolog. It is shown how the SK rules of combinatory
logic can be expressed in this language. Thus, there is a basis for lazily
reducing expressions in a higher-order functional language, using Prolog.
Papers on it and the software can be obtained upon request from me.

Regards.

Sanjai Narain

Technical Details

Message-ID: <2459@randvax.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!mailrus!ncar!ico!ism780c!randvax!narain

References: <837@theseas>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!mailrus!ncar!ico!ism780c!randvax!narain
From: narain@randvax.UUCP (Sanjai Narain)
Newsgroups: comp.lang.prolog
Subject: Re: Info on translating functional programming to PROLOG
Keywords: PROLOG, KRC, lambda calculus, Miranda
Message-ID: <2459@randvax.UUCP>
Date: 19 Mar 90 00:49:11 GMT
References: <837@theseas>
Organization: Rand Corp., Santa Monica, Ca.
Lines: 9

Reply to Parent Message