home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.prolog
- Path: sparky!uunet!mcsun!sunic!corax.udac.uu.se!corax.udac.uu.se!jonas
- From: jonas@csd.uu.se (Jonas Barklund)
- Subject: Re: Common courtesy
- In-Reply-To: ken@aiai.ed.ac.uk's message of 11 Aug 92 10:21:56 GMT
- Message-ID: <1992Aug21.124400.19225@corax.udac.uu.se>
- Followup-To: comp.lang.prolog
- Sender: news@corax.udac.uu.se
- Organization: Uppsala University, Sweden
- References: <SWK.92Aug10220513@seymour.mlb.semi.harris.com> <189@syllogi.syllogic.nl>
- <7141@skye.ed.ac.uk>
- Date: Fri, 21 Aug 1992 12:44:00 GMT
- Lines: 28
-
- In article <7141@skye.ed.ac.uk> ken@aiai.ed.ac.uk (Ken Johnson) writes:
- >
- > In article <189@syllogi.syllogic.nl> fdb@syllogic.nl (Frank de Bruijn)
- > writes:
- >
- > # ...a meta-interpreter could handle the symmetry, transitivity, etc. of
- > # all relations declared as such. One implementation technique that can
- > # be used in such a meta-interpreter is to examine the goal stack for an
- > # earlier call-frame that matches the current call frame. This works, but
- > # it's costly.........
- >
- > I hadn't thought of that. It is a fascinating possibility. Have you
- > actually implemented anything this way?
-
- This is something the metalogic programming language Reflective Prolog
- is really good at. In fact, this very problem is one of the first
- examples the authors take up in their papers about the language. There
- is a paper by Costantini and Lanzarone about Reflective Prolog in the
- proceedings of the Lisbon ICLP. There is a slow prototype
- implementation available from University of Milan and an efficient
- compiling version (of a somewhat modified language) is under
- development through a collaboration between University of Uppsala and
- University of Milan.
-
- -- Jonas B.
- --
- Jonas Barklund, Computing Science Department, Uppsala University
- Email jonas@csd.uu.se, phone +46-18-181050, fax +46-18-521270
-