🚀 go-pugleaf

[ John Feo at LLL had a set called the salishan problems. I have put a
  copy of the problems and a bib. ref to his book in parlib.
	shell> mail parlib@hubcap.clemson.edu
	       Subject:
	       send index from salishan
	       .
	shell>

  I'd be glad to take any new problems and add them into this set.
]
hi,
   I am involved in assessing a language. Does anyone know of a standard
set of problems that I could use to judge the languages compabilities?
   Can anyone think of a problem that represents a real need in a language?
For example, we have tested it for the eight queens problem to show that 
it can do state space searches. We have also made sure it can generate the 
Fibonacci numbers. Can you think of any other well known problems?
   What things do you expect to be able to write relatively simply using any
language? I would like to here from people working in all areas. 

Nicole
nharvey@probitas.cs.utas.edu.au