home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.sys.ibm.pc.programmer:740 comp.lang.functional:1485
- Newsgroups: comp.sys.ibm.pc.programmer,comp.lang.functional
- Path: sparky!uunet!munnari.oz.au!newsroom.utas.edu.au!probitas!nharvey
- From: nharvey@probitas.cs.utas.edu.au (Nicole Harvey)
- Subject: Assessing a language
- Message-ID: <nharvey.726285637@probitas>
- Sender: news@newsroom.utas.edu.au
- Organization: University of Tasmania, Australia.
- Date: Wed, 6 Jan 1993 02:00:37 GMT
- Lines: 14
-
-
- 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
-
-