| Related articles |
|---|
| Looking for logic programming benchmarks maraist@cs.tulane.edu (1993-06-02) |
| Newsgroups: | comp.lang.prolog,comp.compilers,comp.lang.functional |
| From: | maraist@cs.tulane.edu (John Maraist) |
| Followup-To: | comp.lang.prolog |
| Keywords: | prolog, functional, benchmarks, question |
| Organization: | Computer Science Dept., Tulane Univ., New Orleans, LA |
| Date: | Wed, 2 Jun 1993 20:58:43 GMT |
I am looking for good and/or standard benchmark programs for logic
programming systems.
In particular, I am working on an implementation of a functional language
that incorporates logic programming via set-abstraction (something
reminiscient of Darlington's "absolute set abstraction"), so any
benchmarking ideas for such a system in particular would be especially
useful.
I would appreciate any such programs, or references to them, that any of
you might be able to send. Please reply to:
maraist@cs.tulane.edu
I'll post a summary to the net.
Thanks,
John Maraist
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.